結果

問題 No.737 PopCount
コンテスト
ユーザー tutuz
提出日時 2018-09-29 11:18:20
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,650 bytes
コンパイル時間 2,350 ms
コンパイル使用メモリ 78,060 KB
実行使用メモリ 52,452 KB
最終ジャッジ日時 2024-10-12 08:11:19
合計ジャッジ時間 4,048 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 7 WA * 8
権限があれば一括ダウンロードができます

ソースコード

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();
			int c = log(n);

			long ans = 0;
			for (long k = 0; k < c; k++) {
				long keta = 0;
				long sum  = sum(1L << k, 1, 1L << k);
				long c1 = f(k, n);

				keta += sum(sum, 1L << (2*k+1), c1) % MOD;

				long max = (1L << (k+1)) * c1 - 1;
				long c2 = g(k, n);
				long min = (1L << (k+1)) * c2 - (1L << k);

				if (max < min) {
					keta += sum(min, 1, n-min+1) % MOD;
				}

				ans += keta;
				ans %= MOD;
			}

			out.println(ans % MOD);

		}
	}

	static long g(long k, long n) {
		return (n + (1L << k)) / ((1L << (k+1)));
	}

	static long f(long k, long n) {
		return (n + 1) / ((1L << (k+1)));
	}

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

	static int log(long n) {
		int cnt = 0;
		while (n > 0) {
			n /= 2;
			cnt++;
		}
		return cnt;
	}

	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