제출 #1302428

#제출 시각아이디문제언어결과실행 시간메모리
1302428aaaaaaaaSouvenirs (IOI25_souvenirs)C++20
3 / 100
13 ms332 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long P0) { //pair<vector<int>, long long> res = transaction(P0 - 1); // N, N - 1, N - 2, N - 3, N - 4, .. 1 for(int i = N - 1, cnt = 0; i >= 1; --i, ++cnt) { for(int j = 0; j <= cnt; ++j){ transaction(i); } } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...