結果

問題 No.1800 Random XOR
ユーザー nishi5451
提出日時 2022-05-14 13:05:14
言語 Java
(openjdk 23)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,078 bytes
コンパイル時間 4,313 ms
コンパイル使用メモリ 78,840 KB
実行使用メモリ 37,036 KB
最終ジャッジ日時 2024-07-22 21:56:37
合計ジャッジ時間 4,105 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

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

import java.util.*;
import java.util.stream.*;
import java.io.*;
class Mod {
    private static int MOD = 1000000007;
    private static long[] fac, finv, inv;
    private static int combSize;
    static void setMod(int mod){
        MOD = mod;
    }
    static int mod(){
        return MOD;
    }
    static long pow(long p, long n){
        p %= MOD;
        long ret = 1;
        while(n > 0){
            if((n & 1) == 1) ret = ret * p % MOD;
            p = p * p % MOD;
            n >>= 1;
        }
        return ret;
    }
    static long factorial(int n){
        long ret = 1;
        for(int i = 2; i <= n; i++) ret = ret * i % MOD;
        return ret;
    }
    static long inverse(long a){
        long b = MOD, u = 1, v = 0;
        while(b > 0){
            long t = a / b;
            a -= t * b;
            long tmp1 = a; a = b; b = tmp1;
            u -= t * v;
            long tmp2 = u; u = v; v = tmp2;
        }
        u %= MOD;
        if(u < 0) u += MOD;
        return u;
    }
    static void initTable(int n){
        combSize = n+1;
        fac = new long[combSize];
        finv = new long[combSize];
        inv = new long[combSize];
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for(int i = 2; i < combSize; i++){
            fac[i] = fac[i-1] * i % MOD;
            inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
            finv[i] = finv[i-1] * inv[i] % MOD;
        }
    }
    static long comb(int n, int k){
        if(n < k) return 0;
        if(n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
    }
    static long perm(int n, int k){
        if(n < k) return 0;
        if(n < 0 || k < 0) return 0;
        return fac[n] * finv[n-k] % MOD;
    }
    static long homo(int n, int r){
        if(n < 0 || r < 0) return 0;
        return comb(n+r-1, r);
    }
}
public class Main {
    static final int INF = 1<<30;
    static final long INFL = 1L<<60;
    static final int MOD = 1000000007;
    static final int MOD2 = 998244353;
    static List<List<Integer>> g;
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        PrintWriter pw = new PrintWriter(System.out);
        // 1/2 + 1/2*2 + 1/2*4
        // 1/2(1 + 2 + 4 + ... + 2^(m-1) )
        // 1/2(2^m - 1)
        long n = fs.nextLong();
        long m = fs.nextLong();
        long ans = Mod.pow(2, m);
        ans = (ans - 1 + MOD) % MOD;
        ans = ans * Mod.inverse(2) % MOD;
        pw.println(ans);
        pw.close();
    }
}
class FastScanner {
    private InputStream in = System.in;
    private byte[] buffer = new byte[1024];
    private int length = 0, p = 0;
    private boolean hasNextByte() {
        if (p < length) return true;
        else{
            p = 0;
            try{
                length = in.read(buffer);
            }catch(Exception e){
                e.printStackTrace();
            }
            if(length == 0) return false;
        }
        return true;
    }
    private int readByte() {
        if (hasNextByte() == true) return buffer[p++];
        return -1;
    }
    private static boolean isPrintable(int n) {
        return 33 <= n && n <= 126;
    }
    private void skip() {
        while (hasNextByte() && !isPrintable(buffer[p])) p++;
    }
    public boolean hasNext() {
        skip();
        return hasNextByte();
    }
    public String next() {
        if(!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int temp = readByte();
        while (isPrintable(temp)) {
            sb.appendCodePoint(temp);
            temp = readByte();
        }
        return sb.toString();
    }
    public int nextInt() {
        return Math.toIntExact(nextLong());
    }
    public int[] nextInts(int n) {
        int[] ar = new int[n];
        for (int i = 0; i < n; i++) ar[i] = nextInt();
        return ar;
    }
    public long[] nextLongs(int n) {
        long[] ar = new long[n];
        for (int i = 0; i < n; i++) ar[i] = nextLong();
        return ar;
    }
    public long nextLong() {
        if(!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        int temp = readByte();
        if (temp == '-') {
            minus = true;
            temp = readByte();
        }
        if (temp < '0' || '9' < temp) throw new NumberFormatException();
        long n = 0;
        while (isPrintable(temp)) {
            if ('0' <= temp && temp <= '9') {
                n *= 10;
                n += temp - '0';
            }
            temp = readByte();
        }
        return minus ? -n : n;
    }
    public char[] nextChars() {
        String s = next();
        return s.toCharArray();
    }
    public char[][] nextCharMat(int h, int w) {
        char[][] ar = new char[h][w];
        for(int i = 0; i < h; i++){
            String s = next();
            for(int j = 0; j < w; j++){
                ar[i][j] = s.charAt(j);
            }
        }
        return ar;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0