hdu An easy problem (背包)
来源:互联网 发布:2d旋转矩阵 编辑:程序博客网 时间:2024/04/29 12:32
Problem Description
When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..” , “100 yuan buy 100 pig” .etc..
One day Teddy met a old man in his dream , in that dream the man whose name was“RuLai” gave Teddy a problem :
Given an N , can you calculate how many ways to write N as i * j + i + j (0 < i <= j) ?
Teddy found the answer when N was less than 10…but if N get bigger , he found it was too difficult for him to solve.
Well , you clever ACMers ,could you help little Teddy to solve this problem and let him have a good dream ?
One day Teddy met a old man in his dream , in that dream the man whose name was“RuLai” gave Teddy a problem :
Given an N , can you calculate how many ways to write N as i * j + i + j (0 < i <= j) ?
Teddy found the answer when N was less than 10…but if N get bigger , he found it was too difficult for him to solve.
Well , you clever ACMers ,could you help little Teddy to solve this problem and let him have a good dream ?
Input
The first line contain a T(T <= 2000) . followed by T lines ,each line contain an integer N (0<=N <= 1010).
Output
For each case, output the number of ways in one line.
Sample Input
213
Sample Output
01#include<iostream>#include<cstring>#include<cstdio>#include<cmath>using namespace std;int main(){int t,i,m,sum;__int64 n;while(scanf("%d",&t)!=EOF){while(t--){sum=0;scanf("%I64d",&n);n+=1;m=sqrt(n);for(i=2;i<=m;i++) if(n%i==0) sum++; printf("%d\n",sum);}}return 0;}
0 0
- hdu An easy problem (背包)
- hdu-An Easy Problem
- hdu-An Easy Problem
- hdu 2055 An easy problem (水题)
- hdu 2055 An easy problem (水题)
- hdu 2055 An easy problem (java)
- HDU 2601 An easy problem (数学)
- 数学 hdu 2601 (An easy problem)
- HDU 2601 An easy problem(思维)
- HDU 2601 An easy problem (数论)
- hdu 2601 An easy problem
- hdu 2601(An easy problem)
- hdu 2601 An easy problem
- hdu 2601 An easy problem
- HDU 2123 An easy problem
- HDU 2055 An easy problem
- HDU 2123 An easy problem
- hdu 2132 An easy problem
- App8_10_抽象类abstract
- 酒肉穿肠过 佛祖心中留...
- 安卓实习第八天
- App8_12_利用接口实现多重继承
- 2015年7月24日笔记
- hdu An easy problem (背包)
- (八十五)应用程序间的跳转与消息传递
- App8_14_内部类与外部类的访问规则
- 画流程图
- CodeForces#313 C. Gerald's Hexagon
- 胖大海和罗汉果可以同泡吗
- hdu Piggy-Bank (背包)
- 快速学习STL中find函数和replace函数的应用,nyoj,字符串的替换113
- App8_15_匿名内部类