# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1249665 | _abaatar | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
using namespace std;
const int Ma = 5e2+10;
using ll = long long;
void buy_souvenirs(int N, long long P0) {
if (N == 2) transaction(P0-1);
else {
for (int i = N - 1; i > 0; i--) {
transaction(i * (i + 1) >> 1);x
}
}
}