# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474577 | egod1537 | 팔찌 (kriii4_V) | C++14 | 1094 ms | 16076 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.
#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];
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 (ll i = 2; i * i <= num; i++) {
pi p = pi(i, 0);
while (num % i == 0) {
p.cnt++;
num /= i;
}
if (p.cnt > 0) ans.push_back(p);
}
if (num > 1) ans.push_back(pi(num, 1));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |