hihoCoder太阁最新面经算法竞赛12 register

Ended

Participants:164

Verdict:Accepted
Score:100 / 100
Submitted:2016-10-27 16:06:02

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.*;
class Main{
    static Scanner scanner;
    static int N;
    static int record[][],calu[];
    static A[] t;
    public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);
        N=scan.nextInt();
        String a=Integer.toBinaryString(N);
        t=parse(a);
        N=t.length;
      //  System.out.println(a);
        record=new int[N][N];
        calu=new int[N];
        System.out.println(getCalu(0));
    }
    static int getRecord(int i1,int j1){
        if(record[i1][j1]>0){
            return record[i1][j1];
        }
        if(i1==j1){
            record[i1][j1]=t[i1].len();
            return record[i1][j1];
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX