1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 |
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #define INF 1000000 #define ll long long using namespace std; struct node{ int x,y; }; node arr[10005]; int main() { int n,diff; int difference_arr[10005]; for(int i=2;i<61;i++) { for(int j=1;j<i;j++) { diff = i*i*i - j*j*j; if(diff>10001) continue; difference_arr[diff]=1; if(arr[diff].x==0 || arr[diff].y==0) { arr[diff].x=i; arr[diff].y=j; } else { if(arr[diff].y>j) { arr[diff].x=i; arr[diff].y=j; } } } } while(scanf("%d",&n),n) { if(difference_arr[n]==1) printf("%d %d\n",arr[n].x,arr[n].y); else printf("No solution\n"); } return 0; } |