Submission #1078

#TimeUsernameProblemLanguageResultExecution timeMemory
1078tncks0121덩치 (KOI13_body)C++98
18 / 18
0 ms884 KiB
#include <stdio.h>
FILE *in=stdin;
FILE *out=stdout;
int n, k;
int x[100], y[100], cnt;
int main() {
int i, j;
fscanf(in, "%d", &n);
for (i=1;i<=n;i++)
fscanf(in, "%d%d", &x[i], &y[i]);
for (i=1;i<=n;i++) {
cnt = 1;
for (j=1;j<=n;j++) {
if (i != j) {
if (x[j] > x[i] && y[j] > y[i])
cnt++;
}
}fprintf(out, "%d ", cnt);
}fprintf(out, "\n");
return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...