Advertisement
Guest User

Untitled

a guest
Oct 21st, 2014
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.45 KB | None | 0 0
  1.  
  2.  
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5.  
  6. int main()
  7. {
  8. int i=0,pr,pom,k,n,min = 0;
  9. long double pole [5000];
  10. while (i<5000) {
  11. pr = 0;
  12. if (i==0) {
  13. pole[i] = 1; pr = 1;
  14. }
  15. else {
  16. if (i+pr < 5030) {
  17. pom = i + pr;
  18. k = i + pr;
  19. while (pom - 1 > 0 && pole[pom-1] > 3*pole[min]) pom--;
  20. if (pole[pom-1] != 3*pole[min]) {
  21. while (pom != k) {pole[k] = pole[--k];}
  22. pole[pom] = 3*pole[min]; pr++;
  23. }
  24. }
  25. if (i+pr < 5030) {
  26. pom = i + pr;
  27. k = i + pr;
  28. while (pom - 1 > 0 && pole[pom-1] > 5*pole[min]) pom--;
  29. if (pole[pom-1] != 5*pole[min]) {
  30. while (pom != k) {pole[k] = pole[--k];}
  31. pole[pom] = 5*pole[min]; pr++;
  32. }
  33. }
  34. if (i+pr < 5030) {
  35. pom = i + pr;
  36. k = i + pr;
  37. while (pom - 1 > 0 && pole[pom-1] > 7*pole[min]) pom--;
  38. if (pole[pom-1] != 7*pole[min]) {
  39. while (pom != k) {pole[k] = pole[--k];}
  40. pole[pom] = 7*pole[min]; pr++;
  41. }
  42. }
  43. min++;
  44. }
  45. i=pr+i;}
  46. while(scanf("%d",&n)>0) printf("%.0Lf\n",pole[n-1]);
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement