D - Rectangles

最新推荐文章于 2021-09-12 11:29:28 发布

原创最新推荐文章于 2021-09-12 11:29:28 发布 · 515 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种通过给定数量的单位正方形来构造不同矩形的方法。算法通过双层循环遍历所有可能的长宽组合，确保了每个构造出的矩形都是唯一的，并且不考虑旋转和平移等同的情况。代码实现简洁明了，易于理解。

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:

the correct result is:

#include<cstdio>
using namespace std;
int main()
{
    int n,c;
    while(scanf("%d",&n)!=EOF)
    {
        c=0;
        for(int i=1;i*i<=n;i++)
        {
            for(int u=i;i*u<=n;u++)
            {
                if(i*u<=n)
                {
                    c++;
                }
            }
        }
        printf("%d\n",c);
    }
    return 0;
}