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
//------------------------------------------
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define EACH(i, c) \
for (decltype((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(x) ::std::begin(x), ::std::end(x)
#define RALL(x) ::std::rbegin(x), ::std::rend(x)
#define SORT(c) whole(sort, c)
#define RSORT(c) rwhole(sort, c)
// constant
//--------------------------------------------
constexpr double EPS = 1e-10;
constexpr double PI = 3.14159265358979323846;
constexpr int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
// declaretion
template <typename T> istream &operator>>(istream &is, vector<T> &vec);
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &vv);
template <typename T> vector<T> make_v(size_t a);
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts);
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v);
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v);
// implementation
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << "," << p.second;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
// main code
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> 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 main(int argc, char *argv[]) {
LL n;
cin >> n;
auto mp = factorize(n);
LL ans = 0;
for (auto i : mp) {
LL k = i.second;
LL l = 1;
while (k - l >= 0) {
k -= l;
l += 1;
ans++;
}
}
cout << ans << endl;
return 0;
}
| // 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
//------------------------------------------
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define EACH(i, c) \
for (decltype((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(x) ::std::begin(x), ::std::end(x)
#define RALL(x) ::std::rbegin(x), ::std::rend(x)
#define SORT(c) whole(sort, c)
#define RSORT(c) rwhole(sort, c)
// constant
//--------------------------------------------
constexpr double EPS = 1e-10;
constexpr double PI = 3.14159265358979323846;
constexpr int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
// declaretion
template <typename T> istream &operator>>(istream &is, vector<T> &vec);
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &vv);
template <typename T> vector<T> make_v(size_t a);
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts);
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v);
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v);
// implementation
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << "," << p.second;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
// main code
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> 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 main(int argc, char *argv[]) {
LL n;
cin >> n;
auto mp = factorize(n);
LL ans = 0;
for (auto i : mp) {
LL k = i.second;
LL l = 1;
while (k - l >= 0) {
k -= l;
l += 1;
ans++;
}
}
cout << ans << endl;
return 0;
} | 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 1000000007
#define whole(a) (a).begin(), (a).end()
#define rwhole(a) (a).rbegin(), (a).rend()
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (ll i = (a); i >= (b); i--)
#define each(itr, ds) for (auto itr = (ds).begin(); itr != (ds).end(); itr++)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
// DUMP
// ostream vector<T> , vector<vector<T>> , set<T> ,queue<T> ,
// priority_queue<T> , pair<T,U> , map<T,U>
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{ ";
rep(i, vec.size()) os << ((i == 0) ? "" : ", ") << i << ":" << vec[i];
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
os << "{" << endl;
rep(i, vec.size()) os << "\t " << i << ":" << vec[i]
<< ((i == vec.size() - 1) ? "" : ",") << endl;
os << "\t }";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << *itr;
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, queue<T> &p) {
queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.front();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T> ostream &operator<<(ostream &os, priority_queue<T> &p) {
priority_queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.top();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, map<T, U> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << itr->first << ":"
<< itr->second;
os << " }";
return os;
}
void dump_f(string &nm, char t) { cerr << endl; }
template <class T, class... Ts>
void dump_f(string &nm, char t, T &&x, Ts &&...ts) {
int l = nm.find_first_of(',');
string name(nm, 0, l), nx(nm, l + 1, -1);
if (t == '\n')
cerr << " " << name << "\t: " << x << t;
else
cerr << name << ": " << x << "," << t;
dump_f(nx, t, forward<Ts>(ts)...);
}
template <class... Ts> void dump_m(int &&ln, string &&nm, char t, Ts &&...ts) {
cerr << "[ln: " << ln << "]" << t;
dump_f(nm, t, forward<Ts>(ts)...);
}
#define dump(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\n', __VA_ARGS__)
#define dl(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\t', __VA_ARGS__)
#define lower_bound_idx(V, c) distance(V.begin(), lower_bound(whole(V), c))
bool issosu(ll n) {
bool is = true;
if (n == 1)
return false;
if (n == 2)
return true;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
is = false;
break;
}
}
return is;
}
int main() {
ios::sync_with_stdio(false); // printf<=>cout
cin.tie(nullptr); // cin<=>cout
ll N;
cin >> N;
//-----------------------------------
ll ans = 0;
for (ll i = 2; i * i <= N; i++) {
ll u = 0;
while (N % i == 0) {
N /= i;
u++;
}
for (ll t = 1; u >= 0; t++) {
u -= t;
if (u >= 0)
ans++;
}
}
if (issosu(N))
ans++;
cout << ans << '\n';
return (0);
} | #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 1000000007
#define whole(a) (a).begin(), (a).end()
#define rwhole(a) (a).rbegin(), (a).rend()
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (ll i = (a); i >= (b); i--)
#define each(itr, ds) for (auto itr = (ds).begin(); itr != (ds).end(); itr++)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
// DUMP
// ostream vector<T> , vector<vector<T>> , set<T> ,queue<T> ,
// priority_queue<T> , pair<T,U> , map<T,U>
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{ ";
rep(i, vec.size()) os << ((i == 0) ? "" : ", ") << i << ":" << vec[i];
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
os << "{" << endl;
rep(i, vec.size()) os << "\t " << i << ":" << vec[i]
<< ((i == vec.size() - 1) ? "" : ",") << endl;
os << "\t }";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << *itr;
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, queue<T> &p) {
queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.front();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T> ostream &operator<<(ostream &os, priority_queue<T> &p) {
priority_queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.top();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, map<T, U> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << itr->first << ":"
<< itr->second;
os << " }";
return os;
}
void dump_f(string &nm, char t) { cerr << endl; }
template <class T, class... Ts>
void dump_f(string &nm, char t, T &&x, Ts &&...ts) {
int l = nm.find_first_of(',');
string name(nm, 0, l), nx(nm, l + 1, -1);
if (t == '\n')
cerr << " " << name << "\t: " << x << t;
else
cerr << name << ": " << x << "," << t;
dump_f(nx, t, forward<Ts>(ts)...);
}
template <class... Ts> void dump_m(int &&ln, string &&nm, char t, Ts &&...ts) {
cerr << "[ln: " << ln << "]" << t;
dump_f(nm, t, forward<Ts>(ts)...);
}
#define dump(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\n', __VA_ARGS__)
#define dl(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\t', __VA_ARGS__)
#define lower_bound_idx(V, c) distance(V.begin(), lower_bound(whole(V), c))
bool issosu(ll n) {
bool is = true;
if (n == 1)
return false;
if (n == 2)
return true;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
is = false;
break;
}
}
return is;
}
int main() {
ios::sync_with_stdio(false); // printf<=>cout
cin.tie(nullptr); // cin<=>cout
ll N;
cin >> N;
//-----------------------------------
ll ans = 0;
for (ll i = 2; i * i <= N; i++) {
ll u = 0;
while (N % i == 0) {
N /= i;
u++;
}
for (ll t = 1; u >= 0; t++) {
u -= t;
if (u >= 0)
ans++;
}
}
if (issosu(N))
ans++;
cout << ans << '\n';
return (0);
} | 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));
}
if (n != 1)
mp.push_back(make_pair(n, 1));
return mp;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
prime(n);
auto pf = prime(n);
for (auto p : pf) {
ll cal = p.second;
ll tmp = 0;
ll cur = 1;
while (cal >= cur)
cal -= cur++, ++tmp;
ans += tmp;
}
cout << ans << endl;
return 0;
}
| #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 (n != 1)
mp.push_back(make_pair(n, 1));
return mp;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
prime(n);
auto pf = prime(n);
for (auto p : pf) {
ll cal = p.second;
ll tmp = 0;
ll cur = 1;
while (cal >= cur)
cal -= cur++, ++tmp;
ans += tmp;
}
cout << ans << endl;
return 0;
}
| 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 << ans << endl;
return 0;
}
| #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 << ans << endl;
return 0;
}
| 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(make_pair(i, counter));
}
if (N != 1)
v.push_back(make_pair(N, 1));
return v;
}
long long find(long long n) {
// long long ans;
// long long sum = 0;
long long l = 1;
long long r = n;
while (r - l > 1) {
long long c = (l + r) / 2;
if (c * (c + 1) / 2 <= n)
l = c;
else
r = c;
}
return l;
// for(int i =1; i <= n + 1000; i++){
// sum += i;
// if(sum > n) {
// ans = i - 1;
// break;
// }
// }
}
int main() {
long long N;
cin >> N;
// cout << find(N) << endl;
vector<pair<long long, long long>> v = pf(N);
long long ans = 0;
for (int i = 0; i < v.size(); i++) {
ans += find(v.at(i).second);
}
cout << ans << endl;
} | #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_back(make_pair(i, counter));
}
if (N != 1)
v.push_back(make_pair(N, 1));
return v;
}
long long find(long long n) {
// long long ans;
// long long sum = 0;
long long l = 1;
long long r = n;
while (r - l > 1) {
long long c = (l + r) / 2;
if (c * (c + 1) / 2 <= n)
l = c;
else
r = c;
}
return l;
// for(int i =1; i <= n + 1000; i++){
// sum += i;
// if(sum > n) {
// ans = i - 1;
// break;
// }
// }
}
int main() {
long long N;
cin >> N;
// cout << find(N) << endl;
vector<pair<long long, long long>> v = pf(N);
long long ans = 0;
for (int i = 0; i < v.size(); i++) {
ans += find(v.at(i).second);
}
cout << ans << endl;
} | 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> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define _GLIBCXX_DEBUG
#define vpush(a, x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
const int INF = 1 << 30;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
#define stp(x) setprecision(x)
vlong so;
int findFactors(ll num) {
int i;
bool fg = true;
for (i = 2; i * i <= num; i++) { // 他の素数で割っていく
while (num % i == 0) {
fg = false;
so.push_back(i);
num /= i;
}
}
if (num != 1) {
so.push_back(num);
}
return 0;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
return (0);
}
findFactors(n);
int now = 2, count = 1, ans = 0, fg = 1;
ll test = 1;
rep(i, (int)so.size()) {
if (now == so[i]) {
count--;
if (count == 0) {
ans++;
fg++;
count = fg;
}
} else {
now = so[i];
ans++;
fg = 2;
count = 2;
}
}
cout << ans << '\n';
return (0);
} | #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> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define _GLIBCXX_DEBUG
#define vpush(a, x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
const int INF = 1 << 30;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
#define stp(x) setprecision(x)
vlong so;
int findFactors(ll num) {
ll i;
bool fg = true;
for (i = 2; i * i <= num; i++) { // 他の素数で割っていく
while (num % i == 0) {
fg = false;
so.push_back(i);
num /= i;
}
}
if (num != 1) {
so.push_back(num);
}
return 0;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
return (0);
}
findFactors(n);
int now = 2, count = 1, ans = 0, fg = 1;
ll test = 1;
rep(i, (int)so.size()) {
if (now == so[i]) {
count--;
if (count == 0) {
ans++;
fg++;
count = fg;
}
} else {
now = so[i];
ans++;
fg = 2;
count = 2;
}
}
cout << ans << '\n';
return (0);
}
| 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 <= n; i++) {
while (n % i == 0) {
p[i]++;
n /= i;
}
}
ll ans = 0;
if (n != 1)
ans++;
for (auto &&i : p) {
ll pnum = i;
ll cnt = 1;
while (pnum - cnt >= 0) {
ans++;
pnum -= cnt;
cnt++;
}
}
cout << ans << endl;
}
| #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 <= n; i++) {
while (n % i == 0) {
p[i]++;
n /= i;
}
}
ll ans = 0;
if (n != 1)
ans++;
for (auto &&i : p) {
ll pnum = i;
ll cnt = 1;
while (pnum - cnt >= 0) {
ans++;
pnum -= cnt;
cnt++;
}
}
cout << ans << endl;
}
| 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 == 0) {
n = n / i;
cnt++;
}
ans += upper_bound(lim + 1, lim + 1000, cnt) - lim - 1;
}
}
if (n != 1)
ans++;
cout << ans;
}
| #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) {
n = n / i;
cnt++;
}
ans += upper_bound(lim + 1, lim + 1000, cnt) - lim - 1;
}
}
if (n != 1)
ans++;
cout << ans;
}
| 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>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator<<(std::ostream &out, vector<pair<T, N>> &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T>> &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
map<long long, int> prime_factors_count;
while (n % 2 == 0) {
++prime_factors_count[2];
n >>= 1;
}
for (int i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
++prime_factors_count[i];
n /= i;
}
}
if (n > 2) {
++prime_factors_count[n];
}
int ans = 0;
for (auto it = prime_factors_count.begin(); it != prime_factors_count.end();
++it) {
int occs = it->second;
int use = 1;
while (occs >= use) {
occs -= use;
++ans;
++use;
}
}
cout << ans << "\n";
return 0;
} | #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>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator<<(std::ostream &out, vector<pair<T, N>> &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T>> &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
map<long long, int> prime_factors_count;
while (n % 2 == 0) {
++prime_factors_count[2];
n >>= 1;
}
for (long long i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
++prime_factors_count[i];
n /= i;
}
}
if (n > 2) {
++prime_factors_count[n];
}
int ans = 0;
for (auto it = prime_factors_count.begin(); it != prime_factors_count.end();
++it) {
int occs = it->second;
int use = 1;
while (occs >= use) {
occs -= use;
++ans;
++use;
}
}
cout << ans << "\n";
return 0;
} | 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 << "=" << z \
<< '\n'
#define rep(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define vi vector<int>
#define pi pair<int, int>
#define INF INT_MAX
#define _INF INT_MIN
#define TC 0
using namespace std;
using ll = long long;
#define MAXN 100001
int spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
vector<int> getFactorization(ll x) {
vector<int> ret;
while (x != 1) {
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
vector<ll> primeFactors(ll n) {
vector<ll> res;
while (n % 2 == 0) {
res.push_back(2);
n = n / 2;
}
for (ll i = 3; i * i <= n; i = i + 2) {
while (n % i == 0) {
res.push_back(i);
n = n / i;
}
}
if (n > 2)
res.push_back(n);
return res;
}
void testcase() {
// sieve();
ll n;
cin >> n;
vector<ll> fac = primeFactors(n);
sort(fac.begin(), fac.end());
int m = fac.size();
int i = 0;
int res = 0;
while (i < m) {
int cur = fac[i];
int ct = 0;
while (i < m && cur == fac[i]) {
ct++;
i++;
}
int sum = 0, c = 0;
while (true) {
sum += c;
if (sum > ct) {
c--;
break;
}
c++;
}
res += c;
}
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
if (TC)
cin >> t;
while (t--) {
testcase();
}
return 0;
} | // 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 << "=" << z \
<< '\n'
#define rep(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define vi vector<int>
#define pi pair<int, int>
#define INF INT_MAX
#define _INF INT_MIN
#define TC 0
using namespace std;
using ll = long long;
#define MAXN 100001
int spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
vector<int> getFactorization(ll x) {
vector<int> ret;
while (x != 1) {
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
vector<ll> primeFactors(ll n) {
vector<ll> res;
while (n % 2 == 0) {
res.push_back(2);
n = n / 2;
}
for (ll i = 3; i * i <= n; i = i + 2) {
while (n % i == 0) {
res.push_back(i);
n = n / i;
}
}
if (n > 2)
res.push_back(n);
return res;
}
void testcase() {
// sieve();
ll n;
cin >> n;
vector<ll> fac = primeFactors(n);
sort(fac.begin(), fac.end());
int m = fac.size();
int i = 0;
int res = 0;
while (i < m) {
ll cur = fac[i];
int ct = 0;
while (i < m && cur == fac[i]) {
ct++;
i++;
}
int sum = 0, c = 0;
while (true) {
sum += c;
if (sum > ct) {
c--;
break;
}
c++;
}
res += c;
}
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
if (TC)
cin >> t;
while (t--) {
testcase();
}
return 0;
} | 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;
long long q = p;
while (n % q == 0) {
++ans;
n /= q;
q *= p;
}
while (n % p == 0)
n /= p;
if (p > rt) {
++ans;
break;
}
}
cout << ans << endl;
} | #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;
long long q = p;
while (n % q == 0) {
++ans;
n /= q;
q *= p;
}
while (n % p == 0)
n /= p;
if (p > rt) {
++ans;
break;
}
}
cout << ans << endl;
} | 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) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> void printvec(const vector<T> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <class T> void printtree(const vector<vector<T>> &tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": ";
printvec(tree[i]);
}
}
template <class T, class U> void printmap(const map<T, U> &mp) {
for (auto x : mp) {
cout << x.first << "=>" << x.second << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define sz(x) (ll)(x).size()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
int main(int argc, char **argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
// cout << setprecision(10) << fixed;
vector<ll> dp(100);
dp[0] = 0;
for (int i = 1; i < 100; ++i) {
dp[i] = i * (i + 1) / 2;
}
// printvec(dp);
ll n;
cin >> n;
map<ll, ll> fs; // count of prime factors
{
int i = 2;
while (i * i <= n) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
++fs[i];
}
}
++i;
}
if (n > 1) {
++fs[n];
}
}
ll ans = 0;
for (auto &p : fs) {
ll cnt = p.second;
ll i = upper_bound(all(dp), cnt) - dp.begin();
ans += i - 1;
// cout << "cnt:" << cnt << endl;
// cout << "i:" << i << endl;
// ll tot = 0;
// ll i = 1;
// while (tot + i <= cnt) {
// tot += i;
// ++i;
// }
// // Here, i is available
// ans += i-1;
}
cout << ans << endl;
}
| #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) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> void printvec(const vector<T> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <class T> void printtree(const vector<vector<T>> &tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": ";
printvec(tree[i]);
}
}
template <class T, class U> void printmap(const map<T, U> &mp) {
for (auto x : mp) {
cout << x.first << "=>" << x.second << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define sz(x) (ll)(x).size()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
int main(int argc, char **argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
// cout << setprecision(10) << fixed;
vector<ll> dp(100);
dp[0] = 0;
for (int i = 1; i < 100; ++i) {
dp[i] = i * (i + 1) / 2;
}
// printvec(dp);
ll n;
cin >> n;
map<ll, ll> fs; // count of prime factors
{
ll i = 2;
while (i * i <= n) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
++fs[i];
}
}
++i;
}
if (n > 1) {
++fs[n];
}
}
ll ans = 0;
for (auto &p : fs) {
ll cnt = p.second;
ll i = upper_bound(all(dp), cnt) - dp.begin();
ans += i - 1;
// cout << "cnt:" << cnt << endl;
// cout << "i:" << i << endl;
// ll tot = 0;
// ll i = 1;
// while (tot + i <= cnt) {
// tot += i;
// ++i;
// }
// // Here, i is available
// ans += i-1;
}
cout << ans << endl;
}
| 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 x
yield n
for fac in facs(n):
while n % fac == 0:
n //= fac
prime_counter[fac] += 1
# ここで if fac * fac > n: braek を入れると，
# 計算量の少ないケースでは早く，多いケースでは遅くなる。
if n != 1:
prime_counter[n] += 1
ans = 0
for c in prime_counter.values():
for i, x in enumerate(acc):
if c < x:
tmp = i
break
ans += tmp
print(ans)
if __name__ == "__main__":
main()
| 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 x
for fac in facs(n):
while n % fac == 0:
n //= fac
prime_counter[fac] += 1
# ここで if fac * fac > n: braek を入れると，
# 計算量の少ないケースでは早く，多いケースでは遅くなる。
if n != 1:
prime_counter[n] += 1
ans = 0
for c in prime_counter.values():
for i, x in enumerate(acc):
if c < x:
tmp = i
break
ans += tmp
print(ans)
if __name__ == "__main__":
main()
| 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
if chk:
return n
if n in check:
return 0
else:
check[n] = 1
return 1
check = {}
n = int(input())
if n == 1:
print(0)
else:
while 1:
n = is_prime(n)
if n == 0:
break
ans = 0
for k, v in check.items():
for i in range(1, 50):
v -= i
if v < 0:
break
else:
ans += 1
# print(check)
print(ans)
| 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
if chk:
return n
if n in check:
return 0
else:
check[n] = 1
return 1
check = {}
n = int(input())
if n == 1:
print(0)
else:
while 1:
n = is_prime(n)
if n == 0:
break
ans = 0
for k, v in check.items():
for i in range(1, 50):
v -= i
if v < 0:
break
else:
ans += 1
# print(check)
print(ans)
| 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;
for (int i = 0; i < cnt; i++) {
if (N % p == 0) {
N /= p;
} else {
f = true;
break;
}
}
if (f)
break;
cnt++;
ans++;
}
if (p * p > N)
break;
}
if (N != 1)
ans++;
cout << ans << endl;
return 0;
} | #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;
for (int i = 0; i < cnt; i++) {
if (N % p == 0) {
N /= p;
} else {
f = true;
break;
}
}
if (f)
break;
cnt++;
ans++;
}
if (p * p > N)
break;
}
if (N != 1)
ans++;
cout << ans << endl;
return 0;
} | 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 push_front
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(x) (int)(x).size()
#define endl '\n'
#define FOR(a, b, c) for (auto(a) = (b); (a) < (c); ++(a))
#define ROF(a, b, c) for (auto(a) = (b); (a) > (c); --(a))
#define F0R(a, b) FOR((a), 0, (b))
#define R0F(a, b) ROF((a), (b), -1)
#define CEIL(a, b) ((a) + (b)-1) / (b)
#define SET(a, b) memset((a), (b), sizeof(a))
template <class t> bool ckmin(t &a, const t &b) {
return a > b ? a = b, true : false;
}
template <class t> bool ckmax(t &a, const t &b) {
return a < b ? a = b, true : false;
}
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout \
if (DEBUG) \
std::cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
template <class a, class b>
ostream &operator<<(ostream &o, const pair<a, b> &p);
template <class T> struct IsC {
template <class C> static char test(typename C::const_iterator *);
template <class C> static int test(...);
static const bool value = sizeof(test<T>(0)) == sizeof(char);
};
template <> struct IsC<string> {
static const bool value = false;
};
template <class C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &o,
const C &c) {
o << '[';
for (auto it = c.begin(); it != c.end();)
o << *it << (++it != c.end() ? ", " : "");
return o << ']';
}
template <class a, class b>
ostream &operator<<(ostream &o, const pair<a, b> &p) {
return o << '(' << p.fi << ", " << p.se << ')';
}
void solve() {
ll n;
cin >> n;
ll nn = n;
vi factors;
for (ll i = 2; i <= n; ++i) {
if (i * i > nn) {
assert(factors.empty());
factors.pb(1);
break;
}
int cnt = 0;
while (n % i == 0) {
n /= i;
++cnt;
}
if (cnt)
factors.eb(cnt);
}
int score = 0;
for (int cnt : factors) {
for (int i = 1; i <= cnt; ++i) {
++score;
cnt -= i;
}
}
cout << score << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
FOR(t, 1, tt + 1) {
// cout << "Case #" << t << ": ";
solve();
}
return 0;
}
| #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 push_front
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(x) (int)(x).size()
#define endl '\n'
#define FOR(a, b, c) for (auto(a) = (b); (a) < (c); ++(a))
#define ROF(a, b, c) for (auto(a) = (b); (a) > (c); --(a))
#define F0R(a, b) FOR((a), 0, (b))
#define R0F(a, b) ROF((a), (b), -1)
#define CEIL(a, b) ((a) + (b)-1) / (b)
#define SET(a, b) memset((a), (b), sizeof(a))
template <class t> bool ckmin(t &a, const t &b) {
return a > b ? a = b, true : false;
}
template <class t> bool ckmax(t &a, const t &b) {
return a < b ? a = b, true : false;
}
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout \
if (DEBUG) \
std::cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
template <class a, class b>
ostream &operator<<(ostream &o, const pair<a, b> &p);
template <class T> struct IsC {
template <class C> static char test(typename C::const_iterator *);
template <class C> static int test(...);
static const bool value = sizeof(test<T>(0)) == sizeof(char);
};
template <> struct IsC<string> {
static const bool value = false;
};
template <class C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &o,
const C &c) {
o << '[';
for (auto it = c.begin(); it != c.end();)
o << *it << (++it != c.end() ? ", " : "");
return o << ']';
}
template <class a, class b>
ostream &operator<<(ostream &o, const pair<a, b> &p) {
return o << '(' << p.fi << ", " << p.se << ')';
}
void solve() {
ll n;
cin >> n;
ll nn = n;
vi factors;
for (ll i = 2; i <= n; ++i) {
if (i * i > nn) {
factors.pb(1);
break;
}
int cnt = 0;
while (n % i == 0) {
n /= i;
++cnt;
}
if (cnt)
factors.eb(cnt);
}
int score = 0;
for (int cnt : factors) {
for (int i = 1; i <= cnt; ++i) {
++score;
cnt -= i;
}
}
cout << score << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
FOR(t, 1, tt + 1) {
// cout << "Case #" << t << ": ";
solve();
}
return 0;
}
| 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 (Aux % 2 == 0) {
Aux /= 2;
Canon.push_back({2, 1});
while (Aux % 2 == 0) {
Aux /= 2;
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % 3 == 0) {
Aux /= 3;
Canon.push_back({3, 1});
while (Aux % 3 == 0) {
Aux /= 3;
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % 5 == 0) {
Aux /= 5;
Canon.push_back({5, 1});
while (Aux % 5 == 0) {
Aux /= 5;
Canon[Canon.size() - 1].second += 1;
}
}
for (i = 6; i * i <= Aux; i += 6) {
if (Aux % (i + 1) == 0) {
Aux /= (i + 1);
Canon.push_back({i + 1, 1});
while (Aux % (i + 1) == 0) {
Aux /= (i + 1);
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % (i + 5) == 0) {
Aux /= (i + 5);
Canon.push_back({i + 5, 1});
while (Aux % (i + 5) == 0) {
Aux /= (i + 5);
Canon[Canon.size() - 1].second += 1;
}
}
}
if (Aux > 1)
Canon.push_back({Aux, 1});
Prec();
int Ans = 0;
for (i = 0; i < Canon.size(); i++) {
j = 1;
while (Canon[i].second >= Gau[j])
j += 1;
Ans += j - 1;
}
cout << Ans;
}
| #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 (Aux % 2 == 0) {
Aux /= 2;
Canon.push_back({2, 1});
while (Aux % 2 == 0) {
Aux /= 2;
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % 3 == 0) {
Aux /= 3;
Canon.push_back({3, 1});
while (Aux % 3 == 0) {
Aux /= 3;
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % 5 == 0) {
Aux /= 5;
Canon.push_back({5, 1});
while (Aux % 5 == 0) {
Aux /= 5;
Canon[Canon.size() - 1].second += 1;
}
}
for (i = 6; i * i <= Aux; i += 6) {
if (Aux % (i + 1) == 0) {
Aux /= (i + 1);
Canon.push_back({i + 1, 1});
while (Aux % (i + 1) == 0) {
Aux /= (i + 1);
Canon[Canon.size() - 1].second += 1;
}
}
if (Aux % (i + 5) == 0) {
Aux /= (i + 5);
Canon.push_back({i + 5, 1});
while (Aux % (i + 5) == 0) {
Aux /= (i + 5);
Canon[Canon.size() - 1].second += 1;
}
}
}
if (Aux > 1)
Canon.push_back({Aux, 1});
Prec();
int Ans = 0;
for (i = 0; i < Canon.size(); i++) {
j = 1;
while (Canon[i].second >= Gau[j])
j += 1;
Ans += j - 1;
}
cout << Ans;
}
| 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) cerr << endl << #a << " : " << a << endl
#define chk2(a, b) \
cerr << endl << #a << " : " << a << "\t" << #b << " : " << b << endl
#define chk3(a, b, c) \
cerr << endl \
<< #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " \
<< c << endl
#define chk4(a, b, c, d) \
cerr << endl \
<< #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " \
<< c << "\t" << #d << " : " << d << endl
#define rep(i, a, n) for (i = a; i < n; i++)
#define rev(i, a, n) for (i = a; i >= n; i--)
#define MSV(A, a) memset(A, a, sizeof(A))
#define rep_itr(itr, c) for (itr = (c).begin(); itr != (c).end(); itr++)
using namespace std;
inline void inp(int &n) {
n = 0;
int ch = getcx();
int sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getcx();
}
while (ch >= '0' && ch <= '9')
n = (n << 3) + (n << 1) + ch - '0', ch = getcx();
n = n * sign;
}
inline void inp1(LL &n) {
n = 0;
LL ch = getcx();
LL sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getcx();
}
while (ch >= '0' && ch <= '9')
n = (n << 3) + (n << 1) + ch - '0', ch = getcx();
n = n * sign;
}
int main() {
LL n;
cin >> n;
LL c = n;
vector<pair<int, int>> v;
for (int i = 2; i * i <= n; i++) {
int cnt = 0;
while (c % i == 0) {
cnt++;
c /= i;
}
v.PB(MP(i, cnt));
}
if (c > 1)
v.PB(MP(c, 1));
LL ans = 0;
for (int i = 0; i < v.size(); i++) {
int val = v[i].Y;
int s = 1;
while (val > 0) {
if (val - s > s) {
ans++;
val -= s;
} else {
ans++;
val = 0;
}
s++;
}
}
cout << ans << endl;
return 0;
}
| /*
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) cerr << endl << #a << " : " << a << endl
#define chk2(a, b) \
cerr << endl << #a << " : " << a << "\t" << #b << " : " << b << endl
#define chk3(a, b, c) \
cerr << endl \
<< #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " \
<< c << endl
#define chk4(a, b, c, d) \
cerr << endl \
<< #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " \
<< c << "\t" << #d << " : " << d << endl
#define rep(i, a, n) for (i = a; i < n; i++)
#define rev(i, a, n) for (i = a; i >= n; i--)
#define MSV(A, a) memset(A, a, sizeof(A))
#define rep_itr(itr, c) for (itr = (c).begin(); itr != (c).end(); itr++)
using namespace std;
inline void inp(int &n) {
n = 0;
int ch = getcx();
int sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getcx();
}
while (ch >= '0' && ch <= '9')
n = (n << 3) + (n << 1) + ch - '0', ch = getcx();
n = n * sign;
}
inline void inp1(LL &n) {
n = 0;
LL ch = getcx();
LL sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getcx();
}
while (ch >= '0' && ch <= '9')
n = (n << 3) + (n << 1) + ch - '0', ch = getcx();
n = n * sign;
}
int main() {
LL n;
cin >> n;
LL c = n;
vector<pair<int, int>> v;
for (LL i = 2; i * i <= n; i++) {
int cnt = 0;
while (c % i == 0) {
cnt++;
c /= i;
}
v.PB(MP(i, cnt));
}
if (c > 1)
v.PB(MP(c, 1));
LL ans = 0;
for (int i = 0; i < v.size(); i++) {
int val = v[i].Y;
int s = 1;
while (val > 0) {
if (val - s > s) {
ans++;
val -= s;
} else {
ans++;
val = 0;
}
s++;
}
}
cout << ans << endl;
return 0;
}
| 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>
#include <vector>
// #include <ostream>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
bool sosuhantei(ll x) {
if (x == 1)
return false;
if (x == 2)
return true;
if (x == 3)
return true;
int i = 2;
bool res = true;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
res = false;
break;
}
}
return res;
}
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
ll M = N;
ll max = 1;
for (ll i = 1; i * i <= N; i++)
max = i;
vector<ll> num;
map<ll, ll> cnt;
for (int i = 2; i <= max; i++) {
if (M % i == 0)
num.push_back(i);
while (M % i == 0) {
cnt[i]++;
M /= i;
}
if (sosuhantei(M)) {
num.push_back(M);
cnt[M]++;
break;
}
} /*
rep(i,num.size()){
cout << num[i] << " ";
}
cout << endl;
*/
ll ans = 0;
for (int i = 0; i < num.size(); i++) {
int j = 1;
while (cnt[num[i]] - j >= 0) {
cnt[num[i]] -= j;
j++;
ans++;
}
}
cout << ans << endl;
}
| // 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>
#include <vector>
// #include <ostream>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
bool sosuhantei(ll x) {
if (x == 1)
return false;
if (x == 2)
return true;
if (x == 3)
return true;
int i = 2;
bool res = true;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
res = false;
break;
}
}
return res;
}
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
ll M = N;
ll max = 1;
for (ll i = 1; i * i <= N; i++)
max = i;
vector<ll> num;
map<ll, ll> cnt;
for (int i = 2; i <= max; i++) {
if (M % i == 0)
num.push_back(i);
while (M % i == 0) {
cnt[i]++;
M /= i;
}
}
if (M != 1) {
num.push_back(M);
cnt[M]++;
}
/*
rep(i,num.size()){
cout << num[i] << " ";
}
cout << endl;
*/
ll ans = 0;
for (int i = 0; i < num.size(); i++) {
int j = 1;
while (cnt[num[i]] - j >= 0) {
cnt[num[i]] -= j;
j++;
ans++;
}
}
cout << ans << endl;
}
| 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 pair<double, int> P;
const ll linf = (1ll << 61);
const int inf = 1001001001;
const int mod = 1000000007;
template <typename T> map<T, ll> factorize(T x) {
map<T, ll> res;
for (int i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
res[i]++;
}
}
if (x != 1)
res[x]++;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
map<ll, ll> mp = factorize(n);
ll ans = 0;
for (auto &c : mp) {
int k = -1;
for (int i = 1; i * (i + 1) / 2 <= c.second; ++i) {
k = i;
}
if (k == -1)
continue;
ans += k;
}
cout << ans << endl;
return 0;
}
| #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 pair<double, int> P;
const ll linf = (1ll << 61);
const int inf = 1001001001;
const int mod = 1000000007;
template <typename T> map<T, ll> factorize(T x) {
map<T, ll> res;
for (ll i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
res[i]++;
}
}
if (x != 1)
res[x]++;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
map<ll, ll> mp = factorize(n);
ll ans = 0;
for (auto &c : mp) {
int k = -1;
for (int i = 1; i * (i + 1) / 2 <= c.second; ++i) {
k = i;
}
if (k == -1)
continue;
ans += k;
}
cout << ans << endl;
return 0;
}
| 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")
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles \
ifstream cin("input.txt"); \
ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)
// #define for(int i=0;i<n;i++) for(ll i=0;i<n;i++)
using namespace std;
// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
ll inf = 1e18, mod2 = 998244353, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
: sqr(binpow(a, b / 2, mod)) % mod)
: 1;
}
ll binmult(ll a, ll b, ll mod) {
return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
: (2 * binmult(a, b / 2, mod)) % mod)
: 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// const ll to[5]={0,4,6,7,9};
// const ll N=2*1e5+1;
const ll R = 1e4;
// const ll to[7]={1,2,3,1,3,2,1};
// const ll tx[4]={0,0,-1,1};
// const ll ty[4]={-1,1,0,0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const ll N = 2 * 1e5 + 4;
// set<int> lol2[26][26];
// set<int>ab;
// set<int>ba;
signed main() {
fast_io;
ll n;
cin >> n;
ll ans = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
ll D = 1 + 8 * cnt;
ll x = ((ld)-1 + sqrt(D)) / 2;
ans += x;
}
if (n > 1) {
ans++;
}
cout << ans;
return 0;
}
/*
(x+1)*x/2=cnt
cnt*2=(x+1)*x
x^2+x-2*cnt=0;
D=1+8*cnt
x1=(-1+D)/2
если WA , то чекер говно, поэтому почекай l8 строчку
!x || !y x-проигрышная или выигрышная , y-колво таких позиций
x==0 проигрышная
y==0 четное проигрышных или четное выигрышных
x==0 && y==0 четное проигрышных
*/
| #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")
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles \
ifstream cin("input.txt"); \
ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)
// #define for(int i=0;i<n;i++) for(ll i=0;i<n;i++)
using namespace std;
// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
ll inf = 1e18, mod2 = 998244353, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
: sqr(binpow(a, b / 2, mod)) % mod)
: 1;
}
ll binmult(ll a, ll b, ll mod) {
return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
: (2 * binmult(a, b / 2, mod)) % mod)
: 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// const ll to[5]={0,4,6,7,9};
// const ll N=2*1e5+1;
const ll R = 1e4;
// const ll to[7]={1,2,3,1,3,2,1};
// const ll tx[4]={0,0,-1,1};
// const ll ty[4]={-1,1,0,0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const ll N = 2 * 1e5 + 4;
// set<int> lol2[26][26];
// set<int>ab;
// set<int>ba;
signed main() {
fast_io;
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
ll D = 1 + 8 * cnt;
ll x = ((ld)-1 + sqrt(D)) / 2;
ans += x;
}
if (n > 1) {
ans++;
}
cout << ans;
return 0;
}
/*
(x+1)*x/2=cnt
cnt*2=(x+1)*x
x^2+x-2*cnt=0;
D=1+8*cnt
x1=(-1+D)/2
если WA , то чекер говно, поэтому почекай l8 строчку
!x || !y x-проигрышная или выигрышная , y-колво таких позиций
x==0 проигрышная
y==0 четное проигрышных или четное выигрышных
x==0 && y==0 четное проигрышных
*/
| 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>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define lnd '\n'
// #define reverse(i, n) for(ll i = n-1; i >= 0; --i)
#define from(i, n) for (ll i = 0; i < n; ++i)
#define loop(i, n) for (ll i = 0; i < n; i++)
#define REPN(i, n) for (ll i = 1; i <= n; ++i)
#define ALL(s) (s).begin(), (s).end()
#define rALL(s) (s).rbegin(), (s).rend()
#define sz(s) (int)(s).size()
#define mk make_pair
#define pb push_back
#define sqr(s) ((s) * (s))
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
template <class T> T GCD(T a, T b) {
if (a == 0)
return b;
return GCD(b % a, a);
}
template <class T> T LCM(T a, T b) { return a * b / GCM(a, b); }
template <class T> T modpow(T x, T p) {
T res = 1;
while (p > 0) {
if (p & 1)
res *= x;
x *= x;
p /= 2;
}
return res;
}
template <class T> T modpow(T x, T p, ll mod) {
T res = 1;
while (p > 0) {
if (p & 1)
res = (res * x) % mod;
x = (x * x) % mod;
p /= 2;
}
return res % mod;
}
template <class T> void print(T a[], ll n) {
for (ll i = 0; i < n; i++)
std::cout << a[i] << ' ';
cout << endl;
}
template <class T> void printc(T c) {
for (auto const &v : c)
std::cout << v << ' ';
cout << endl;
}
struct HASH {
size_t operator()(const pair<long, long> &x) const {
return hash<long long>()(((long long)x.first) ^
(((long long)x.second) << 32));
}
};
bool pair_sort(const pair<int, int> &p1, const pair<int, int> &p2) {
if (p1.first != p2.first)
return p1.first < p2.first;
else
return p1.second < p2.second;
}
const int INF = std::numeric_limits<int>::max();
const ll M_INF = std::numeric_limits<ll>::min();
const ll LL_INF = std::numeric_limits<ll>::max();
void solution();
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solution();
return 0;
}
void solution() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i <= n; i++) {
if (n % i)
continue;
ll count = 0;
while (n % i == 0) {
n = n / i;
count++;
}
ll index = 1;
while (count >= index) {
ans++;
count -= index;
index++;
}
}
if (n > 1)
ans++;
cout << ans << endl;
}
| #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>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define lnd '\n'
// #define reverse(i, n) for(ll i = n-1; i >= 0; --i)
#define from(i, n) for (ll i = 0; i < n; ++i)
#define loop(i, n) for (ll i = 0; i < n; i++)
#define REPN(i, n) for (ll i = 1; i <= n; ++i)
#define ALL(s) (s).begin(), (s).end()
#define rALL(s) (s).rbegin(), (s).rend()
#define sz(s) (int)(s).size()
#define mk make_pair
#define pb push_back
#define sqr(s) ((s) * (s))
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
template <class T> T GCD(T a, T b) {
if (a == 0)
return b;
return GCD(b % a, a);
}
template <class T> T LCM(T a, T b) { return a * b / GCM(a, b); }
template <class T> T modpow(T x, T p) {
T res = 1;
while (p > 0) {
if (p & 1)
res *= x;
x *= x;
p /= 2;
}
return res;
}
template <class T> T modpow(T x, T p, ll mod) {
T res = 1;
while (p > 0) {
if (p & 1)
res = (res * x) % mod;
x = (x * x) % mod;
p /= 2;
}
return res % mod;
}
template <class T> void print(T a[], ll n) {
for (ll i = 0; i < n; i++)
std::cout << a[i] << ' ';
cout << endl;
}
template <class T> void printc(T c) {
for (auto const &v : c)
std::cout << v << ' ';
cout << endl;
}
struct HASH {
size_t operator()(const pair<long, long> &x) const {
return hash<long long>()(((long long)x.first) ^
(((long long)x.second) << 32));
}
};
bool pair_sort(const pair<int, int> &p1, const pair<int, int> &p2) {
if (p1.first != p2.first)
return p1.first < p2.first;
else
return p1.second < p2.second;
}
const int INF = std::numeric_limits<int>::max();
const ll M_INF = std::numeric_limits<ll>::min();
const ll LL_INF = std::numeric_limits<ll>::max();
void solution();
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solution();
return 0;
}
void solution() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i)
continue;
ll count = 0;
while (n % i == 0) {
n = n / i;
count++;
}
ll index = 1;
while (count >= index) {
ans++;
count -= index;
index++;
}
}
if (n > 1)
ans++;
cout << ans << endl;
}
| 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) {
d -= k;
k++;
}
cnt += k - 1;
}
cout << cnt << endl;
} | #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) {
d -= k;
k++;
}
cnt += k - 1;
}
cout << cnt << endl;
}
| 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]++;
}
else
i++;
}
long long ans = 0;
if (N == tempN) {
printf("1");
return 0;
}
else if (N > 1) {
freq[N]++;
ans++;
}
i = 0;
while (true) {
sums.push_back(i * (i + 1) / 2);
if (sums.back() >= (long long)(1E6) * (long long)(1E6))
break;
i++;
}
for (long long int i = 0; i < 1000005; i++) {
if (freq[i] == 0)
continue;
long long pos =
upper_bound(sums.begin(), sums.end(), freq[i]) - sums.begin();
ans += pos - 1;
}
printf("%lld", ans);
}
| #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]++;
}
else
i++;
}
long long ans = 0;
if (N == tempN) {
printf("1");
return 0;
}
else if (N > 1) {
// freq[N]++;
ans++;
}
i = 0;
while (true) {
sums.push_back(i * (i + 1) / 2);
if (sums.back() >= (long long)(1E6) * (long long)(1E6))
break;
i++;
}
for (long long int i = 0; i < 1000005; i++) {
if (freq[i] == 0)
continue;
long long pos =
upper_bound(sums.begin(), sums.end(), freq[i]) - sums.begin();
ans += pos - 1;
}
printf("%lld", ans);
}
| 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;
for (auto p : A) {
int b = 1;
int y = p.second;
while (y >= b) {
y -= b;
b++;
count++;
}
}
cout << count << endl;
}
| #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 = 0;
for (auto p : A) {
int b = 1;
int y = p.second;
while (y >= b) {
y -= b;
b++;
count++;
}
}
cout << count << endl;
}
| 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, n) for (i = x; i >= n; i--)
#define pu push_back
#define pp pop_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SP(x) fixed << setprecision(x)
#define IOS() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long INF = INT_MAX;
const long long LINF = LLONG_MAX;
const long long N = 1e18;
typedef long long ll;
typedef long double ld;
using u128 = __uint128_t;
void test_case() {
ll n, i, j;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
}
set<pair<ll, ll>> s;
ll zz = n;
ll res = 0;
if (n % 2 == 0) {
s.insert({2, 2});
while (n % 2 == 0)
n /= 2;
}
for (i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
s.insert({i, i});
while (n % i == 0)
n /= i;
}
}
if (n > 1) {
s.insert({n, n});
}
n = zz;
while (n >= (*s.begin()).F) {
auto it = s.begin();
ll x = (*it).F, y = (*it).S;
if (n % x == 0) {
res++;
n /= x;
}
ll z = x * y;
s.insert({z, y});
s.erase(it);
}
cout << res << '\n';
}
int32_t main() {
IOS();
int tc = 1;
// cin>>tc;
while (tc--)
test_case();
return 0;
}
| /*** 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, n) for (i = x; i >= n; i--)
#define pu push_back
#define pp pop_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SP(x) fixed << setprecision(x)
#define IOS() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long INF = INT_MAX;
const long long LINF = LLONG_MAX;
const long long N = 1e18;
typedef long long ll;
typedef long double ld;
using u128 = __uint128_t;
void test_case() {
ll n, i, j;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
return;
}
set<pair<ll, ll>> s;
ll zz = n;
ll res = 0;
if (n % 2 == 0) {
s.insert({2, 2});
while (n % 2 == 0)
n /= 2;
}
for (i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
s.insert({i, i});
while (n % i == 0)
n /= i;
}
}
if (n > 1) {
s.insert({n, n});
}
n = zz;
while (n >= (*s.begin()).F) {
auto it = s.begin();
ll x = (*it).F, y = (*it).S;
if (n % x == 0) {
res++;
n /= x;
}
ll z = x * y;
s.insert({z, y});
s.erase(it);
}
cout << res << '\n';
}
int32_t main() {
IOS();
int tc = 1;
// cin>>tc;
while (tc--)
test_case();
return 0;
}
| 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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define REPR1(i, n) for (ll i = n; i >= 1; i--)
#define FOR1(i, m, n) for (ll i = m; i <= n; i++)
const ll INF = LLONG_MAX;
#define VEC(type, A, N) vector<type> A(N)
#define VECi(type, A, N, i) vector<type> A(N, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N, vector<type>(M))
#define VEC2i(type, A, N, M, i) vector<vector<type>> A(N, vector<type>(M, i))
#define ALL(v) v.begin(), v.end()
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
vector<ll> getPrime(ll N) {
vector<ll> p = {2};
for (ll i = 2; i * i <= N; i++) {
for (ll j = 0; j <= p.size(); j++) {
}
}
return p;
}
bool isp(ll N) {
if (N == 1)
return false;
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0;
return 0;
}
ll soi;
ll ii;
ll cnt = 0;
for (ii = 2; ii < sqrt(N); ii++) {
if (N % ii == 0) {
soi = 0;
while (true) {
if (N % ii == 0) {
N /= ii;
soi++;
} else
break;
}
// sl(ii,soi[ii],N)
ll t = soi;
ll o = 1;
while (t != 0) {
// sl(t,ii);
t -= o++;
cnt++;
}
}
}
// sl(N)
if (N != 1)
cnt++;
cout << cnt;
// cout<<fixed<<setprecision(32)<<m;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| #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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define REPR1(i, n) for (ll i = n; i >= 1; i--)
#define FOR1(i, m, n) for (ll i = m; i <= n; i++)
const ll INF = LLONG_MAX;
#define VEC(type, A, N) vector<type> A(N)
#define VECi(type, A, N, i) vector<type> A(N, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N, vector<type>(M))
#define VEC2i(type, A, N, M, i) vector<vector<type>> A(N, vector<type>(M, i))
#define ALL(v) v.begin(), v.end()
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
vector<ll> getPrime(ll N) {
vector<ll> p = {2};
for (ll i = 2; i * i <= N; i++) {
for (ll j = 0; j <= p.size(); j++) {
}
}
return p;
}
bool isp(ll N) {
if (N == 1)
return false;
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0;
return 0;
}
ll soi;
ll ii;
ll cnt = 0;
for (ii = 2; ii < sqrt(N); ii++) {
if (N % ii == 0) {
soi = 0;
while (true) {
if (N % ii == 0) {
N /= ii;
soi++;
} else
break;
}
// sl(ii,soi[ii],N)
ll t = soi;
for (ll j = 1;; j++) {
if (t >= j) {
t -= j;
cnt++;
} else
break;
}
}
}
// sl(N)
if (N != 1)
cnt++;
cout << cnt;
// cout<<fixed<<setprecision(32)<<m;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| 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, c));
}
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
int c = 0;
while (n % i == 0) {
n /= i;
c++;
}
v.push_back(make_pair(i, c));
}
}
int ans = 0;
for (auto _v : v) {
for (int i = 1; i * (i - 1) / 2 <= _v.second; i++) {
ans++;
}
ans--;
}
if (n != 1)
ans += 1;
cout << ans << endl;
return 0;
} | #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, c));
}
for (long long i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
int c = 0;
while (n % i == 0) {
n /= i;
c++;
}
v.push_back(make_pair(i, c));
}
}
int ans = 0;
for (auto _v : v) {
for (int i = 1; i * (i - 1) / 2 <= _v.second; i++) {
ans++;
}
ans--;
}
if (n != 1)
ans += 1;
cout << ans << endl;
return 0;
} | 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) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
int tmp = 1;
while (cnt >= tmp) {
++ans;
cnt -= tmp;
++tmp;
}
}
}
if (n != 1)
++ans;
cout << ans << endl;
} | #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 cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
int tmp = 1;
while (cnt >= tmp) {
++ans;
cnt -= tmp;
++tmp;
}
}
}
if (n != 1)
++ans;
cout << ans << endl;
} | 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)
++ans;
cout << ans << endl;
return 0;
} | #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 != 1)
++ans;
cout << ans << endl;
return 0;
} | 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) cout << #i << " = " << i << ", ";
#define wre(i) cout << #i << " = " << i << endl;
#define all(v) v.begin(), v.end()
typedef long long ll;
#define lim 1000000007LL
typedef unsigned long long ull;
#define M 100006LL
using u64 = uint64_t;
// using i128= __int128;
// typedef unsigned int uint128_t __attribute__((mode(TI)));
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll fact(ll n) {
ll ans = 1LL;
while (n)
ans *= (n--);
return ans;
}
ll phi(ll n) {
ll res = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
res -= res / i;
}
}
if (n > 1)
res -= res / n;
return res;
}
ll a[100][100];
void sparse(vector<ll> v) {
ll n = v.size();
ll k = log2(n) + 1;
for (int i = 0; i < n; i++)
a[i][0] = v[i];
for (int j = 1; j <= k; j++) {
for (int i = 0; i + (1 << j) <= n; i++)
a[i][j] = a[i][j - 1] + a[i + (1 << (j - 1))][j - 1];
}
}
int main() {
fast ll t = 1LL;
for (; t; t--) {
ll n;
cin >> n;
map<ll, ll> m;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n > 1)
m[n]++;
ll cn = 0LL;
for (auto x : m) {
// wr(x.first)wre(x.second);
ll tmp = 0LL;
ll i = x.second;
while (i > 0) {
tmp++;
i -= tmp;
if (i < 0)
break;
cn++;
}
}
cout << cn;
}
} | // '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) cout << #i << " = " << i << ", ";
#define wre(i) cout << #i << " = " << i << endl;
#define all(v) v.begin(), v.end()
typedef long long ll;
#define lim 1000000007LL
typedef unsigned long long ull;
#define M 100006LL
using u64 = uint64_t;
// using i128= __int128;
// typedef unsigned int uint128_t __attribute__((mode(TI)));
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll fact(ll n) {
ll ans = 1LL;
while (n)
ans *= (n--);
return ans;
}
ll phi(ll n) {
ll res = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
res -= res / i;
}
}
if (n > 1)
res -= res / n;
return res;
}
ll a[100][100];
void sparse(vector<ll> v) {
ll n = v.size();
ll k = log2(n) + 1;
for (int i = 0; i < n; i++)
a[i][0] = v[i];
for (int j = 1; j <= k; j++) {
for (int i = 0; i + (1 << j) <= n; i++)
a[i][j] = a[i][j - 1] + a[i + (1 << (j - 1))][j - 1];
}
}
int main() {
fast ll t = 1LL;
for (; t; t--) {
ll n;
cin >> n;
map<ll, ll> m;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n > 1)
m[n]++;
ll cn = 0LL;
for (auto x : m) {
// wr(x.first)wre(x.second);
ll tmp = 0LL;
ll i = x.second;
while (i > 0) {
tmp++;
i -= tmp;
if (i < 0)
break;
cn++;
}
}
cout << cn;
}
} | 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;
}
if (a >= 3) {
for (int64_t i = 2; i <= sqrt(a); i++) {
c = 0;
if (a % i == 0) {
vec.push_back(i);
a = a / i;
c = 1;
break;
}
}
}
if (c == 0) {
vec.push_back(a);
break;
}
}
sort(vec.begin(), vec.end());
vec.push_back(4);
int64_t t = vec.size();
for (int64_t i = 0; i < t - 1; i++) {
if (vec.at(i) == vec.at(i + 1)) {
z++;
} else {
ans.push_back(z + 1);
z = 0;
}
}
int64_t s = ans.size();
for (int64_t i = 0; i < s; i++) {
for (int64_t j = 0; j < 100; j++) {
if (j * (j + 1) / 2 <= ans.at(i) && ans.at(i) < (j + 1) * (j + 2) / 2) {
h = h + j;
break;
}
}
}
}
cout << h << endl;
} | #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;
}
if (a >= 3) {
c = 0;
for (int64_t i = 2; i <= sqrt(a); i++) {
c = 0;
if (a % i == 0) {
vec.push_back(i);
a = a / i;
c = 1;
break;
}
}
}
if (c == 0) {
vec.push_back(a);
break;
}
}
sort(vec.begin(), vec.end());
vec.push_back(4);
int64_t t = vec.size();
for (int64_t i = 0; i < t - 1; i++) {
if (vec.at(i) == vec.at(i + 1)) {
z++;
} else {
ans.push_back(z + 1);
z = 0;
}
}
int64_t s = ans.size();
for (int64_t i = 0; i < s; i++) {
for (int64_t j = 0; j < 100; j++) {
if (j * (j + 1) / 2 <= ans.at(i) && ans.at(i) < (j + 1) * (j + 2) / 2) {
h = h + j;
break;
}
}
}
}
cout << h << endl;
} | 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; \
cin >> x; \
while (x--)
#define ps(x, y) fixed << setprecision(y) << x;
#define fo(i, j, k, in) for (ll i = j; i < k; i += in)
#define re(i, j) fo(i, 0, j, 1)
#define pi 3.1415926535897932384626433832795
#define all(cont) cont.begin(), cont.end()
#define countbit(x) __builtin_popcount(x)
#define mod 1000000007
#define lo lower_bound
#define de(n) \
ll n; \
cin >> n;
#define def(a, n) \
ll n; \
cin >> n; \
ll a[n]; \
re(i, n) { cin >> a[i]; }
#define z 1000000000000000000
using namespace std;
ll ab(ll a, ll b) {
if (a > b)
return a - b;
return b - a;
}
ll factor(ll n) {
ll ans = 0;
for (ll j = 1; j * j <= n; j++) {
if (n % j == 0) {
if (j * j == n)
ans++;
else {
ans += 2;
}
}
}
return ans;
}
ll power(ll x, ll y, ll p) {
int res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll pow(ll x, ll y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
void cp() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<ll> get_prime_factors_less_than(ll n) {
vector<ll> factor;
vector<ll> prime(n, 1);
prime[0] = 0, prime[1] = 0;
for (ll i = 2; i <= n; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= n; j = j + i)
prime[j] = 0;
factor.push_back(i);
}
}
return factor;
}
ll digit(ll n) {
ll q = 0;
while (n > 0) {
q++;
n /= 10;
}
return q;
}
ll sq(ll n) { return n * n; }
ll NR(ll n, ll r) {
long long p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
// gcd of p, k
long long m = __gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else
p = 1;
// if our approach is correct p = ans and k =1
return p;
}
bool isPrime(ll n) {
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int main() {
cp();
de(n);
if (n == 1) {
cout << "0\n";
exit(0);
}
ll ans = 0;
ll k = 1;
ll g = 2;
if (isPrime(n) == true) {
cout << "1\n";
exit(0);
}
while (n % pow(g, k) == 0) {
n /= pow(g, k);
ans++;
k++;
}
while (n % 2 == 0) {
n /= 2;
}
for (ll g = 3; g <= n; g += 2) {
k = 1;
while (n % pow(g, k) == 0) {
n /= pow(g, k);
ans++;
k++;
}
while (n % g == 0) {
n /= g;
}
if (isPrime(n) == true) {
ans++;
break;
}
if (n < g)
break;
}
cout << ans;
return 0;
} | #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; \
cin >> x; \
while (x--)
#define ps(x, y) fixed << setprecision(y) << x;
#define fo(i, j, k, in) for (ll i = j; i < k; i += in)
#define re(i, j) fo(i, 0, j, 1)
#define pi 3.1415926535897932384626433832795
#define all(cont) cont.begin(), cont.end()
#define countbit(x) __builtin_popcount(x)
#define mod 1000000007
#define lo lower_bound
#define de(n) \
ll n; \
cin >> n;
#define def(a, n) \
ll n; \
cin >> n; \
ll a[n]; \
re(i, n) { cin >> a[i]; }
#define z 1000000000000000000
using namespace std;
ll ab(ll a, ll b) {
if (a > b)
return a - b;
return b - a;
}
ll factor(ll n) {
ll ans = 0;
for (ll j = 1; j * j <= n; j++) {
if (n % j == 0) {
if (j * j == n)
ans++;
else {
ans += 2;
}
}
}
return ans;
}
ll power(ll x, ll y, ll p) {
int res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll pow(ll x, ll y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
void cp() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<ll> get_prime_factors_less_than(ll n) {
vector<ll> factor;
vector<ll> prime(n, 1);
prime[0] = 0, prime[1] = 0;
for (ll i = 2; i <= n; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= n; j = j + i)
prime[j] = 0;
factor.push_back(i);
}
}
return factor;
}
ll digit(ll n) {
ll q = 0;
while (n > 0) {
q++;
n /= 10;
}
return q;
}
ll sq(ll n) { return n * n; }
ll NR(ll n, ll r) {
long long p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
// gcd of p, k
long long m = __gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else
p = 1;
// if our approach is correct p = ans and k =1
return p;
}
bool isPrime(ll n) {
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int main() {
cp();
de(n);
if (n == 1) {
cout << "0\n";
exit(0);
}
ll ans = 0;
ll k = 1;
ll g = 2;
if (isPrime(n) == true) {
cout << "1\n";
exit(0);
}
while (n % pow(g, k) == 0) {
n /= pow(g, k);
ans++;
k++;
}
while (n % 2 == 0) {
n /= 2;
}
// cout<<ans<<"kk\n";
if (n == 3 || n == 5 || n == 7) {
ans++;
} else {
for (ll g = 3; g * g <= n; g += 2) {
k = 1;
bool change = 0;
while (n % pow(g, k) == 0) {
n /= pow(g, k);
ans++;
k++;
change = 1;
}
while (n % g == 0) {
change = 1;
n /= g;
}
if (change == 1) {
if (isPrime(n) == true) {
ans++;
break;
}
}
if (n < g)
break;
}
}
cout << ans;
return 0;
} | 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 = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int c = 0;
while (n % i == 0) {
c++;
n /= i;
}
for (int j = 1; j <= c; j++) {
ans++;
c -= j;
}
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 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 string EMP = " ";
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
int c = 0;
while (n % i == 0) {
c++;
n /= i;
}
for (int j = 1; j <= c; j++) {
ans++;
c -= j;
}
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
}
| 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;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
for (int j = 1; j <= cnt; j++) {
ans++;
cnt -= j;
}
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 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;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
for (int j = 1; j <= cnt; j++) {
ans++;
cnt -= j;
}
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 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 main() {
ll n;
cin >> n;
map<ll, ll> mp = factorization(n);
ll ans = 0;
for (auto x : mp) {
ll i = 1;
while (x.second >= i) {
ans++;
x.second -= i;
i++;
}
}
cout << ans << endl;
} | #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 main() {
ll n;
cin >> n;
map<ll, ll> mp = factorization(n);
ll ans = 0;
for (auto x : mp) {
ll i = 1;
while (x.second >= i) {
ans++;
x.second -= i;
i++;
}
}
cout << ans << endl;
} | 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;
}
}
if (N != 1)
ans++;
cout << ans << endl;
}
| #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;
}
}
if (N != 1)
ans++;
cout << ans << endl;
}
| 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};
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
inline void fastIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << ' ' << H;
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif
bool isPrime(ll x) {
if (x == 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
fastIO();
ll n, ans = 0, c = 10;
cin >> n;
set<ll> factors;
vector<ll> prime_factors;
map<ll, ll> reps;
map<ll, ll> seen_primes;
factors.insert(n);
for (int i = 2; i <= sqrt(n) + c; i++) {
if (n % i == 0) {
factors.insert(i);
if (n % (n / i) == 0) {
factors.insert(n / i);
}
}
}
for (set<ll>::iterator it = factors.begin(); it != factors.end(); it++) {
ll value = *it;
if (isPrime(value)) {
while (n % value == 0) {
prime_factors.push_back(value);
n /= value;
}
}
}
for (int i = 0; i < prime_factors.size(); i++) {
reps[prime_factors[i]]++;
}
for (int i = 0; i < prime_factors.size(); i++) {
ll take = 1;
if (seen_primes[prime_factors[i]] > 0)
continue;
while (reps[prime_factors[i]] - take >= 0) {
reps[prime_factors[i]] -= take, take++, ans++;
}
seen_primes[prime_factors[i]]++;
}
cout << ans << endl;
return 0;
}
| #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};
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
inline void fastIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << ' ' << H;
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif
bool isPrime(ll x) {
if (x == 1)
return false;
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
fastIO();
ll n, ans = 0, c = 10;
cin >> n;
set<ll> factors;
vector<ll> prime_factors;
map<ll, ll> reps;
map<ll, ll> seen_primes;
factors.insert(n);
for (int i = 2; i <= sqrt(n) + c; i++) {
if (n % i == 0) {
factors.insert(i);
if (n % (n / i) == 0) {
factors.insert(n / i);
}
}
}
for (set<ll>::iterator it = factors.begin(); it != factors.end(); it++) {
ll value = *it;
if (isPrime(value)) {
while (n % value == 0) {
prime_factors.push_back(value);
n /= value;
}
}
}
for (int i = 0; i < prime_factors.size(); i++) {
reps[prime_factors[i]]++;
}
for (int i = 0; i < prime_factors.size(); i++) {
ll take = 1;
if (seen_primes[prime_factors[i]] > 0)
continue;
while (reps[prime_factors[i]] - take >= 0) {
reps[prime_factors[i]] -= take, take++, ans++;
}
seen_primes[prime_factors[i]]++;
}
cout << ans << endl;
return 0;
}
| 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) {
for (int i = 1; i <= x.second; i++) {
x.second -= i;
ans += 1;
}
}
cout << ans << endl;
}
| #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 i = 1; i <= x.second; i++) {
x.second -= i;
ans += 1;
}
}
cout << ans << endl;
}
| 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) {
++j;
t += j;
}
R += j - 1;
}
++i;
}
std::cout << R << std::endl;
return 0;
} |
#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) {
++j;
t += j;
}
R += j - 1;
} else {
if (i * i > N) {
++R;
break;
}
}
++i;
}
std::cout << R << std::endl;
return 0;
} | 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;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
ll result = 0;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<pair<ll, int>> p;
for (int i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
p.emplace_back(i, cnt);
}
if (n != 1) {
p.emplace_back(n, 1);
}
for (auto x : p) {
int num = x.second;
int count = 1;
while (count <= num) {
num -= count;
result++;
count++;
}
}
cout << result << endl;
}
| #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;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
ll result = 0;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<pair<ll, int>> p;
for (ll i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
p.emplace_back(i, cnt);
}
if (n != 1) {
p.emplace_back(n, 1);
}
for (auto x : p) {
int num = x.second;
int count = 1;
while (count <= num) {
num -= count;
result++;
count++;
}
}
cout << result << endl;
}
| 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 (n % i == 0) {
n /= i;
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 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() {
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 % i == 0) {
n /= i;
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
} | 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(), vec.end()
map<int, int> mp;
int tri(int n) {
int x = 0;
for (int i = 1;; i++) {
if (x + i > n) {
return i - 1;
} else
x += i;
}
return 0;
}
vector<int> vec;
signed main() {
int n;
int ans = 0;
cin >> n;
int nn = n;
for (int i = 2; i <= nn; i++) {
if (n % i == 0) {
mp[i]++;
n /= i;
i--;
}
if (n == 1) {
break;
}
}
if (n > 1) {
mp[n]++;
}
for (auto x : mp) {
ans += tri(x.second);
}
if (ans == 0 && n > 1)
cout << 1 << endl;
else
cout << ans << endl;
return 0;
}
| #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(), vec.end()
map<int, int> mp;
int tri(int n) {
int x = 0;
for (int i = 1;; i++) {
if (x + i > n) {
return i - 1;
} else
x += i;
}
return 0;
}
vector<int> vec;
signed main() {
int n;
int ans = 0;
cin >> n;
int nn = n;
for (int i = 2; i <= sqrt(nn); i++) {
if (n % i == 0) {
mp[i]++;
n /= i;
i--;
}
if (n == 1) {
break;
}
}
if (n > 1) {
mp[n]++;
}
for (auto x : mp) {
ans += tri(x.second);
}
if (ans == 0 && n > 1)
cout << 1 << endl;
else
cout << ans << endl;
return 0;
}
| 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)
mp[n] = 1;
int ans = 0;
for (auto [f, s] : mp) {
for (int i = 1; s >= i; ++i) {
s -= i;
ans++;
}
}
cout << ans;
} | #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;
}
}
if (n > 1)
mp[n] = 1;
int ans = 0;
for (auto [f, s] : mp) {
for (int i = 1; s >= i; ++i) {
s -= i;
ans++;
}
}
cout << ans;
} | 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;
}
a.push_back(cnt);
tmp++;
}
}
for (int i = 0; i < tmp; i++) {
int k = 0;
for (int j = 1; j * (j + 1) / 2 <= a[i]; j++) {
k = j;
}
ans += k;
}
cout << ans << endl;
}
| #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 /= i;
}
a.push_back(cnt);
tmp++;
}
}
for (int i = 0; i < tmp; i++) {
int k = 0;
for (int j = 1; j * (j + 1) / 2 <= a[i]; j++) {
k = j;
}
ans += k;
}
cout << ans << endl;
}
| 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 inline auto ndvec(size_t &&n, Tail &&...tail) {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(
n, ndvec(std::forward<Tail>(tail)...));
}
template <class Cond> struct chain {
Cond cond;
chain(Cond cond) : cond(cond) {}
template <class T> bool operator()(T &a, const T &b) const {
if (cond(a, b)) {
a = b;
return true;
}
return false;
}
};
template <class Cond> chain<Cond> make_chain(Cond cond) {
return chain<Cond>(cond);
}
int main() {
i64 N;
cin >> N;
map<i64, i64> mp;
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
i64 cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
mp[i] = cnt;
}
}
if (N > 1) {
mp[N] = 1;
}
i64 ans = 0;
for (auto pp : mp) {
auto p = pp.second;
i64 ok = 0;
i64 ng = 1e9;
for (int i = 0; i < 50; i++) {
i64 mid = (ok + ng) / 2;
if (mid * (mid + 1) / 2 <= p) {
ok = mid;
} else {
ng = mid;
}
}
ans += ok;
}
cout << ans << endl;
}
| #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 inline auto ndvec(size_t &&n, Tail &&...tail) {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(
n, ndvec(std::forward<Tail>(tail)...));
}
template <class Cond> struct chain {
Cond cond;
chain(Cond cond) : cond(cond) {}
template <class T> bool operator()(T &a, const T &b) const {
if (cond(a, b)) {
a = b;
return true;
}
return false;
}
};
template <class Cond> chain<Cond> make_chain(Cond cond) {
return chain<Cond>(cond);
}
int main() {
i64 N;
cin >> N;
map<i64, i64> mp;
for (i64 i = 2; i * i <= N; i++) {
if (N % i == 0) {
i64 cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
mp[i] = cnt;
}
}
if (N > 1) {
mp[N] = 1;
}
i64 ans = 0;
for (auto pp : mp) {
auto p = pp.second;
i64 ok = 0;
i64 ng = 1e9;
for (int i = 0; i < 50; i++) {
i64 mid = (ok + ng) / 2;
if (mid * (mid + 1) / 2 <= p) {
ok = mid;
} else {
ng = mid;
}
}
ans += ok;
}
cout << ans << endl;
}
| 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 << ' '; \
cout << '\n'
#define db cout << "db: "
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
#define all(v) v.B, v.E
#define sz(v) (int)((v).size())
#define vi vector<int>
#define vii vector<pair<int, int>>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define clk1 clock_t start_time = clock()
#define clk2 cout << (clock() - start_time) / (double)CLOCKS_PER_SEC
#define clean(arr) memset(arr, 0, sizeof(arr))
#define mod 1000000007
#define mod2 998244353
#define space 100005
//<<fixed << setprecision(9)
int main() {
int n, i, j, t;
boost;
ll x;
cin >> x;
vi v;
for (i = 2; i * i <= x; i++) {
if (x % i == 0) {
int pow = 0;
while (x % i == 0) {
x /= i;
pow++;
}
v.pb(pow);
}
}
if (x != 1)
v.pb(1);
ll ans = 0;
for (auto z : v) {
rep(i, 1, 10) {
j = i * (i + 1) / 2;
if (j > z)
break;
}
i--;
ans += i;
}
cout << ans;
return 0;
}
| #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 << ' '; \
cout << '\n'
#define db cout << "db: "
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
#define all(v) v.B, v.E
#define sz(v) (int)((v).size())
#define vi vector<int>
#define vii vector<pair<int, int>>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define clk1 clock_t start_time = clock()
#define clk2 cout << (clock() - start_time) / (double)CLOCKS_PER_SEC
#define clean(arr) memset(arr, 0, sizeof(arr))
#define mod 1000000007
#define mod2 998244353
#define space 100005
//<<fixed << setprecision(9)
int main() {
int n, i, j, t;
boost;
ll x;
cin >> x;
vi v;
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0) {
int pow = 0;
while (x % i == 0) {
x /= i;
pow++;
}
v.pb(pow);
}
}
if (x != 1)
v.pb(1);
ll ans = 0;
for (auto z : v) {
rep(i, 1, 10) {
j = i * (i + 1) / 2;
if (j > z)
break;
}
i--;
ans += i;
}
cout << ans;
return 0;
}
| 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 i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> p;
vector<ll> f;
if (n % 2 == 0) {
ll count = 0;
while (n % 2 == 0) {
count++;
n /= 2;
}
p.push_back(2);
f.push_back(count);
}
for (ll i = 3; i <= (ll)sqrt(n); i += 2) {
if (n % i == 0) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
p.push_back(i);
f.push_back(count);
}
}
if (n > 2) {
p.push_back(n);
f.push_back(1);
}
ll c = 0;
fr(i, 0, f.size() - 1) {
ll a = f[i];
ll b = (ll)((-1 + sqrt(1 + 8 * a)) / 2);
c += b;
}
cout << c << endl;
return 0;
}
| #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 i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> p;
vector<ll> f;
if (n % 2 == 0) {
ll count = 0;
while (n % 2 == 0) {
count++;
n /= 2;
}
p.push_back(2);
f.push_back(count);
}
for (ll i = 3; i <= (ll)sqrt(n); i += 2) {
if (n % i == 0) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
p.push_back(i);
f.push_back(count);
}
}
if (n > 2) {
p.push_back(n);
f.push_back(1);
}
ll c = 0;
fr(i, 0, f.size() - 1) {
ll a = f[i];
ll b = (ll)((-1 + sqrt(1 + 8 * a)) / 2);
c += b;
}
cout << c << endl;
return 0;
}
| 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);
cout.tie(0);
}
const ld PI = 4 * atan((ld)1);
const int INF = 1e9 + 7;
int main() {
setIO();
ll n, ct = 0;
cin >> n;
for (int i = 2; i * i <= n; i++) {
int rq = 1, ct1 = 0;
while (n % i == 0) {
ct1++;
n /= i;
if (ct1 == rq) {
ct++;
rq++;
ct1 = 0;
}
}
}
if (n > 1)
ct++;
cout << ct << endl;
} | #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);
cout.tie(0);
}
const ld PI = 4 * atan((ld)1);
const int INF = 1e9 + 7;
int main() {
setIO();
ll n, ct = 0;
cin >> n;
for (ll i = 2; i * i <= n; i++) {
int rq = 1, ct1 = 0;
while (n % i == 0) {
ct1++;
n /= i;
if (ct1 == rq) {
ct++;
rq++;
ct1 = 0;
}
}
}
if (n > 1)
ct++;
cout << ct << endl;
} | 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) {
N /= i;
x++;
}
if (x != 0) {
table.emplace_back(i, x);
}
i += 2;
}
if (N != 1) {
table.emplace_back(N, 1);
}
/*for (int i = 0; i < table.size(); i++) {
cout << table.at(i).first << " " << table.at(i).second <<endl;
}*/
int ans = 0;
for (int i = 0; i < table.size(); i++) {
int y = table.at(i).second;
int b = 1;
while (y >= b) {
ans++;
y -= b;
b++;
}
}
cout << ans << endl;
return 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) {
N /= i;
x++;
}
if (x != 0) {
table.emplace_back(i, x);
}
i += 2;
}
if (N != 1) {
table.emplace_back(N, 1);
}
/*for (int i = 0; i < table.size(); i++) {
cout << table.at(i).first << " " << table.at(i).second <<endl;
}*/
int ans = 0;
for (int i = 0; i < table.size(); i++) {
int y = table.at(i).second;
int b = 1;
while (y >= b) {
ans++;
y -= b;
b++;
}
}
cout << ans << endl;
return 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 unsigned long long ull;
typedef long long ll;
int main() {
cin.tie(0);
ll N;
cin >> N;
vector<int> Eratosthenes((int)sqrt(N) + 10, 0);
vector<int> factor;
vector<ll> prime;
/*エラトステネス*/
for (ll i = 2; i * i < N; i++) {
if (!Eratosthenes[i]) {
for (ll j = 2; i * i * j * j <= N; j++)
Eratosthenes[i * j] = 1;
}
}
for (ll i : Eratosthenes) {
if (!i) {
int keep = 0;
while (N % i == 0) {
keep++;
N /= i;
}
factor.emplace_back(keep);
}
}
if (N > 1)
factor.emplace_back(1);
int ans = 0;
for (int i : factor) {
for (int j = 1; j <= i; j++) {
ans++;
i -= j;
}
}
cout << ans << endl;
return 0;
}
| /**
* 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 unsigned long long ull;
typedef long long ll;
int main() {
cin.tie(0);
ll N;
cin >> N;
vector<int> Eratosthenes((int)sqrt(N) + 10, 0);
vector<int> factor;
vector<ll> prime;
/*エラトステネス*/
for (ll i = 2; i * i < N; i++) {
if (!Eratosthenes[i]) {
for (ll j = 2; i * i * j * j <= N; j++)
Eratosthenes[i * j] = 1;
}
}
for (ll i = 2; i < Eratosthenes.size(); i++) {
if (!Eratosthenes[i]) {
int keep = 0;
while (N % i == 0) {
keep++;
N /= i;
}
factor.emplace_back(keep);
}
}
if (N > 1)
factor.emplace_back(1);
int ans = 0;
for (int i : factor) {
for (int j = 1; j <= i; j++) {
ans++;
i -= j;
}
}
cout << ans << endl;
return 0;
} | 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;
while (num % i == 0) {
num /= i;
++cnt;
}
int j = 1;
while (cnt - j >= 0) {
cnt -= j;
++res;
++j;
}
}
if (num != 1)
++res;
cout << res << 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>;
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;
while (num % i == 0) {
num /= i;
++cnt;
}
int j = 1;
while (cnt - j >= 0) {
cnt -= j;
++res;
++j;
}
}
if (num != 1)
++res;
cout << res << endl;
}
}
| 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> ostream &operator<<(ostream &O, const vector<T> &v) {
for (const T &e : v)
O << e << ' ';
return O;
}
void _main() {
ll n;
cin >> n;
map<ll, int> pf;
for (int div = 2; div * div <= n; div++) {
while (n % div == 0) {
pf[div]++;
n /= div;
}
}
if (n > 1)
pf[n]++;
int ans = 0;
for (auto &it : pf) {
int i = 1;
while (it.second - i >= 0) {
ans++;
it.second -= i++;
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int _t = 1;
// cin >> _t;
while (_t--)
_main();
return 0;
}
| #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> ostream &operator<<(ostream &O, const vector<T> &v) {
for (const T &e : v)
O << e << ' ';
return O;
}
void _main() {
ll n;
cin >> n;
map<ll, int> pf;
for (ll div = 2; div * div <= n; div++) {
while (n % div == 0) {
pf[div]++;
n /= div;
}
}
if (n > 1)
pf[n]++;
int ans = 0;
for (auto &it : pf) {
int i = 1;
while (it.second - i >= 0) {
ans++;
it.second -= i++;
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int _t = 1;
// cin >> _t;
while (_t--)
_main();
return 0;
}
| 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(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//
int main(void) {
ll N;
cin >> N;
ll ans = 0;
for (int i = 2; i * i <= N; ++i) {
int e = 0;
while (N % i == 0) {
++e;
N /= i;
}
int k = 0;
while (k * (k + 1) / 2 <= e)
++k;
if (k * (k + 1) / 2 > e)
--k;
ans += k;
}
if (N != 1) {
++ans;
}
cout << ans << endl;
return 0;
}
| #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(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//
int main(void) {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 2; i * i <= N; ++i) {
int e = 0;
while (N % i == 0) {
++e;
N /= i;
}
int k = 0;
while (k * (k + 1) / 2 <= e)
++k;
if (k * (k + 1) / 2 > e)
--k;
ans += k;
}
if (N != 1) {
++ans;
}
cout << ans << endl;
return 0;
}
| 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++){
answer=answer*A[i];
if(answer>1000000000000000000){
answer=-1;
break;
}
}
cout<<answer<<endl;
}*/
long long N;
cin >> N;
int div[1000001];
for (int i = 0; i <= 1000000; i++) {
div[i] = 0;
}
long long answer = 0;
int i = 2;
while (i * i <= N && N > 1) {
if (N % i == 0) {
int judge = 1;
while (N % i == 0) {
N = N / i;
div[i]++;
if (div[i] == judge) {
div[i] = 0;
answer++;
judge++;
}
}
}
i++;
if (N != 1 && i * i > N) {
answer++;
}
}
cout << answer << endl;
return 0;
} | #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++){
answer=answer*A[i];
if(answer>1000000000000000000){
answer=-1;
break;
}
}
cout<<answer<<endl;
}*/
long long N;
cin >> N;
int div[1000001];
for (int i = 0; i <= 1000000; i++) {
div[i] = 0;
}
long long answer = 0;
long long i = 2;
while (i * i <= N && N > 1) {
if (N % i == 0) {
int judge = 1;
while (N % i == 0) {
N = N / i;
div[i]++;
if (div[i] == judge) {
div[i] = 0;
answer++;
judge++;
}
}
}
i++;
if (N != 1 && i * i > N) {
answer++;
}
}
cout << answer << endl;
return 0;
} | 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]++;
}
int ans = 0;
for (auto myPair : mp) {
int count = myPair.second;
int iter = 1;
while (count >= iter) {
count -= iter;
iter++;
ans++;
}
}
cout << ans << endl;
return 0;
} | #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]++;
}
int ans = 0;
for (auto myPair : mp) {
int count = myPair.second;
int iter = 1;
while (count >= iter) {
count -= iter;
iter++;
ans++;
}
}
cout << ans << endl;
return 0;
} | 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 <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using PII = pair<ll, ll>;
using piii = pair<pii, pii>;
using Pi = pair<int, pii>;
using Graph = vector<vector<int>>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
bool check(int x, int y, int n, int m) {
if (1 <= x && x <= n && 1 <= y && y <= m)
return true;
else
return false;
}
const ll INF = 1e+7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
void mul(ll a, ll b) { a = a * b % INF; }
using Graph = vector<vector<int>>;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
const double PI = 3.14159265358979323846;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルをつくる前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1; // mod pにおける1,2,,,nの逆元
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % INF) % INF;
}
double Euclidean_distance(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int prime[1001000]; // i番目の素数
bool is_prime[1001010]; // is_prime[i]がtrueならiは素数
// n以下の素数の数を返す
int sieve(int n) {
int p = 0;
for (int i = 0; i <= n; ++i) {
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i <= n; ++i) {
if (is_prime[i]) {
prime[p] = i;
p++;
for (int j = 2 * i; j <= n; j += i) {
is_prime[j] = false;
}
}
}
return p;
}
// 素因数分解
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
ll powmod(ll a, ll k, ll mod) {
ll ap = a, ans = 1;
while (k) {
if (k & 1) {
ans *= ap;
ans %= mod;
}
ap = ap * ap;
ap %= mod;
k >>= 1;
}
return ans;
}
ll invi(ll a, ll mod) { return powmod(a, mod - 2, mod); }
// 逆元Aを足したときのmodで割った余りは
//+=invi(A)
///////////////////////////////////////
// dp[v][s]:=頂点vにいて所持金sという状態になるのに要する最小の所要時間
int findpos(ll k, ll hieghts[], ll n) {
int l = 1, r = n;
while (l < r) {
int mid = (l + r) / 2;
if (hieghts[mid] < k) {
l = mid + 1;
} else if (hieghts[mid] > k) {
r = mid;
} else {
return mid;
}
}
return l;
}
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
int c = 0;
while (n % 2 == 0) {
n = n / 2;
c++;
}
if (c > 0) {
v.pb({2, c});
}
for (int i = 3; i <= n; i += 2) {
c = 0;
while (n % i == 0) {
n = n / i;
c++;
}
if (c > 0) {
v.pb({i, c});
}
}
if (n > 3) {
v.pb({n, 1});
}
ll no = 0;
for (auto p : v) {
ll x = 1, ad = 1;
// cout<<p.second<<endl;
while (x <= p.second) {
no++;
ad++;
x += ad;
}
// cout<<no<<endl;
}
cout << no;
}
| #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 <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using PII = pair<ll, ll>;
using piii = pair<pii, pii>;
using Pi = pair<int, pii>;
using Graph = vector<vector<int>>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
bool check(int x, int y, int n, int m) {
if (1 <= x && x <= n && 1 <= y && y <= m)
return true;
else
return false;
}
const ll INF = 1e+7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
void mul(ll a, ll b) { a = a * b % INF; }
using Graph = vector<vector<int>>;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
const double PI = 3.14159265358979323846;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルをつくる前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1; // mod pにおける1,2,,,nの逆元
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % INF) % INF;
}
double Euclidean_distance(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int prime[1001000]; // i番目の素数
bool is_prime[1001010]; // is_prime[i]がtrueならiは素数
// n以下の素数の数を返す
int sieve(int n) {
int p = 0;
for (int i = 0; i <= n; ++i) {
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i <= n; ++i) {
if (is_prime[i]) {
prime[p] = i;
p++;
for (int j = 2 * i; j <= n; j += i) {
is_prime[j] = false;
}
}
}
return p;
}
// 素因数分解
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
ll powmod(ll a, ll k, ll mod) {
ll ap = a, ans = 1;
while (k) {
if (k & 1) {
ans *= ap;
ans %= mod;
}
ap = ap * ap;
ap %= mod;
k >>= 1;
}
return ans;
}
ll invi(ll a, ll mod) { return powmod(a, mod - 2, mod); }
// 逆元Aを足したときのmodで割った余りは
//+=invi(A)
///////////////////////////////////////
// dp[v][s]:=頂点vにいて所持金sという状態になるのに要する最小の所要時間
int findpos(ll k, ll hieghts[], ll n) {
int l = 1, r = n;
while (l < r) {
int mid = (l + r) / 2;
if (hieghts[mid] < k) {
l = mid + 1;
} else if (hieghts[mid] > k) {
r = mid;
} else {
return mid;
}
}
return l;
}
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
int c = 0;
while (n % 2 == 0) {
n = n / 2;
c++;
}
if (c > 0) {
v.pb({2, c});
}
for (int i = 3; i <= n && i <= 1000000; i += 2) {
c = 0;
while (n % i == 0) {
n = n / i;
c++;
}
if (c > 0) {
v.pb({i, c});
}
}
if (n > 3) {
v.pb({n, 1});
}
ll no = 0;
for (auto p : v) {
ll x = 1, ad = 1;
// cout<<p.second<<endl;
while (x <= p.second) {
no++;
ad++;
x += ad;
}
// cout<<no<<endl;
}
cout << no;
}
| 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 10^6
// Also, there are at most 40 prime factors.
bool composite[MAXN];
vector<pii> prime_factorise(ll N) {
vector<pii> prime_factors;
for (ll i = 2; i <= MAXN; i++) {
if (!composite[i]) {
// Found prime
ll power = 0;
while (N % (ll)i == 0) {
N /= (ll)i;
power++;
}
if (power) {
prime_factors.pb({i, power});
}
// Update rest
for (ll j = i * i; j <= MAXN; j += i) {
composite[j] = true;
}
}
}
if (N > 1) {
prime_factors.pb({N, 1});
}
return prime_factors;
}
int main() {
inputSpeed();
ll N;
cin >> N;
vector<pii> prime_factors = prime_factorise(N);
// printf("N = 1\n");
// for (auto f : prime_factors) {
// printf("* %d ^ %d\n", f.x, f.y);
// }
int ans = 0;
for (auto f : prime_factors) {
// find out which triangular number it is
for (int j = 1; j < 100; j++) {
if (f.y - j >= 0) {
f.y -= j;
ans++;
}
}
}
printf("%d\n", ans);
}
| #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 10^6
// Also, there are at most 40 prime factors.
bool composite[MAXN];
vector<pii> prime_factorise(ll N) {
vector<pii> prime_factors;
for (ll i = 2; i < MAXN; i++) {
if (!composite[i]) {
// Found prime
ll power = 0;
while (N % (ll)i == 0) {
N /= (ll)i;
power++;
}
if (power) {
prime_factors.pb({i, power});
}
// Update rest
for (ll j = i * i; j <= MAXN; j += i) {
composite[j] = true;
}
}
}
if (N > 1) {
prime_factors.pb({N, 1});
}
return prime_factors;
}
int main() {
inputSpeed();
ll N;
cin >> N;
vector<pii> prime_factors = prime_factorise(N);
// printf("N = 1\n");
// for (auto f : prime_factors) {
// printf("* %d ^ %d\n", f.x, f.y);
// }
int ans = 0;
for (auto f : prime_factors) {
// find out which triangular number it is
for (int j = 1; j < 100; j++) {
if (f.y - j >= 0) {
f.y -= j;
ans++;
}
}
}
printf("%d\n", ans);
}
| 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;
}
#define MAX 1000000 // 求MAX范围内的素数
long long su[MAX], cnt;
bool isprime[MAX];
void prime() {
cnt = 1;
memset(isprime, 1, sizeof(isprime)); // 初始化认为所有数都为素数
isprime[0] = isprime[1] = 0; // 0和1不是素数
for (long long i = 2; i <= MAX; i++) {
if (isprime[i])
su[cnt++] = i; // 保存素数i
for (long long j = 1; j < cnt && su[j] * i < MAX; j++) {
isprime[su[j] * i] = 0; // 筛掉小于等于i的素数和i的积构成的合数
}
}
}
int main() {
prime();
int a[] = {0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55};
ll n, ans = 0;
cin >> n;
for (int i = 1;; i++) {
if (i <= MAX && n < su[i])
break;
if (n % su[i] == 0) {
int c = 0;
while (n % su[i] == 0)
n /= su[i], c++;
// cout<<c<<endl;
ans += upper_bound(a, a + 11, c) - a - 1;
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
} | #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;
}
#define MAX 1000000 // 求MAX范围内的素数
long long su[MAX], cnt;
bool isprime[MAX];
void prime() {
cnt = 1;
memset(isprime, 1, sizeof(isprime)); // 初始化认为所有数都为素数
isprime[0] = isprime[1] = 0; // 0和1不是素数
for (long long i = 2; i <= MAX; i++) {
if (isprime[i])
su[cnt++] = i; // 保存素数i
for (long long j = 1; j < cnt && su[j] * i < MAX; j++) {
isprime[su[j] * i] = 0; // 筛掉小于等于i的素数和i的积构成的合数
}
}
}
int main() {
prime();
int a[] = {0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55};
ll n, ans = 0;
cin >> n;
for (int i = 1;; i++) {
if (i < cnt && su[i] * su[i] > n)
break;
if (n % su[i] == 0) {
int c = 0;
while (n % su[i] == 0)
n /= su[i], c++;
// cout<<c<<endl;
ans += upper_bound(a, a + 11, c) - a - 1;
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
} | 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(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
long long n;
cin >> n;
const auto pf = pre(n);
long long ans = 0;
for (auto p : pf) {
long long e = p.second;
long long tmp = 0, cur = 1;
while (e >= cur)
e -= cur++, ++tmp;
ans += tmp;
}
cout << ans << endl;
return 0;
} | #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.push_back(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
long long n;
cin >> n;
const auto pf = pre(n);
long long ans = 0;
for (auto p : pf) {
long long e = p.second;
long long tmp = 0, cur = 1;
while (e >= cur)
e -= cur++, ++tmp;
ans += tmp;
}
cout << ans << endl;
return 0;
} | 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 /= i;
}
if (cnt != 0)
f.emplace_back(i, cnt);
}
if (n != 1)
f.emplace_back(n, 1);
// 答えを求める
int ans = 0;
for (auto p : f) {
int x = p.second;
int a = 1;
while (x >= a) {
x -= a;
a++;
ans++;
}
}
cout << ans << endl;
return 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() {
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;
}
if (cnt != 0)
f.emplace_back(i, cnt);
}
if (n != 1)
f.emplace_back(n, 1);
// 答えを求める
int ans = 0;
for (auto p : f) {
int x = p.second;
int a = 1;
while (x >= a) {
x -= a;
a++;
ans++;
}
}
cout << ans << endl;
return 0;
} | 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 % i == 0) {
cnt++;
n /= i;
}
ans += ret(cnt);
}
}
if (n > 1)
ans += 1;
cout << ans << "\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;
while (n % i == 0) {
cnt++;
n /= i;
}
ans += ret(cnt);
}
}
if (n > 1)
ans += 1;
cout << ans << "\n";
}
| 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
if (sf[i])
prime[++num] = i; // 如果是质数就加入素数表
for (int j = 1; j <= num; j++) { // 内层枚举num以内的质数
if (i * prime[j] > maxn)
break; // 筛完结束
sf[i * prime[j]] = false; // 筛掉...
if (i % prime[j] == 0)
break; // 避免重复筛
}
}
sf[1] = false;
sf[0] = false; // 1 0 特判
}
int main() {
init();
ll n;
cin >> n;
map<ll, ll> mp;
for (int i = 2; i * i <= n; i++) {
if (!sf[i])
continue;
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
int ans = 0;
for (auto i : mp) {
for (int j = 1; i.second >= j; j++)
i.second -= j, ++ans;
}
cout << ans << "\n";
} | #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
if (sf[i])
prime[++num] = i; // 如果是质数就加入素数表
for (int j = 1; j <= num; j++) { // 内层枚举num以内的质数
if (i * prime[j] > maxn)
break; // 筛完结束
sf[i * prime[j]] = false; // 筛掉...
if (i % prime[j] == 0)
break; // 避免重复筛
}
}
sf[1] = false;
sf[0] = false; // 1 0 特判
}
int main() {
init();
ll n;
cin >> n;
map<ll, ll> mp;
for (ll i = 2; i * i <= n; i++) {
if (!sf[i])
continue;
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
int ans = 0;
for (auto i : mp) {
for (int j = 1; i.second >= j; j++)
i.second -= j, ++ans;
}
cout << ans << "\n";
} | 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_back(i, b);
}
if (N != 1)
res.emplace_back(N, 1);
ll ans = 0;
for (auto s : res) {
ll p = s.second;
ll b = 1;
while (b <= p) {
p -= b;
b++;
ans++;
}
}
cout << ans << endl;
}
// void solve(long long N){
// vector<pair<ll,int>> fs;
// for(ll i = 2; i*i <= N; i++){
// int x = 0;
// while(N%i == 0){
// N/=i;
// ++x;
// }
// fs.emplace_back(i,x);
// }
// if(N != 1) fs.emplace_back(N,1);
// int ans = 0;
// for(auto p : fs) {
// int x = p.second;
// int b = 1;
// while(b <= x){
// x -= b;
// b++;
// ++ans;
// }
// }
// cout << ans << endl;
// }
int main() {
long long N;
scanf("%lld", &N);
solve(N);
return 0;
}
| #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_back(i, b);
}
if (N != 1)
res.emplace_back(N, 1);
ll ans = 0;
for (auto s : res) {
ll p = s.second;
ll b = 1;
while (b <= p) {
p -= b;
b++;
ans++;
}
}
cout << ans << endl;
}
// void solve(long long N){
// vector<pair<ll,int>> fs;
// for(ll i = 2; i*i <= N; i++){
// int x = 0;
// while(N%i == 0){
// N/=i;
// ++x;
// }
// fs.emplace_back(i,x);
// }
// if(N != 1) fs.emplace_back(N,1);
// int ans = 0;
// for(auto p : fs) {
// int x = p.second;
// int b = 1;
// while(b <= x){
// x -= b;
// b++;
// ++ans;
// }
// }
// cout << ans << endl;
// }
int main() {
long long N;
scanf("%lld", &N);
solve(N);
return 0;
}
| 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) {
dem = 0;
while (n % i == 0) {
dem++;
n /= i;
}
kq += solve(dem);
}
if (n > 2)
kq++;
cout << kq;
}
int main() {
scanf("%lld", &n);
process();
return 0;
}
| #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 += 2) {
dem = 0;
while (n % i == 0) {
dem++;
n /= i;
}
kq += solve(dem);
}
if (n > 2)
kq++;
cout << kq;
}
int main() {
scanf("%lld", &n);
process();
return 0;
}
| 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};
int dy[4] = {1, -1, 0, 0};
const int INF = 1 << 29;
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// 最大公約数
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
// 最小公倍数
int lcm(int x, int y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
ll N;
cin >> N;
ll out = 0;
for (int i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll c = 0;
ll o = 1;
while (N % i == 0) {
N /= i;
c++;
if (o == c) {
o++;
c = 0;
}
}
// cerr << o << "\t" << c << endl;
o--;
out += o;
}
if (N != 1) {
out++;
}
cout << out << endl;
return 0;
}
| #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};
int dy[4] = {1, -1, 0, 0};
const int INF = 1 << 29;
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// 最大公約数
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
// 最小公倍数
int lcm(int x, int y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
ll N;
cin >> N;
ll out = 0;
for (ll i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll c = 0;
ll o = 1;
while (N % i == 0) {
N /= i;
c++;
if (o == c) {
o++;
c = 0;
}
}
// cerr << o << "\t" << c << endl;
o--;
out += o;
}
if (N != 1) {
out++;
}
cout << out << endl;
return 0;
}
| 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;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { // 線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
// a>=b
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> cnt;
ll m = n;
for (int i = 2; i * i <= m && n > 1; i++) {
if (n % i == 0) {
ll tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
cnt.push_back(tmp);
}
}
ll ans = 0;
if (n != 1) {
ans++;
}
n = cnt.size();
rep(i, n) {
ll k = 0;
while (((k + 2) * (k + 1)) / 2 <= cnt[i]) {
k++;
}
ans += k;
}
if (ans == 0)
ans++;
cout << ans << endl;
return 0;
}
| #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;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { // 線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
// a>=b
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> cnt;
ll m = n;
for (long long int i = 2; i * i <= m && n > 1; i++) {
if (n % i == 0) {
ll tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
cnt.push_back(tmp);
}
}
ll ans = 0;
if (n != 1) {
ans++;
}
n = cnt.size();
rep(i, n) {
ll k = 0;
while (((k + 2) * (k + 1)) / 2 <= cnt[i]) {
k++;
}
ans += k;
}
if (ans == 0)
ans++;
cout << ans << endl;
return 0;
}
| 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 /= i;
kosuu++;
}
fs.emplace_back(i, kosuu);
}
if (n != 1)
fs.emplace_back(n, 1);
int ans = 0;
for (auto p : fs) {
int i = 1;
while (p.second - i >= 0) {
p.second -= i;
i++;
ans++;
}
}
cout << ans << endl;
}
| #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 /= i;
kosuu++;
}
fs.emplace_back(i, kosuu);
}
if (n != 1)
fs.emplace_back(n, 1);
int ans = 0;
for (auto p : fs) {
int i = 1;
while (p.second - i >= 0) {
p.second -= i;
i++;
ans++;
}
}
cout << ans << endl;
}
| 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)
return false;
for (int i = 2; i * i <= k; i++) {
if (k % i == 0)
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lld n = 0;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
return 0;
}
int ans = 0;
vector<lld> v;
map<lld, int> mp;
v.push_back(1);
for (int i = 2; i <= 100; i++) {
v.push_back(v.back() + i);
}
for (lld i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
if (isPrime(n / i) && i != n / i) {
mp[n / i]++;
}
n /= i;
}
}
for (auto &p : mp) {
ans += upper_bound(ALL(v), p.second) - v.begin();
}
cout << max(1, ans) << '\n';
return 0;
}
// g++ sol.cpp -o sol.out -Wall -Wextra -Wshadow -fsanitize=undefined -std=c++17 | #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)
return false;
for (lld i = 2; i * i <= k; i++) {
if (k % i == 0)
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lld n = 0;
cin >> n;
if (n == 1) {
cout << 0 << '\n';
return 0;
}
int ans = 0;
vector<lld> v;
map<lld, int> mp;
v.push_back(1);
for (int i = 2; i <= 100; i++) {
v.push_back(v.back() + i);
}
for (lld i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
if (isPrime(n / i) && i != n / i) {
mp[n / i]++;
}
n /= i;
}
}
for (auto &p : mp) {
ans += upper_bound(ALL(v), p.second) - v.begin();
}
cout << max(1, ans) << '\n';
return 0;
}
// g++ sol.cpp -o sol.out -Wall -Wextra -Wshadow -fsanitize=undefined -std=c++17 | 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++;
cnt -= cut;
cut++;
}
}
if (n > 1)
ans++;
cout << ans;
return 0;
} | #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++;
cnt -= cut;
cut++;
}
}
if (n > 1)
ans++;
cout << ans;
return 0;
} | 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;
for (auto p : prime_factor(N)) {
ll x = p.second;
ll i = 1;
while (x >= i) {
x -= i;
i++;
ans++;
}
}
cout << ans << endl;
} | #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;
for (auto p : prime_factor(N)) {
ll x = p.second;
ll i = 1;
while (x >= i) {
x -= i;
i++;
ans++;
}
}
cout << ans << endl;
} | 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.14159265358979
#define MOD 1000000007 // = 10^9 + 7
using namespace std;
using ll = long long;
// 素数判定
// から派生して、最初の約数を返す
int isPrime(ll a) {
if (a == 1)
return 1;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0)
return i;
}
return -1;
}
void solve() {
ll n;
cin >> n;
ll first_prime = isPrime(n);
if (first_prime <= 0) {
cout << 1;
return;
}
if (first_prime == 1) {
cout << 0;
return;
}
map<ll, ll> mp;
int ans = 0;
for (int i = first_prime; i <= n; i++) {
while (n % i == 0) {
// cout << i << " ";
mp[i]++;
n /= i;
}
}
for (auto &m : mp) {
// cout << m.first << " : " << m.second << endl;
int i = 1;
while (m.second >= i) {
m.second -= i;
++i;
++ans;
}
}
cout << ans;
}
int main() {
fastio;
solve();
return 0;
} | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007 // = 10^9 + 7
using namespace std;
using ll = long long;
// 素数判定
// から派生して、最初の約数を返す
int isPrime(ll a) {
if (a == 1)
return 1;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0)
return i;
}
return -1;
}
void solve() {
ll n;
cin >> n;
ll first_prime = isPrime(n);
if (first_prime <= 0) {
cout << 1;
return;
}
if (first_prime == 1) {
cout << 0;
return;
}
map<ll, ll> mp;
int ans = 0;
for (int i = first_prime; i <= n; i = isPrime(n)) {
if (i == 1) {
break;
}
if (i == -1) {
mp[n]++;
break;
}
while (n % i == 0) {
// cout << i << " ";
mp[i]++;
n /= i;
}
}
for (auto &m : mp) {
// cout << m.first << " : " << m.second << endl;
int i = 1;
while (m.second >= i) {
m.second -= i;
++i;
++ans;
}
}
cout << ans;
}
int main() {
fastio;
solve();
return 0;
} | 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;
}
prm.push_back(0);
}
}
if (n > 1ll)
prm.back()++;
ll cnt = 0;
for (int x : prm) {
int prev = 0;
for (int i = 1; i <= x; i++) {
if (i * (i + 1) / 2 <= x)
prev = i;
else
break;
}
cnt += prev;
}
cout << cnt;
} | #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;
}
prm.push_back(0);
}
}
if (n > 1ll)
prm.back()++;
ll cnt = 0;
for (int x : prm) {
int prev = 0;
for (int i = 1; i <= x; i++) {
if (i * (i + 1) / 2 <= x)
prev = i;
else
break;
}
cnt += prev;
}
cout << cnt;
} | 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 = 1; cnt > 0; j++) {
if (cnt < j)
break;
ans++;
cnt -= j;
}
}
if (n > 1)
ans++;
cout << ans << endl;
return 0;
}
| #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;
for (int j = 1; cnt > 0; j++) {
if (cnt < j)
break;
ans++;
cnt -= j;
}
}
if (n > 1)
ans++;
cout << ans << endl;
return 0;
}
| 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) {
prime_num[i] -= num;
num++;
ans++;
}
}
if (n != 1)
ans++;
return ans;
}
int main() {
ll N;
cin >> N;
int ans = prime_factrization(N);
if (N != 1 && ans == 0)
cout << 1 << endl;
else
cout << ans << endl;
} | #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) {
prime_num[i] -= num;
num++;
ans++;
}
}
if (n != 1)
ans++;
return ans;
}
int main() {
ll N;
cin >> N;
int ans = prime_factrization(N);
if (N != 1 && ans == 0)
cout << 1 << endl;
else
cout << ans << endl;
} | 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> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
map<llint, llint> mp;
bool prime[1000005];
void solve() {
llint n;
cin >> n;
for (int i = 2; i < 1000005; i++) {
if (prime[i])
continue;
for (int j = 2 * i; j < 1000005; j += i)
prime[j] = true;
}
for (int i = 2; i < n; i++) {
if (prime[i])
continue;
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n > 1)
mp[n]++;
llint ans = 0;
for (auto it = mp.begin(); it != mp.end(); it++) {
for (int i = 1;; i++) {
if (it->second >= i) {
ans++;
it->second -= i;
} else
break;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| // 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> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
map<llint, llint> mp;
bool prime[1000005];
void solve() {
llint n;
cin >> n;
for (int i = 2; i < 1000005; i++) {
if (prime[i])
continue;
for (int j = 2 * i; j < 1000005; j += i)
prime[j] = true;
}
for (int i = 2; i < 1000005; i++) {
if (prime[i])
continue;
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n > 1)
mp[n]++;
llint ans = 0;
for (auto it = mp.begin(); it != mp.end(); it++) {
for (int i = 1;; i++) {
if (it->second >= i) {
ans++;
it->second -= i;
} else
break;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 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) {
pf.push_back(1);
}
int ans = 0;
for (auto e : pf) {
for (int i = 1; i <= e; ++i) {
e -= i;
++ans;
}
}
cout << ans << endl;
}
| #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 != 1) {
pf.push_back(1);
}
int ans = 0;
for (auto e : pf) {
for (int i = 1; i <= e; ++i) {
e -= i;
++ans;
}
}
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02660 | C++ | Time Limit Exceeded | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!! ! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!
!!!!
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define MAXN 1000005
#define mod 998244353
#define inf LLONG_MAX / 3
#define ALPHABET_SIZE 2
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll power(ll x, ll y, ll m = mod) {
ll ans = 1;
while (y > 0) {
if (y & 1) {
ans = (ans * x) % m;
}
x = (x * x) % m;
y /= 2;
}
return ans % m;
}
ll modInverse(ll a, ll m = mod) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
ll q = a / m;
ll t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
ll calc(ll n) {
ll ans = 1;
ll l = 1, r = n;
while (l <= r) {
ll mid = l + (r - l) / 2;
if (mid * (mid + 1) > 2 * n)
r = mid - 1;
else {
ans = mid;
l = mid + 1;
}
}
return ans;
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
ll n, m, q, k, i, j, ans = 0;
cin >> n;
unordered_map<ll, ll> mp;
for (i = 2; i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n > 1)
mp[n]++;
for (auto it : mp) {
ans += calc(it.second);
}
cout << ans << "\n";
}
return 0;
} | /*
!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!! ! !!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! !!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !
!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!!!!!
!!!!!!!!
!!!!!!
!!!!
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define MAXN 1000005
#define mod 998244353
#define inf LLONG_MAX / 3
#define ALPHABET_SIZE 2
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll power(ll x, ll y, ll m = mod) {
ll ans = 1;
while (y > 0) {
if (y & 1) {
ans = (ans * x) % m;
}
x = (x * x) % m;
y /= 2;
}
return ans % m;
}
ll modInverse(ll a, ll m = mod) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
ll q = a / m;
ll t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
ll calc(ll n) {
ll ans = 1;
ll l = 1, r = n;
while (l <= r) {
ll mid = l + (r - l) / 2;
if (mid * (mid + 1) > 2 * n)
r = mid - 1;
else {
ans = mid;
l = mid + 1;
}
}
return ans;
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
ll n, m, q, k, i, j, ans = 0;
cin >> n;
unordered_map<ll, ll> mp;
for (i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n > 1)
mp[n]++;
for (auto it : mp) {
ans += calc(it.second);
}
cout << ans << "\n";
}
return 0;
} | 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;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const ll mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int cans(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
vector<pair<long long, long long>> prime_factorization(ll N) {
vector<pair<long long, long long>> res;
for (int p = 2; p * p <= N; p++) {
if (N % p != 0)
continue;
int ex = 0; // exponetial part
while (N % p == 0) {
ex++;
N /= p;
}
res.push_back({p, ex});
}
if (N != 1) {
res.push_back({N, 1});
}
return res;
}
int main() {
ll N;
cin >> N;
vector<pair<ll, ll>> a;
a = prime_factorization(N);
ll ans = 0;
for (auto it : a) {
ll num = it.second;
ll cnt = 1;
ll tmp = 0;
while (num >= cnt) {
num -= cnt;
cnt++;
tmp++;
}
ans += tmp;
}
cout << ans << endl;
return 0;
}
| #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;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const ll mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int cans(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
vector<pair<long long, long long>> prime_factorization(ll N) {
vector<pair<long long, long long>> res;
for (ll p = 2; p * p <= N; p++) {
if (N % p != 0)
continue;
int ex = 0; // exponetial part
while (N % p == 0) {
ex++;
N /= p;
}
res.push_back({p, ex});
}
if (N != 1) {
res.push_back({N, 1});
}
return res;
}
int main() {
ll N;
cin >> N;
vector<pair<ll, ll>> a;
a = prime_factorization(N);
ll ans = 0;
for (auto it : a) {
ll num = it.second;
ll cnt = 1;
ll tmp = 0;
while (num >= cnt) {
num -= cnt;
cnt++;
tmp++;
}
ans += tmp;
}
cout << ans << endl;
return 0;
}
| 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>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repm(i, s, n) for (int i = s; i < n; i++)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9 + 7;
// ----------------------------------------------------------------
// String Functions
// ----------------------------------------------------------------
int ctoi(char c) {
if (isdigit(c))
return c - '0';
else if (islower(c))
return c - 'a';
else if (isupper(c))
return c - 'A';
else
return -1;
}
char itocd(int i) {
char c = i + '0';
if (isdigit(c))
return c;
else
return 0x00;
}
char itocl(int i) {
char c = i + 'a';
if (islower(c))
return c;
else
return 0x00;
}
char itocu(int i) {
char c = i + 'A';
if (isupper(c))
return c;
else
return 0x00;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Dynamical Programming
// ----------------------------------------------------------------
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;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Graph Theory
// ----------------------------------------------------------------
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra() {}
void BellmanFord() {}
void WarshallFloyd() {}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Mathematical Functions
// ----------------------------------------------------------------
ll gcd(ll A, ll B) {
if (A % B == 0) {
return (B);
} else {
return (gcd(B, A % B));
}
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
ll divtimes(ll N, ll D) {
ll res = 0;
while (N % D == 0) {
N /= D;
res++;
}
return res;
}
ll powMod(ll B, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = powMod(B, P / 2);
return t * t % MOD;
}
return B * powMod(B, P - 1) % MOD;
}
/* ----------------------------------
Factorial, Permutation, Combination
---------------------------------- */
const int FAC_INIT_SIZE = 5e6 + 9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll factMod(ll N) { return fac[N] % MOD; }
ll factInvMod(ll N) { return finv[N] % MOD; }
ll permMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else
return factMod(N) * factInvMod(N - K) % MOD;
}
ll combMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else if (N < FAC_INIT_SIZE) {
return factMod(N) * (factInvMod(K) * factInvMod(N - K) % MOD) % MOD;
} else {
ll ans = 1;
ll Ks = K < N - K ? K : N - K;
for (ll i = N; i > N - Ks; i--) {
ans *= i;
ans %= MOD;
}
return ans * factInvMod(Ks) % MOD;
}
}
/* ----------------------------------
Sieve of Eratosthenes
---------------------------------- */
vector<bool> isprime;
void sieveInit(int size) {
int sb = size + 9;
isprime.resize(sb);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for (int i = 2; i < sb; i++) {
if (i % 2 == 0)
isprime[i] = false;
else
isprime[i] = true;
}
for (int i = 3; i * i <= sb; i += 2) {
if (isprime[i]) {
int m = 3 * i;
while (m < sb) {
isprime[m] = false;
m += 2 * i;
}
} else {
continue;
}
}
}
struct PRIMEFACTOR {
ll number;
map<ll, int> exponent;
};
PRIMEFACTOR primeFactorInit(ll number) {
PRIMEFACTOR primeFactor;
primeFactor.number = number;
for (int i = 2; i * i < number + 1; i++) {
while (number % i == 0) {
primeFactor.exponent[i]++;
number /= i;
}
if (number == 1)
break;
}
if (number != 1)
primeFactor.exponent[number]++;
return primeFactor;
}
// ----------------------------------------------------------------
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
PRIMEFACTOR pf = primeFactorInit(N);
ll res = 0;
for (auto idx : pf.exponent)
res += (sqrt(1. + 8. * (ld)idx.second) - 1.) / 2.;
cout << res << endl;
}
| #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>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repm(i, s, n) for (int i = s; i < n; i++)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9 + 7;
// ----------------------------------------------------------------
// String Functions
// ----------------------------------------------------------------
int ctoi(char c) {
if (isdigit(c))
return c - '0';
else if (islower(c))
return c - 'a';
else if (isupper(c))
return c - 'A';
else
return -1;
}
char itocd(int i) {
char c = i + '0';
if (isdigit(c))
return c;
else
return 0x00;
}
char itocl(int i) {
char c = i + 'a';
if (islower(c))
return c;
else
return 0x00;
}
char itocu(int i) {
char c = i + 'A';
if (isupper(c))
return c;
else
return 0x00;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Dynamical Programming
// ----------------------------------------------------------------
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;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Graph Theory
// ----------------------------------------------------------------
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra() {}
void BellmanFord() {}
void WarshallFloyd() {}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Mathematical Functions
// ----------------------------------------------------------------
ll gcd(ll A, ll B) {
if (A % B == 0) {
return (B);
} else {
return (gcd(B, A % B));
}
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
ll divtimes(ll N, ll D) {
ll res = 0;
while (N % D == 0) {
N /= D;
res++;
}
return res;
}
ll powMod(ll B, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = powMod(B, P / 2);
return t * t % MOD;
}
return B * powMod(B, P - 1) % MOD;
}
/* ----------------------------------
Factorial, Permutation, Combination
---------------------------------- */
const int FAC_INIT_SIZE = 5e6 + 9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll factMod(ll N) { return fac[N] % MOD; }
ll factInvMod(ll N) { return finv[N] % MOD; }
ll permMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else
return factMod(N) * factInvMod(N - K) % MOD;
}
ll combMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else if (N < FAC_INIT_SIZE) {
return factMod(N) * (factInvMod(K) * factInvMod(N - K) % MOD) % MOD;
} else {
ll ans = 1;
ll Ks = K < N - K ? K : N - K;
for (ll i = N; i > N - Ks; i--) {
ans *= i;
ans %= MOD;
}
return ans * factInvMod(Ks) % MOD;
}
}
/* ----------------------------------
Sieve of Eratosthenes
---------------------------------- */
vector<bool> isprime;
void sieveInit(int size) {
int sb = size + 9;
isprime.resize(sb);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for (int i = 2; i < sb; i++) {
if (i % 2 == 0)
isprime[i] = false;
else
isprime[i] = true;
}
for (int i = 3; i * i <= sb; i += 2) {
if (isprime[i]) {
int m = 3 * i;
while (m < sb) {
isprime[m] = false;
m += 2 * i;
}
} else {
continue;
}
}
}
struct PRIMEFACTOR {
ll number;
map<ll, int> exponent;
};
PRIMEFACTOR primeFactorInit(ll number) {
PRIMEFACTOR primeFactor;
primeFactor.number = number;
for (int i = 2; i < sqrt(number) + 1; i++) {
while (number % i == 0) {
primeFactor.exponent[i]++;
number /= i;
}
if (number == 1)
break;
}
if (number != 1)
primeFactor.exponent[number]++;
return primeFactor;
}
// ----------------------------------------------------------------
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
PRIMEFACTOR pf = primeFactorInit(N);
ll res = 0;
for (auto idx : pf.exponent)
res += (sqrt(1. + 8. * (ld)idx.second) - 1.) / 2.;
cout << res << endl;
}
| 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 * i <= n; ++i) {
int x = 0;
while (n % i == 0) {
n /= i;
++x;
}
ret.emplace_back(i, x);
}
if (n != 1)
ret.emplace_back(n, 1);
return ret;
}
int main() {
ll n;
cin >> n;
auto fs = divisor(n);
int ans = 0;
for (auto a : fs) {
int x = a.second;
int b = 1;
while (b <= x) {
x -= b;
++b;
++ans;
}
}
pri(ans);
return 0;
}
| #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 * i <= n; ++i) {
int x = 0;
while (n % i == 0) {
n /= i;
++x;
}
ret.emplace_back(i, x);
}
if (n != 1)
ret.emplace_back(n, 1);
return ret;
}
int main() {
ll n;
cin >> n;
auto fs = divisor(n);
int ans = 0;
for (auto a : fs) {
int x = a.second;
int b = 1;
while (b <= x) {
x -= b;
++b;
++ans;
}
}
pri(ans);
return 0;
}
| 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;
// cout << k << " " << i << endl;
s += i;
}
k += 1;
}
if (n > 1)
s += 1;
cout << s;
}
| #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 += 1;
// cout << k << " " << i << endl;
s += i;
}
k += 1;
}
if (n > 1)
s += 1;
cout << s;
}
| 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 cnt = 0;
while (A % i == 0)
cnt++, A /= i;
res += ans[cnt];
}
if (A > 1) {
res++;
}
cout << res;
} | #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++) {
int cnt = 0;
while (A % i == 0)
cnt++, A /= i;
res += ans[cnt];
}
if (A > 1) {
res++;
}
cout << res;
} | 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(n, 1);
int ans = 0;
for (auto p : fs) {
int x = p.second;
int b = 1;
while (b <= x) {
x -= b;
b++;
ans++;
}
}
cout << ans << endl;
} | #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(n, 1);
int ans = 0;
for (auto p : fs) {
int x = p.second;
int b = 1;
while (b <= x) {
x -= b;
b++;
ans++;
}
}
cout << ans << endl;
} | 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 % i == 0) {
count++;
n /= i;
}
int x = 0;
while (x * (x + 1) / 2 <= count)
x++;
ans += --x;
}
if (n > 2)
ans++;
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt = 1;
// cin >> tt;
for (int tc = 1; tc <= tt; ++tc) {
solve();
}
}
| // 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 == 0) {
count++;
n /= i;
}
int x = 0;
while (x * (x + 1) / 2 <= count)
x++;
ans += --x;
}
if (n > 2)
ans++;
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt = 1;
// cin >> tt;
for (int tc = 1; tc <= tt; ++tc) {
solve();
}
}
| 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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000
#define mod = (int)1000000007;
#pragma endregion
lint n;
vector<pair<lint, lint>> prime_factorize(lint N) {
vector<pair<lint, lint>> res;
for (int a = 2; a * a <= N; a++) {
if (N % a != 0)
continue;
lint ex = 0;
while (N % a == 0) {
ex++;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void input() {
cin >> n;
return;
}
int ans = 0;
void solve() {
vector<pair<lint, lint>> d;
d = prime_factorize(n);
int cnt = 0;
for (int i = 0; i < d.size(); i++) {
auto s = d[i];
for (int j = 1; j < INF; j++) {
cnt += j;
if (cnt > s.second) {
ans += j - 1;
cnt = 0;
break;
}
}
}
}
int main(void) {
input();
solve();
printf("%d\n", ans);
return 0;
} | #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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000
#define mod = (int)1000000007;
#pragma endregion
lint n;
vector<pair<lint, lint>> prime_factorize(lint N) {
vector<pair<lint, lint>> res;
for (lint a = 2; a * a <= N; a++) {
if (N % a != 0)
continue;
lint ex = 0;
while (N % a == 0) {
ex++;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void input() {
cin >> n;
return;
}
int ans = 0;
void solve() {
vector<pair<lint, lint>> d;
d = prime_factorize(n);
int cnt = 0;
for (int i = 0; i < d.size(); i++) {
auto s = d[i];
for (int j = 1; j < INF; j++) {
cnt += j;
if (cnt > s.second) {
ans += j - 1;
cnt = 0;
break;
}
}
}
}
int main(void) {
input();
solve();
printf("%d\n", ans);
return 0;
} | 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
#define endl "\n"
#define MOD 1000000007
#define DEB(x) cout << "##" << x << "##" << endl;
void solve() {
ll n, count1 = 0, ans = 0;
cin >> n;
while (n % 2 == 0) {
n = n / 2;
count1++;
}
ans += (sqrt(1.0 + 8 * count1) - 1) / 2;
for (int i = 3; i * i <= n; i += 2) {
count1 = 0;
if (n == 1)
break;
while (n % i == 0) {
n = n / i;
count1++;
}
ans += (sqrt(1.0 + 8 * count1) - 1) / 2;
}
if (n != 1) {
ans++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tt = 1;
// cin>>tt;
while (tt--)
solve();
return 0;
}
| #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
#define endl "\n"
#define MOD 1000000007
#define DEB(x) cout << "##" << x << "##" << endl;
void solve() {
ll n, count1 = 0, ans = 0;
cin >> n;
while (n % 2 == 0) {
n = n / 2;
count1++;
}
ans += (sqrt(1.0 + 8 * count1) - 1) / 2;
for (int i = 3; i <= sqrt(n); i += 2) {
count1 = 0;
if (n == 1)
break;
while (n % i == 0) {
n = n / i;
count1++;
}
ans += (sqrt(1.0 + 8 * count1) - 1) / 2;
}
if (n != 1) {
ans++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tt = 1;
// cin>>tt;
while (tt--)
solve();
return 0;
}
| 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, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key(val): returns the number of values less than val
// find_by_order(k): returns an iterator to the kth largest element (0-based)
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, ans = 0, p;
cin >> n;
for (int i = 2; i * i <= n; i++) {
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
for (int j = 1;; j++) {
if (cnt < j) {
break;
}
cnt = cnt - j;
ans++;
}
}
if (n > 1) {
ans++;
}
cout << ans << "\n";
} | #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, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key(val): returns the number of values less than val
// find_by_order(k): returns an iterator to the kth largest element (0-based)
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, ans = 0, p;
cin >> n;
for (int i = 2; i < 1000010; i++) {
ll cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
for (int j = 1;; j++) {
if (cnt < j) {
break;
}
cnt = cnt - j;
ans++;
}
}
if (n > 1) {
ans++;
}
cout << ans << "\n";
} | 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) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
}
if (n > 1) {
mp[n]++;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
factor(n);
int ans = 0;
for (auto aa : mp) {
long double p = aa.second;
int val = (sqrt(1 + 8 * p) - 1) / 2;
ans += val;
}
cout << ans << endl;
return 0;
} | #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) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
}
if (n > 1) {
mp[n]++;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
factor(n);
int ans = 0;
for (auto aa : mp) {
long double p = aa.second;
int val = (sqrt(1 + 8 * p) - 1) / 2;
ans += val;
}
cout << ans << endl;
return 0;
} | 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) {
cnt -= j;
j++;
ops++;
}
}
}
if (n > 1)
ops++;
cout << ops << '\n';
}
int main() {
int T;
T = 1;
for (int t = 1; t <= T; t++)
solve_test();
return 0;
}
| #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) {
cnt -= j;
j++;
ops++;
}
}
}
if (n > 1)
ops++;
cout << ops << '\n';
}
int main() {
int T;
T = 1;
for (int t = 1; t <= T; t++)
solve_test();
return 0;
}
| 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;
}
if (n != 1)
f[n] = 1;
return f;
}
int main(void) {
ll N;
cin >> N;
auto f = factor(N);
ll ans = 0;
for (auto x : f) {
int i = 1;
int y = x.second;
while (y >= i) {
y -= i;
i++;
ans++;
}
}
cout << ans << endl;
return 0;
} | #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;
}
if (n != 1)
f[n] = 1;
return f;
}
int main(void) {
ll N;
cin >> N;
auto f = factor(N);
ll ans = 0;
for (auto x : f) {
int i = 1;
int y = x.second;
while (y >= i) {
y -= i;
i++;
ans++;
}
}
cout << ans << endl;
return 0;
} | 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++;
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
}
| #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++;
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
}
| 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;
}
}
}
if (n != 1)
p.push_back(1);
int cnt = 0;
for (int i = 0; i < (int)p.size(); i++) {
int num = 1;
while (p[i] - num >= 0) {
cnt++;
p[i] -= num;
num++;
}
}
cout << cnt << endl;
return 0;
} | #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;
}
}
}
if (n != 1)
p.push_back(1);
int cnt = 0;
for (int i = 0; i < (int)p.size(); i++) {
int num = 1;
while (p[i] - num >= 0) {
cnt++;
p[i] -= num;
num++;
}
}
cout << cnt << endl;
return 0;
} | 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 long n) {
// map<ll,ll> first=素因数 second=first素因数の数
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 main() {
ll N;
cin >> N;
map<ll, ll> mp = prime_factorization(N);
ll ans = 0;
for (auto s : mp) {
for (int i = 1; i <= s.second; i++) {
ans++;
s.second -= i;
}
}
cout << ans << endl;
} | #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 long n) {
// map<ll,ll> first=素因数 second=first素因数の数
map<ll, ll> res;
for (int i = 2; i <= n / i; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
int main() {
ll N;
cin >> N;
map<ll, ll> mp = prime_factorization(N);
ll ans = 0;
for (auto s : mp) {
for (int i = 1; i <= s.second; i++) {
ans++;
s.second -= i;
}
}
cout << ans << endl;
} | 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) {
n /= i;
cnt++;
}
v.push_back(cnt);
}
}
if (n > 1)
v.push_back(1);
sort(v.begin(), v.end());
int ans = 0;
int p = 1;
for (int i = 0; i < (int)v.size(); i++) {
while (a[p] <= v[i])
p++;
ans += p - 1;
}
cout << ans << endl;
return 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) {
n /= i;
cnt++;
}
v.push_back(cnt);
}
}
if (n > 1)
v.push_back(1);
sort(v.begin(), v.end());
int ans = 0;
int p = 1;
for (int i = 0; i < (int)v.size(); i++) {
while (a[p] <= v[i])
p++;
ans += p - 1;
}
cout << ans << endl;
return 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, cnt));
}
if (N != 1) {
res.push_back(make_pair(N, 1));
}
return res;
}
int main(void) {
ll N;
cin >> N;
vector<pair<ll, ll>> res = prime_factorize(N);
ll cnt = 0;
for (int i = 0; i < res.size(); i++) {
for (int j = 1; j <= res.at(i).second; j++) {
ll tmp = pow(res.at(i).first, j);
if (N % tmp == 0) {
N /= tmp;
cnt++;
}
if (N < tmp)
break;
}
}
cout << cnt << endl;
}
| #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, cnt));
}
if (N != 1) {
res.push_back(make_pair(N, 1));
}
return res;
}
int main(void) {
ll N;
cin >> N;
vector<pair<ll, ll>> res = prime_factorize(N);
ll cnt = 0;
for (int i = 0; i < res.size(); i++) {
for (int j = 1; j <= res.at(i).second; j++) {
ll tmp = pow(res.at(i).first, j);
if (N % tmp == 0) {
N /= tmp;
cnt++;
}
if (N < tmp)
break;
}
}
cout << cnt << endl;
}
| 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
#define no cout << "no" << endl
#define vec(a, y, x) vector<vector<char>> a(y, vector<char>(x))
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const in N = 1000000 /*値*/;
void eratosthenes(bool prime[N]) {
rep(i, N) prime[i] = 1;
prime[0] = prime[1] = 0;
rep(i, N) {
if (prime[i]) {
for (int j = i + i; j < N; j += i) {
prime[j] = 0;
}
}
}
}
int main() {
in n;
cin >> n;
bool prime[N];
vector<pair<in, int>> p;
eratosthenes(prime);
rep(i, N) {
if (prime[i]) {
pair<in, int> a;
a.first = i;
a.second = 0;
p.push_back(a);
}
}
int adi = 0;
int m = p.size();
// int M=1;
/*rep(i,m){
if(p.at(i).first*p.at(i).first>n) break;
M=i;
}*/
while (n > 1) {
rep(i, m + 1) {
if (n % p.at(i).first == 0 && i != m) {
// cout<<p.at(i).first;
p.at(i).second++;
if (p.at(i).first != 0)
n = n / p.at(i).first;
break;
}
if (i == m) {
adi = 1;
n = 1;
break;
}
}
}
int ans = adi;
// cout<<ans<<endl;
rep(i, m) {
int b = p.at(i).second;
if (b == 0)
continue;
if (b < 3) {
ans += 1;
continue;
}
if (b < 6) {
ans += 2;
continue;
}
if (b < 10) {
ans += 3;
continue;
}
if (b < 15) {
ans += 4;
continue;
}
if (b < 21) {
ans += 5;
continue;
}
if (b < 28) {
ans += 6;
continue;
}
if (b < 36) {
ans += 7;
continue;
}
ans += 8;
}
cout << ans << endl;
/*rep(i,50)
cout<<p.at(i).first<<" ";*/
// cout<<m<
} | #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
#define no cout << "no" << endl
#define vec(a, y, x) vector<vector<char>> a(y, vector<char>(x))
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const in N = 1000000 /*値*/;
void eratosthenes(bool prime[N]) {
rep(i, N) prime[i] = 1;
prime[0] = prime[1] = 0;
rep(i, N) {
if (prime[i]) {
for (int j = i + i; j < N; j += i) {
prime[j] = 0;
}
}
}
}
int main() {
in n;
cin >> n;
bool prime[N];
vector<pair<in, int>> p;
eratosthenes(prime);
rep(i, N) {
if (prime[i]) {
pair<in, int> a;
a.first = i;
a.second = 0;
p.push_back(a);
}
}
int adi = 0;
int m = p.size();
// int M=1;
/*rep(i,m){
if(p.at(i).first*p.at(i).first>n) break;
M=i;
}*/
while (n > 1) {
rep(i, m + 1) {
if (i != m && n % p.at(i).first == 0) {
// cout<<p.at(i).first;
p.at(i).second++;
if (p.at(i).first != 0)
n = n / p.at(i).first;
break;
}
if (i == m) {
adi = 1;
n = 1;
break;
}
}
}
int ans = adi;
// cout<<ans<<endl;
rep(i, m) {
int b = p.at(i).second;
if (b == 0)
continue;
if (b < 3) {
ans += 1;
continue;
}
if (b < 6) {
ans += 2;
continue;
}
if (b < 10) {
ans += 3;
continue;
}
if (b < 15) {
ans += 4;
continue;
}
if (b < 21) {
ans += 5;
continue;
}
if (b < 28) {
ans += 6;
continue;
}
if (b < 36) {
ans += 7;
continue;
}
ans += 8;
}
cout << ans << endl;
/*rep(i,50)
cout<<p.at(i).first<<" ";*/
// cout<<m<
} | 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;
a++;
ans++;
}
}
if (n != 1) {
ans++;
}
cout << ans << endl;
} | #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;
a++;
ans++;
}
}
if (n != 1) {
ans++;
}
cout << ans << endl;
} | 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;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
map<ll, int> Map;
for (int n = 2; n * n <= N; ++n) {
while (N % n == 0) {
Map[n]++;
N /= n;
}
}
if (N != 1) {
Map[N] = 1;
}
vector<int> Sum(11);
for (int i = 1; i <= 10; ++i) {
Sum[i] = Sum[i - 1] + i;
}
int Ans = 0;
for (auto &z : Map) {
int k = z.second;
for (int i = 1; i <= 10; ++i) {
if (k < Sum[i]) {
Ans += i - 1;
break;
}
}
}
cout << Ans << endl;
return 0;
}
| #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;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
map<ll, int> Map;
for (ll n = 2; n * n <= N; ++n) {
while (N % n == 0) {
Map[n]++;
N /= n;
}
}
if (N != 1) {
Map[N] = 1;
}
vector<int> Sum(11);
for (int i = 1; i <= 10; ++i) {
Sum[i] = Sum[i - 1] + i;
}
int Ans = 0;
for (auto &z : Map) {
int k = z.second;
for (int i = 1; i <= 10; ++i) {
if (k < Sum[i]) {
Ans += i - 1;
break;
}
}
}
cout << Ans << endl;
return 0;
}
| 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.