UVA 138 - Street Numbers
2014-03-05 22:01
447 查看
求1 + 2 + ... (C - 1) == (C+ 1) + (C + 2) + ... + N
利用求和公式可以得出C^2 = N * (N + 1) / 2,枚举n.
两边开根号,如果C的值是整数那么就是一个解.
直接输出答案了.
利用求和公式可以得出C^2 = N * (N + 1) / 2,枚举n.
两边开根号,如果C的值是整数那么就是一个解.
直接输出答案了.
#include <cstdio> using namespace std; int main(int argc, char const *argv[]){ printf("%10d%10d\n", 6, 8); printf("%10d%10d\n", 35, 49); printf("%10d%10d\n", 204, 288); printf("%10d%10d\n", 1189, 1681); printf("%10d%10d\n", 6930, 9800); printf("%10d%10d\n", 40391, 57121); printf("%10d%10d\n", 235416, 332928); printf("%10d%10d\n", 1372105, 1940449); printf("%10d%10d\n", 7997214, 11309768); printf("%10d%10d\n", 46611179, 65918161); return 0; }
相关文章推荐
- uva 138 Street Numbers
- UVa 138 Street Numbers / 佩尔方程
- UVaOJ138 - Street Numbers
- UVa 1210 - Sum of Consecutive Prime Numbers(素数+连续和)
- uva 10392 Factoring Large Numbers
- UVa 1210 - Sum of Consecutive Prime Numbers
- UVa10539 - Almost Prime Numbers
- UVa 11105 - Semi-prime H-numbers(筛选法)
- uva 763 Fibinary Numbers
- UVA, 332 Rational Numbers from Repeating Fractions
- UVA 1406 - A Sequence of Numbers(树状数组)
- UVA - 350 Pseudo-Random Numbers
- UVa 138 - Street Numbers (门牌号)
- Ugly Numbers, UVa 136
- UVA - 10392 Factoring Large Numbers
- UVa 10392 - Factoring Large Numbers
- UVA11005 Semi-prime H-numbers(筛法)
- UVA 138 Street Numbers
- UVa11582 Colossal Fibonacci Numbers!
- Colossal Fibonacci Numbers! UVA - 11582