Advertisement
Guest User

Untitled

a guest
Mar 30th, 2015
206
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.08 KB | None | 0 0
  1. #include <cstdio>
  2. #define LL long long
  3. FILE *fin, *fout;
  4. using namespace std;
  5. int n, p1 = 1, p2 = 1;
  6. LL nr1 = 1, nr2 = 1, temp, pw3[30], pw5[30];
  7. int main()
  8. {
  9. fin = freopen("puteri35.in", "r", stdin);
  10. fout = freopen("puteri35.out", "w", stdout);
  11. pw3[0] = 1;
  12. pw5[0] = 1;
  13. for(int i = 1; i< 30; i++)
  14. {
  15. pw3[i] = 3*pw3[i-1];
  16. pw5[i] = 5*pw5[i-1];
  17. }
  18. scanf("%d", &n);
  19. while(p1 <= n || p2 <= n)
  20. {
  21. if((nr1 < nr2 || p2 > n) && p1 <= n)
  22. {
  23. printf("%lld\n", nr1);
  24. p1++;
  25. nr1 = 0;
  26. temp = p1;
  27. for(int j = 0; temp; j++)
  28. {
  29. nr1 += (temp&1)*pw3[j];
  30. temp>>=1;
  31. }
  32. }
  33. else
  34. {
  35. printf("%lld\n", nr2);
  36. p2++;
  37. nr2 = 0;
  38. temp = p2;
  39. for(int j = 0; temp; j++)
  40. {
  41. nr2 += (temp&1)*pw5[j];
  42. temp>>=1;
  43. }
  44. }
  45. }
  46. fclose(fin);
  47. fclose(fout);
  48. return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement