fork download
copy 
  1. //// "و ذا النون اذ ذهب مغاضبا فظن ان لن نقدر عليه"
  2. //// "فنادي في الظلمات ان لا اله لا انت سبحانك اني كنت من الظالمين"
  3. ////  "فاستجبنا له و نجينه من الغم و كذلك ننجي المؤمنين"
  4. // MORE FALLS , HIGHER JUMPS YOU GET !! //
  5. #include <bits/stdc++.h>
  6. #define ll long long
  7. #define Zhraa ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr);
  8. #define YES "YES"
  9. #define NO "NO"
  10. #define sp ' '
  11. #define nl '\n'
  12. #define ON(mask,bit) (mask | (1LL<<bit) )
  13. #define OFF(mask,bit) ( mask & ~ ( 1LL << bit ) )
  14. #define IsOn(mask,bit) (( mask>>bit) & 1LL)
  15. #define toggle(mask,bit)( mask ^ (1LL<<bit) )
  16. #define IsOdd(mask) (mask & 1LL)
  17. using namespace std;
  18.  
  19. #include <ext/pb_ds/assoc_container.hpp>
  20. #include <ext/pb_ds/tree_policy.hpp>
  21. #include <cstring>
  22. using namespace __gnu_pbds;
  23. #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
  24.  
  25. //        down   up right  left
  26. int dx []={ 1 , -1 , 0 ,  0     , -1 ,1,-1, 1 };
  27. int dy []={ 0 ,  0 , 1 , -1     , -1 ,1, 1,-1 };
  28. char dir[] = {'D', 'U' , 'R' , 'L'};
  29.  
  30. const ll MOD = 1e9 + 7;
  31. const int N = 5e3+2,M=1e5+2  ;
  32. const int oo = 0x3f3f3f3f;
  33. const ll ooLL = 0x3f3f3f3f3f3f3f3f;
  34.  
  35. ///////////////////////////////////////// The Code ///////////////////////////////////////////
  36.  
  37. //constant
  38. //state
  39.  
  40. int go (int i , int j ){// calc min oper to get same strings
  41.  
  42. }
  43.  
  44.  
  45.  
  46.  
  47.  
  48. void solve(){
  49.  
  50.     int n;cin>>n;
  51.  
  52.     ll mult =1;
  53.     mult*=2;
  54.     while(mult<(1e18/3)){
  55.         cout<<mult<<sp;
  56.         mult*=(2);
  57.         n--;
  58.         if(n<=0) {
  59.  
  60.             break;
  61.         }
  62.     }
  63.  
  64.  
  65.  
  66.     ll ood = 3;
  67.     bool done =false;
  68.     while(n&&!done){
  69.         ll mult =1;
  70.         mult*=ood;ood+=2;
  71.         while(mult<=(1e18/ood-2)){
  72.             cout<<mult<<sp;
  73.             mult*=(ood-2);
  74.             n--;
  75.             if(n<=0) {
  76.                 done =true;
  77.                 break;
  78.             }
  79.         }
  80.         if(done)
  81.             break;
  82.         cout<<mult *ood<<sp;
  83.         n--;
  84.         if(n<=0) {
  85.             done =true;
  86.             break;
  87.         }
  88.  
  89.     }
  90.     cout<<nl;
  91.  
  92.  
  93. }
  94.  
  95.  
  96. int main() {
  97.  
  98. #ifndef ONLINE_JUDGE
  99.     freopen("input.txt", "r", stdin);
  100.     freopen("output.txt", "w", stdout);
  101. #endif
  102.  
  103.     Zhraa
  104.  
  105.     int t =1;
  106.     cin>>t;
  107.  
  108.  
  109.     while (t--)
  110.         solve();
  111.  
  112.  
  113. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
2 3
https://ideone.com/1UQZEJ
language:
C++14 (gcc 8.3)
created:
4 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!