ACM程序设计计算简单题.pptVIP

;列出完数;;题目分析;参考源代码;参考源代码;对称三位数素数;;题目分析;参考源代码;参考源代码;五位以内的对称素数;;题目分析;参考源代码;参考源代码;参考源代码; An easy problem;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 ?;;Sample input: 2 1 3 Sample output: 0 1 ;题目分析：;思路2： 同样将等式???形N + 1 = (i + 1) * (j + 1)。只需要求出N + 1的约数个数，然后分情况处理即可。令N + 1的约数个数为f[N + 1] 1. 当N + 1为完全平方数时，ans = (f[N + 1] – 2 + 1) / 2 公式可以理解成：所有的约数，去掉1和本身之后（减2），剩下的可以对称的组成一对一对的答案。;而分解质因数最有效的方法就是筛出 范围内的素数表，然后依次试除。;1、简单的筛素数;const int Max = 100000; bool bp[Max + 1]; //记录每个数是否是素数 int p[30000]; //记录筛选出来的素数 int pCnt=0; //记录当前筛选出来的素数个数 void sievePrime() { int i, j; memset(bp, true, sizeof(bp)); bp[0] = bp[1] = false; for (i = 2; i = Max; i++) { if (bp[i]) //i是素数 { p[pCnt++] = i; for (j = i + i; j = Max; j += i) //依次筛掉i的倍数 bp[j] = false; } } }