結果

問題 No.321 (P,Q)-サンタと街の子供たち
ユーザー uwiuwi
提出日時 2015-12-14 01:45:52
言語 Java19
(openjdk 21)
結果
AC  
実行時間 102 ms / 2,000 ms
コード長 3,502 bytes
コンパイル時間 5,059 ms
コンパイル使用メモリ 78,188 KB
実行使用メモリ 52,512 KB
最終ジャッジ日時 2023-09-21 03:12:11
合計ジャッジ時間 9,313 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,428 KB
testcase_01 AC 43 ms
49,504 KB
testcase_02 AC 42 ms
49,212 KB
testcase_03 AC 43 ms
49,404 KB
testcase_04 AC 43 ms
49,308 KB
testcase_05 AC 43 ms
49,652 KB
testcase_06 AC 42 ms
49,524 KB
testcase_07 AC 43 ms
49,384 KB
testcase_08 AC 44 ms
49,360 KB
testcase_09 AC 44 ms
49,416 KB
testcase_10 AC 43 ms
49,528 KB
testcase_11 AC 43 ms
49,492 KB
testcase_12 AC 43 ms
49,376 KB
testcase_13 AC 43 ms
49,840 KB
testcase_14 AC 78 ms
52,512 KB
testcase_15 AC 95 ms
52,496 KB
testcase_16 AC 87 ms
52,136 KB
testcase_17 AC 46 ms
49,328 KB
testcase_18 AC 91 ms
51,844 KB
testcase_19 AC 100 ms
51,964 KB
testcase_20 AC 98 ms
52,260 KB
testcase_21 AC 96 ms
49,880 KB
testcase_22 AC 64 ms
50,940 KB
testcase_23 AC 102 ms
51,928 KB
testcase_24 AC 75 ms
51,624 KB
testcase_25 AC 81 ms
51,772 KB
testcase_26 AC 95 ms
51,984 KB
testcase_27 AC 99 ms
52,100 KB
testcase_28 AC 101 ms
52,420 KB
testcase_29 AC 98 ms
52,112 KB
testcase_30 AC 48 ms
49,480 KB
testcase_31 AC 46 ms
49,340 KB
testcase_32 AC 90 ms
52,164 KB
testcase_33 AC 89 ms
52,416 KB
testcase_34 AC 84 ms
52,248 KB
testcase_35 AC 92 ms
51,980 KB
testcase_36 AC 48 ms
49,272 KB
testcase_37 AC 97 ms
51,888 KB
testcase_38 AC 91 ms
52,400 KB
testcase_39 AC 62 ms
50,684 KB
testcase_40 AC 96 ms
52,212 KB
testcase_41 AC 82 ms
51,588 KB
testcase_42 AC 93 ms
51,700 KB
testcase_43 AC 86 ms
52,032 KB
testcase_44 AC 101 ms
51,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q849 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int P = ni(), Q = ni();
		int n = ni();
		int ok = 0;
		int g = gcd(P, Q);
		if(g != 0){
			P /= g; Q /= g;
		}
		
		for(int i = 0;i < n;i++){
			int x = ni(), y = ni();
			if(g == 0){
				if(x == 0 && y == 0){
					ok++;
				}else{
					continue;
				}
			}else if(x % g == 0 && y % g == 0){
				if((P+Q) % 2 == 0 && (x/g+y/g) % 2 != 0)continue;
				ok++;
			}
		}
		out.println(ok);
	}
	
	public static int gcd(int a, int b) {
		while (b > 0) {
			int c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Q849().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0