OJ1004

 1004，求字符串出现最多次数

package shiyantest;
import java.util.*;

public class OJ1004 {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		while(n!=0)
		{
			String[]  colors = new String[n];
			for(int i =0;i<n;i++)
			{
				colors[i] = in.nextLine();
			}
			int max =0;
			int id =0;
			int nowmax=0;
			for(int i=0;i<n;i++) {
				for(int j=0;j<i;j++) {
					if(colors[i].equals(colors[j]))
						nowmax++;
				}
				if(nowmax>max) {
					max = nowmax;
					id =i;
				}
			}
			System.out.println(colors[id]);
			n = in.nextInt();
			in.nextLine();
		}
	}

}

OJ 1005

周期的思想，除以77 49

package shiyantest;

import java.util.Scanner;

public class OJ1005{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a, b;
		int n;
		while (in.hasNext()) {
			a = in.nextInt();
			b = in.nextInt();
			n = in.nextInt();
			// 1 <= A, B <= 1000, 1 <= n <= 100,000,000
			if (a < 1 & a > 1000 & b < 1 & b > 1000 & b < 1 & a > 100000000)
				System.exit(0);
			if (a == 0 & b == 0 & n == 0)
				System.exit(0);
			int f[] = new int[49];
			for (int i = 0; i < 49; i++) {
				if (i == 1 || i == 0) {
					f[i] = 1;
				} else {
					f[i] = (a * f[i - 1] + b * f[i - 2]) % 7;
				}
			}
			System.out.println(f[(n-1) % 49]);
		}
		in.close();
	}
 
}