2013-2019CSP真题 Java解答（部分）

201312

题目一 出现次数最多的数

import java.util.*;


public class Main {
   
	public static void main(String[] args) {
   
		HashMap<Integer,Integer> map = new HashMap<>();
		Scanner input=new Scanner(System.in);
		int num;
		int a,min = 0,maxvalue=0;
		List<Integer> max=new ArrayList<>();
		int j=0;
		num=input.nextInt();
		for(int i=0;i<num;i++){
   
			a=input.nextInt();
			if(!map.containsKey(a)){
   
				map.put(a, 1);
			}else {
   
				int now=map.get(a)+1;
				if(now>maxvalue){
   
					maxvalue=now;
					max.add(a);
				}
				map.put(a,now);
			}
		}
		Collections.sort(max);
		System.out.println(max.get(0));
		input.close();
	}
}

// 50

分

题目2 ISBN

public class Main {
   
	public static void main(String[] args) {
   
		Scanner input=new Scanner(System.in);
		String str1=input.next();
		String str=str1.replaceAll("-","");
		int sum=0;
		int len=str.length();
		int last;
		for(int i=0;i<str.length()-1;i++){
   
			sum+=(i+1)*Integer.parseInt(str.substring(i,i+1));
		}
		if(str.substring(len-1,len).equals("X"))
			last=10;
		else
			last=Integer.parseInt(str.substring(len-1,len));
		if(sum%11==last){
   
			System.out.println("Right");
		}else{
   
			if(sum%11==10)
			System.out.println(str1.substring(0,str1.length()-1)+"X");
			else 
				System.out.println(str1.substring(0,str1.length()-1)+sum%11);
		}
		input.close();
	}
}

题目三

题目四

全部由2 代号0
0或2 代号1
2或3 代号2
0或2 或 3 代号3
0或1 或2 代号4
0或1 或2 或3 代号5
A(1)(0) =1 A(1)(1)======0
A(i)[0]=1
A(i)[1]=2A(i-1)[1] +A(i-1)[0]
A(i)[2]=A(i-1)[2] +A(i-1)[0]
A(i)[3]=A(i-1)[2]+A(i-1)[1]+2A(i-1)[3]
A(i)[4]=A(i-1)[1]+A(i-1)[4]*2
A(i)[5]=A(i-1)[5]*2 +A(i-1)[3]+ A(i-1)[4]

public class Main {
   
	public static void main(String[] args) {
   
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		long a[]=new long[1001];
		long b[]=new long[1001];
		long c[]=new long[1001];
		long d[]=new long[1001];
		long e[]=new long[1001];
		long f[]=new long[1001];
		for(int i=1;i<=n;i++){
   
			a[i]=1;
			b[i]=b[i-1]*2+a[i-1]%1000000007;
			c[i]=c[i-1]+a[i-1]%1000000007;
			d[i]=c[i-1]+b[i-1]+2*d[i-1]%1000000007;
			e[i]=b[i-1]+2*e[i-1]%1000000007;
			f[i]=2*f[i-1]+d[i-1]+e[i-1]%1000000007;
		}
		System.out.print(f[n]);
		input.close();
	}
}

20140301

public class Main {
   
    public static void main(String[] args) {
   
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int ans=0;
        int a[] = new int[n];
        for(int i=0;i<n;i++){
   
            a[i]=sc.nextInt();
        }
        for(int i=0;i<n;i++){
   
            for(int j=i+1;j<n;j++){
   
                if(a[j]==-a[i])ans++;
            }
        }
        System.out.println(ans);
    }
}

20140302

import java.util.*;

public class Main {
   
    public static void main(String[] args) {
   
        Scanner sc = new Scanner(System.in);
        int n, m;
        n = sc.nextInt();
        m = sc.nextInt();
        List<Windows> lists = new ArrayList<>();
        for(int i=0;i<n;i++){
   
            Windows windows=new Windows(sc.nextInt(),sc.