| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1285893 | nikakh | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB | 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void buy_souvenirs(int N, long long P0){
	pair<vector<int>, long long> ret;
	if(N == 2){
		transaction(P0 - 1);
		return;
	}
	if(P0 == N){
		for(int i = 1; i < N; i++){
			for(int j = 0; j < i; j++){
				transaction(P0 - i);
			}
		}
		return;
	} if(N == 3){
		res = transaction(P0 - 1);
		int f = res.first, s = res.second;
		if(f.size() == 2){
			transaction(P0 - 1 - s - 1);
			transaction(P0 - 1 - s - 1);
		} else{
			transaction(P0 - 1 - s - 1);
		}
		return;
	}
}
