Guest User

Untitled

a guest
Jun 24th, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. #include<iostream>
  2. #include<cmath>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. int i,j,p;
  9. int x;
  10. int div[1000][2];
  11. for(i=1;i<=1000;i++)
  12. {x=sqrt(i);
  13. p=0;
  14. for(j=1;j<=x;j++){if((i%j)==0){if(j!=(i/j))p+=2;
  15. else p++;}
  16. }
  17.  
  18. div[i-1][0]=p;
  19. div[i-1][1]=i;
  20.  
  21. }
  22. for(i=1;i<=999;i++)
  23. for(j=0;j<=998;j++)
  24. {if(div[j][0]<div[j+1][0] || (div[j][0]==div[j+1][0] && div[j][1]>div[j+1][1])){int temp,Temp;
  25. temp=div[j]0];Temp=div[j][1];
  26. div[j][0]=div[j+1]0]; div[j][1]=div[j+1][1];
  27. div[j+1][0]=temp;div[j+1][1]=Temp;}
  28.  
  29. }
  30.  
  31.  
  32. cout<<div[500][1]<<endl;
  33. return 0;
  34. }
Add Comment
Please, Sign In to add comment