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 <stdio.h>
int main(){
int i,j, n, x[51], y[51], rank[51];
scanf("%d", &n);
for(i=0; i < n; ++i) scanf("%d %d", &x[i], &y[i]);
for(i=0; i < n; ++i){
rank[i] = 1;
for(j=0; j < n; ++j){
if( x[i]<x[j] && y[i]<y[j] ) ++rank[i];
}
printf("%d ", rank[i]);
}
printf("\n");
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... |