Submission #891673


Source Code Expand

import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);

		int N = scanner.nextInt();
		int a[] = new int[N];
		for (int i = 0; i < N; i++) {
			a[i] = scanner.nextInt();
		}
		int ans = 0;
		for (int i = 0; i < a.length; i++) {
			if (i + 1 == a[a[i] - 1])
				ans++;
		}
		System.out.println(ans / 2);
	}
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User tohusoy
Language Java7 (OpenJDK 1.7.0)
Score 200
Code Size 402 Byte
Status AC
Exec Time 455 ms
Memory 31500 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt
Case Name Status Exec Time Memory
0_00.txt AC 129 ms 9172 KB
0_01.txt AC 124 ms 9044 KB
0_02.txt AC 124 ms 8916 KB
1_00.txt AC 124 ms 8916 KB
1_01.txt AC 452 ms 31500 KB
1_02.txt AC 455 ms 31308 KB
1_03.txt AC 441 ms 31216 KB
1_04.txt AC 438 ms 31432 KB
1_05.txt AC 455 ms 30820 KB
1_06.txt AC 446 ms 31316 KB
1_07.txt AC 443 ms 31436 KB
1_08.txt AC 403 ms 29716 KB
1_09.txt AC 432 ms 30016 KB
1_10.txt AC 435 ms 30296 KB
1_11.txt AC 364 ms 25992 KB