【HDU 2601 】
来源:互联网 发布:php和软件测试工程师 编辑:程序博客网 时间:2024/06/10 02:45
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 ?
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
2
1
3
Sample Output
0
1
不难想到 i * j + i +j = (i + 1) * (j + 1) - 1 = N,既N + 1 = (i + 1) * (j + 1),只用判断 N + 1 是否能整除 i + 1 就好因为 j >= i,所以只用判断到 根号 N +1就好
AC代码 :
#include<cstdio>#include<cmath>using namespace std;int main(){ int T,i,ans; long long sum,N; scanf("%d",&T); while(T--) { scanf("%lld",&N); sum = N + 1; ans = 0; N = sqrt(sum * 1.0); for(i = 2 ; i <= N; i++) if(sum % i == 0) ans++; printf("%d\n",ans); } return 0;}
- hdu 2601
- hdu 2601
- hdu 2601
- HDU 2601
- HDU 2601
- 【HDU 2601 】
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- C#之XML基础 节点.innertext,为标签添加内容
- python中self和cls
- shell变量、重定向、管道
- 算法导论--红黑树的维持平衡
- Elasticsearch
- 【HDU 2601 】
- userAgent获取浏览器信息
- Codeforces Round #369 (Div. 2) C 四维dp
- Java概述
- past.deploy
- C#之XML基础 输出标签的内容
- 【可视化】div背景半透明
- String MD5 encrypt
- Struts2 in action 笔记2