Rectangles
2017-01-22 21:48
260 查看
Rectangles
DESCRIPTIONByteman 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; }
相关文章推荐
- ActiveMQ入门实例
- 0122程序练习
- mysql5.7.14安装配置方法实操教程
- Glide进阶详解(五)
- 《Angular2初步涉略》
- 排队打水问题
- Log4j 日志环境搭建
- 【UML】用例图
- CodeForces - 527C Glass Carving (二分+set) 多维矩形切割问题
- CodeForces 59B
- Glide进阶详解(四)
- Codeforces 755D-PolandBall and Polygon
- Jquery实现的几款漂亮的时间轴
- NLP系列(4)_朴素贝叶斯实战与进阶(转)
- kafka入门:简介、使用场景、设计原理、主要配置及集群搭建(转)
- HDU 1548 BFS求最优解
- Android Studio导出Jar包并混淆
- 前端开发如何抠图
- 有监督学习VS无监督学习
- Glide进阶详解(三)