結果
問題 | No.1680 Sum and Difference |
ユーザー | cyclerecycle9 |
提出日時 | 2021-12-06 04:11:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 46 ms / 1,000 ms |
コード長 | 3,854 bytes |
コンパイル時間 | 1,863 ms |
コンパイル使用メモリ | 80,744 KB |
実行使用メモリ | 37,408 KB |
最終ジャッジ日時 | 2024-07-07 08:50:31 |
合計ジャッジ時間 | 3,543 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
37,152 KB |
testcase_01 | AC | 45 ms
37,176 KB |
testcase_02 | AC | 46 ms
37,092 KB |
testcase_03 | AC | 46 ms
37,104 KB |
testcase_04 | AC | 46 ms
37,328 KB |
testcase_05 | AC | 44 ms
37,392 KB |
testcase_06 | AC | 43 ms
36,592 KB |
testcase_07 | AC | 45 ms
37,008 KB |
testcase_08 | AC | 45 ms
36,756 KB |
testcase_09 | AC | 43 ms
36,964 KB |
testcase_10 | AC | 44 ms
37,216 KB |
testcase_11 | AC | 44 ms
36,940 KB |
testcase_12 | AC | 44 ms
37,408 KB |
testcase_13 | AC | 45 ms
37,216 KB |
testcase_14 | AC | 45 ms
36,968 KB |
testcase_15 | AC | 44 ms
37,264 KB |
testcase_16 | AC | 44 ms
37,268 KB |
testcase_17 | AC | 45 ms
37,088 KB |
testcase_18 | AC | 43 ms
37,024 KB |
testcase_19 | AC | 42 ms
36,756 KB |
testcase_20 | AC | 43 ms
37,092 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.math.RoundingMode; import java.util.*; import java.util.concurrent.locks.ReentrantReadWriteLock.WriteLock; import java.io.File; import java.io.FileDescriptor; import java.io.FileOutputStream; import java.io.OutputStream; import java.io.UncheckedIOException; import java.lang.Thread.State; import java.lang.reflect.Field; import java.nio.CharBuffer; import java.nio.charset.CharacterCodingException; import java.nio.charset.CharsetEncoder; import java.nio.charset.StandardCharsets; public class Main { static final long MOD1=1000000007; static final long MOD=998244353; static long ans=0; public static void main(String[] args){ PrintWriter out = new PrintWriter(System.out); InputReader sc=new InputReader(System.in); long A = sc.nextLong(); long B = sc.nextLong(); long a_even = (1l + (A/2l)*2l)%MOD1; long b_even = (1l + (B/2l)*2l)%MOD1; long a_odd = (((A+1)/2l)*2l)%MOD1; long b_odd = (((B+1)/2l)*2l)%MOD1; long even = (a_even*b_even)%MOD1; long odd = (a_odd*b_odd)%MOD1; System.out.println((even+odd)%MOD1); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } 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 double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); 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 char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } }