QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#129206#6740. FunctionNicolas125841TL 0ms0kbC++17779b2023-07-22 06:28:562023-07-22 06:29:00

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-22 06:29:00]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2023-07-22 06:28:56]
  • 提交

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);
vector<int> lp(N+1), pr;

void prep(){
    for (int i=2; i <= N; ++i) {
        if (lp[i] == 0) {
            lp[i] = i;
            pr.push_back(i);
        }  

        for(int j = 1; j * j <= i; j++)
            dp[i]++;

        for (int j = 0; i * pr[j] <= N; ++j) {
            lp[i * pr[j]] = pr[j];
            if (pr[j] == lp[i]) {
                break;
            }
        }
    }
}

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

詳細信息

Test #1:

score: 0
Time Limit Exceeded

input:

1

output:


result: