QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#108458#3161. Another Coin Weighing Puzzlezaxwellmen#WA 142ms18980kbC++201.1kb2023-05-25 03:47:582023-05-25 03:48:02

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-25 03:48:02]
  • 评测
  • 测评结果:WA
  • 用时:142ms
  • 内存:18980kb
  • [2023-05-25 03:47:58]
  • 提交

answer

#include <vector>
#include <iostream>
#define MOD 998244353
#define MAXN 1000000
using namespace std;

int m, k;

long long dp[1000001];

long long mpowers[1000001];

int main(){
    cin >> m >> k;
    long long power2[21];
    dp[0] = 0;
    for(int i = 1; i <= 2 * MAXN + 1; i += 2){
        power2[0] = i;
        for(int i = 1; i < 21; i++){
            power2[i] = (power2[i - 1] * power2[i - 1]) % MOD;
        }
        int t = m;
        long long ans = 1;
        for(int j = 0; j < 21; j++){
            if(t % 2 == 1){
                ans *= power2[j];
            }
            t/=2;
        }
        mpowers[i/2] = ans;
        if(i > 1){
            dp[i/2] = (MOD + mpowers[i/2] - mpowers[i/2 - 1]) % MOD;
        }
    }
    for(int i = 1; i <= MAXN; i++){
        int j = 2;
        while(i * j <= MAXN){
            dp[i * j] += (MOD - dp[i]);
            dp[i * j] %= MOD;
            j++;
        }
    }
    long long ans = 0;
    for(int i = 1; i <= k; i++){
        ans += dp[i];
        ans %= MOD;
    }
    cout << ans + 1 << endl;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 136ms
memory: 18980kb

input:

2 1

output:

9

result:

ok single line: '9'

Test #2:

score: 0
Accepted
time: 131ms
memory: 18908kb

input:

2 2

output:

17

result:

ok single line: '17'

Test #3:

score: -100
Wrong Answer
time: 142ms
memory: 18960kb

input:

10000 10000

output:

937082346

result:

wrong answer 1st lines differ - expected: '689223145', found: '937082346'