제출 #1318259

#제출 시각아이디문제언어결과실행 시간메모리
1318259hayford08Memory (IOI10_memory)C++20
50 / 100
10 ms412 KiB
#include "grader.h" #include "memory.h" #include <bits/stdc++.h> using namespace std; void play() { // 2450 // 2 * (49 + 48 + 47 + ... + 3 + 2 + 1) // 2 * (49 * (49 + 1)) / 2 // 49 * 50 = 2450 // cards : 1, 2, 3, ..., 50 // Pick 1: check cards 2, 3, 4, ..., 50 // call faceUp(1), faceUp(i) where i is current card // check if faceUp(1) == faceUp(i) // 1 -> cards: [2, 50] card was 50 // 2 -> cards: [3, 49] card was 49 // ... // 50 // n = 50 // Subtask 1: cannot call faceup more than 2450 for (int card1 = 1; card1 <= 50; card1++) { for (int card2 = card1 + 1; card2 <= 50; card2++) { faceup(card1); faceup(card2); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...