fork download
copy 
  1. #include<bits/stdc++.h> 
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4. using namespace std;
  5. using namespace __gnu_pbds;
  6. typedef long long ll;
  7. typedef long double ld;
  8. typedef pair<int,int> pii;
  9. typedef pair<ll,ll> pll;
  10. typedef vector<int> vi;
  11. typedef vector<ll> vll;
  12. #define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
  13. #define ordered_multiset tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
  14. #define pb push_back
  15. #define ff first
  16. #define ss second
  17.  
  18. int main(){
  19.     ios_base::sync_with_stdio(0);
  20.     cin.tie(0);
  21.  
  22.     uint64_t x[12]={
  23.         0x22ae9e9ad091bb3a,
  24.         0xd5c31f1ee7e1fa8f,
  25.         0xf807b7be20823557,
  26.         0x3895af80e9d30069,
  27.         0x4ee4094aa1e24bd7,
  28.         0x8c16a64a18f86808,
  29.         0x3039cd7b474ba8b0,
  30.         0xfe2d787b8c006d3e,
  31.         0xff181690f51f2a88,
  32.         0xf7bada9bf702ef34,
  33.         0xb9d0957d285954c0,
  34.         0xfb2a014af878c4d6
  35.     };
  36.  
  37.     mt19937 rng(5489);
  38.  
  39.     for(int i = 0; i < 12; i++){
  40.         cout << char((x[i]&((1ll << 33) - 1))^rng());
  41.         cout << char((x[i] >> 32) ^ rng());
  42.     }
  43.  
  44.     return 0;
  45. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
d091bb3a
22ae9e9a
e7e1fa8f
d5c31f1e
20823557
f807b7be
e9d30069
3895af80
a1e24bd7
04ee4094
18f86808
8c16a64a
474ba8b0
3039cd7b
8c006d3e
fe2d787b
f51f2a88
ff181690
f702ef34
f7bada9b
285954c0
b9d0957d
f878c4d6
fb2a014a
stdout
copy 
flag{alamakotaakotmaale}
https://ideone.com/dX6H7f
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!