# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1251133 | somefolk | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
#define endl "\n"
#define ll long long
const int INF = 1e9+7;
const int MOD = 1e9+7;
pair<vector<int>, ll> transaction(ll m);
// pair<vector<int>, ll> transaction(int n, ll m){
// cout << "Input arr: ";
// vector<int> a(n);
// for(int i = 0; i < n; i++){
// cin >> a[i];
// }
// cout << "Input r: ";
// int r;
// cin >> r;
// return {a, r};
// }
void buy_souvenirs(int n, ll p0){
transaction(p0-i);
for(int i = 1; i < n; i++){
transaction(n-i);
}
}