This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 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... |