| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1286206 | kaxi | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
void buy_souvenirs(int N, long long P0) {
if (N == 2 && P0 != N) {
Transaction(P0 - 1);
return;
}
for (long long k = 1; k < N; ++k) {
Transaction(N - k);
}
}
