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