結果

問題 No.737 PopCount
ユーザー ziitaziita
提出日時 2018-09-28 23:06:21
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,647 bytes
コンパイル時間 2,866 ms
コンパイル使用メモリ 89,712 KB
実行使用メモリ 45,916 KB
最終ジャッジ日時 2024-10-12 07:15:16
合計ジャッジ時間 5,044 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 98 ms
45,580 KB
testcase_01 AC 97 ms
45,520 KB
testcase_02 AC 100 ms
45,820 KB
testcase_03 AC 101 ms
45,772 KB
testcase_04 AC 101 ms
45,916 KB
testcase_05 AC 100 ms
45,712 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 101 ms
45,872 KB
testcase_11 AC 100 ms
45,772 KB
testcase_12 AC 102 ms
45,508 KB
testcase_13 AC 103 ms
45,484 KB
testcase_14 WA -
testcase_15 AC 102 ms
45,716 KB
testcase_16 AC 101 ms
45,816 KB
testcase_17 AC 101 ms
45,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    // static int mod = 1_000_000_007;
    long inf = Long.MAX_VALUE;

    void solve(){ 
        long n = nl();
        long t = n;
        ArrayList<Integer> list = new ArrayList<>();
        while(t>0){
            int p = 0;
            long r = t;
            while(true){
                if(r%2==0) p++;
                else break;
                r/=2;
            }
            list.add(p);
            t -= Math.pow(2,p);
        }
        int mod = 1_000_000_007;
        int[][] fif = enumFIF(1000000, mod);
        long[] inv = new long[100];
        inv[1] = 1;
        for(int i = 2; i < 100; i++) inv[i] = inv[mod%i] * (mod - mod/i) % mod;

        long ans = 0;
        int cum = 0;
        long base = 0;
        for(int i = list.size()-1; i >= 0; i--){
            int num = list.get(i);
            long sum = 0;
            for(int j = 0; j < num; j++){
                sum += Math.pow(2,j)%mod;
                sum %= mod;
            }
            for(int j = 1; j <= num; j++){
                long s = C(num, j, mod, fif)*j%mod*inv[num]%mod*sum%mod*(j+cum)%mod;
                ans += s%mod;
                ans %= mod;
                ans += C(num, j, mod, fif)*base%mod*(j+cum)%mod;
                ans %= mod;
            }
            long res = (long)Math.pow(2,num)%mod;
            base += res%mod;
            base %= mod;
            ans += base*(cum+1)%mod;
            ans %= mod;
            cum++;
        }
        out.println(ans%mod);

    }

    public static long C(int n, int r, int mod, int[][] fif) {
        if (n < 0 || r < 0 || r > n)
            return 0;
        return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
    }

    
    public static int[][] enumFIF(int n, int mod) {
        int[] f = new int[n + 1];
        int[] invf = new int[n + 1];
        f[0] = 1;
        for (int i = 1; i <= n; i++) {
            f[i] = (int) ((long) f[i - 1] * i % mod);
        }
        long a = f[n];
        long b = mod;
        long p = 1, q = 0;
        while (b > 0) {
            long c = a / b;
            long d;
            d = a;
            a = b;
            b = d % b;
            d = p;
            p = q;
            q = d - c * q;
        }
        invf[n] = (int) (p < 0 ? p + mod : p);
        for (int i = n - 1; i >= 0; i--) {
            invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
        }
        return new int[][] { f, invf };
    }

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0