fork download
copy 
  1.  
  2. #include <bits/stdc++.h>
  3. #include <ext/pb_ds/assoc_container.hpp>
  4. #include <ext/pb_ds/tree_policy.hpp>
  5.  
  6. using namespace __gnu_pbds;
  7. #include <set>
  8. // #include<ext/pb_ds/assoc_container.hpp>
  9. // #include<ext/pb_ds/tree_policy.hpp>
  10. //
  11. // using namespace __gnu_pbds;
  12. using namespace std;
  13. template<typename T>
  14. using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
  15. // order_of_key, find_by_order
  16.  
  17. // update data type
  18. void erase_os(ordered_set<int> &t, int v){
  19.     int rank = t.order_of_key(v);
  20.     ordered_set<int>::iterator it = t.find_by_order(rank);
  21.     t.erase(it);
  22. }
  23. void fastIO() {
  24.     ios_base::sync_with_stdio(false);
  25.     cin.tie(nullptr);
  26.     cout.tie(nullptr);
  27. }
  28.  
  29. #define tests          int t; cin>>t; for(int l = 0;l  < (t); l++)
  30. #define loop(n)          for(int i = 0; i < (n); i++)
  31. #define lop(n)          for(int g = 1; g <= (n); g++)
  32. #define lp(n)           for(int j = 1; j <= (n); j++)
  33. #define ll long long
  34. #define int ll
  35. #define ld long double
  36. #define endl '\n'
  37.  
  38. void solve() {
  39.     int x; cin >> x;
  40.     cout<< "fdfsdfsdfsafs"<<endl << x;
  41. }
  42.  
  43. signed main() {
  44.     fastIO();
  45.     int t = 1;
  46.     //cin >> t ;
  47.     while (t--) {
  48.         solve();
  49.     }
  50.     return 0;
  51. }
  52.  
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin
copy 
44
stdout
copy 
fdfsdfsdfsafs
44
https://ideone.com/dZlbFb
language:
C++ (gcc 8.3)
created:
1 day 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!