20190203 --- C - Rectangles

Byteman has a collection of N squares with side 1. How many different rectangles can he form using these squares?
Two rectangles are considered different if none of them can be rotated and moved to obtain the second one. During rectangle construction, Byteman can neither deform the squares nor put any squares upon any other ones.
Input
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
Output
The first and only line of the standard output should contain a single integer equal to the number of different rectangles that Byteman can form using his squares.
Example
For the input data:
6
the correct result is:
8

题目大意： 就是给出n个小正方块，让你输出—能拼出不同大小和形状的矩形的最大个数。
思路：数据撑死才9999， 暴力查找， 从2到100的矩形，，，，

int main( )
{
    int n, sum = 0;
    scanf("%d", &n);
    for(int j=1; j<=n; ++j)//首先遍历n
    {
        sum++;				//本身可以组成一整条矩形 ， so 此处要加一
        for(int i=2; i<=100; ++i)//遍历矩形个数
        {
            if(j <= i)
                break;
            if(j%i == 0 && j/i >= i)//第二个条件是为了矩形形状各不同，自己想想。。。。
                sum++;
        }
    }
    cout << sum << '\n';
    return 0;
}

千万不要把输出中间值的sum也复制过去了哦~~~~~