結果

問題 No.1198 お菓子配り-1
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-08-28 21:56:32
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 2,703 bytes
コンパイル時間 2,511 ms
コンパイル使用メモリ 90,144 KB
実行使用メモリ 53,396 KB
最終ジャッジ日時 2024-11-14 00:18:19
合計ジャッジ時間 4,797 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 108 ms
53,120 KB
testcase_01 AC 78 ms
51,104 KB
testcase_02 AC 79 ms
50,984 KB
testcase_03 AC 102 ms
52,972 KB
testcase_04 AC 102 ms
53,224 KB
testcase_05 AC 104 ms
53,092 KB
testcase_06 AC 104 ms
53,172 KB
testcase_07 AC 104 ms
53,396 KB
testcase_08 AC 103 ms
53,036 KB
testcase_09 AC 103 ms
53,356 KB
testcase_10 AC 103 ms
53,132 KB
testcase_11 AC 103 ms
53,368 KB
testcase_12 AC 102 ms
53,336 KB
testcase_13 AC 102 ms
53,212 KB
testcase_14 AC 101 ms
53,248 KB
testcase_15 AC 100 ms
53,376 KB
testcase_16 WA -
testcase_17 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

public class Main {
private static void solve() {
char[] s = ns();
int n = s.length;
int x;
if (n >= 2) {
x = Integer.parseInt("" + s[n - 2] + s[n - 1]);
} else {
x = Integer.parseInt(new String(s));
}
if (x % 2 == 0 && x % 4 != 0) {
System.out.println(-1);
} else {
System.out.println(1);
}
}
public static void main(String[] args) {
new Thread(null, new Runnable() {
@Override
public void run() {
long start = System.currentTimeMillis();
String debug = args.length > 0 ? args[0] : null;
if (debug != null) {
try {
is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
} catch (Exception e) {
throw new RuntimeException(e);
}
}
reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
solve();
out.flush();
tr((System.currentTimeMillis() - start) + "ms");
}
}, "", 64000000).start();
}
private static java.io.InputStream is = System.in;
private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
private static java.util.StringTokenizer tokenizer = null;
private static java.io.BufferedReader reader;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new java.util.StringTokenizer(reader.readLine());
} catch (Exception e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private static double nd() {
return Double.parseDouble(next());
}
private static long nl() {
return Long.parseLong(next());
}
private static int[] na(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni();
return a;
}
private static char[] ns() {
return next().toCharArray();
}
private static long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nl();
return a;
}
private static int[][] ntable(int n, int m) {
int[][] table = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[i][j] = ni();
}
}
return table;
}
private static int[][] nlist(int n, int m) {
int[][] table = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[j][i] = ni();
}
}
return table;
}
private static int ni() {
return Integer.parseInt(next());
}
private static void tr(Object... o) {
if (is != System.in)
System.out.println(java.util.Arrays.deepToString(o));
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0