Submission #1128258

#TimeUsernameProblemLanguageResultExecution timeMemory
1128258shnBank (IZhO14_bank)C++20
0 / 100
0 ms324 KiB
/*
	Dimash ne katai!!!
	shnurok krash))
	Serikbay777 tozhe krash))
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define Respaabs1equal2xdoner cin.tie(nullptr)->sync_with_stdio(false);
#define pii pair < long long , long long >
#define len(s) (long long)(s.size())
#define all(x) x.begin() , x.end()
#define pll pair < int , int >
#define pofik continue
#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const long long N = 2e5 + 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 % MOD * a % MOD;
}

void solve(){
	
}

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...