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 <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define VAL 100000
#define ll long long int
#define INF 10000000000000000LL
#define pll pair<long long, long long>
const int MAX = 1e7;
const ll MOD = 1e18;
const int TOT_PRIMES = 19;
const int MAX_A = 70;
ll dp[90000];
using namespace std... | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define VAL 100000
#define ll long long int
#define INF 10000000000000000LL
#define pll pair<long long, long long>
const int MAX = 1e7;
const ll MOD = 1e18;
const int TOT_PRIMES = 19;
const int MAX_A = 70;
ll dp[90000];
using namespace std... | replace | 28 | 29 | 28 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
stru... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
stru... | replace | 78 | 79 | 78 | 79 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int i, j, k, n, b, ans = 0, po = 0;
scanf("%lld", &n);
for (i = 2; 1; i++) {
po = 0;
if (n % i == 0) {
while (1) {
if (n % i == 0) {
n = n / i;
po++;
} else
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int i, j, k, n, b, ans = 0, po = 0;
scanf("%lld", &n);
for (i = 2; 1; i++) {
po = 0;
if (n % i == 0) {
while (1) {
if (n % i == 0) {
n = n / i;
po++;
} else
... | insert | 28 | 28 | 28 | 32 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ll n;
cin >> n;
map<int, int> m;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n != 1)
m[n] = 1;
int ans = 0;
for (auto itr = m.begin(); itr ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ll n;
cin >> n;
map<int, int> m;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n != 1)
m[n] = 1;
int ans = 0;
for (auto itr = m.begin(); itr !... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | replace | 47 | 48 | 47 | 48 | TLE | |
p02660 | C++ | Time Limit Exceeded | // g++ .cpp && ./a.out
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<pair<ll, int>> factor(ll x) {
vector<pair<ll, int>> res;
for (int i = 2; i * i <= x; i++) {
int cnt = 0;
while (x % i == 0)
x /= i, cnt++;
if (cnt)
... | // g++ .cpp && ./a.out
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<pair<ll, int>> factor(ll x) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= x; i++) {
int cnt = 0;
while (x % i == 0)
x /= i, cnt++;
if (cnt)
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)(n)); i++)
#define reg(i, a, b) for (ll i = ((ll)(a)); i <= ((ll)(b)); i++)
#define irep(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (ll i = ((ll)(b)); i >= ((ll)(a)); i--)
template <c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)(n)); i++)
#define reg(i, a, b) for (ll i = ((ll)(a)); i <= ((ll)(b)); i++)
#define irep(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (ll i = ((ll)(b)); i >= ((ll)(a)); i--)
template <c... | replace | 22 | 23 | 22 | 23 | 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++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
map<ll, int> mp;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
mp[i]++;
}
}
if (n != 1)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
map<ll, int> mp;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
mp[i]++;
}
}
if (n != 1)
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
constexpr auto INFI = 2147483647;
const ll INFL = 9223372036854775807;
int main() {
ll n;
cin >> n;
ll start_n = n;
ll ans = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
constexpr auto INFI = 2147483647;
const ll INFL = 9223372036854775807;
int main() {
ll n;
cin >> n;
ll start_n = n;
ll ans = 0;
ll limit_i = ... | replace | 13 | 29 | 13 | 28 | TLE | |
p02660 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (l... |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (l... | replace | 64 | 65 | 64 | 65 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, ans = 0;
cin >> n;
unordered_map<long long int, int> mp;
while (n % 2 == 0) {
mp[2]++;
n = n / 2;
}
for (long long int i = 3; i <= sqrt(n); i = i + 2) {
w... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, ans = 0;
cin >> n;
unordered_map<long long int, int> mp;
while (n % 2 == 0) {
mp[2]++;
n = n / 2;
}
for (long long int i = 3; i <= sqrt(n); i = i + 2) {
w... | replace | 35 | 36 | 35 | 36 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b)
{
return a.first ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b)
{
return a.first ... | replace | 56 | 57 | 56 | 57 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <iomanip> : 表示桁数, ex) cout << fixed << setprecision(15) << ...
#define pi 3.14159265358979323846
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ld = long double;
using... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <iomanip> : 表示桁数, ex) cout << fixed << setprecision(15) << ...
#define pi 3.14159265358979323846
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ld = long double;
using... | replace | 42 | 44 | 42 | 44 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Time Limit Exceeded | /*
Reference:-
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i < int(n); i++)
#define PI pair<int, int>
#define all(vec) vec.begin(), vec.end()
ll mod =... | /*
Reference:-
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i < int(n); i++)
#define PI pair<int, int>
#define all(vec) vec.begin(), vec.end()
ll mod =... | replace | 34 | 35 | 34 | 35 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int mod = 1e9 + 7;
inline int add(int a, int b) {
int res = a + b;
if (res >= mod)
res -= mod;
return res;
}
inline int sub(int a, int b) {
int res = a - b;
if (res < 0)
res += mod;
return res;
}
inline int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int mod = 1e9 + 7;
inline int add(int a, int b) {
int res = a + b;
if (res >= mod)
res -= mod;
return res;
}
inline int sub(int a, int b) {
int res = a - b;
if (res < 0)
res += mod;
return res;
}
inline int... | replace | 41 | 42 | 41 | 42 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, ans = 0;
cin >> n;
vector<int> v;
for (int i = 1; i <= 100; i++) {
v.push_back(i * (i + 1) / 2);
}
for (int i = 2; i * i <= n; i++) {... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, ans = 0;
cin >> n;
vector<int> v;
for (int i = 1; i <= 100; i++) {
v.push_back(i * (i + 1) / 2);
}
for (ll i = 2; i * i <= n; i++) {
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Blue \
ios_... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Blue \
ios_... | replace | 41 | 48 | 41 | 42 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(... | insert | 75 | 75 | 75 | 80 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Blue \
ios_... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Blue \
ios_... | replace | 35 | 36 | 35 | 36 | 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>;
using v = vector<int>;
using vv = vector<v>;
const int MOD = 1000000007;
const ll INF = 1001001001001;
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
... | #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>;
using v = vector<int>;
using vv = vector<v>;
const int MOD = 1000000007;
const ll INF = 1001001001001;
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02660 | C++ | Time Limit Exceeded | /*
Author: Babin Dutta
*/
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mp make_pair
#define boost \
ios_base::sync_with_stdio(false); ... | /*
Author: Babin Dutta
*/
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mp make_pair
#define boost \
ios_base::sync_with_stdio(false); ... | replace | 80 | 89 | 80 | 87 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | replace | 26 | 27 | 26 | 27 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define mk make_pair
template <class key, class cmp = std::less<key>>
using ordered_set =
tree<key, null_type, cmp, rb_... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define mk make_pair
template <class key, class cmp = std::less<key>>
using ordered_set =
tree<key, null_type, cmp, rb_... | replace | 42 | 43 | 42 | 43 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define FO(x) \
{ \
freopen(#x ".in"... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define FO(x) \
{ \
freopen(#x ".in"... | replace | 82 | 83 | 82 | 83 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
#define ll long long
using namespace std;
const int lim = 5e6;
int lp[lim + 10], pr[lim], cnt = 0;
vector<ll> V;
unordered_map<ll, int> mp;
ll n;
void sieve() {
for (int i = 2; i <= lim; i++) {
if (lp[i] == 0)
lp[i] = pr[++... | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
#define ll long long
using namespace std;
const int lim = 5e6;
int lp[lim + 10], pr[lim], cnt = 0;
vector<ll> V;
unordered_map<ll, int> mp;
ll n;
void sieve() {
for (int i = 2; i <= lim; i++) {
if (lp[i] == 0)
lp[i] = pr[++... | replace | 49 | 50 | 49 | 50 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<pair<int, int>> ve;
void factorize(long long n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int temp = 0;
while (n % i == 0) {
n /= i;
temp++;
}
ve.emplace_back(i, temp);
}
}
if (n > 1) {... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<pair<int, int>> ve;
void factorize(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
int temp = 0;
while (n % i == 0) {
n /= i;
temp++;
}
ve.emplace_back(i, temp);
}
}
if (n ... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
cin >> n;
map... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
cin >> n;
map... | replace | 23 | 24 | 23 | 24 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define ret return
#define PB push_back
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define pii pair<int, int>
#define pll pair<long long, long long>
#define FAST ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define ret return
#define PB push_back
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define pii pair<int, int>
#define pll pair<long long, long long>
#define FAST ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02660 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for (int i = (a); i > (b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define pb push_back
#de... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for (int i = (a); i > (b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define pb push_back
#de... | replace | 30 | 31 | 30 | 31 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// print(fixed << setprecision(10));
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repk(i, n, k) for (ll i = k; i < (n); i++)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
double PI = acos(-1.0);
int INF = 1e9;
ll LINF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// print(fixed << setprecision(10));
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repk(i, n, k) for (ll i = k; i < (n); i++)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
double PI = acos(-1.0);
int INF = 1e9;
ll LINF ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
vector<pair<int64, int>> Factorize(int64 x) {
vector<pair<int64, int>> r;
for (int d = 2; d * d <= x; d++) {
int c = 0;
while (x % d == 0) {
x /= d;
c++;
}
if (c > 0) {
r.push_back({d... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
vector<pair<int64, int>> Factorize(int64 x) {
vector<pair<int64, int>> r;
for (int64 d = 2; d * d <= x; d++) {
int c = 0;
while (x % d == 0) {
x /= d;
c++;
}
if (c > 0) {
r.push_back(... | replace | 9 | 10 | 9 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#... | replace | 43 | 44 | 43 | 44 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define INFLL 9e18
#define INF 2e9
#define EPS 1e-9
#define pb push_back
#define emp emplace_back
#define PI acos(-1.0)
#define endl "\n"
#define mp make_p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define INFLL 9e18
#define INF 2e9
#define EPS 1e-9
#define pb push_back
#define emp emplace_back
#define PI acos(-1.0)
#define endl "\n"
#define mp make_p... | replace | 38 | 39 | 38 | 39 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}... | replace | 49 | 50 | 49 | 50 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define SpeeD ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define endl '\n'
// pair<int, int> *p=new pair<int, int>[n];
// std::vector<pair<int,int>> vp;
// v.push_back(make_pair(x,y))
// pair<int, int> p[1000001];
// string *s=new string [n];
// int freq[e];
// ... | #include <bits/stdc++.h>
#define SpeeD ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define endl '\n'
// pair<int, int> *p=new pair<int, int>[n];
// std::vector<pair<int,int>> vp;
// v.push_back(make_pair(x,y))
// pair<int, int> p[1000001];
// string *s=new string [n];
// int freq[e];
// ... | replace | 43 | 44 | 43 | 44 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b) \
do { \
cout << "["; ... | replace | 37 | 38 | 37 | 38 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pi... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pi... | replace | 45 | 46 | 45 | 46 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
int ans = 0;
int div = 2;
while (n > 1 && div * div <= n) {
int cur = 0;
int next = 1;
while (n % div == 0) {
cur++;
if (cur == next) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
int ans = 0;
int div = 2;
while (n > 1 && div * 1LL * div <= n) {
int cur = 0;
int next = 1;
while (n % div == 0) {
cur++;
if (cur == ne... | replace | 13 | 14 | 13 | 14 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
template <class T> inline... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
template <class T> inline... | replace | 30 | 31 | 30 | 31 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <map>
using namespace std;
map<long, int> fac(long n) {
map<long, int> M;
for (int i = 2; i <= n; i++) {
if (n == 1)
break;
if (i * i > n) {
M[n] = 1;
break;
}
if (n % i == 0) {
M[i] = 0;
while (n % i == 0) {
n /= i... | #include <cmath>
#include <iostream>
#include <map>
using namespace std;
map<long, int> fac(long n) {
map<long, int> M;
for (long i = 2; i <= n; i++) {
if (n == 1)
break;
if (i * i > n) {
M[n] = 1;
break;
}
if (n % i == 0) {
M[i] = 0;
while (n % i == 0) {
n /= ... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defi... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defi... | replace | 108 | 110 | 108 | 110 | 0 | |
p02660 | C++ | Time Limit Exceeded | /**
1.对题分析，要让转化次数越大，则先从最小开始。
2.对一个数的x质数，最多能分为多少个不同的数
3.只需求到根号n以内的变化值
**/
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
int solve(int x) { // 计算以i为底，以x为指数一共有多少不同的值
int now = 1, res = 0;
while (now <= x) {
x -= now;
now++;
res++;
}
return res;... | /**
1.对题分析，要让转化次数越大，则先从最小开始。
2.对一个数的x质数，最多能分为多少个不同的数
3.只需求到根号n以内的变化值
**/
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
int solve(int x) { // 计算以i为底，以x为指数一共有多少不同的值
int now = 1, res = 0;
while (now <= x) {
x -= now;
now++;
res++;
}
return res;... | replace | 22 | 23 | 22 | 23 | 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 __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
#define fast \
ios_base::sync_with_stdio(0); ... | replace | 53 | 54 | 53 | 54 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; 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>> a;
for (int i = 2; i * i <= n; i++) {
int x = 0;
while (n % i == 0) {
n /= i;
x++;
}
a.e... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; 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>> a;
for (ll i = 2; i * i <= n; i++) {
int x = 0;
while (n % i == 0) {
n /= i;
x++;
}
a.em... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cnt[1000001];
int main() {
long N, M;
int ans = 0;
cin >> N;
M = N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i < sqrt((double)N) + 1; i++) {
if (N % i)
continue;
while (N % i == 0) {
cnt[i]++;
N /= i;
... | #include <bits/stdc++.h>
using namespace std;
int cnt[1000001];
int main() {
long N, M;
int ans = 0;
cin >> N;
M = N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i < sqrt((double)N) + 1; i++) {
if (N % i)
continue;
while (N % i == 0) {
cnt[i]++;
N /= i;
... | replace | 25 | 26 | 25 | 27 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <set>
#include <vector>
using namespace std;
set<int64_t> ans;
void decomPrime(int num) {
int n = 2;
while (num > n * n) {
while (num % n == 0) {
num /= n;
cout << n << ",";
ans.insert(n);
}
n++;
}
cout << num << endl;
ans.insert... | #include <iostream>
#include <math.h>
#include <set>
#include <vector>
using namespace std;
set<int64_t> ans;
void decomPrime(int num) {
int n = 2;
while (num > n * n) {
while (num % n == 0) {
num /= n;
cout << n << ",";
ans.insert(n);
}
n++;
}
cout << num << endl;
ans.insert... | replace | 29 | 30 | 29 | 30 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<int> v(1000004, 1);
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<int> v(1000004, 1);
int ans = 0;
... | replace | 29 | 30 | 29 | 30 | 0 | |
p02660 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
int getTheAnswer() { return 42; }
using namespace std;
using ll = long long;
int a[1... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
int getTheAnswer() { return 42; }
using namespace std;
using ll = long long;
int a[1... | insert | 30 | 30 | 30 | 31 | 0 | |
p02660 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#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 Q \
int t; ... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#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 Q \
int t; ... | replace | 26 | 27 | 26 | 27 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef long long LL;
const int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,
5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};
const LL UnUseMethod = 1e6;
LL count[2] = {0};
LL IN(void) {
LL x = 0;
short f... | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef long long LL;
const int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,
5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};
const LL UnUseMethod = 10e10;
LL count[2] = {0};
LL IN(void) {
LL x = 0;
short... | replace | 6 | 7 | 6 | 7 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <stdio.h>
typedef long long LL;
const int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,
5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};
LL IN(void) {
LL x = 0;
short f = 0, c = getchar();
while (c < 48 || c > 57)
f ^= c == 45, c = getchar();
wh... | #include <stdio.h>
typedef long long LL;
const int e[40] = {0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5,
5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8};
LL IN(void) {
LL x = 0;
short f = 0, c = getchar();
while (c < 48 || c > 57)
f ^= c == 45, c = getchar();
wh... | replace | 31 | 32 | 31 | 32 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const int maxn = 500050;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const ll linf = 7e18;
ll power(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = ans * x % mod;
x =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const int maxn = 500050;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const ll linf = 7e18;
ll power(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = ans * x % mod;
x =... | replace | 29 | 31 | 29 | 31 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | replace | 24 | 25 | 24 | 25 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<bool> prime(1000001, true);
prime[0] = false;
prime[1] = false;
for (ll i = 2; i * i < 1000001; i++) {
if (!prime[i])
continue;
for (ll j = 2 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<bool> prime(1000001, true);
prime[0] = false;
prime[1] = false;
for (ll i = 2; i * i < 1000001; i++) {
if (!prime[i])
continue;
for (ll j = 2 ... | replace | 27 | 28 | 27 | 28 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PP;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PP;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n... | replace | 28 | 29 | 28 | 29 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
vector<pair<ll, int>> factor(ll n) {
vector<pair<ll, int>> res;
for (ll i; i * i <= n; i++) {
if (n % i... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
vector<pair<ll, int>> factor(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n... | replace | 10 | 11 | 10 | 11 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc(int n) {
for (int i = 1;; i++) {
if (i * (i + 1) > n * 2)
return i - 1;
}
}
vector<pair<ll, int>> prime_factorize(ll n) {
vector<pair<ll, int>> vp;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc(int n) {
for (int i = 1;; i++) {
if (i * (i + 1) > n * 2)
return i - 1;
}
}
vector<pair<ll, int>> prime_factorize(ll n) {
vector<pair<ll, int>> vp;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
... | replace | 13 | 14 | 13 | 14 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | replace | 25 | 26 | 25 | 26 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ii;
long kotae;
int i;
int j;
int k;
int a[66];
k = 1;
a[0] = 0;
a[1] = 0;
for (i = 1; i < 11; i++) {
a[k] = a[k - 1] + 1;
k++;
for (j = 0; j < i; j++) {
a[k] = a[k - 1];
k++;
}
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ii;
long kotae;
int i;
int j;
int k;
int a[66];
k = 1;
a[0] = 0;
a[1] = 0;
for (i = 1; i < 11; i++) {
a[k] = a[k - 1] + 1;
k++;
for (j = 0; j < i; j++) {
a[k] = a[k - 1];
k++;
}
}
c... | replace | 39 | 40 | 39 | 40 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
// unordered_map<ll, int> count;
// count.reserve(1024);
... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
// unordered_map<ll, int> count;
// count.reserve(1024);
... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int n;
cin >> n;
long long int ans = 0;
for (long long int i = 0; i * i <= n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int n;
cin >> n;
long long int ans = 0;
for (long long int i = 2; i * i <= n;... | replace | 16 | 17 | 16 | 17 | -8 | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | replace | 85 | 86 | 85 | 86 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int fun(int x) {
int ans = 0;
for (int i = 1;; i++) {
ans += i;
if (ans == x)
return i;
else if (x < ans)
return i - 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int fun(int x) {
int ans = 0;
for (int i = 1;; i++) {
ans += i;
if (ans == x)
return i;
else if (x < ans)
return i - 1;
... | replace | 23 | 24 | 23 | 28 | -8 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define pll pair<ll, ll>
#define ff first
#define snd second
#define pb push_back
#define vll vector<ll>
#define vpll vector<pll>
#define endl "\n"
#define MOD 1000000007
using namespace std;
ll const N = 1e5 + 1;
map<ll, ll> m;
void prime(ll n) {
while (n > 1 && n % ... | #include <bits/stdc++.h>
typedef long long ll;
#define pll pair<ll, ll>
#define ff first
#define snd second
#define pb push_back
#define vll vector<ll>
#define vpll vector<pll>
#define endl "\n"
#define MOD 1000000007
using namespace std;
ll const N = 1e5 + 1;
map<ll, ll> m;
void prime(ll n) {
while (n > 1 && n % ... | replace | 22 | 23 | 22 | 23 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<int> fc;
for (int i = 2; i * i < N; i++) {
if (N % i == 0) {
int cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
fc.push_back(cnt);
}
}
if (N != 1) {
fc.push_back(1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<int> fc;
for (long long i = 2; i * i < N; i++) {
if (N % i == 0) {
int cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
fc.push_back(cnt);
}
}
if (N != 1) {
fc.push_back... | replace | 6 | 7 | 6 | 7 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int solve(long long n) {
if (n == 1) {
return 0;
}
vector<int> f;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
f.push_back(i);
n /= i;
}
}
if (n > 1)
f.push_back(n);
int ans = 0;
int i = 0;
while (i < f... | #include <iostream>
#include <vector>
using namespace std;
int solve(long long n) {
if (n == 1) {
return 0;
}
vector<long long> f;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
f.push_back(i);
n /= i;
}
}
if (n > 1)
f.push_back(n);
int ans = 0;
int i = 0;
... | replace | 8 | 10 | 8 | 10 | TLE | |
p02660 | C++ | Time Limit Exceeded | //-----------------------
// author : xyqkoala
// time : 2020-07-23
//-----------------------
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typede... | //-----------------------
// author : xyqkoala
// time : 2020-07-23
//-----------------------
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typede... | replace | 38 | 39 | 38 | 39 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define PI 3.14159265358979323846
#define vl vector<long long>
using namespace std;
using ll = long long;
using ld = long double;
// ----本問について----
// 問題：
// 問題文URL：
// ------------------
// ----ここから本問のソースコード----
// グローバル変数（入力）
ll n;
vector<pair<... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define PI 3.14159265358979323846
#define vl vector<long long>
using namespace std;
using ll = long long;
using ld = long double;
// ----本問について----
// 問題：
// 問題文URL：
// ------------------
// ----ここから本問のソースコード----
// グローバル変数（入力）
ll n;
vector<pair<... | replace | 22 | 23 | 22 | 23 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | replace | 109 | 110 | 109 | 110 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false),
cout << fixed << setprecision(9), 0);
// int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv
// ./prog.exe") >> 8), 0);
int main() {
Int N;
cin >> N;
In... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false),
cout << fixed << setprecision(9), 0);
// int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv
// ./prog.exe") >> 8), 0);
int main() {
Int N;
cin >> N;
In... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Runtime Error | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i... | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i... | replace | 16 | 17 | 16 | 17 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | replace | 41 | 42 | 41 | 42 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
#include <unordered_map>
using namespace std;
int main() {
long long N;
cin >> N;
unordered_map<long long, int> factor;
long long a = 2;
long long N0 = N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
while (N > 1) {
if (N % a == 0) {
N /= a;
factor[a] +... | #include <iostream>
#include <unordered_map>
using namespace std;
int main() {
long long N;
cin >> N;
unordered_map<long long, int> factor;
long long a = 2;
long long N0 = N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
while (N > 1) {
if (N % a == 0) {
N /= a;
factor[a] +... | replace | 27 | 29 | 27 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded |
/*
"Won't stop untill I'm Phenomenal"
- Phenomenal, EMINEM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam \
ios_base::sync_with_stdio(false); \
cin.... |
/*
"Won't stop untill I'm Phenomenal"
- Phenomenal, EMINEM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam \
ios_base::sync_with_stdio(false); \
cin.... | replace | 38 | 39 | 38 | 39 | TLE | |
p02660 | C++ | Time Limit Exceeded | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | replace | 132 | 133 | 132 | 133 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;
int main() {
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
ll cnt = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ll times = 0;
while (n % i == 0) {
n /= i;
times++;
}
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;
int main() {
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
ll cnt = 0;
if (n % 2 == 0) {
ll times = 0;
while (n % 2 == 0) {
n /= 2;
times++;
}
ll t = 1;
while (t <= times) {
cnt++;
... | replace | 13 | 14 | 13 | 28 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
int cnt = 0;
cin >> n;
int cnt2 = 0;
vector<pair<long, long>> v(0);
for (int i = 2; i * i < n; i++) {
while (n % i == 0) {
cnt++;
n = n / i;
}
if (cnt != 0)
v.push_back(make_pair(i, cnt));
cnt = 0;
}
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
int cnt = 0;
cin >> n;
int cnt2 = 0;
vector<pair<long, long>> v(0);
for (long i = 2; i * i < n; i++) {
while (n % i == 0) {
cnt++;
n = n / i;
}
if (cnt != 0)
v.push_back(make_pair(i, cnt));
cnt = 0;
}
if... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(), (x).end()
#define uniq(x) ((x).erase(unique(all(x)), (x).end()))
#define sz(x) ((int)(x).size()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(), (x).end()
#define uniq(x) ((x).erase(unique(all(x)), (x).end()))
#define sz(x) ((int)(x).size()... | replace | 59 | 60 | 59 | 60 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fin freopen("input", "r", stdin);
#define fout freopen("output", "w", stdout);
#define wt(x) cerr << #x << ": " << x << " ";
#define whatis(x) \
{ cerr << #x << ": " << x << endl; }
#define whatis2(x, y) ... | #include <bits/stdc++.h>
#define fin freopen("input", "r", stdin);
#define fout freopen("output", "w", stdout);
#define wt(x) cerr << #x << ": " << x << " ";
#define whatis(x) \
{ cerr << #x << ": " << x << endl; }
#define whatis2(x, y) ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <stdio.h>
#define LL long long
int p[50], m[50], tot;
int main() {
LL n;
int i, j, ans = 0;
scanf("%lld", &n);
for (i = 2; i * i <= n; i++)
if (n % i == 0) {
p[++tot] = i;
while (n % i == 0)
n /= i, m[tot]++;
}
if (n > 1)
p[++tot] = n, m[tot] = 1;
for (i = 1; i <= to... | #include <stdio.h>
#define LL long long
int p[50], m[50], tot;
int main() {
LL n;
int i, j, ans = 0;
scanf("%lld", &n);
for (i = 2; (LL)i * i <= n; i++)
if (n % i == 0) {
p[++tot] = i;
while (n % i == 0)
n /= i, m[tot]++;
}
if (n > 1)
p[++tot] = n, m[tot] = 1;
for (i = 1; i <... | replace | 7 | 8 | 7 | 8 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int total = 0; // ｚの合計
int64_t i = 2;
while (n > 1) {
int count = 1; // 各素因数におけるeのパターン数
for (int j = 1; n % i == 0; j++) {
if (j == count * (count + 1) / 2) {
total++;
count++;
}
n /= i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int total = 0; // ｚの合計
int64_t i = 2;
while (n > 1) {
if (i > 1000000) {
total++;
break;
}
int count = 1; // 各素因数におけるeのパターン数
for (int j = 1; n % i == 0; j++) {
if (j == count * (count + 1) / 2) ... | insert | 9 | 9 | 9 | 14 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <ctime>
#include <map>
#include <math.h>
#include <typeinfo>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <ctime>
#include <map>
#include <math.h>
#include <typeinfo>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%... | replace | 37 | 38 | 37 | 38 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <cstdio>
int f[50];
long long n;
int res = 0;
int main() {
for (int i = 1; i < 10; i++) {
f[i * (i + 1) / 2] = i;
}
for (int i = 1; i < 50; i++) {
if (f[i] < f[i - 1]) {
f[i] = f[i - 1];
}
}
scanf("%lld", &n);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cn... | #include <cstdio>
int f[50];
long long n;
int res = 0;
int main() {
for (int i = 1; i < 10; i++) {
f[i * (i + 1) / 2] = i;
}
for (int i = 1; i < 50; i++) {
if (f[i] < f[i - 1]) {
f[i] = f[i - 1];
}
}
scanf("%lld", &n);
for (int i = 2; 1ll * i * i <= n; i++) {
if (n % i == 0) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e5 + 5;
const ll maxm = 1e3 + 5;
inline void qread() {}
template <class T1, class... T2> inline void qread(T1 &IEE, T2 &...ls) {
register T1 __ = 0, ___ = 1;
register char ch;
while (!isdigit(ch = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e5 + 5;
const ll maxm = 1e3 + 5;
inline void qread() {}
template <class T1, class... T2> inline void qread(T1 &IEE, T2 &...ls) {
register T1 __ = 0, ___ = 1;
register char ch;
while (!isdigit(ch = ... | replace | 27 | 28 | 27 | 28 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
vector<ll> factors(ll N) {
vector<ll> ret;
if (N % 2 == 0) {
ret.push_back(2);
while (N % 2 == 0)
N /= 2;
}
ll root = sqrt(N);
for (ll p = 3; p <= root; p += 2) {
if (N % p)
continue;
ret.push_back(p);
while (... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
vector<ll> factors(ll N) {
vector<ll> ret;
if (N % 2 == 0) {
ret.push_back(2);
while (N % 2 == 0)
N /= 2;
}
ll root = sqrt(N);
for (ll p = 3; p <= root; p += 2) {
if (N % p)
continue;
ret.push_back(p);
while (... | replace | 39 | 41 | 39 | 41 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int64_t gcd(int64_t a, int64_t b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int64_t a, int64_t b) { return a / gcd(a, b) * b; }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対... | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int64_t gcd(int64_t a, int64_t b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int64_t a, int64_t b) { return a / gcd(a, b) * b; }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対... | replace | 46 | 47 | 46 | 47 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1e9 + 7
using namespace std;
typedef long long ll;
const double pi = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1e9 + 7
using namespace std;
typedef long long ll;
const double pi = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b... | replace | 19 | 21 | 19 | 21 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
int 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++;
}
for (ll j = 1;; j++) {
... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
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++;
}
for (ll j = 1;; j++) {
... | replace | 9 | 11 | 9 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 275 | 276 | 275 | 276 | TLE | |
p02660 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using names... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using names... | replace | 25 | 26 | 25 | 26 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<... | replace | 20 | 21 | 20 | 21 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
cin >> N;
int ans = 0;
FOR(i, 2, 1000000000) {
int cur = 0;
while (N % i == 0) {
cur++;
N /= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
cin >> N;
int ans = 0;
FOR(i, 2, 100000000) {
int cur = 0;
while (N % i == 0) {
cur++;
N /= i... | replace | 11 | 12 | 11 | 12 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int INF = 1001001001;
const ll BIG = 1000000007;
const double PI = 3.141592653589793;
int main() {
ll n;
cin >> n;
map<int, int> prim... | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int INF = 1001001001;
const ll BIG = 1000000007;
const double PI = 3.141592653589793;
int main() {
ll n;
cin >> n;
map<ll, ll> primes... | replace | 15 | 17 | 15 | 17 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
long long n;
c... | #include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
long long n;
c... | insert | 38 | 38 | 38 | 42 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
#define fs first
#define re resize
#define sc second
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define all(x) x.begin(), x.end()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
#define fs first
#define re resize
#define sc second
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define all(x) x.begin(), x.end()... | replace | 88 | 89 | 88 | 89 | TLE | |
p02660 | C++ | Time Limit Exceeded | // from : https://atcoder.jp/contests/abc169/submissions/13867215
#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)
#endi... | // from : https://atcoder.jp/contests/abc169/submissions/13867215
#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)
#endi... | replace | 133 | 134 | 133 | 134 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll p;
ll calc(ll n) {
ll res = (1 + n) * n / 2;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
#endif
ll ans = 0;
cin >... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll p;
ll calc(ll n) {
ll res = (1 + n) * n / 2;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
#endif
ll ans = 0;
cin >... | replace | 25 | 26 | 25 | 26 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
using namespace std;
LL ksc(LL a, LL n, LL mod) {
LL ret = 0;
for (; n; n >>= 1) {
if (n & 1) {
ret += a;
if (ret >= mod)
ret -= mod;
}
a <<= 1;
if (a >= mod)
a -= mod;
}
return ret;
}
LL ksm(LL a, LL n, LL mod) {
LL ret =... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
LL ksc(LL a, LL n, LL mod) {
LL ret = 0;
for (; n; n >>= 1) {
if (n & 1) {
ret += a;
if (ret >= mod)
ret -= mod;
}
a <<= 1;
if (a >= mod)
a -= mod;
}
return ret;
}
LL ksm(LL a, LL n, LL mod) {
LL ret =... | insert | 75 | 75 | 75 | 79 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
map<int, int> p;
while (n % 2 == 0) {
n /= 2;
p[2] += 1;
}
int i = 3;
while (n != 1 || n >= i) {
if (n % i == 0) {
p[i]++;
n /= i;
} else {
i += 2;
}
}
int ans = 0;
for (auto i : p) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
map<int, int> p;
while (n % 2 == 0) {
n /= 2;
p[2] += 1;
}
int i = 3;
while (n != 1 || n >= i) {
if (pow(n, 0.5) < i) {
p[n]++;
break;
}
if (n % i == 0) {
p[i]++;
n /= i;
} else {... | insert | 14 | 14 | 14 | 18 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.