fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define db double
  5. #define ll long long
  6. #define ld long double
  7. #define li long int
  8. #define pb push_back
  9. #define mp make_pair
  10. #define FOR(i,a,b) for(i=a;i<b;i++)
  11. #define RFOR(i,a,b) for(i=a;i>b;i--)
  12. #define f first
  13. #define s second
  14. #define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL));
  15. #define pl pair<ll,ll>
  16. #define pll pair<ll,pl>
  17. #define plll pair<ll,pll>
  18. #define all(a) a.begin(),a.end()
  19. #define nl cout<<"\n"
  20. #define inf LONG_LONG_MAX
  21. #define minf LONG_LONG_MIN
  22. #define pq priority_queue
  23. #define pi 3.1415926535897932
  24.  
  25. bool isPrime(ll n)
  26. {
  27.         if (n <= 1)  return false;
  28.         if (n <= 3)  return true;
  29.  
  30.         if (n%2 == 0 || n%3 == 0) 
  31.             return false;
  32.  
  33.         for (ll i=5; i*i<=n; i=i+6)
  34.         {
  35.             if (n%i == 0 || n%(i+2) == 0)
  36.                return false;
  37.         }  
  38.         return true;
  39. }
  40. ll gcd(ll a,ll b)
  41. {
  42.     if(a==0)    return b;
  43.     if(a<b) swap(a,b);
  44.     return gcd(a%b,b);
  45. }
  46. ll gcdextended(ll a,ll b,ll &x,ll &y)
  47. {
  48.     if(a==0)
  49.     {
  50.         x=0;
  51.         y=1;
  52.         return b;
  53.     }
  54.     ll x1,y1,gcd=gcdextended(b%a,a,x1,y1);
  55.     x=y1-(b/a)*x1;
  56.     y=x1;
  57.     return gcd;
  58. }
  59. ll modinverse(ll a,ll m)
  60. {
  61.     ll x,y;
  62.     ll g=gcdextended(a,m,x,y);
  63.     if(g!=1)
  64.     {
  65.         cout<<"NOT POSSIBLE";
  66.         return -1;
  67.     }
  68.     else
  69.         return (x%m+m)%m;
  70. }
  71. ll po(ll x,ll y) 
  72. { 
  73.     ll res = 1;        
  74.     while (y > 0) 
  75.     { 
  76.         if (y & 1) 
  77.             res = (res*x); 
  78.         y = y>>1;
  79.         x = (x*x);   
  80.     } 
  81.     return res; 
  82. }
  83. ll pom(ll x,ll y,ll p)
  84. {
  85.     ll res=1;
  86.     x=x%p;
  87.     while(y>0)
  88.     {
  89.         if(y&1)
  90.             res=(res*x)%p;
  91.         y= y>>1;
  92.         x=(x*x)%p;
  93.     }
  94.     return res;
  95. }
  96. ll root(ll x,vector<ll> &id)
  97. {
  98.     while(id[x]!=x)
  99.     {
  100.         id[x]=id[id[x]];
  101.         x=id[x];
  102.     }
  103.     return x;
  104. }
  105. void uni(ll x,ll y,vector<ll> &id)
  106. {
  107.     ll a=root(x,id);
  108.     ll b=root(y,id);
  109.     id[a]=id[b];
  110. }
  111. bool sec(const pl &a,const pl &b)  
  112. {
  113.     return a.s<b.s;
  114. }
  115. void solve()
  116. {
  117.     printf("cccc");
  118. }   
  119. int main()
  120. {
  121.     fast;
  122.     ll t;
  123.     t=1;
  124.     //cin>>t;
  125.     while(t--)
  126.     {
  127.         solve();
  128.     }
  129.  
  130. }
  131.  
Success #stdin #stdout 0s 4420KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
cccc
https://ideone.com/eyRTwT
language:
C++14 (gcc 8.3)
created:
4 years 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!