problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02660 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
using LL = int64_t;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using PLL = pair<LL, LL>;
// container util
//--------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
using LL = int64_t;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using PLL = pair<LL, LL>;
// container util
//--------------------... | replace | 138 | 139 | 138 | 139 | TLE | |
p02660 | C++ | Time Limit Exceeded | #define __mode_debug__
/* ξ
ll
＿ll＿
／ ∞ ＼
│* Ａ *│
│* Ｃ *│
│* 祈 *│
│* 願 *│
│* *│
￣￣￣￣￣ */
// C++14 (GCC 5.4.1)
#include <bits/stdc++.h>
using namespace std;
#ifdef __mode_debug__
#define DBG
#else
#define DBG if (false)
#endif
#define LLINF (1LL << 60)
using ll = long long;
#define mod 100... | #define __mode_debug__
/* ξ
ll
＿ll＿
／ ∞ ＼
│* Ａ *│
│* Ｃ *│
│* 祈 *│
│* 願 *│
│* *│
￣￣￣￣￣ */
// C++14 (GCC 5.4.1)
#include <bits/stdc++.h>
using namespace std;
#ifdef __mode_debug__
#define DBG
#else
#define DBG if (false)
#endif
#define LLINF (1LL << 60)
using ll = long long;
#define mod 100... | replace | 132 | 133 | 132 | 133 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> prime(ll n) {
vector<pair<ll, ll>> mp;
for (int i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
ll ex = 0;
while (n % i == 0) {
++ex;
n /= i;
}
mp.push_back(make_pair(i, ex));
}
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> prime(ll n) {
vector<pair<ll, ll>> mp;
for (ll i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
ll ex = 0;
while (n % i == 0) {
++ex;
n /= i;
}
mp.push_back(make_pair(i, ex));
}
if... | replace | 6 | 7 | 6 | 7 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
int ans, p;
int main() {
cin >> n;
for (int i = 2; i * i <= n; ++i) {
p = i;
while (n % p == 0) {
n /= p;
ans++;
p *= i;
}
while (n % i == 0) {
n /= i;
}
}
if (n != 1) {
ans++;
}
cout... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
int ans, p;
int main() {
cin >> n;
for (ll i = 2; i * i <= n; ++i) {
p = i;
while (n % p == 0) {
n /= p;
ans++;
p *= i;
}
while (n % i == 0) {
n /= i;
}
}
if (n != 1) {
ans++;
}
cout ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> pf(long long N) {
vector<pair<long long, long long>> v;
for (int i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
long long counter = 0;
while (N % i == 0) {
counter++;
N /= i;
}
v.push_back(ma... | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> pf(long long N) {
vector<pair<long long, long long>> v;
for (long long i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
long long counter = 0;
while (N % i == 0) {
counter++;
N /= i;
}
v.push_b... | replace | 5 | 6 | 5 | 6 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | replace | 24 | 25 | 24 | 25 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define repr(i, n, m) for (int i = (int)(n)-1; i >= (int)(m); i--)
using namespace std;
using ll = int64_t;
const int MOD = 1000000007; // 10^9+7
int main() {
ll n;
cin >> n;
vector<ll> p(1000010, 0);
for (int i = 2; i * i ... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define repr(i, n, m) for (int i = (int)(n)-1; i >= (int)(m); i--)
using namespace std;
using ll = int64_t;
const int MOD = 1000000007; // 10^9+7
int main() {
ll n;
cin >> n;
vector<int> p(1000010, 0);
for (ll i = 2; i * i ... | replace | 10 | 12 | 10 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int ll;
ll lim[1009];
int main() {
ll n;
cin >> n;
ll cnt = 0, ans = 0;
for (int i = 1; i <= 1000; i++)
lim[i] = (i * (i + 1)) / 2;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt = 0;
while (n % i == ... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long int ll;
ll lim[1009];
int main() {
ll n;
cin >> n;
ll cnt = 0, ans = 0;
for (int i = 1; i <= 1000; i++)
lim[i] = (i * (i + 1)) / 2;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt = 0;
while (n % i == 0... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | replace | 63 | 64 | 63 | 64 | TLE | |
p02660 | C++ | Time Limit Exceeded | // Created by Nandu Vinodan
#include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z <<... | // Created by Nandu Vinodan
#include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z <<... | replace | 79 | 80 | 79 | 80 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
long long rt = sqrt(n) + 1;
vector<bool> is_prime(n + 1, 1);
for (long long p = 2; p <= n; p++) {
if (!is_prime[p])
continue;
for (long long k = 2 * p; k <= rt; k += p)
is_prime[k] = false;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
long long rt = sqrt(n) + 1;
vector<bool> is_prime(rt + 1, 1);
for (long long p = 2; p <= n; p++) {
if (!is_prime[p])
continue;
for (long long k = 2 * p; k <= rt; k += p)
is_prime[k] = false;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | replace | 90 | 91 | 90 | 91 | TLE | |
p02660 | Python | Time Limit Exceeded | from itertools import accumulate
from collections import defaultdict
def main():
n = int(input())
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(range(1, 42))) # because 10^12 < 2^39
def facs(n):
yield 2
for x in range(3, int(n**0.5) + 1, 2):
yield... | from itertools import accumulate
from collections import defaultdict
def main():
n = int(input())
prime_counter = defaultdict(int) # key ^ value
acc = tuple(accumulate(range(1, 42))) # because 10^12 < 2^39
def facs(n):
yield 2
for x in range(3, int(n**0.5) + 1, 2):
yield... | delete | 13 | 14 | 13 | 13 | TLE | |
p02660 | Python | Runtime Error | import math
# 素数の判定
def is_prime(n):
if n == 1:
return 0
for k in range(2, int(math.sqrt(n)) + 1):
chk = False
while n % k == 0:
chk = True
n /= k
if k not in check:
check[k] = 1
else:
check[k] += 1
... | import math
# 素数の判定
def is_prime(n):
if n == 1:
return 0
for k in range(2, int(math.sqrt(n)) + 1):
chk = False
while n % k == 0:
chk = True
n /= k
if k not in check:
check[k] = 1
else:
check[k] += 1
... | replace | 43 | 45 | 43 | 45 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll ans = 0;
ll NN = N;
for (int p = 2;; p++) {
ll cnt = 1;
while (N % p == 0) {
// cout << p << endl;
bool f = false;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll ans = 0;
ll NN = N;
for (ll p = 2;; p++) {
ll cnt = 1;
while (N % p == 0) {
// cout << p << endl;
bool f = false;
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pf pu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pf pu... | delete | 68 | 69 | 68 | 68 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/// first: primo second: exponente
vector<pair<ll, ll>> Canon;
int Gau[50];
void Prec() {
int i;
for (i = 1; i < 50; i++) {
Gau[i] = Gau[i - 1] + i;
}
return;
}
int main() {
ll N, Aux;
cin >> N;
int i, j;
Aux = N;
if (A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/// first: primo second: exponente
vector<pair<ll, ll>> Canon;
int Gau[50];
void Prec() {
int i;
for (i = 1; i < 50; i++) {
Gau[i] = Gau[i - 1] + i;
}
return;
}
int main() {
ll N, Aux;
cin >> N;
ll i, j;
Aux = N;
if (Au... | replace | 23 | 24 | 23 | 24 | TLE | |
p02660 | C++ | Time Limit Exceeded | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cer... | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cer... | replace | 69 | 70 | 69 | 70 | TLE | |
p02660 | C++ | Time Limit Exceeded | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#incl... | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#incl... | replace | 67 | 78 | 67 | 78 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | replace | 16 | 17 | 16 | 17 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
#d... | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
#d... | replace | 74 | 75 | 74 | 75 | TLE | |
p02660 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#in... | replace | 118 | 119 | 118 | 119 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, cnt = 0;
cin >> n;
map<long, int> v;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
v[i]++;
n /= i;
}
}
if (n != 1)
v[n] = 1;
for (auto i : v) {
int k = 1, d = i.second;
while (0 <= d - k) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, cnt = 0;
cin >> n;
map<long, int> v;
for (long i = 2; i * i <= n; i++) {
while (n % i == 0) {
v[i]++;
n /= i;
}
}
if (n != 1)
v[n] = 1;
for (auto i : v) {
int k = 1, d = i.second;
while (0 <= d - k) {
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long freq[1000005];
vector<long long> sums;
int main() {
long long N;
scanf("%lld", &N);
if (N == 1) {
printf("0");
return 0;
}
long long tempN = N, i = 2;
while (i * i <= tempN) {
if (N % i == 0) {
N /= i;
freq[i]++;
}
... | #include <bits/stdc++.h>
using namespace std;
long long freq[1000005];
vector<long long> sums;
int main() {
long long N;
scanf("%lld", &N);
if (N == 1) {
printf("0");
return 0;
}
long long tempN = N, i = 2;
while (i * i <= tempN) {
if (N % i == 0) {
N /= i;
freq[i]++;
}
... | replace | 33 | 34 | 33 | 34 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<pair<long long, int>> A;
for (int i = 2; i * i < N; i++) {
int x = 0;
while (N % i == 0) {
N /= i;
x++;
}
A.emplace_back(i, x);
}
if (N != 1)
A.emplace_back(N, 1);
int count = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<pair<long long, int>> A;
for (long long i = 2; i * i < N; i++) {
int x = 0;
while (N % i == 0) {
N /= i;
x++;
}
A.emplace_back(i, x);
}
if (N != 1)
A.emplace_back(N, 1);
int count = ... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Runtime Error | /*** akshaykumar99 ***/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using id_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define f(i, x, n) for (i = x; i < n; i++)
#define fr(i, x,... | /*** akshaykumar99 ***/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using id_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define f(i, x, n) for (i = x; i < n; i++)
#define fr(i, x,... | insert | 41 | 41 | 41 | 42 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int z;
int a = 0;
for (int i = 2; i * i <= n; ++i) {
int c = 0;
while (n % i == 0) {
n /= i;
c++;
}
for (int j = 1; c > 0; ++j, c -= j) {
a++;
}
}
if (n != 1)
a++;
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int z;
int a = 0;
for (long long i = 2; i * i <= n; ++i) {
int c = 0;
while (n % i == 0) {
n /= i;
c++;
}
for (int j = 1; c > 0; ++j, c -= j) {
a++;
}
}
if (n != 1)
a++;
cout << a;... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | replace | 106 | 111 | 106 | 112 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<int, int>> v;
if (n % 2 == 0) {
int c = 0;
while (n % 2 == 0) {
n /= 2;
c++;
}
v.push_back(make_pair(2,... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<int, int>> v;
if (n % 2 == 0) {
int c = 0;
while (n % 2 == 0) {
n /= 2;
c++;
}
v.push_back(make_pair(2,... | replace | 22 | 23 | 22 | 23 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
ll n;
int ans = 0;
cin >> n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
ll n;
int ans = 0;
cin >> n;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
for (int i = 2; i * i <= n; ++i) {
int e = 0, z = 0;
while (n % i == 0) {
++e;
if (e > z) {
++ans;
z = e;
e = 0;
}
n /= i;
}
}
if (n != 1)
++... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
for (long long i = 2; i * i <= n; ++i) {
long long e = 0, z = 0;
while (n % i == 0) {
++e;
if (e > z) {
++ans;
z = e;
e = 0;
}
n /= i;
}
}
if (n ... | replace | 7 | 9 | 7 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded | // 'By Anki'
#include <bits/stdc++.h>
// #include<iostream>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define wr(i) cou... | // 'By Anki'
#include <bits/stdc++.h>
// #include<iostream>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define wr(i) cou... | replace | 62 | 63 | 62 | 63 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a;
int64_t c = 0;
int64_t z = 0;
int64_t h = 0;
vector<int64_t> vec;
vector<int64_t> ans;
cin >> a;
if (a == 1) {
h = 0;
}
if (a != 1) {
while (a >= 2) {
if (a == 2) {
vec.push_back(2);
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a;
int64_t c = 0;
int64_t z = 0;
int64_t h = 0;
vector<int64_t> vec;
vector<int64_t> ans;
cin >> a;
if (a == 1) {
h = 0;
}
if (a != 1) {
while (a >= 2) {
if (a == 2) {
vec.push_back(2);
break;
}
... | insert | 22 | 22 | 22 | 23 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define vi vector<ll>
#define ss second
#define ff first
#define pii pair<int, int>
#define mii map<int, int>
#define mod 1000000007
#define w(x) \
int x; ... | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define vi vector<ll>
#define ss second
#define ff first
#define pii pair<int, int>
#define mii map<int, int>
#define mod 1000000007
#define w(x) \
int x; ... | replace | 174 | 190 | 174 | 200 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const string EMP = " ";
const ll INF = 1LL << 60;
const ll MOD = 10000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const string EMP = " ";
const ll INF = 1LL << 60;
const ll MOD = 10000000... | replace | 16 | 17 | 16 | 17 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const ll INF = 1LL << 60;
int main() {
ll n;
cin >> n;
ll ans = 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const ll INF = 1LL << 60;
int main() {
ll n;
cin >> n;
ll ans = 0;... | replace | 14 | 15 | 14 | 15 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
map<ll, ll> factorization(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
map<ll, ll> factorization(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
int ... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
ll ans = 0;
cin >> N;
for (int i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll z = i;
while (N % z == 0) {
N /= z;
z *= i;
ans++;
}
while (N % i == 0) {
N /= i;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
ll ans = 0;
cin >> N;
for (ll i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll z = i;
while (N % z == 0) {
N /= z;
z *= i;
ans++;
}
while (N % i == 0) {
N /= i;
}
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9) + 7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9) + 7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};... | replace | 50 | 51 | 50 | 51 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
unordered_map<int, int> factor;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
factor[i] += 1;
n /= i;
}
}
if (n != 1)
factor[n] += 1;
int ans = 0;
for (auto x : factor) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<int, int> factor;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
factor[i] += 1;
n /= i;
}
}
if (n != 1)
factor[n] += 1;
int ans = 0;
for (auto x : factor) {
for (int... | replace | 7 | 9 | 7 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded |
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
size_t i = 2;
int64_t R = 0;
while (i <= N) {
int64_t c = 0;
while (N % i == 0) {
N /= i;
++c;
}
if (c != 0) {
size_t t = 1;
size_t j = 1;
while (t <= c) {
+... |
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
size_t i = 2;
int64_t R = 0;
while (i <= N) {
int64_t c = 0;
while (N % i == 0) {
N /= i;
++c;
}
if (c != 0) {
size_t t = 1;
size_t j = 1;
while (t <= c) {
+... | insert | 25 | 25 | 25 | 30 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#defi... | replace | 28 | 29 | 28 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, ans = 0;
cin >> n;
for (int i = 2; i * i <= n; i++) {
int x = i;
while (n % x == 0) {
n /= x;
x *= i;
ans++;
}
while (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 2; i * i <= n; i++) {
ll x = i;
while (n % x == 0) {
n /= x;
x *= i;
ans++;
}
while (n ... | replace | 9 | 11 | 9 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 1000000000000 // 10^12
#define F first
#define S second
#define P pair<int, int>
#define all(vec) vec.begin()... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 1000000000000 // 10^12
#define F first
#define S second
#define P pair<int, int>
#define all(vec) vec.begin()... | replace | 28 | 29 | 28 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
map<int, int> mp;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0)
cnt++, n /= i;
mp[i] = cnt;
}
}
if (n > 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
map<long long, int> mp;
for (long long i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0)
cnt++, n /= i;
mp[i] = cnt;
}
}... | replace | 10 | 12 | 10 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
int tmp = 0;
vector<int> a;
for (int i = 2; i <= n; i++) {
if (n < i * i) {
ans++;
break;
}
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
int tmp = 0;
vector<int> a;
for (long long i = 2; i <= n; i++) {
if (n < i * i) {
ans++;
break;
}
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n ... | replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
template <class T> static inline std::vector<T> ndvec(size_t &&n, T val) {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail> static... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
template <class T> static inline std::vector<T> ndvec(size_t &&n, T val) {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail> static... | replace | 32 | 33 | 32 | 33 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, s, f) for (i = s; i < f; i++)
#define print(v) \
for (auto &z : v) \
cout << z << ' '; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, s, f) for (i = s; i < f; i++)
#define print(v) \
for (auto &z : v) \
cout << z << ' '; ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#define inp(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i]
#define fr(i, a, b) for (int ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#define inp(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i]
#define fr(i, a, b) for (int ... | insert | 16 | 16 | 16 | 20 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define st first
#define nd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO() {
ios::sync_with_stdio(0);
cin.tie(0);
c... | #include <bits/stdc++.h>
#define st first
#define nd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO() {
ios::sync_with_stdio(0);
cin.tie(0);
c... | replace | 28 | 29 | 28 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<pair<int64_t, int>> table;
int y = 0;
while (N % 2 == 0) {
N /= 2;
y++;
if (N % 2 != 0) {
table.emplace_back(2, y);
}
}
int i = 3;
while (i * i < N) {
int x = 0;
while (N % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<pair<int64_t, int>> table;
int y = 0;
while (N % 2 == 0) {
N /= 2;
y++;
if (N % 2 != 0) {
table.emplace_back(2, y);
}
}
int64_t i = 3;
while (i * i < N) {
int x = 0;
while (N % i == 0)... | replace | 17 | 18 | 17 | 18 | TLE | |
p02660 | C++ | Runtime Error | /**
* author: Dooloper
* created: 06.06.2020 00:59:13
**/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef u... | /**
* author: Dooloper
* created: 06.06.2020 00:59:13
**/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef u... | replace | 38 | 40 | 38 | 40 | -8 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
long N;
cin >> N;
if (N == 1)
cout << 0 << endl;
else {
long num = N;
int res = 0;
for (int i = 2; i * i <= N; i++) {
int cnt = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
long N;
cin >> N;
if (N == 1)
cout << 0 << endl;
else {
long num = N;
int res = 0;
for (long i = 2; i * i <= N; i++) {
int cnt = 0;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | replace | 25 | 26 | 25 | 26 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Ar... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Ar... | replace | 54 | 55 | 54 | 55 | TLE | |
p02660 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
/*int N;
cin>>N;
long long A[100000];
long long answer=1;
for(int i=0;i<N;i++){
cin>>A[i];
if(A[i]==0) answer=0;
}
if(answer==0) cout<<answer<<endl;
else{
for(int i=0;i<N;i++){
an... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
/*int N;
cin>>N;
long long A[100000];
long long answer=1;
for(int i=0;i<N;i++){
cin>>A[i];
if(A[i]==0) answer=0;
}
if(answer==0) cout<<answer<<endl;
else{
for(int i=0;i<N;i++){
an... | replace | 32 | 33 | 32 | 33 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
// 素因数分解
ll limit = n;
map<ll, int> mp;
for (int i = 2; i * i < n; i++) {
ll x = 0;
// 割り切れるなら
while (n % i == 0) {
n /= i;
x++;
}
mp[i] = x;
}
if (n != 1) {
mp[n]++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
// 素因数分解
ll limit = n;
map<ll, int> mp;
for (ll i = 2; i * i < n; i++) {
ll x = 0;
// 割り切れるなら
while (n % i == 0) {
n /= i;
x++;
}
mp[i] = x;
}
if (n != 1) {
mp[n]++;
}... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | replace | 182 | 183 | 182 | 183 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define x first
#define y second
#define pb push_back
#define all(x) x.begin(), x.end()
#define inputSpeed() ios_base::sync_with_stdio(0), cin.tie(0)
#define MAXN (ll)(1e6 + 10)
// only one prime factor will be larger than ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define x first
#define y second
#define pb push_back
#define all(x) x.begin(), x.end()
#define inputSpeed() ios_base::sync_with_stdio(0), cin.tie(0)
#define MAXN (ll)(1e6 + 10)
// only one prime factor will be larger than ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <class T> inline void read(T &res) {
char c;
T flag = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-')
flag = -1;
res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
res *= flag... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <class T> inline void read(T &res) {
char c;
T flag = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-')
flag = -1;
res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
res *= flag... | replace | 35 | 36 | 35 | 36 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
vector<pair<long long, long long>> pre(long long n) {
vector<pair<long long, long long>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
int num = 0;
while (n % i == 0) {
num++;
n /= i;
}
res.push_back... | #include <iostream>
#include <vector>
using namespace std;
vector<pair<long long, long long>> pre(long long n) {
vector<pair<long long, long long>> res;
for (long long i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
int num = 0;
while (n % i == 0) {
num++;
n /= i;
}
res.pus... | replace | 5 | 6 | 5 | 6 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
// 素因数分解する
vector<pair<ll, int>> f;
for (int i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
// 素因数分解する
vector<pair<ll, int>> f;
for (ll i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int ret(int n) {
int i = sqrt(n);
while (i * (i + 1) <= 2 * n)
i++;
if (i * (i + 1) > 2 * n)
i--;
return i;
}
int main() {
long long n;
cin >> n;
int ans = 0;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int cnt = 0;
while (n ... | #include <bits/stdc++.h>
using namespace std;
int ret(int n) {
int i = sqrt(n);
while (i * (i + 1) <= 2 * n)
i++;
if (i * (i + 1) > 2 * n)
i--;
return i;
}
int main() {
long long n;
cin >> n;
int ans = 0;
for (long long i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int cnt = 0;
whi... | replace | 14 | 15 | 14 | 15 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int maxn = 1e6 + 100;
int prime[maxn]; // 就是个素数表
bool sf[maxn]; // 判断这个数是不是素数，sf[i]中的i是从1到maxn的数
void init() { // 核心 欧拉筛代码
int num = 0; // num 用来记筛到第几个质数
memset(sf, true, sizeof(sf));
for (int i = 2; i <= maxn; i++) { // 外层枚举1~maxn
i... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int maxn = 1e6 + 100;
int prime[maxn]; // 就是个素数表
bool sf[maxn]; // 判断这个数是不是素数，sf[i]中的i是从1到maxn的数
void init() { // 核心 欧拉筛代码
int num = 0; // num 用来记筛到第几个质数
memset(sf, true, sizeof(sf));
for (int i = 2; i <= maxn; i++) { // 外层枚举1~maxn
i... | replace | 31 | 32 | 31 | 32 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void solve(long long N) {
vector<pair<ll, ll>> res;
for (int i = 2; i * i < N; i++) {
ll b = 0;
while (N % i == 0) {
N /= i;
b++;
}
res.emplace_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void solve(long long N) {
vector<pair<ll, ll>> res;
for (ll i = 2; i <= N / i; i++) {
ll b = 0;
while (N % i == 0) {
N /= i;
b++;
}
res.emplace_... | replace | 9 | 10 | 9 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n;
int solve(int x) {
int s = 0, i = 0;
while (s <= x) {
i++;
s += i;
}
return i - 1;
}
void process() {
int kq = 0;
int dem = 0;
while (n % 2 == 0) {
dem++;
n /= 2;
}
kq += solve(dem);
for (int i = 3; i * i <= n; i += 2) {
... | #include <bits/stdc++.h>
using namespace std;
long long n;
int solve(int x) {
int s = 0, i = 0;
while (s <= x) {
i++;
s += i;
}
return i - 1;
}
void process() {
int kq = 0;
int dem = 0;
while (n % 2 == 0) {
dem++;
n /= 2;
}
kq += solve(dem);
for (long long i = 3; i * i <= n; i +=... | replace | 23 | 24 | 23 | 24 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
i... | replace | 88 | 89 | 88 | 89 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | replace | 73 | 74 | 73 | 74 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll n;
cin >> n;
vector<pair<ll, int>> fs;
for (int i = 2; i * i <= n; i++) {
int kosuu = 0;
while (n % i == 0) {
n ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll n;
cin >> n;
vector<pair<ll, int>> fs;
for (ll i = 2; i * i <= n; i++) {
int kosuu = 0;
while (n % i == 0) {
n /... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define MP make_pair
#define PB push_back
#define X first
#define Y second
typedef long long int lld;
typedef pair<int, int> pii;
typedef pair<lld, lld> pll;
bool isPrime(lld k) {
if (k == 1)
r... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define MP make_pair
#define PB push_back
#define X first
#define Y second
typedef long long int lld;
typedef pair<int, int> pii;
typedef pair<lld, lld> pll;
bool isPrime(lld k) {
if (k == 1)
r... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
ll cut = 1;
while (cut <= cnt) {
ans++;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
ll cut = 1;
while (cut <= cnt) {
ans++;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | replace | 42 | 43 | 42 | 50 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<int> prm(1);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) {
prm.back()++;
n /= i;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<int> prm(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) {
prm.back()++;
n /= i;
}
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
long long _n = n;
for (int i = 2; i * i <= _n; i++)
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
// cout << i << ' ' << cnt << endl;
for (int j = ... | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int ans = 0;
long long _n = n;
for (int i = 2; (long long)i * i <= _n; i++)
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
// cout << i << ' ' << cnt << endl;
fo... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int prime_factrization(ll n) {
vector<int> prime_num(int(sqrt(n)) + 1);
int ans = 0;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
prime_num[i]++;
n /= i;
}
int num = 1;
while (prime_num[i] >= num) {
p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int prime_factrization(ll n) {
vector<int> prime_num(int(sqrt(n)) + 1);
int ans = 0;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
prime_num[i]++;
n /= i;
}
int num = 1;
while (prime_num[i] >= num) {
pr... | replace | 7 | 8 | 7 | 8 | 0 | |
p02660 | C++ | Runtime Error | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef unsigned long LInt;
typedef long double ld;
#define inf 1e18
constexpr long long INFLL = 1e18;
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inlin... | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef unsigned long LInt;
typedef long double ld;
#define inf 1e18
constexpr long long INFLL = 1e18;
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inlin... | replace | 35 | 36 | 35 | 36 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int> pf;
for (int i = 2; i * i <= n; ++i) {
if (n % i)
continue;
int cnt = 0;
while (n % i == 0) {
++cnt;
n /= i;
}
pf.push_back(cnt);
}
if (n != 1) ... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int> pf;
for (int64_t i = 2; i * i <= n; ++i) {
if (n % i)
continue;
int cnt = 0;
while (n % i == 0) {
++cnt;
n /= i;
}
pf.push_back(cnt);
}
if (n !=... | replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
... | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
... | replace | 140 | 141 | 140 | 141 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | replace | 43 | 44 | 43 | 44 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | replace | 216 | 217 | 216 | 217 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define pri(str) cout << str << endl
using ll = long long;
using P = pair<int, int>;
const ll MX = 1e18;
const long double PI = acos(-1);
vector<pair<ll, int>> divisor(ll n) {
vector<pair<ll, int>> ret;
for (ll i = 1; i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define pri(str) cout << str << endl
using ll = long long;
using P = pair<int, int>;
const ll MX = 1e18;
const long double PI = acos(-1);
vector<pair<ll, int>> divisor(ll n) {
vector<pair<ll, int>> ret;
for (ll i = 2; i ... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int k = 2;
int s = 0;
while (k * k <= n) {
if (n % k == 0) {
int x = 0;
while (n % k == 0) {
x += 1;
n = n / k;
}
int i = 1;
while (x >= (i + 2) * (i + 1) / 2)
i += 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k = 2;
int s = 0;
while (k * k <= n) {
if (n % k == 0) {
int x = 0;
while (n % k == 0) {
x += 1;
n = n / k;
}
int i = 1;
while (x >= (i + 2) * (i + 1) / 2)
i +... | replace | 6 | 7 | 6 | 7 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long A;
int res = 0, ans[1000004];
int main() {
cin >> A;
ans[1] = 1;
for (int i = 1; i <= 1e6; i++) {
ans[i] = max(ans[i], ans[i - 1]);
if (i + ans[i] + 1 <= 1e6)
ans[i + ans[i] + 1] = ans[i] + 1;
}
for (int i = 2; i * i <= A; i++) {
int cn... | #include <bits/stdc++.h>
using namespace std;
long long A;
int res = 0, ans[1000004];
int main() {
cin >> A;
ans[1] = 1;
for (int i = 1; i <= 1e6; i++) {
ans[i] = max(ans[i], ans[i - 1]);
if (i + ans[i] + 1 <= 1e6)
ans[i + ans[i] + 1] = ans[i] + 1;
}
for (int i = 2; 1ll * i * i <= A; i++) {
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<pair<ll, int>> fs;
for (int i = 2; i * i <= n; i++) {
int x = 0;
while (n % i == 0) {
n /= i;
x++;
}
if (x != 0)
fs.emplace_back(i, x);
}
if (n != 1)
fs.emplace_back... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<pair<ll, int>> fs;
for (ll i = 2; i * i <= n; i++) {
int x = 0;
while (n % i == 0) {
n /= i;
x++;
}
if (x != 0)
fs.emplace_back(i, x);
}
if (n != 1)
fs.emplace_back(... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const ll N = 1e9, MOD = 998244353;
void solve() {
ll n;
cin >> n;
if (n == 1) {
cout << 0;
return;
}
int ans = 0;
for (int i = 2; i * i <= n; ++i) {
int count = 0;
while (n % ... | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const ll N = 1e9, MOD = 998244353;
void solve() {
ll n;
cin >> n;
if (n == 1) {
cout << 0;
return;
}
int ans = 0;
for (ll i = 2; i * i <= n; ++i) {
int count = 0;
while (n % i... | replace | 16 | 17 | 16 | 17 | TLE | |
p02660 | C++ | Time Limit Exceeded | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>... | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>... | replace | 58 | 59 | 58 | 59 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rep(i, j) FOR(i, 0, j, 1)
#define rrep(i, j) RFOR(i, j, 0, 1)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#def... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rep(i, j) FOR(i, 0, j, 1)
#define rrep(i, j) RFOR(i, j, 0, 1)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#def... | replace | 21 | 22 | 21 | 22 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, l... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, l... | replace | 25 | 26 | 25 | 26 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
typedef long long ll;
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const ll MXN = 1e18;
map<ll, int> mp;
void factor(ll n) {
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
whi... | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
typedef long long ll;
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const ll MXN = 1e18;
map<ll, int> mp;
void factor(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
whil... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
void solve_test() {
LL n;
cin >> n;
int ops = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
int j = 1;
while (cnt >= j) {
... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
void solve_test() {
LL n;
cin >> n;
int ops = 0;
for (LL i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
int j = 1;
while (cnt >= j) {
c... | replace | 9 | 10 | 9 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
map<ll, int> factor(ll n) {
map<ll, int> f;
for (int i = 2; i * i < n; i++) {
int x = 0;
while (n % i == 0)
n /= i, x++;
if (x != 0)
f[i] = x;
}
... | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
map<ll, int> factor(ll n) {
map<ll, int> f;
for (ll i = 2; i * i < n; i++) {
int x = 0;
while (n % i == 0)
n /= i, x++;
if (x != 0)
f[i] = x;
}
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 2; i * i < n; i++) {
int cnt = 0, j = 1;
while (n % i == 0)
n /= i, cnt++;
while (cnt >= j)
cnt -= j, ans++, j++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i * i < n; i++) {
int cnt = 0, j = 1;
while (n % i == 0)
n /= i, cnt++;
while (cnt >= j)
cnt -= j, ans++, j++;
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> p;
for (int a = 2; a * a <= n; a++) {
if (n % a == 0) {
p.push_back(0);
while (n % a == 0) {
p.back()++;
n /= a;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> p;
for (ll a = 2; a * a <= n; a++) {
if (n % a == 0) {
p.push_back(0);
while (n % a == 0) {
p.back()++;
n /= a;
}
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
map<ll, ll> prime_factorization(long l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
map<ll, ll> prime_factorization(long l... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[70] = {};
int main() {
ll n;
cin >> n;
vector<int> v;
a[1] = 1;
for (int i = 2; i < 70; i++) {
a[i] = a[i - 1] + i;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[70] = {};
int main() {
ll n;
cin >> n;
vector<int> v;
a[1] = 1;
for (int i = 2; i < 70; i++) {
a[i] = a[i - 1] + i;
}
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> res;
for (int i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll cnt = 0;
while (N % i == 0) {
N /= i;
cnt++;
}
res.push_back(make_pair(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll cnt = 0;
while (N % i == 0) {
N /= i;
cnt++;
}
res.push_back(make_pair(i,... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... | replace | 56 | 57 | 56 | 57 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long long n;
cin >> n;
int ans = 0;
for (int i = 2; i * i <= n; i++) {
int e = 0;
while (n % i == 0) {
n /= i;
e++;
}
int a = 1;
while ((e - a) >= 0) {
e -= a;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long long n;
cin >> n;
int ans = 0;
for (long long i = 2; i * i <= n; i++) {
int e = 0;
while (n % i == 0) {
n /= i;
e++;
}
int a = 1;
while ((e - a) >= 0) {
e -= a;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | replace | 34 | 35 | 34 | 35 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.