Rectangles

Rectangles

DESCRIPTION
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.

Sample input
6
Sample output
8

题解:n个小正方形所能拼成长方形最多的个数

解题:小正方形个数与长和宽能整除

#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int ans=0;
        for(int i=1; i<=n; i++)
        {
            for(int j=1;j<=(sqrt(i)+0.5);j++)//保留精度
            {
                if(i%j==0)
                    ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值