# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1276833 | nguyenhuuhongquan | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define ull unsigned long long
#define BIG __int128
#define fi first
#define se second
#define MASK(i) (1ll << i)
#define BIT(x, i) (((x) >> (i)) & 1)
#define sz(x) (int)(x).size()
#define debug cout << "NO ERROR", exit(0);
#define TASK "txt"
#define IOS ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int LimN = 1e5 + 5;
void maximize(int &x, int y){
x = max(x, y);
}
void minimize(int &x, int y){
x = min(x, y);
}
void add(int &x, int y){
x = (x % MOD + y % MOD) % MOD;
}
void buy_souvenirs(int N, long long P0){
transaction(P0 - 1);
}
void solve(){
}
// Authors: Nguyen Huu Hong Quan from Tay Son Secondary school Da Nang
signed main(){
IOS;
if (fopen(TASK".inp", "r")){
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
int Q = 1, NumTest = 0;
//cin >> Q;
for (int i = 1; i <= Q; i ++){
if (NumTest) cout << "Case #" << i << ": ";
solve();
}
}