joj 1753: Street Numbers
2012-10-22 13:10
197 查看
http://acm.jlu.edu.cn/joj/showproblem.php?pid=1753
这道题目的一个思路是采用二分的思想进行枚举,然后打表即可,C代码如下:
这道题目的一个思路是采用二分的思想进行枚举,然后打表即可,C代码如下:
#include <stdio.h> #define max 0x7fffffff int main() { long long i,j,cnt=0; for(i=6;;i++) { j = i; long long k = i*i+i*i; long long low = i,high = max; while(low<=high) { long long mid = (low+high)/2; long long temp = mid*mid+mid; if(temp==k) { printf("%lld,%lld\n",i,mid); cnt++; if(cnt==10)goto aa; break; } else if(temp>k) high = mid-1; else low = mid+1; } j++; } aa: return 0; }
相关文章推荐
- POJ 1320:Street Numbers
- POJ 1320:Street Numbers 佩尔方程
- UVA 138 - Street Numbers
- uva 138 Street Numbers
- UVa 138 Street Numbers / 佩尔方程
- Street Numbers
- UVaOJ138 - Street Numbers
- 52. 不用+、-、×、÷做加法[add two numbers without arithmetic]
- 【USACO题库】3.1.3 Humble Numbers丑数
- leetcode Add Two Numbers
- [LeetCode] Add Two Numbers
- projecteuler---->problem=21----Amicable numbers
- LeetCode165—Compare Version Numbers
- HDu 2138 How many prime numbers 高效Miller素数测试
- LeetCode2. Add Two Numbers(链表加法)
- poj 2769——Reduced ID Numbers
- POJ 1515 Street Directions 未完成
- LeetCode: Sum Root to Leaf Numbers [129]
- [leetcode]165. Compare Version Numbers
- Problem Sum Root to Leaf Numbers