Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define scl(n) scanf("%lld", &n)
- #define pcl(n) printf("%lld\n", n)
- #define pcl1(n) printf("%lld ", n)
- #define nln printf("\n")
- #define yes printf("YES\n")
- #define no printf("NO\n")
- #define dev(x) cout << #x << " " << x << " ";
- #define PTT pair<ll, ll>
- map<ll, ll> primeFactorMap, mp1;
- map<ll, ll>::iterator itr;
- #define M 1000000
- bool marked[M];
- vector<ll> primeVector;
- bool isPrime(int n)
- {
- if (n < 2)
- return false;
- if (n == 2)
- return true;
- if (n % 2 == 0)
- return false;
- return marked[n] == false;
- }
- void sieve()
- {
- primeVector.push_back(2);
- for (ll i = 3; i * i <= M; i += 2)
- {
- if (marked[i] == false)
- { // i is a prime
- primeVector.push_back(i);
- for (ll j = i * i; j <= M; j += i + i)
- {
- marked[j] = true;
- }
- }
- }
- }
- int main()
- {
- sieve();
- ll n;
- scl(n);
- for (int i = 0; primeVector[i] <= n; i++)
- {
- while (n % primeVector[i] == 0)
- {
- primeFactorMap[primeVector[i]]++;
- n /= primeVector[i];
- }
- }
- for (itr = primeFactorMap.begin(); itr != primeFactorMap.end(); itr++)
- {
- cout << itr->first << " " << itr->second << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
