Advertisement
Guest User

Untitled

a guest
Nov 13th, 2019
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.36 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. vector <long long> hm[6];
  5.  
  6. int main(){
  7. ios_base::sync_with_stdio(0);
  8. cin.tie(0);
  9. hm[0]={1};
  10. hm[1]={1,2};
  11. hm[2]={2,6};
  12. hm[3]={2,4,6,8,12,24};
  13. hm[4]={12,24,60,120};
  14. hm[5]={144,720,36,72,12,240,48,360,180,24,120,60};
  15. sort(hm[5].begin(),hm[5].end());
  16.  
  17. int z;
  18. cin>>z;
  19. long long n;
  20. long long cos;
  21. for(int t=0;t<z;t++){
  22. cin>>n;
  23. if(n<650){
  24. bool to_chyba_to=false;
  25. for(long long i=1;!to_chyba_to;i++){
  26. bool mniejsze=true;
  27. cos=i;
  28. for(long long j=i+1;mniejsze;j++){
  29. cos=(cos*j)/__gcd(cos,j);
  30. if(cos==n){
  31. cout<<i<<" "<<j<<endl;
  32. to_chyba_to=true;
  33. break;
  34. }
  35. if(cos>n){
  36. mniejsze=false;
  37. break;
  38. }
  39. }
  40. if(i==649){
  41. cout<<"NIE\n";
  42. break;
  43. }
  44. }
  45. }
  46. else {
  47. bool rob=true;
  48. for(long long i=0;i<6&&rob;i++){
  49. for(unsigned long j=0;j<hm[i].size()&&rob;j++){
  50. long long dsf;
  51. long long nie_wiem;
  52. dsf=pow(n*hm[i][j],1.0/(i+2.0));
  53. nie_wiem=dsf;
  54. for(long long k=1;k<i+2;k++){
  55. nie_wiem=(nie_wiem*(hm[i][j]+k))/__gcd(nie_wiem,hm[i][j]+k);
  56.  
  57. }
  58. if(nie_wiem==n){
  59. cout<<hm[i][j]<<" "<<hm[i][j]+k<<endl;
  60. rob=false;
  61. break;
  62. }
  63. }
  64. }
  65. if(rob){
  66. cout<<"NIE\n";
  67. }
  68. }
  69. //cout<<cos<<"\n";
  70. }
  71.  
  72. return 0;
  73. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement