| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1259041 | siquy3001 | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
std::pair<std::vector<int>, long long> transaction(long long M);
ll p[105];
void buy_souvenirs(int N, long long P0){
ll n=N;
ll val=P0;
for(int i=1;i<n;i++){
for(int j=1;j<=i;j++)transaction(n-i);
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
