fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long int
  4. #define red 1
  5. #define blue -1
  6. #define white 0
  7. set<ll>s[29];
  8. vector<ll>graph[200009];
  9. map<ll,ll>nodes;
  10. vector<ll>vertex;
  11. map<ll,ll>vis;
  12. map<ll,ll>colour;
  13. ll cnt=0;
  14. ll vampire=0,lyken=0;
  15. ll power(ll base,ll n)
  16. {
  17. ll i,j,k,l,p=1;
  18. for(i=1;i<=n;i++)
  19. p=p*base;
  20.  
  21. return p;
  22. }
  23. int main()
  24. {
  25. ios_base::sync_with_stdio(false);
  26. cin.tie(NULL);
  27. ll i,j,k=0,l,p=1,r,t,n,m,a,b,vam=0,lyk=0,c,three=3,d,q,check=0;
  28.  
  29. for(i=45;i<=1000;i++)
  30. {
  31. check=1;
  32. p=i*i-1984;
  33. if(p%5)
  34. {
  35. check=0;
  36. continue;
  37. }
  38. p=p/5;
  39. q=sqrt(p);
  40. if(q*q!=p){
  41. check=0;
  42. continue;
  43. }
  44. r=i-q;
  45. a=i-3;
  46. if(sqrt(a)*sqrt(a)!=a)
  47. {
  48. check=0;
  49. continue;
  50. }
  51. b=sqrt(a);
  52. c=(three*i+2);
  53. if(c%2)
  54. continue;
  55. c=c/2;
  56. if(cbrt(c)*cbrt(c)*cbrt(c)!=c)
  57. continue;
  58. d=cbrt(c);
  59. t=power(b-d,three)-power(i-q,three+4);
  60. cout<<t<<'\n';
  61. if(t==0)
  62. {
  63. cout<<i<<'\n';
  64. return 0;
  65. }
  66.  
  67.  
  68. }
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78. }
Success #stdin #stdout 0.01s 8368KB
stdin
Standard input is empty
stdout
-562949953420800