// well may be i am just bad at this game
#pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int , int>
#define sz(x) x.size()
#define clr(x) x.clear()
#define mem(x ,y) memset(x , y , sizeof x )
#define all(a ) a.begin() , a.end()
#define endl "\n"
#define si(x ) scanf("%d", &x);
#define sii(x,y ) scanf("%d%d", &x,&y);
#define fast() ios_base :: sync_with_stdio(false ) ; cin.tie(0) ; cout.tie(0) ;
#define rep(i ,n ) for(int i = 0 ; i < n ; i++ )
#define repi(i ,n ) for(int i = 1 ; i <= n ; i++ )
#define forn(i ,x,n ) for(int i = x ; i <= n ; i++ )
#define repit(i, c) for( __typeof((c).begin()) i = (c).begin(); i != (c).end();++i )
#define dbg(args...) do { cerr << #args << ' ' ; print(args); } while(0); cerr<< endl ;
const long long mod = 1e9+7 ;
const int inf = 1e9 ;
const long long inflong = 1e18 ;
int setbit(int n, int pos ) { return n = n|(1<< pos) ; }
int resetbit(int n,int pos ) { return n = n & ~(1<<pos ); }
bool checkbit(int n,int pos ) { return (bool ) (n& (1<<pos)) ; }
template < typename T > void print(const T& v) { cerr << v << ' ' ;}
template < typename T > T modMul(T x, T y ) { x %= mod ; y %= mod ; return (x*y)%mod ; }
template < typename T > T modAdd(T x, T y ) { x %= mod ; y %= mod ; return (x+y)%mod ; }
template < typename T > T modPow(T x, T k ,T mod ) { if(k == 0 ) return 1; if(k&1 ) { return ( (x%mod)*modPow(x,k-1, mod )%mod )%mod ; } else { T ret = modPow(x,k/2 , mod ) ; ret %= mod ; return (ret*ret )%mod; } }
template < typename T1, typename... T2 > void print( const T1& first, const T2&... rest ){ print(first); print(rest...) ;}
template < typename T > T ext_gcd(T num1 , T num2, T &X , T &Y ) { T r2,r1, q2, q1 , x2, x1, y2 ,y1 , x, y, r ; x2 = 1; y2 = 0; x1 = 0; y1 = 1; for( r2 =num1 ,r1 = num2 ;r1 != 0 ; y2 = y1, y1 = y,x2 = x1 ,x1 = x ,r2 = r1, r1 = r) {q1 = r2/r1; x = x2 - q1*x1; y = y2 - q1*y1; r = r2%r1 ; } X = x2 ; Y = y2 ; return r2 ; }
template<typename T >
T modInv( T x , T m ) {
return modPow(x,m-2 , m) ;
long long ret, t ;
ext_gcd( x, m ,ret ,t ) ;
ret %= m ;
if(ret<0) ret += m ;
return ret;
}
typedef long long ll ;
typedef unsigned long long ull ;
typedef vector<int> vi ;
//int dx[] = {0 , 0 ,+1, -1 } ;
//int dy[] = {-1, +1,0 , 0 };
// code from here
const int M = 1e5+7 ;
const int mx = M+2 ;
//const ll N = 1e7+5 ;
const int N = 1e7+7;
int main() {
// freopen("in.txt", "r", stdin );
// freopen( "out.txt", "w",stdout );
cout << "hello world" ;
return 0 ;
}
Compilation message
palindrome.cpp:3:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/stack:247474112")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
