Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1730 Accepted Submission(s): 1049
1 #include <iostream> 2 #include <cstring> 3 #include <algorithm> 4 #include <cstdio> 5 #include <cmath> 6 using namespace std; 7 8 int main() 9 { 10 int n,m; 11 while(scanf("%d%d", &n, &m) != EOF) 12 { 13 if(n == 0 && m == 0) 14 break; 15 if(n > m) 16 { 17 swap(n, m); 18 } 19 double gold = (sqrt(5) + 1)/2; 20 int c = gold * (m - n); 21 int a,b; 22 if(c == n) 23 { 24 printf("0\n"); 25 } 26 else 27 { 28 printf("1\n"); 29 printf("%d %d\n", c, c + m - n); 30 for(int i = 1; i <= m; i++) 31 { 32 a = i * gold; 33 if(a == c) 34 continue; 35 b = a + i; 36 if(a == n) 37 { 38 printf("%d %d\n", a,b); 39 } 40 else if(b == n) 41 { 42 printf("%d %d\n",a, b); 43 } 44 else if(b == m) 45 { 46 printf("%d %d\n", a, b); 47 } 48 } 49 } 50 } 51 return 0; 52 }
原文:http://www.cnblogs.com/zhaopAC/p/5183246.html