UVa 138 Street Numbers / 佩尔方程
2013-12-06 14:09
399 查看
求 一组解 x y
使得 1 + 2 + ... + x-1 = x+1 + x+2 +... + y(x不算)
可以写成2*x*x = y*y+y的形式 化成佩尔方程求解
懒了 搞了个打表
使得 1 + 2 + ... + x-1 = x+1 + x+2 +... + y(x不算)
可以写成2*x*x = y*y+y的形式 化成佩尔方程求解
懒了 搞了个打表
#include <cstdio> int main () { printf (" 6 8\n"); printf (" 35 49\n"); printf (" 204 288\n"); printf (" 1189 1681\n"); printf (" 6930 9800\n"); printf (" 40391 57121\n"); printf (" 235416 332928\n"); printf (" 1372105 1940449\n"); printf (" 7997214 11309768\n"); printf (" 46611179 65918161\n"); return 0; }
相关文章推荐
- uva 138 Street Numbers
- UVA 138 - Street Numbers
- UVaOJ138 - Street Numbers
- UVA 138 - Street Numbers (佩尔方程递推求解)
- POJ 1320:Street Numbers 佩尔方程
- Uva 138-Street Numbers(佩尔方程)
- 【例题5-7 UVA - 136】Ugly Numbers
- UVA - 12050-Palindrome Numbers
- UVa 10539 - Almost Prime Numbers(筛选求素数)
- UVa 10392 - Factoring Large Numbers
- UVa 443 / POJ 2247 Humble Numbers (4因子-丑数&STL灵活运用)
- UVA138 Street Numbers(数论)
- UVA - 138 Street Numbers
- UVa11582 Colossal Fibonacci Numbers!(斐波那契数列小规律+思维)
- uva 763 Fibinary Numbers
- UVA, 332 Rational Numbers from Repeating Fractions
- UVA 11582 Colossal Fibonacci Numbers!(打表+快速幂)
- UVA 11582 - Colossal Fibonacci Numbers!(数论)(分治法幂取模)
- UVA - 11582 Colossal Fibonacci Numbers!循环节
- UVA 11582 - Colossal Fibonacci Numbers!