結果
問題 | No.99 ジャンピング駒 |
ユーザー |
![]() |
提出日時 | 2015-05-17 20:58:35 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 210 ms / 5,000 ms |
コード長 | 2,286 bytes |
コンパイル時間 | 2,432 ms |
コンパイル使用メモリ | 78,200 KB |
実行使用メモリ | 57,428 KB |
最終ジャッジ日時 | 2024-07-06 05:10:25 |
合計ジャッジ時間 | 3,644 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 6 |
ソースコード
import java.io.IOException;import java.util.InputMismatchException;public class Main {void run() {MyScanner sc = new MyScanner();int n = sc.nextInt();int e = 0, o = 0;for (int i = 0; i < n; i++) {if (sc.nextInt() % 2 == 0) {e++;} else {o++;}}System.out.println(Math.abs(e - o));}public static void main(String[] args) {new Main().run();}public void mapDebug(int[][] a) {System.out.println("--------map display---------");for (int i = 0; i < a.length; i++) {for (int j = 0; j < a[i].length; j++) {System.out.printf("%3d ", a[i][j]);}System.out.println();}System.out.println("----------------------------" + '\n');}class MyScanner {int read() {try {return System.in.read();} catch (IOException e) {throw new InputMismatchException();}}boolean isSpaceChar(int c) {return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;}boolean isEndline(int c) {return c == '\n' || c == '\r' || c == -1;}int nextInt() {return Integer.parseInt(next());}int[] nextIntArray(int n) {int[] array = new int[n];for (int i = 0; i < n; i++)array[i] = nextInt();return array;}long nextLong() {return Long.parseLong(next());}long[] nextLongArray(int n) {long[] array = new long[n];for (int i = 0; i < n; i++)array[i] = nextLong();return array;}double nextDouble() {return Double.parseDouble(next());}double[] nextDoubleArray(int n) {double[] array = new double[n];for (int i = 0; i < n; i++)array[i] = nextDouble();return array;}String next() {int c = read();while (isSpaceChar(c))c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();} while (!isSpaceChar(c));return res.toString();}String[] nextStringArray(int n) {String[] array = new String[n];for (int i = 0; i < n; i++)array[i] = next();return array;}String nextLine() {int c = read();while (isEndline(c))c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();} while (!isEndline(c));return res.toString();}}}