結果

問題 No.103 素因数ゲーム リターンズ
ユーザー threepipes_sthreepipes_s
提出日時 2014-12-15 02:32:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 69 ms / 5,000 ms
コード長 5,428 bytes
コンパイル時間 3,051 ms
コンパイル使用メモリ 78,328 KB
実行使用メモリ 51,496 KB
最終ジャッジ日時 2023-09-02 14:46:45
合計ジャッジ時間 5,713 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
50,192 KB
testcase_01 AC 58 ms
50,376 KB
testcase_02 AC 61 ms
50,188 KB
testcase_03 AC 59 ms
50,596 KB
testcase_04 AC 59 ms
50,444 KB
testcase_05 AC 59 ms
50,372 KB
testcase_06 AC 60 ms
50,412 KB
testcase_07 AC 60 ms
50,496 KB
testcase_08 AC 59 ms
50,380 KB
testcase_09 AC 60 ms
50,632 KB
testcase_10 AC 61 ms
50,312 KB
testcase_11 AC 60 ms
50,364 KB
testcase_12 AC 62 ms
50,436 KB
testcase_13 AC 62 ms
50,596 KB
testcase_14 AC 63 ms
50,512 KB
testcase_15 AC 62 ms
50,408 KB
testcase_16 AC 61 ms
50,468 KB
testcase_17 AC 67 ms
51,496 KB
testcase_18 AC 61 ms
50,452 KB
testcase_19 AC 67 ms
51,088 KB
testcase_20 AC 60 ms
50,396 KB
testcase_21 AC 62 ms
50,372 KB
testcase_22 AC 60 ms
50,620 KB
testcase_23 AC 59 ms
50,624 KB
testcase_24 AC 69 ms
51,124 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.TreeSet;
public class Main {
	public static int[] p = new int[10000];
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		p[0] = 2;
		int jLast = 0;
		for(int i=3; i<=10007; i++){
			boolean prim = true;
			for(int j=0; j<=jLast; j++){
				if(i%p[j] == 0){
					prim = false;
					break;
				}
			}
			if(prim){
				jLast++;
				p[jLast] = i;
			}
		}
		int x = 0;
		for(int i=0; i<n; i++){
			x ^= grundy(in.nextInt());
		}
		System.out.println(x==0?"Bob":"Alice");
	}
	
	public static int grundy(int m){
		int i = 0;
		int res = 0;
		while(p[i] <= m){
			int m2 = m;
			int x = 0;
			while(m2%p[i] == 0){
				m2 /= p[i];
				x++;
			}
			if(x > 0) res ^= x%3;
			i++;
		}
		return res;
	}
	
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}


class NodeW{
	int id;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class MyMath{
	public final static double PIhalf = Math.PI/2.0;
	public static double pAngle(double x, double y){
		// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)
		if(x == 0){
			if(y == 0){
				System.err.println("pAngle error: zero vector.");
				return 0;
			}else if(y < 0){
				return PIhalf*3.0;
			}else{
				return PIhalf;
			}
		}
		double rad = Math.atan(y/x);
		if(rad < 0){
			rad += Math.PI*2.0;
		}
		return rad;
	}
	
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}

	// 最大公約数
	static int gcd(int a, int b){
		return b == 0 ? a : gcd(b, a % b);
	}

	// 最小公倍数
	static int lcm(int a, int b){
		return a * b / gcd(a, b);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}
0