QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#129242 | #6740. Function | Nicolas125841 | TL | 0ms | 0kb | C++17 | 555b | 2023-07-22 11:37:59 | 2023-07-22 11:38:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int N = 20210926;
const int SB = 32;
vector<ll> dp(N+1);
void prep(){
dp[1] = 1;
for(int i = 1; i <= N; i++){
for(int j = 2; j * i <= N; j++){
dp[i*j] += dp[i];
dp[i*j] %= mod;
}
}
}
int main(){
prep();
int n;
cin >> n;
ll ans = 0;
//for(int i = 1; i <= n; i++){
// ans += pref[i] - pref[i-1];
//}
cout << ans << "\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
1