#424646 (Java21) No.976 2 の 128 乗と M

提出ソース

結果

問題	No.976 2 の 128 乗と M
ユーザー	Oland
提出日時	2020-02-01 06:41:57
言語	Java21 (openjdk 21)
結果	AC
実行時間	54 ms / 2,000 ms
コード長	6,499 bytes
コンパイル時間	2,498 ms
コンパイル使用メモリ	78,352 KB
実行使用メモリ	50,764 KB
最終ジャッジ日時	2024-09-18 19:41:02
合計ジャッジ時間	6,402 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	50 ms 50,288 KB
testcase_01	AC	50 ms 49,988 KB
testcase_02	AC	50 ms 50,276 KB
testcase_03	AC	52 ms 50,212 KB
testcase_04	AC	54 ms 50,336 KB
testcase_05	AC	51 ms 50,328 KB
testcase_06	AC	51 ms 50,280 KB
testcase_07	AC	50 ms 50,280 KB
testcase_08	AC	47 ms 50,312 KB
testcase_09	AC	46 ms 50,464 KB
testcase_10	AC	49 ms 50,312 KB
testcase_11	AC	50 ms 50,360 KB
testcase_12	AC	50 ms 50,376 KB
testcase_13	AC	48 ms 50,236 KB
testcase_14	AC	48 ms 50,488 KB
testcase_15	AC	48 ms 50,460 KB
testcase_16	AC	49 ms 50,216 KB
testcase_17	AC	47 ms 50,464 KB
testcase_18	AC	48 ms 50,136 KB
testcase_19	AC	54 ms 50,332 KB
testcase_20	AC	48 ms 50,256 KB
testcase_21	AC	47 ms 50,216 KB
testcase_22	AC	47 ms 50,040 KB
testcase_23	AC	48 ms 50,224 KB
testcase_24	AC	47 ms 50,496 KB
testcase_25	AC	50 ms 49,972 KB
testcase_26	AC	49 ms 50,444 KB
testcase_27	AC	48 ms 50,108 KB
testcase_28	AC	48 ms 50,444 KB
testcase_29	AC	49 ms 50,500 KB
testcase_30	AC	49 ms 50,388 KB
testcase_31	AC	49 ms 50,376 KB
testcase_32	AC	48 ms 50,480 KB
testcase_33	AC	48 ms 50,424 KB
testcase_34	AC	50 ms 50,764 KB
testcase_35	AC	51 ms 50,356 KB
testcase_36	AC	48 ms 50,468 KB
testcase_37	AC	48 ms 50,140 KB
testcase_38	AC	48 ms 50,380 KB
testcase_39	AC	48 ms 50,112 KB
testcase_40	AC	48 ms 50,372 KB
testcase_41	AC	47 ms 50,352 KB
testcase_42	AC	50 ms 50,596 KB
testcase_43	AC	48 ms 50,320 KB
testcase_44	AC	53 ms 50,220 KB
testcase_45	AC	48 ms 50,216 KB
testcase_46	AC	48 ms 50,176 KB
testcase_47	AC	48 ms 50,220 KB
testcase_48	AC	47 ms 50,480 KB
testcase_49	AC	48 ms 50,440 KB
testcase_50	AC	47 ms 50,060 KB
testcase_51	AC	48 ms 50,408 KB
testcase_52	AC	47 ms 50,300 KB
testcase_53	AC	48 ms 50,516 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.util.*;
import java.io.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        long M = in.nextLong(), ans = 1L;
        for(int i = 0; i < 128; i++) ans = (ans << 1) % M;
        out.println(ans);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}

yukicoder

結果

テストケース

ソースコード