Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int solve(int n) {
- if(n<6){
- return n+1;
- }
- vector<bool> dp(n+1);
- dp[0]=false;
- dp[1]=dp[2]=dp[3]=dp[4]=dp[5]=true;
- int i=6,j=5,ans;
- while(j!=n+1){
- if((i%2==0 && dp[i/2]==true)||(i%3==0 && dp[i/3]==true) ||(i%5==0 && dp[i/5]==true)){
- dp[i]=true,ans=i,j++;
- }
- else{
- dp[i]=false;
- }
- i++;
- }
- return ans;
- }
Add Comment
Please, Sign In to add comment