| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1284493 | dimitri.shengelia | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
pair <vector<int>, long long> transaction(long long M);
void buy_souvenirs(int N, long long P0) {
if ( n == 2 ) {
transaction ( P0 - 1 );
return;
} else if ( n == 3 ) {
transaction ( P0 - 1 );
transaction ( ( P0 - 1 ) / 2 );
}
pair <vector<int>, long long> res;
for ( int i = 1; i < N; i++ ) {
for ( int j = 0; j < i; j++ ) {
transaction ( N - i );
}
}
return;
}
