Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<cmath>
- using namespace std;
- int main()
- {
- int i,j,p;
- int x;
- int div[1000][2];
- for(i=1;i<=1000;i++)
- {x=sqrt(i);
- p=0;
- for(j=1;j<=x;j++){if((i%j)==0){if(j!=(i/j))p+=2;
- else p++;}
- }
- div[i-1][0]=p;
- div[i-1][1]=i;
- }
- for(i=1;i<=999;i++)
- for(j=0;j<=998;j++)
- {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;
- temp=div[j]0];Temp=div[j][1];
- div[j][0]=div[j+1]0]; div[j][1]=div[j+1][1];
- div[j+1][0]=temp;div[j+1][1]=Temp;}
- }
- cout<<div[500][1]<<endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment