/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 23ms 4.375 MiB
#2 Accepted 23ms 4.379 MiB
#3 Accepted 24ms 4.375 MiB
#4 Accepted 45ms 4.375 MiB
#5 Accepted 38ms 5.652 MiB
#6 Accepted 30ms 4.375 MiB
#7 Accepted 36ms 4.762 MiB
#8 Accepted 32ms 4.387 MiB
#9 Accepted 38ms 4.66 MiB
#10 Accepted 31ms 4.379 MiB
#11 Accepted 66ms 4.383 MiB

Code

#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e6+2,mod = 1e9+7;

int spf[N],cnt[N];
void solve() {
    for(int i = 2; i < N; i++)
        spf[i] = i;
    for(int i = 2; i < N; i++) {
        if(spf[i] == i) {
            for(int j = 2*i; j < N; j += i) {
                if(spf[j] == j) spf[j] = i;
            }
        }
    }
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) {
        int x;
        cin >> x;
        while(x > 1) {
            cnt[spf[x]]++;
            x /= spf[x];
        }
    }
    ll ans = 1;
    for(int i = 2; i < N; i++) {
        ans *= 1ll * (cnt[i]+1);
        ans %= mod;
    }
    cout << ans << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1060 Divisor
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 12:28:11
Judged At
2024-11-11 03:19:33
Judged By
Score
100
Total Time
66ms
Peak Memory
5.652 MiB