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 arr[50][2];
int main()
{
int cnt,n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d",&arr[i][0],&arr[i][1]);
for(i=0;i<n;i++)
{
cnt=1;
for(j=0;j<n;j++)
if(arr[j][0]>arr[i][0]&&arr[j][1]>arr[i][1])
cnt++;
printf("%d ",cnt);
}
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... |