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 n, x[51], y[51], big[51];
void input(void)
{
int i;
scanf("%d",&n);
for(i=1 ; i<=n ; i++)
scanf("%d %d",&x[i],&y[i]);
}
void process(void)
{
int i, j;
for(i=1 ; i<=n ; i++)
for(j=1 ; j<=n ; j++)
if(x[i]<=x[j] && y[i]<=y[j])
big[i]++;
}
void output(void)
{
int i;
for(i=1 ; i<=n ; i++)
printf("%d ",big[i]);
}
int main(void)
{
input();
process();
output();
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... |