fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long ll;
  5.  
  6.  
  7. // policy Based ds
  8. #include<ext/pb_ds/assoc_container.hpp>
  9. using namespace __gnu_pbds;
  10.  
  11. typedef tree<long long , null_type, less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
  12.  
  13. #define order(s, x) s.order_of_key(x) // return the number of elements in the set that are smaller than x
  14. #define elemat(s ,x) s.find_by_order(x) // return poller to element at index x
  15.  
  16.  
  17.  
  18. typedef   vector<ll>  vl;
  19. typedef   vector<pair<ll, ll>> vll;
  20. typedef   multiset<pair<ll, ll>> msll;
  21. typedef   multiset<ll> msl;
  22. typedef   set<pair<ll, ll>> sll;
  23. typedef   set<ll> sl;
  24. typedef   map<ll, ll> mll;
  25. typedef   pair<ll, ll>pll;
  26.  
  27. typedef   vector<ll>  vi;
  28. typedef   vector<pair<ll, ll>> vii;
  29. typedef   multiset<pair<ll, ll>> msii;
  30. typedef   multiset<ll> msi;
  31. typedef   set<pair<ll, ll>> sii;
  32. typedef   set<ll> si;
  33. typedef   map<ll, ll> mii;
  34. typedef   pair<ll, ll>pii;
  35.  
  36.  
  37. #define recap(i,k,n)  for(ll i = k; i>=n; i--)
  38. #define rep(i,k,n)    for(ll i=k; i<n; i++)
  39. #define boost 	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  40. #define for1(x, a, b)  for(x=a; x<b; x++)
  41. #define for2(x, a, b)  for(x=a, x>=b; x--)
  42. #define endl 	"\n"
  43. #define all(x)  x.begin(), x.end()
  44. #define mp      make_pair
  45. #define read    freopen("today_is_gonna_be_a_great_day_input.txt","r",stdin)
  46. #define write   freopen("output.txt","w",stdout)
  47. #define pb      push_back
  48. #define ff      first
  49. #define ss      second
  50. #define bb      begin
  51. #define mem(arr, x) memset(arr, x, sizeof(arr));
  52. #define arr_ub(arr, n, x) upper_bound(arr, arr+n, x)-arr
  53. #define arr_lb(arr, n, x) lower_bound(arr, arr+n, x)-arr
  54. #define u_p(v, x) upper_bound(v.begin(), v.end(), x)-v.begin()
  55. #define l_b(v, x) lower_bound(v.begin(), v.end(), x)-v.begin()
  56.  
  57.  
  58. const ll sz=1e6+123;
  59. #define INF 1000000000000000007
  60.  
  61. #define stringLen 18446744073709551620
  62. //#define pi 3.1415926536
  63. const ll mod = 1000000000 + 7;
  64.  
  65.  
  66. inline void normal(ll &a, ll MOD) { a %= MOD; (a < 0) && (a += MOD); }
  67. inline ll modMul(ll a, ll b, ll MOD) { a %= MOD, b %= MOD; normal(a, MOD), normal(b, MOD); return (a*b)%MOD; }
  68. inline ll modAdd(ll a, ll b, ll MOD) { a %= MOD, b %= MOD; normal(a, MOD), normal(b, MOD); return (a+b)%MOD; }
  69. inline ll modSub(ll a, ll b, ll MOD) { a %= MOD, b %= MOD; normal(a, MOD), normal(b, MOD); a -= b; normal(a, MOD); return a; }
  70. inline ll modPow(ll b, ll p, ll MOD) { ll r = 1; while(p) { if(p&1) r = modMul(r, b, MOD); b = modMul(b, b, MOD); p >>= 1; } return r; }
  71. inline ll modInverse(ll a, ll MOD) { return modPow(a, MOD-2, MOD); }
  72. inline ll modDiv(ll a, ll b, ll MOD) { return modMul(a, modInverse(b, MOD), MOD); }
  73.  
  74.  
  75.  
  76. //vi divisorList[sz];
  77. //ll divisorNumber[sz];
  78. //void findDivisor(ll n){
  79. //	  for(ll i=1; i<=n; i++){
  80. //			for(ll j=i; j<=n; j+=i){
  81. //				 divisorList[j].pb(i);
  82. //		     	 divisorNumber[j]++;
  83. //			}
  84. //	  }
  85. //}
  86.  
  87. bool isPalindrome(string s){ll i=0,j=s.size()-1;for(i,j;i<=j;i++,j--){if(s[i]!=s[j]) return 0;}return 1;}
  88. ll gcd(ll a, ll  b){return b==0? a: gcd(b, a%b);}
  89. //// lcm * gcd = a*b
  90. ll lcm(ll a, ll b){if(a>b)swap(a, b);return a*(b/gcd(a, b));}
  91. //bool isPalindrome(string s){ ll i=0,j=s.size()-1;for(i,j;i<=j;i++,j--){if(s[i]!=s[j]) return 0;} return 1;}
  92. bool isPowerofTwo(ll n){return (n && !(n&(n-1)));}
  93. //ll count_one(ll n){ll count=0;while(n){n &= (n-1);count++;}return count;}
  94. //string binRep(ll n){string s="";ll f = 0;while(n>0){if(n%2){f=1;s+='1';}else s+='0';n/=2;}if(s.empty())return "0";else return s;}
  95. //ll ctz(ll n){return __builtin_ctzll(n);}
  96. //ll clz(ll n){return __builtin_clzll(n);}
  97. //ll bitCount(ll n){return __builtin_popcountll(n);}
  98.  
  99. //bitset<sz> is_prime;
  100. //vector<int>prime;
  101. //
  102. //void primeGen(ll n){
  103. //     for(ll i=3; i<=n; i+=2)is_prime[i]=1;
  104. //     ll nn = sqrt(n)+1;
  105. //     for(ll i=3; i<nn; i+=2){
  106. //		     if(is_prime[i]==0)continue;
  107. //			for(ll j=i*i; j<=n; j+=(i+i)){
  108. //				is_prime[j]=0;
  109. //			}
  110. //     }
  111. //     is_prime[2]=1;
  112. //     prime.pb(2);
  113. //
  114. //     for(int i=3; i<=n; i+=2){
  115. //        if(is_prime[i]) prime.pb(i);
  116. //     }
  117. //}
  118. ////
  119. ///**
  120. //Faisal Amin Abir(20-43206-1)
  121. //**/
  122. //
  123. //
  124. //vector<ll>factorization(ll n){
  125. //	//O(sqrt(n)/ln(sqrt(n)) + log2 n)
  126. //	vector<ll>factors;
  127. //	for(auto u:prime){
  128. //		if(1LL*u*u > n) break;
  129. //		if(n%u==0){
  130. //			//factors.push_back(u);//for generating unique factors keep this line here
  131. //			while(n%(u)==0){
  132. //				factors.push_back(u);//for generating all factors keep this line here
  133. //				n/=(u);
  134. //			}
  135. //		}
  136. //	}
  137. //	if(n>1)factors.push_back(n);
  138. //	return factors;
  139. //}
  140.  
  141. //ll NOD(long long n){
  142. //	ll res=1;
  143. //	for(auto u:prime){
  144. //		if(1LL*u*u > n)break;
  145. //		if(n%u==0){
  146. //		      ll count=1;
  147. //			while(n%u==0){
  148. //				n/=u;
  149. //				count++;
  150. //			}
  151. //			res *= count;
  152. //		}
  153. //	}
  154. //	if(n>1)res*=2;
  155. //	return res;
  156. //}
  157. //          R  D  L  U  uR dR dL uL
  158.  
  159. ll dx[] = {0, 1, 0,-1,-1, 1, 1, -1};
  160. ll dy[] = {1, 0,-1, 0, 1, 1,-1, -1};
  161.  
  162.  
  163.  
  164. //--------------------------------------------------------------------------------------------------------------
  165. //                                ** CODE STARTS HERE **
  166. //--------------------------------------------------------------------------------------------------------------
  167.  
  168. void solve(){
  169.  
  170.     int n ;
  171.     cin>>n;
  172.     vector<string>v;
  173.     for(int i=1; i<=n; i++){
  174.         v.pb(to_string(i));
  175.     }
  176.     sort(all(v));
  177.  
  178.     for(int i=0; i<n; i++){
  179.         cout << i + 1 << ": " << v[i] << endl;
  180.     }
  181.  
  182. }
  183. int main(){
  184.    boost;
  185.  
  186.  
  187.    int t=1;
  188.    //cin>>t;
  189.    while(t--){
  190.     solve();
  191.    }
  192.  
  193. //priority_queue<pair<int,int>>q;
  194. //q.push({2, 1});
  195. //q.push({1, 2});
  196. //cout << q.top().ff;
  197.  
  198.  
  199. 	return 0;
  200. }
  201.  
  202. /*
  203.  
  204.  
  205.  
  206. 10101
  207. 11101
  208. 10111
  209. 11111
  210.  
  211. */
  212.  
Success #stdin #stdout 0s 5296KB
comments (?)
stdin
copy 
2
stdout
copy 
1: 1
2: 2
https://ideone.com/1b0mhU
language:
C++ (gcc 8.3)
created:
13 days 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!