Submission #1001571

#TimeUsernameProblemLanguageResultExecution timeMemory
1001571vjudge1Robots (APIO13_robots)C++17
0 / 100
0 ms348 KiB
/* Dimash ne katai!!! shnurok krash)) Serikbay777 tozhe krash)) */ #include <bits/stdc++.h> #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout) #define Respaabs1equal2xdoner ios_base::sync_with_stdio(0);cin.tie(0); #define pll pair < long long , long long > #define all(x) x.begin() , x.end() #define pii pair < int , int > #define pofik continue #define int long long #define pb push_back #define ins insert #define sz size() #define F first #define S second const long long N = 3e5 + 77 , inf = 1e18 + 77 , MOD = 1e9 + 7; const long double eps = 1e-11; using namespace std; int T = 1; int binpow(int a , int b){ if(!b) return 1; int val = binpow(a , b / 2); if(b % 2 == 0) return val * val % MOD; else return val * val * a % MOD; } /* 1......... AA.x4..... ..A..x.... 2....x.... ..C.3.A... */ void solve(){ cout << 1; } signed main(){ Respaabs1equal2xdoner // cin >> T; for(int cas = 1; cas <= T; cas++){ // cout << "Case " << cas << ":\n"; solve(); } } /* ___ __ _ | \ | | _____ | | _ | |\ \ | | __ __ | __ \ | | (_) | | \ \ | | | | | || | \_\__ _| | _ | | \ \ | | | | | || | / _` | | | | | | \ \| | | |__| || | / (_| | | | | |_| \___| |______||_| \_,__|_| |_| Created by: Moldiyar Abay */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...