Submission #4327

#TimeUsernameProblemLanguageResultExecution timeMemory
4327kipa00덩치 (KOI13_body)C++98
18 / 18
0 ms1088 KiB
#include <cstdio> int main() { int i, j, N, x[50], y[50]; scanf("%d", &N); for (i=0; i<N; ++i) { scanf("%d %d", &x[i], &y[i]); } for (i=0; i<N; ++i) { int prize = 1; for (j=0; j<N; ++j) { if (i == j) continue; if (x[j] > x[i] && y[j] > y[i]) { ++prize; } } printf("%d ", prize); } return 0; }
#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...