結果

問題 No.321 (P,Q)-サンタと街の子供たち
ユーザー ぴろずぴろず
提出日時 2015-12-17 22:32:24
言語 Java19
(openjdk 21)
結果
AC  
実行時間 135 ms / 2,000 ms
コード長 4,593 bytes
コンパイル時間 2,503 ms
コンパイル使用メモリ 75,948 KB
実行使用メモリ 53,344 KB
最終ジャッジ日時 2023-09-21 03:27:38
合計ジャッジ時間 8,473 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,272 KB
testcase_01 AC 44 ms
49,796 KB
testcase_02 AC 44 ms
49,388 KB
testcase_03 AC 45 ms
49,452 KB
testcase_04 AC 44 ms
49,320 KB
testcase_05 AC 43 ms
49,280 KB
testcase_06 AC 43 ms
49,160 KB
testcase_07 AC 43 ms
49,352 KB
testcase_08 AC 44 ms
49,360 KB
testcase_09 AC 44 ms
49,464 KB
testcase_10 AC 44 ms
49,280 KB
testcase_11 AC 45 ms
49,464 KB
testcase_12 AC 44 ms
49,544 KB
testcase_13 AC 45 ms
47,408 KB
testcase_14 AC 112 ms
52,484 KB
testcase_15 AC 123 ms
52,720 KB
testcase_16 AC 90 ms
52,636 KB
testcase_17 AC 46 ms
49,464 KB
testcase_18 AC 96 ms
52,696 KB
testcase_19 AC 115 ms
52,884 KB
testcase_20 AC 125 ms
52,704 KB
testcase_21 AC 119 ms
52,696 KB
testcase_22 AC 84 ms
52,068 KB
testcase_23 AC 128 ms
52,992 KB
testcase_24 AC 90 ms
52,312 KB
testcase_25 AC 116 ms
52,688 KB
testcase_26 AC 125 ms
52,936 KB
testcase_27 AC 122 ms
52,680 KB
testcase_28 AC 124 ms
52,544 KB
testcase_29 AC 131 ms
53,344 KB
testcase_30 AC 52 ms
49,408 KB
testcase_31 AC 49 ms
49,332 KB
testcase_32 AC 118 ms
52,548 KB
testcase_33 AC 114 ms
52,612 KB
testcase_34 AC 114 ms
52,512 KB
testcase_35 AC 128 ms
52,960 KB
testcase_36 AC 57 ms
50,476 KB
testcase_37 AC 122 ms
52,688 KB
testcase_38 AC 120 ms
52,888 KB
testcase_39 AC 89 ms
52,324 KB
testcase_40 AC 133 ms
52,760 KB
testcase_41 AC 108 ms
52,784 KB
testcase_42 AC 135 ms
52,752 KB
testcase_43 AC 121 ms
53,220 KB
testcase_44 AC 129 ms
52,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package no321;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int p = io.nextInt();
		int q = io.nextInt();
		int n = io.nextInt();
		int ans = 0;
		for(int i=0;i<n;i++) {
			int x = io.nextInt();
			int y = io.nextInt();
			if (hasSolution(p,q,x,y)) {
				ans++;
			}
		}
		System.out.println(ans);
	}
	
	//解説を読んだ
	public static boolean hasSolution(long p,long q,long x,long y) {
		if (p == 0 && q == 0) {
			return x == 0 && y == 0;
		}
		if (p == 0) {
			return x % q == 0 && y % q == 0;
		}
		if (q == 0) {
			return x % p == 0 && y % p == 0;
		}
		long gcd = gcd(p,q);
		if (x % gcd != 0 || y % gcd != 0) {
			return false;
		}
		p /= gcd;
		q /= gcd;
		x = x / gcd;
		y = y / gcd;
		if ((p + q) % 2 == 1) {
			return true;
		}else{
			return (x + y) % 2 == 0;
		}
	}
	
	public static long gcd(long a,long b) {
		while(b!=0) {
			long r = a%b;
			a = b;
			b = r;
		}
		return a;
	}

}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0