제출 #1319206

#제출 시각아이디문제언어결과실행 시간메모리
1319206alexaaa선물 (IOI25_souvenirs)C++20
4 / 100
12 ms388 KiB
#include "souvenirs.h" #include <utility> #include <vector> void buy_souvenirs(int N, long long P0) { if(N == 2){ transaction(P0-1); } else{ int n = N - 1; int i = 1; while(i <= N){ for(int j = 0; j < i; j++){ transaction(n); } i ++; n --; } } }
#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...