oj.uz

답안 #1686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1686 2013-07-12T08:28:12 Z gs13105 덩치 (KOI13_body) C++
18 / 18
 0 ms 884 KB 
#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;
}

Subtask #1
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #2
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #3
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #4
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #5
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #6
2.7 / 2.7

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct
3 Correct 0 ms 884 KB Output is correct

Subtask #7
1.8 / 1.8

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 884 KB Output is correct
2 Correct 0 ms 884 KB Output is correct