[Offer收割]编程练习赛14 register

Ended

Participants:574

Verdict:Accepted
Score:100 / 100
Submitted:2017-04-16 14:20:43

Lang:Java

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
    public static void main(String[] args){
       Scanner in = new Scanner(System.in);
       int n = in.nextInt(), abexpa = 0expb = 0expline = 0;
       int[] tree = new int[n + 1];
       int[] lineNum = new int[n + 1];
       tree[1= 1;
       for(int i = 1i <= ni++){
           a = in.nextInt();
           b = in.nextInt();
           if(tree[b== 0){
               tree[b= a;
               lineNum[b= i;
           }else{
               expa = a;
               expb = b;
               expline = i;
               if(b == 1){
                   System.out.print(i);
                   return;
               }
           }
       }
       List<Integer> res = new ArrayList<Integer>();
        int k = 1;
       for(; k <= nk++){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX