fork download
copy 
  1. #include<bits/stdc++.h>
  2.  
  3. #include<ext/pb_ds/assoc_container.hpp>
  4.  
  5. #include<ext/pb_ds/tree_policy.hpp>
  6.  
  7. using namespace __gnu_pbds;
  8.  
  9. using namespace std;
  10.  
  11. template <typename T> using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
  12.  
  13. #define ll long long
  14.  
  15. #define hello() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  16.  
  17. #define nl "\n"
  18.  
  19. #define yes cout<<"YES"<<nl
  20.  
  21. #define no cout<<"NO"<<nl
  22.  
  23. #define ss second
  24.  
  25. #define ff first
  26.  
  27. #define all(v) v.begin(),v.end()
  28.  
  29. #define eb emplace_back
  30.  
  31. #define sz(x) (int)(x).size()
  32.  
  33. #define pb push_back
  34.  
  35. #define mod 1000000007
  36.  
  37. #define mem(a,x) memset(a,x,sizeof(a))
  38.  
  39. int bit(ll a,int i){if(a&(1LL<<i)) return 1;return 0;}
  40.  
  41. int dx[]={1,-1,0,0,1,1,-1,-1};
  42.  
  43. int dy[]={0,0,1,-1,1,-1,1,-1};
  44.  
  45. ll isqrt (ll x){ll ans = 0;for (ll k = 1LL << 30; k != 0; k /= 2){if ((ans + k) * (ans + k) <= x) {ans += k;}}return ans;}
  46.  
  47. ll bin(ll n,ll pow){ll result=1;while(pow){if(pow&1){result=(result * n);}n=(n*n);pow>>=1;}return result;}
  48.  
  49. ll binmod(ll a,ll b,ll MOD){ll ans=1;a%=MOD;while(b){if(b&1)ans=(ans*a)%MOD;b/=2;a=(a*a)%MOD;}return ans;}
  50.  
  51. ll inverse(ll a,ll MOD){return binmod(a,MOD-2,MOD);}
  52.  
  53. const int N=2e5+12;
  54.  
  55. const  int M=998244353;
  56.  
  57. #define int long long int
  58.  
  59.  
  60.  
  61. void solve(){
  62.  
  63.   int n;cin>>n;
  64.   cout<<n<<endl;
  65.  
  66. }
  67.  
  68.  
  69.  
  70. signed main()
  71.  
  72. {
  73.  
  74.    // hello();
  75.  
  76. //cout.precision(10); cout.setf(ios::fixed);
  77.  
  78.  
  79.  
  80.     int tc=1;
  81.  
  82.     cin>>tc;
  83.  
  84.   for(int j=1;j<=tc;j++){
  85.  
  86.   //  cout<<"Case #"<<j<<": ";
  87.  
  88.        solve();
  89.  
  90.    }
  91.  
  92. }
  93.  
  94.  
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin
copy 
1
2
stdout
copy 
2
https://ideone.com/kU7Ydu
language:
C++ (gcc 8.3)
created:
22 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!