結果

問題 No.737 PopCount
ユーザー tutuztutuz
提出日時 2018-09-29 12:00:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 1,000 ms
コード長 3,330 bytes
コンパイル時間 2,332 ms
コンパイル使用メモリ 78,044 KB
実行使用メモリ 37,516 KB
最終ジャッジ日時 2024-10-12 08:13:04
合計ジャッジ時間 3,762 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,780 KB
testcase_01 AC 52 ms
36,816 KB
testcase_02 AC 52 ms
37,388 KB
testcase_03 AC 52 ms
37,100 KB
testcase_04 AC 53 ms
37,280 KB
testcase_05 AC 53 ms
37,516 KB
testcase_06 AC 52 ms
37,084 KB
testcase_07 AC 53 ms
37,160 KB
testcase_08 AC 52 ms
37,344 KB
testcase_09 AC 51 ms
37,196 KB
testcase_10 AC 53 ms
37,128 KB
testcase_11 AC 53 ms
37,280 KB
testcase_12 AC 51 ms
37,064 KB
testcase_13 AC 51 ms
37,280 KB
testcase_14 AC 53 ms
37,088 KB
testcase_15 AC 52 ms
37,388 KB
testcase_16 AC 53 ms
37,424 KB
testcase_17 AC 52 ms
37,116 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int INV = 500000004;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			long n = in.nextLong();

			long ans = 0;
			for (long k = 1; k <= n; k <<= 1) {
				long sum = sum(k, 1, k);
				long len = (n+1) / (2*k);
				ans += sum(sum, k % MOD * (2 * k % MOD) % MOD, len);
				ans %= MOD;
				long to = (n+1) % (2*k) - k;
				if (to > 0) {
					long from = (n+1) / (2*k) * (2*k) + k;
					ans += sum(from, 1, to);
					ans %= MOD;
				}
			}

			out.println(ans);

		}

		long sum(long a, long d, long n) {
			a %= MOD;
			d %= MOD;
			n %= MOD;
			return n * (2 * a % MOD + (n + MOD - 1) % MOD * d % MOD) % MOD * INV % MOD;
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		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;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0