UVA 136 - Ugly Numbers - Solution in C | Volume 1 - Online Judge Solution

Latest

It is a free Online judges problems solution list. Here you can find UVA online Judge Solution, URI Online Judge Solution, Code Marshal Online Judge Solution, Spoz Online Judge Problems Solution

Saturday, April 29, 2017

UVA 136 - Ugly Numbers - Solution in C | Volume 1

UVA 136 - Ugly Numbers - Solution in C | Volume 1


Problem Name: Ugly Numbers
Problem Number : UVA - 136
Online Judge : UVA Online Judge Solution
Volume: 1
Solution Language : C

UVA Solution 136 Code in C Language:

#include<stdio.h>
int main() {
 int DP[1500] = {1}, t2 = 0, t3 = 0, t5 = 0, tmp, i;
 for(i = 1; i < 1500; i++) {
  while(DP[t2]*2 <= DP[i-1]) t2++;
  while(DP[t3]*3 <= DP[i-1]) t3++;
  while(DP[t5]*5 <= DP[i-1]) t5++;
  tmp = DP[t2]*2;
  if(DP[t3]*3 < tmp) tmp = DP[t3]*3;
  if(DP[t5]*5 < tmp) tmp = DP[t5]*5;
  DP[i] = tmp;
 }
 printf("The 1500'th ugly number is %d.\n", DP[1499]);
    return 0;
}

No comments:

Post a Comment