# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474612 | egod1537 | 팔찌 (kriii4_V) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
typedef pair<ll, ll> pi;
#define var first
#define cnt second
ll pwk[2000001];
bitset<1000001> vit;
vector<ll> prime;
ll pow(ll x, ll cnt) {
if (cnt == 0) return 1;
ll mid = pow(x, cnt >> 1)%mod;
return (((mid * mid)%mod) * (cnt % 2 ? x : 1)) % mod;
}
ll revmod(ll x) { return pow(x, mod - 2) % mod; }
vector<pi> getfactor(ll num) {
vector<pi> ans;
for (int i = 0; num > 1 && prime[i]*prime[i] <= num && i < prime.size(); i++) {
ll now = prime[i];
pi p = pi(now, 0);