Ideone.com

fork download

#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int N = 1e6;
vector<int> prime;
bool checkprime(ll n) {
    for (int i = 2; i <= sqrt(n); ++i) if (n % i == 0) return false;
    return true;
}
void TaoMangNguyenTo() {
    for (int i = 2; i <= sqrt(N); ++i) {
        if (checkprime(i)) {
            prime.push_back(i);
        }
    }
}
int cnt[1000001];
void PhanTich(int n) {
    TaoMangNguyenTo();
    // Sau khi co mang prime thi voi moi so ta phan tich ra thua so nguyen to
    for (int i = 2; i <= n; ++i) {
        int a = i, j = 0;
        while (a != 1 && j < prime.size()) {
            if (a % prime[j] == 0) {
                while (a % prime[j] == 0) {
                    a /= prime[j];
                }
                cnt[i]++;
            }
            ++j;
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    PhanTich(1000);
    for (int i = 2; i <= 1000; ++i) cout << i << " " << cnt[i] << endl;
 
    return 0;
}

Success #stdin #stdout 0.01s 5308KB

stdin

Standard input is empty

stdout

Discover > Sphere Engine API

Discover > IDE Widget

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language