problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03049 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
const lli mod = 1000000007;
void precal() { return; }
void solve() {
lli n, A = 0, B = 0, C = 0, D = 0;
cin >> n;
string s[n];
for (int i = 0; i < n; ++i) {
cin >> s[i];
for (int j = 1; j < s[i].size(); ++j) {
if (s[i][j - 1] == 'A' and s[i][j] == 'B')
D++;
}
if (*s[i].begin() == 'B' and *s[i].rbegin() == 'A')
C++;
else if (*s[i].begin() == 'B')
B++;
else if (*s[i].rbegin() == 'A')
A++;
}
if (A and B) {
A--;
B--;
D += C + 1;
} else if (A) {
A--;
D += C;
} else if (B) {
B--;
D += C;
} else {
D += C - 1;
}
D += min(A, B);
cout << D << '\n';
}
int main() {
precal();
int t = 1;
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
const lli mod = 1000000007;
void precal() { return; }
void solve() {
lli n, A = 0, B = 0, C = 0, D = 0;
cin >> n;
string s[n];
for (int i = 0; i < n; ++i) {
cin >> s[i];
for (int j = 1; j < s[i].size(); ++j) {
if (s[i][j - 1] == 'A' and s[i][j] == 'B')
D++;
}
if (*s[i].begin() == 'B' and *s[i].rbegin() == 'A')
C++;
else if (*s[i].begin() == 'B')
B++;
else if (*s[i].rbegin() == 'A')
A++;
}
if (A and B) {
A--;
B--;
D += C + 1;
} else if (A) {
A--;
D += C;
} else if (B) {
B--;
D += C;
} else {
D += max(0LL, C - 1);
}
D += min(A, B);
cout << D << '\n';
}
int main() {
precal();
int t = 1;
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 867,033 | 867,034 | u516708338 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int a = 0;
int b = 0;
int both = 0;
int base = 0;
rep(i, n) {
rep(j, 1, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
base++;
}
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
both++;
} else if (s[i][0] == 'B') {
b++;
} else if (s[i][s[i].size() - 1] == 'A') {
a++;
}
}
cerr << a << "," << b << "," << both << "," << base << endl;
ll ans = 0;
ans += base;
if (base == 0) {
ans += min(a, b);
} else {
if (a + b > 0) {
ans += min(a, b) + base;
} else {
ans += base - 1;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int a = 0;
int b = 0;
int both = 0;
int base = 0;
rep(i, n) {
rep(j, 1, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
base++;
}
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
both++;
} else if (s[i][0] == 'B') {
b++;
} else if (s[i][s[i].size() - 1] == 'A') {
a++;
}
}
cerr << a << "," << b << "," << both << "," << base << endl;
ll ans = 0;
ans += base;
if (both == 0) {
ans += min(a, b);
} else {
if (a + b > 0) {
ans += min(a, b) + both;
} else {
ans += both - 1;
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 867,035 | 867,036 | u174404613 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ll x = n / i;
x--;
ans += x;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
// n = mk + k = k(m+1) k<m
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ll x = n / i;
x--;
if (x > i)
ans += x;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 867,037 | 867,038 | u074488832 | cpp |
p03050 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, a.size()) cin >> a[i]
#define overload4(_1, _2, _3, _4, name, ...) name
/*#define rep1(n) for(int i=0;i<(int)n;++i)
#define rep2(i,n) for(int i=0;i<(int)n;++i)
#define rep3(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rep4(i,a,b,c) for(int i=(int)a;i<(int)b;i+=(int)c)*/
#define rep1(n) for (ll i = 0; i < (ll)n; ++i)
#define rep2(i, n) for (ll i = 0; i < (ll)n; ++i)
#define rep3(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define rep4(i, a, b, c) for (int i = (ll)a; i < (ll)b; i += (ll)c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#ifdef _DEBUG
#define debug1(a) cerr << #a << ": " << a << "\n"
#define debug2(a, b) cerr << #a << ": " << a << ", " << #b << ": " << b << "\n"
#define debug3(a, b, c) \
cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " \
<< c << "\n"
#define debug4(a, b, c, d) \
cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " \
<< c << ", " << #d << ": " << d << "\n"
#define debug(...) \
overload4(__VA_ARGS__, debug4, debug3, debug2, debug1)(__VA_ARGS__)
#define vecout(a) \
cerr << #a << ": ["; \
rep(i, a.size()) { \
cerr << a[i]; \
cerr << (i == a.size() - 1 ? "" : ","); \
} \
cerr << "]\n"
#else
#define debug(...)
#define vecout(a)
#endif
#define mp make_pair
// struct doset{doset(int n){cout << fixed << setprecision(n);cerr << fixed <<
// setprecision(n);}}; struct
// myset{myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}};
void myset() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void doset(int n) { cout << fixed << setprecision(n); }
using ll = long long;
using ld = long double;
using dou = double;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod1 = 1000000007LL;
const ll mod2 = 998244353LL;
typedef pair<ll, ll> P;
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool change(T &a, U &b) {
if (a > b) {
swap(a, b);
return 1;
}
return 0;
}
// nのm乗をMODで割ったあまりO(logm)
ll modpow(ll n, ll m, ll MOD) {
if (m == 0)
return 1;
if (m < 0)
return -1;
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n, ll m) {
if (m == 0)
return 1;
if (m < 0)
return -1;
ll res = 1;
while (m) {
if (m & 1)
res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
//素数判定O(sqrt(N))
template <class T> inline bool isp(T n) {
bool res = true;
if (n == 1 || n == 0)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
template <class T = int> T in() {
T x;
cin >> x;
return x;
}
inline bool Yes(bool b) {
cout << (b ? "Yes\n" : "No\n");
return b;
}
inline bool YES(bool b) {
cout << (b ? "YES\n" : "NO\n");
return b;
}
/*----------------------------------マクロここまで----------------------------------*/
ll __lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
myset();
ll N;
cin >> N;
ll ans = 0;
rep(i, 1, N) {
ll K = (N - i) / i;
if (K < i) {
break;
}
if (K * i + i == N)
ans += K;
// cout << K << "\n";
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, a.size()) cin >> a[i]
#define overload4(_1, _2, _3, _4, name, ...) name
/*#define rep1(n) for(int i=0;i<(int)n;++i)
#define rep2(i,n) for(int i=0;i<(int)n;++i)
#define rep3(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rep4(i,a,b,c) for(int i=(int)a;i<(int)b;i+=(int)c)*/
#define rep1(n) for (ll i = 0; i < (ll)n; ++i)
#define rep2(i, n) for (ll i = 0; i < (ll)n; ++i)
#define rep3(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define rep4(i, a, b, c) for (int i = (ll)a; i < (ll)b; i += (ll)c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#ifdef _DEBUG
#define debug1(a) cerr << #a << ": " << a << "\n"
#define debug2(a, b) cerr << #a << ": " << a << ", " << #b << ": " << b << "\n"
#define debug3(a, b, c) \
cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " \
<< c << "\n"
#define debug4(a, b, c, d) \
cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " \
<< c << ", " << #d << ": " << d << "\n"
#define debug(...) \
overload4(__VA_ARGS__, debug4, debug3, debug2, debug1)(__VA_ARGS__)
#define vecout(a) \
cerr << #a << ": ["; \
rep(i, a.size()) { \
cerr << a[i]; \
cerr << (i == a.size() - 1 ? "" : ","); \
} \
cerr << "]\n"
#else
#define debug(...)
#define vecout(a)
#endif
#define mp make_pair
// struct doset{doset(int n){cout << fixed << setprecision(n);cerr << fixed <<
// setprecision(n);}}; struct
// myset{myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}};
void myset() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void doset(int n) { cout << fixed << setprecision(n); }
using ll = long long;
using ld = long double;
using dou = double;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod1 = 1000000007LL;
const ll mod2 = 998244353LL;
typedef pair<ll, ll> P;
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool change(T &a, U &b) {
if (a > b) {
swap(a, b);
return 1;
}
return 0;
}
// nのm乗をMODで割ったあまりO(logm)
ll modpow(ll n, ll m, ll MOD) {
if (m == 0)
return 1;
if (m < 0)
return -1;
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n, ll m) {
if (m == 0)
return 1;
if (m < 0)
return -1;
ll res = 1;
while (m) {
if (m & 1)
res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
//素数判定O(sqrt(N))
template <class T> inline bool isp(T n) {
bool res = true;
if (n == 1 || n == 0)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
template <class T = int> T in() {
T x;
cin >> x;
return x;
}
inline bool Yes(bool b) {
cout << (b ? "Yes\n" : "No\n");
return b;
}
inline bool YES(bool b) {
cout << (b ? "YES\n" : "NO\n");
return b;
}
/*----------------------------------マクロここまで----------------------------------*/
ll __lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
myset();
ll N;
cin >> N;
ll ans = 0;
rep(i, 1, N) {
ll K = (N - i) / i;
if (K <= i) {
break;
}
if (K * i + i == N)
ans += K;
debug(K);
}
cout << ans << "\n";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 867,043 | 867,044 | u527652459 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i < n; i++) {
ll ans = (n - i) / i;
if ((n - i) % i == 0)
res += ans;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i < n; i++) {
ll ans = (n - i) / i;
if ((n - i) % i == 0 && ans > i)
res += ans;
}
cout << res << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,051 | 867,052 | u955282280 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<ll>>;
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = INF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
rep(i, V) { d[i] = INF; }
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
class UnionFind {
public:
ll par[100005];
ll depth[100005];
ll nGroup[100005];
UnionFind(ll n) { init(n); }
void init(ll n) {
for (ll i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if (depth[x] == depth[y])
depth[x]++;
}
}
};
const ll MAX = 510000;
ll 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;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<ll> depth;
vector<ll> subtree_size;
void dfs(const Graph &G, ll v, ll p, ll d) {
depth[v] = d;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1);
}
// 帰りがけ時に、部分木サイズを求める
subtree_size[v] = INF; // 自分自身
vl q;
for (auto c : G[v]) {
if (c == p)
continue;
q.pb(subtree_size[c]); // 子のサイズを加える
}
ll qq = q.size();
// cout << v << " " << qq << endl;
if (qq == 0)
subtree_size[v] = 0;
else {
sort(all(q));
// rep(i,qq)cout << q[i];
// cout << endl;
ll caa = 0;
rep(i, qq) { caa = max(qq + q[i] - i, caa); }
subtree_size[v] = caa;
}
}
ll dp[100005][2];
int main() {
ll n;
cin >> n;
ll ans = 0;
ll k = 1;
while (1) {
if ((n - k) < k * k) {
break;
}
if ((n - k) % k == 0) {
ans += (n - k) / k;
}
k++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
using Graph = vector<vector<ll>>;
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = INF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
rep(i, V) { d[i] = INF; }
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
class UnionFind {
public:
ll par[100005];
ll depth[100005];
ll nGroup[100005];
UnionFind(ll n) { init(n); }
void init(ll n) {
for (ll i = 0; i < n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if (depth[x] == depth[y])
depth[x]++;
}
}
};
const ll MAX = 510000;
ll 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;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<ll> depth;
vector<ll> subtree_size;
void dfs(const Graph &G, ll v, ll p, ll d) {
depth[v] = d;
for (auto nv : G[v]) {
if (nv == p)
continue; // nv が親 p だったらダメ
dfs(G, nv, v, d + 1);
}
// 帰りがけ時に、部分木サイズを求める
subtree_size[v] = INF; // 自分自身
vl q;
for (auto c : G[v]) {
if (c == p)
continue;
q.pb(subtree_size[c]); // 子のサイズを加える
}
ll qq = q.size();
// cout << v << " " << qq << endl;
if (qq == 0)
subtree_size[v] = 0;
else {
sort(all(q));
// rep(i,qq)cout << q[i];
// cout << endl;
ll caa = 0;
rep(i, qq) { caa = max(qq + q[i] - i, caa); }
subtree_size[v] = caa;
}
}
ll dp[100005][2];
int main() {
ll n;
cin >> n;
ll ans = 0;
ll k = 1;
while (1) {
if ((n - k) <= k * k) {
break;
}
if ((n - k) % k == 0) {
ans += (n - k) / k;
}
k++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,064 | 867,065 | u722640678 | cpp |
p03050 | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define show(x) cerr << #x << " = " << x << endl;
using namespace std;
using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
ll LINF = 1000000000000000000;
typedef vector<ll> vl;
typedef vector<pl> vp;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct UnionFind {
vector<int> d;
UnionFind(int n = 0) : d(n, -1) {}
int root(int x) {
if (d[x] < 0)
return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
int factor_size() {
int ans = 0;
rep(i, d.size()) {
if (d[i] < 0) {
ans++;
}
}
return ans;
}
};
ll d[201][201];
void warshall_floyd(ll n) {
rep(k, n) {
rep(i, n) {
rep(j, n) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); }
}
}
}
struct edge {
ll to, cost;
};
struct dijkstra {
ll V;
vector<vector<edge>> G;
vector<ll> d;
dijkstra(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = LINF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void run(ll s) {
rep(i, V) { d[i] = LINF; }
d[s] = 0;
priority_queue<pl, vector<pl>, greater<pl>> que;
que.push(pl(0, s));
while (!que.empty()) {
pl p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pl(d[e.to], e.to));
}
}
}
}
};
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200005);
// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<pl> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<pl> res(1, pl(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
vector<pair<ll, int>> factor(ll x) {
vector<pair<ll, int>> res;
for (int p : primes) {
int y = 0;
while (x % p == 0)
x /= p, ++y;
if (y != 0)
res.emplace_back(p, y);
}
if (x != 1)
res.emplace_back(x, 1);
return res;
}
};
int main() {
ll n;
cin >> n;
ll ret = 0;
for (ll i = 1; i * i < n; i++) {
if (n % i != 0)
continue;
ret += n / i - 1;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define show(x) cerr << #x << " = " << x << endl;
using namespace std;
using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
ll LINF = 1000000000000000000;
typedef vector<ll> vl;
typedef vector<pl> vp;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct UnionFind {
vector<int> d;
UnionFind(int n = 0) : d(n, -1) {}
int root(int x) {
if (d[x] < 0)
return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
int factor_size() {
int ans = 0;
rep(i, d.size()) {
if (d[i] < 0) {
ans++;
}
}
return ans;
}
};
ll d[201][201];
void warshall_floyd(ll n) {
rep(k, n) {
rep(i, n) {
rep(j, n) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); }
}
}
}
struct edge {
ll to, cost;
};
struct dijkstra {
ll V;
vector<vector<edge>> G;
vector<ll> d;
dijkstra(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
rep(i, V) { d[i] = LINF; }
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void run(ll s) {
rep(i, V) { d[i] = LINF; }
d[s] = 0;
priority_queue<pl, vector<pl>, greater<pl>> que;
que.push(pl(0, s));
while (!que.empty()) {
pl p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(pl(d[e.to], e.to));
}
}
}
}
};
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200005);
// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<pl> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<pl> res(1, pl(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
vector<pair<ll, int>> factor(ll x) {
vector<pair<ll, int>> res;
for (int p : primes) {
int y = 0;
while (x % p == 0)
x /= p, ++y;
if (y != 0)
res.emplace_back(p, y);
}
if (x != 1)
res.emplace_back(x, 1);
return res;
}
};
int main() {
ll n;
cin >> n;
ll ret = 0;
for (ll i = 1; i * i + i < n; i++) {
if (n % i != 0)
continue;
ret += n / i - 1;
}
cout << ret << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 867,079 | 867,080 | u442810826 | cpp |
p03050 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
ll n;
cin >> n;
ll ans = 0;
set<ll> div;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
div.insert(i);
div.insert(n / i);
}
}
div.insert(n);
for (auto it = (--div.end()); it != div.begin(); it--) {
if (*it > sqrt(n)) {
ans += *it;
ans -= 1;
} else
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
ll n;
cin >> n;
ll ans = 0;
set<ll> div;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
div.insert(i);
div.insert(n / i);
}
}
div.insert(n);
for (auto it = (--div.end()); it != div.begin(); it--) {
if ((*it) - 1 > sqrt(n)) {
ans += *it;
ans -= 1;
} else
break;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,081 | 867,082 | u563170985 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
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); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return (a > b && (a = b, true));
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return (a < b && (a = b, true));
}
template <typename T> vector<T> makeVector(size_t a, T b) {
return (vector<T>(a, b));
}
template <typename... Ts> auto makeVector(size_t a, Ts... ts) {
return (vector<decltype(makeVector(ts...))>(a, makeVector(ts...)));
}
template <typename T> bool isin(T y, T x, T h, T w) {
return (0 <= y && 0 <= x && y < h && x < w);
}
template <typename T> bool isin1(T y, T x, T h, T w) {
return (0 < y && 0 < x && y <= h && x <= w);
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
if (v.size()) {
os << v[0];
for (int i = 1; i < v.size(); i++)
os << " " << v[i];
}
return (os);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v)
is >> u;
return (is);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
return (is >> p.first >> p.second);
}
void Main() {
ll N;
cin >> N;
ll sum = 0;
for (ll fl = 1; fl * fl <= N; fl++) {
ll r, l;
r = N / fl;
l = N / (fl + 1) + 1;
//[l, r]
// ma = N-fl a = (N-fl)/l
for (ll a = max((N - fl) / r - 1, 1ll); a <= (N - fl) / l + 1; a++) {
if ((N - fl) % a == 0) {
ll m = (N - fl) / a;
if (l <= m && m <= r) {
sum += m;
}
}
}
}
cout << sum << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
Main();
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
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); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return (a > b && (a = b, true));
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return (a < b && (a = b, true));
}
template <typename T> vector<T> makeVector(size_t a, T b) {
return (vector<T>(a, b));
}
template <typename... Ts> auto makeVector(size_t a, Ts... ts) {
return (vector<decltype(makeVector(ts...))>(a, makeVector(ts...)));
}
template <typename T> bool isin(T y, T x, T h, T w) {
return (0 <= y && 0 <= x && y < h && x < w);
}
template <typename T> bool isin1(T y, T x, T h, T w) {
return (0 < y && 0 < x && y <= h && x <= w);
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
if (v.size()) {
os << v[0];
for (int i = 1; i < v.size(); i++)
os << " " << v[i];
}
return (os);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v)
is >> u;
return (is);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
return (is >> p.first >> p.second);
}
void Main() {
ll N;
cin >> N;
ll sum = 0;
ll fl;
for (fl = 1; fl * fl < N; fl++) {
ll r, l;
r = N / fl;
l = N / (fl + 1) + 1;
// cout << l << " " << r << endl;
//[l, r]
// ma = N-fl a = (N-fl)/l
for (ll a = max((N - fl) / r - 1, 1ll); a <= (N - fl) / l + 1; a++) {
if ((N - fl) % a == 0) {
ll m = (N - fl) / a;
if (l <= m && m <= r) {
sum += m;
}
}
}
}
cout << sum << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
Main();
return (0);
}
| [
"variable_declaration.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,091 | 867,092 | u239239546 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
// 約数の列挙 O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> divs = divisor(N);
sort(ALL(divs));
ll ans = 0;
rep(i, SZ(divs)) {
ll m = (N / divs[i]) - 1;
if (m < divs[i])
continue;
else
ans += m;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
// 約数の列挙 O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> divs = divisor(N);
sort(ALL(divs));
ll ans = 0;
rep(i, SZ(divs)) {
ll m = (N / divs[i]) - 1;
if (m <= divs[i])
continue;
else
ans += m;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,097 | 867,098 | u175975349 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
// 約数の列挙 O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> divs = divisor(N);
sort(ALL(divs));
ll ans = 0;
rep(i, SZ(divs)) {
ll m = (N / divs[i]) - 1;
if (m < divs[i])
break;
else
ans += m;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
// 約数の列挙 O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> divs = divisor(N);
sort(ALL(divs));
ll ans = 0;
rep(i, SZ(divs)) {
ll m = (N / divs[i]) - 1;
if (m <= divs[i])
continue;
else
ans += m;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 867,099 | 867,098 | u175975349 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> 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;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int n;
cin >> n;
int ans = 0;
auto p = enum_divisors(n);
for (auto x : p) {
int tmp = x - 1;
if (n % tmp == n / tmp)
ans += tmp;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> 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;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int n;
cin >> n;
int ans = 0;
auto p = enum_divisors(n);
for (auto x : p) {
int tmp = x - 1;
if (tmp != 0 && n % tmp == n / tmp)
ans += tmp;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 867,100 | 867,101 | u809967037 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
// 約数列挙
vector<ll> divisor(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(begin(ret), end(ret));
sort(ret.begin(), ret.end(), greater<ll>());
return (ret);
}
int main() {
ll n;
cin >> n;
vector<ll> v = divisor(n);
ll ans = 0;
for (auto d : v) {
if (d > n / d)
ans += d - 1;
}
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 = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
// 約数列挙
vector<ll> divisor(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(begin(ret), end(ret));
sort(ret.begin(), ret.end(), greater<ll>());
return (ret);
}
int main() {
ll n;
cin >> n;
vector<ll> v = divisor(n);
ll ans = 0;
for (auto d : v) {
if (d - 1 > n / d)
ans += d - 1;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 867,112 | 867,113 | u501163846 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
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;
}
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll res = 0;
ll tmp = 1;
while (true) {
ll buf = n - tmp;
if (buf / tmp < tmp)
break;
if (buf % tmp == 0) {
res += buf / tmp;
}
tmp++;
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
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;
}
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll res = 0;
ll tmp = 1;
while (true) {
ll buf = n - tmp;
if (buf / tmp <= tmp)
break;
if (buf % tmp == 0) {
res += buf / tmp;
}
tmp++;
}
cout << res << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,116 | 867,117 | u222866518 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int> P;
#define foreach(ix, i) for (auto &(ix) : (i))
typedef long double ld;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
ll n;
cin >> n;
vi ress;
ll ans = 0;
for (ll i = 1; i <= sqrt(n) + 1; i++) {
if (n % i == 0) {
ress.push_back(i - 1);
ress.push_back(n / i - 1);
}
}
rep(i, ress.size()) {
if (ress[i] == 0)
continue;
if (n % ress[i] == n / ress[i])
ans += ress[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int> P;
#define foreach(ix, i) for (auto &(ix) : (i))
typedef long double ld;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
ll n;
cin >> n;
vl ress;
ll ans = 0;
for (ll i = 1; i <= sqrt(n) + 1; i++) {
if (n % i == 0) {
ress.push_back(i - 1);
ress.push_back(n / i - 1);
}
}
rep(i, ress.size()) {
if (ress[i] == 0)
continue;
if (n % ress[i] == n / ress[i])
ans += ress[i];
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 867,120 | 867,121 | u495881622 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) \
rep(i, x.size()) { \
cout << x[i] << " "; \
cout << endl; \
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int, int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
ll n;
cin >> n;
set<ll> st;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
st.insert(i);
st.insert(n / i);
}
}
ll ans = 0;
for (ll x : st) {
ll m = n / x - 1;
if (1 <= x && x <= m)
ans += m;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) \
rep(i, x.size()) { \
cout << x[i] << " "; \
cout << endl; \
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int, int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
ll n;
cin >> n;
set<ll> st;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
st.insert(i);
st.insert(n / i);
}
}
ll ans = 0;
for (ll x : st) {
ll m = n / x - 1;
if (1 <= x && x <= m - 1)
ans += m;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 867,124 | 867,125 | u697968316 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i < sqrt(n); ++i) {
if (n % i == 0) {
ans += n / i - 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i < round(sqrt(n)); ++i) {
if (n % i == 0) {
ans += n / i - 1;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 867,140 | 867,141 | u031240034 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (i < N / i) {
ans += N / i - 1;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (i < N / i - 1) {
ans += N / i - 1;
}
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,142 | 867,143 | u424374375 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (i - 1 < N / i) {
ans += N / i - 1;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (i < N / i - 1) {
ans += N / i - 1;
}
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 867,144 | 867,143 | u424374375 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 0;
for (int i = 1; i < sqrt(N); i++) {
long M = N - i;
if (M % i == 0)
ans += M / i;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 0;
for (int i = 1; i < sqrt(N); i++) {
long M = N - i;
if (M % i == 0 && i < M / i)
ans += M / i;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,145 | 867,146 | u223172354 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i * i + i <= N; i++) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i * i + i < N; i++) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,159 | 867,160 | u237390401 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i * i + 1 <= N; i++) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i * i + i < N; i++) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 867,161 | 867,160 | u237390401 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
template <typename T> vector<T> _divisor(T a) {
vector<T> res;
for (T i = 1; i * i <= a; i++) {
if (a % i == 0) {
res.push_back(i);
if (i != 1 && i * i != a)
res.push_back(a / i);
}
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vll a = _divisor(n);
a.push_back(n);
ll cnt = 0;
rep(i, a.size()) {
if (a[i] > sqrt(n)) {
cnt += a[i] - 1;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
template <typename T> vector<T> _divisor(T a) {
vector<T> res;
for (T i = 1; i * i <= a; i++) {
if (a % i == 0) {
res.push_back(i);
if (i != 1 && i * i != a)
res.push_back(a / i);
}
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vll a = _divisor(n);
a.push_back(n);
ll cnt = 0;
rep(i, a.size()) {
if (a[i] > sqrt(n) + 1) {
cnt += a[i] - 1;
}
}
cout << cnt << endl;
} | [
"control_flow.branch.if.condition.change"
] | 867,170 | 867,171 | u696865277 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
long long n, ans;
cin >> n;
ans = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i - i > 1)
ans += n / i;
ans--;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
long long n, ans;
cin >> n;
ans = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i - i > 1)
ans += n / i - 1;
}
}
cout << ans << endl;
return 0;
}
| [] | 867,176 | 867,177 | u890331732 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repl(i, s, e) for (int i = s; i < e; i++)
#define reple(i, s, e) for (int i = s; i <= e; i++)
#define revrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
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;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i * i < N; i++) {
if (N % i == 0) {
ans += (N / i - 1);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repl(i, s, e) for (int i = s; i < e; i++)
#define reple(i, s, e) for (int i = s; i <= e; i++)
#define revrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
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;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i * i <= N - 2 * i; i++) {
if (N % i == 0) {
ans += (N / i - 1);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,183 | 867,184 | u889915625 | cpp |
p03050 | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 10000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
/*
const int MAX = 1000000;
const int MOD = 1000000007;
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;
//そのまま計算すると負の値になるので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;
}
//二分累乗法
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;
}
*/
/*
//UnionFind木
struct UnionFind{
vector<long long int> par; //par[i] : iの親の番号
vector<long long int> rnk; //root[i] : iの木のサイズ
//コンストラクタ
UnionFind(long long int n): par(n), rnk(n){
//木の初期化
for(long long int i = 0; i < n; i++){
par[i] = i;
rnk[i] = 1;
}
}
//データxが属する木の根を再帰で取得
long long int root(long long int x){
if(par[x] == x){
return x;
}else{
return par[x] = root(par[x]);
}
}
//xとyが同じ木に属しているかを判定
bool same(long long int x, long long int y){
return root(x) == root(y);
}
//xとyの木を併合
void unite(long long int x, long long int y){
long long int rx = root(x); //xの根
long long int ry = root(y); //yの根
if(rx == ry) return; //根が同じならそのまま
//併合するときにサイズを足し合わせる
if(rnk[rx] < rnk[ry]){
par[rx] = ry;
rnk[ry] += rnk[rx];
}else{
par[ry] = rx;
rnk[rx] += rnk[ry];
}
}
//属している木のサイズを取得
long long int size(long long int x){
return rnk[root(x)];
}
};
*/
/*
//重み付きUnionFind
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] =
SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
*/
/*
//ダイクストラ
typedef struct edge{
int to;
int cost;
} edge;
vector<edge> graph[2010];
long long int d[2010];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
for(int i = 0; i < 2010; i++){
d[i] = INF;
}
d[s] = 0;
que.push(P(s, 0));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.first;
if (d[v] < p.second) continue;
for (int i=0; i<graph[v].size(); ++i) {
edge e = graph[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(e.to, d[e.to]));
}
}
}
}
*/
/*
#素因数分解
map<long long, long long> prime_factor(long long n) {
map<long long, long long> ret;
for(long long i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
*/
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
int64_t n;
cin >> n;
vector<int64_t> v = divisor(n);
int64_t ans = 0;
for (int64_t i = 0; i < v.size(); i++) {
int64_t m = n / v[i];
if (m >= v[i] + 1) {
ans += (m - 1);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 10000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
/*
const int MAX = 1000000;
const int MOD = 1000000007;
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;
//そのまま計算すると負の値になるので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;
}
//二分累乗法
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;
}
*/
/*
//UnionFind木
struct UnionFind{
vector<long long int> par; //par[i] : iの親の番号
vector<long long int> rnk; //root[i] : iの木のサイズ
//コンストラクタ
UnionFind(long long int n): par(n), rnk(n){
//木の初期化
for(long long int i = 0; i < n; i++){
par[i] = i;
rnk[i] = 1;
}
}
//データxが属する木の根を再帰で取得
long long int root(long long int x){
if(par[x] == x){
return x;
}else{
return par[x] = root(par[x]);
}
}
//xとyが同じ木に属しているかを判定
bool same(long long int x, long long int y){
return root(x) == root(y);
}
//xとyの木を併合
void unite(long long int x, long long int y){
long long int rx = root(x); //xの根
long long int ry = root(y); //yの根
if(rx == ry) return; //根が同じならそのまま
//併合するときにサイズを足し合わせる
if(rnk[rx] < rnk[ry]){
par[rx] = ry;
rnk[ry] += rnk[rx];
}else{
par[ry] = rx;
rnk[rx] += rnk[ry];
}
}
//属している木のサイズを取得
long long int size(long long int x){
return rnk[root(x)];
}
};
*/
/*
//重み付きUnionFind
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] =
SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
*/
/*
//ダイクストラ
typedef struct edge{
int to;
int cost;
} edge;
vector<edge> graph[2010];
long long int d[2010];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
for(int i = 0; i < 2010; i++){
d[i] = INF;
}
d[s] = 0;
que.push(P(s, 0));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.first;
if (d[v] < p.second) continue;
for (int i=0; i<graph[v].size(); ++i) {
edge e = graph[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(e.to, d[e.to]));
}
}
}
}
*/
/*
#素因数分解
map<long long, long long> prime_factor(long long n) {
map<long long, long long> ret;
for(long long i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
*/
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
int64_t n;
cin >> n;
vector<int64_t> v = divisor(n);
int64_t ans = 0;
for (int64_t i = 0; i < v.size(); i++) {
int64_t m = n / v[i];
// cout << m << endl;
if (m >= v[i] + 2 && m >= 3) {
ans += (m - 1);
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,195 | 867,194 | u536712674 | cpp |
p03050 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
ll ans = 0;
ll p = 1;
while (p * (p - 1) < N) {
if ((N - p) % p == 0) {
ans += (N - p) / p;
}
p++;
}
cout << ans;
} | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
ll ans = 0;
ll p = 1;
while (p * (p + 1) < N) {
if ((N - p) % p == 0) {
ans += (N - p) / p;
}
p++;
}
cout << ans;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.condition.change"
] | 867,196 | 867,197 | u558667782 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int Ans = 0;
for (int p = 1; p < sqrt(N) + 1; p++) {
if ((N - p) % p == 0 && p < (N - p) / p) {
Ans += (N - p) / p;
}
}
cout << Ans << endl;
// (N-p)/p=m && p<m
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t Ans = 0;
for (int64_t p = 1; p < sqrt(N) + 1; p++) {
if ((N - p) % p == 0 && p < (N - p) / p) {
Ans += (N - p) / p;
}
}
cout << Ans << endl;
// (N-p)/p=m && p<m
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 867,198 | 867,199 | u164730704 | cpp |
p03050 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
void solve(void) {
int N;
cin >> N;
auto D = divisor(N);
int ANS = 0;
for (auto &&i : D) {
if (i >= 2 && N / i < i) {
ANS += i - 1;
}
// DEBUG(i);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
void solve(void) {
int N;
cin >> N;
auto D = divisor(N);
int ANS = 0;
for (auto &&i : D) {
if (i >= 2 && N / i < i - 1) {
ANS += i - 1;
}
// DEBUG(i);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 867,205 | 867,206 | u221285045 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
if (n / i - 1 < i)
break;
ans += n / i - 1;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
if (n / i - 1 <= i)
break;
ans += n / i - 1;
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,219 | 867,220 | u596311864 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 0;
ll i = 1;
while (i * i <= N - i) {
if ((N - i) % i == 0)
ans += (N - i) / i;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 0;
ll i = 1;
while (i * i < N - i) {
if ((N - i) % i == 0)
ans += (N - i) / i;
i++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 867,222 | 867,223 | u858575800 | cpp |
p03050 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i < sqrt(n); i++) {
if (n % i == 0 && n / i - i > 2) {
ans += n / i - 1;
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i < sqrt(n); i++) {
if (n % i == 0 && n / i - i >= 2) {
ans += n / i - 1;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,224 | 867,225 | u136342563 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1 || N == 2) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (ll i = 1; i * (i + 2) < N; i++) {
if (N % i == 0)
ans += N / i - 1;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1 || N == 2) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (ll i = 1; i * (i + 1) < N; i++) {
if (N % i == 0)
ans += N / i - 1;
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,235 | 867,236 | u293156359 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL << 60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << 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;
}
int main(void) {
ll N;
cin >> N;
ll ans = 0;
FOR(i, 1, sqrt(N) + 1) {
if (N % i == 0) {
ll p = i;
ll m = N / p - 1;
if (N / p == N % p)
ans += p;
if (N / m == N % m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL << 60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << 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;
}
int main(void) {
ll N;
cin >> N;
ll ans = 0;
FOR(i, 1, sqrt(N) + 1) {
if (N % i == 0) {
ll p = i;
ll m = N / p - 1;
if (N / p == N % p)
ans += p;
if (m > 0 && N / m == N % m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 867,241 | 867,242 | u934272719 | cpp |
p03050 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ll p = n / i;
ll m = max(p, i);
ll u = min(p, i);
if (m != u) {
ans += m - 1;
}
}
}
COUT(ans);
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ll p = n / i;
ll m = max(p, i);
ll u = min(p, i);
if (m - 1 > u) {
ans += m - 1;
}
}
}
COUT(ans);
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,245 | 867,246 | u103850114 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll ans = 0;
ll i;
for (i = 1; i * i < n; i++) {
ll m = (n - i) / i;
if ((n - i) % i == 0)
ans += m;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll ans = 0;
ll i;
for (i = 1; i * i < n; i++) {
ll m = (n - i) / i;
if ((n - i) % i == 0 && i < m)
ans += m;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,274 | 867,275 | u194908943 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
// n以下のうち、商とあまりが等しくなるもの
// a*m+m=n (m<a)
// aで全探索
ll ans = 0;
for (ll i = 1; i < sqrtl(n) + 1; i++) {
ll tmp = (n - i) / i;
if (n / tmp == n % tmp) {
ans += tmp;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i < sqrt(n); i++) {
ll tmp = (n - i) / i;
if (n / tmp == n % tmp) {
ans += tmp;
}
}
cout << ans << endl;
}
| [
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 867,282 | 867,283 | u089885969 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
// n以下のうち、商とあまりが等しくなるもの
// a*m+m=n (m<a)
// aで全探索
ll ans = 0;
for (ll i = 1; i < sqrtl(n) + 1; i++) {
ll tmp = (n - i) / i;
if (n / tmp == n % tmp) {
ans += tmp;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
// n以下のうち、商とあまりが等しくなるもの
// a*m+m=n (m<a)
// aで全探索
ll ans = 0;
for (ll i = 1; i < sqrtl(n); i++) {
ll tmp = (n - i) / i;
if (n / tmp == n % tmp) {
ans += tmp;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 867,282 | 867,284 | u089885969 | cpp |
p03050 | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
lint n;
cin >> n;
lint ans = 0;
for (lint i = 1; i * (i + 1) <= n; i++) {
ans += n % i == 0 ? n / i - 1 : 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
lint n;
cin >> n;
lint ans = 0;
for (lint i = 1; i * (i + 1) < n; i++) {
ans += n % i == 0 ? n / i - 1 : 0;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,293 | 867,294 | u045575753 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
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;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
/*
i:余り
(n-i)/i = m ⇔ n-i = i*m
m > i より n-i > i*i
n-i < n より n > i*i
*/
for (ll i = 1; i * i < n; i++) {
if (!((n - i) % i))
ans += (n - i) / i;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
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;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
/*
i:余り
(n-i)/i = m ⇔ n-i = i*m
m > i より n-i > i*i
n-i < n より n > i*i
*/
for (ll i = 1; i * i < n; i++) {
if (n % ((n - i) / i) == i)
ans += (n - i) / i;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 867,303 | 867,304 | u608258653 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
long long K;
cin >> K;
long long res = 0;
int i = 1;
while (true) {
if ((K - i) / i < i)
break;
if ((K - i) % i != 0) {
++i;
continue;
}
long long q = (K - i) / i;
res += q;
++i;
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
long long K;
cin >> K;
long long res = 0;
int i = 1;
while (true) {
if ((K - i) / i <= i)
break;
if ((K - i) % i != 0) {
++i;
continue;
}
long long q = (K - i) / i;
res += q;
++i;
}
cout << res << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,307 | 867,308 | u600896094 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, ans = 0;
cin >> N;
for (long long int i = 1; i * i <= N - 1; ++i) {
if (N % i == 0) {
ans += N / i - 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, ans = 0;
cin >> N;
for (long long int i = 1; i * i + i < N; ++i) {
if (N % i == 0) {
ans += N / i - 1;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 867,313 | 867,312 | u883725898 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll ans = 0LL;
for (ll k = 1; k * (k + 1) <= N; k++) {
if (N % k != 0)
continue;
ans += N / k - 1LL;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll ans = 0LL;
for (ll k = 1; k * (k + 1) < N; k++) {
if (N % k != 0)
continue;
ans += N / k - 1LL;
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,318 | 867,319 | u263715385 | cpp |
p03050 | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> res;
for (long long i = 1; i * i < N; i++) {
if (N % i != 0)
continue;
res.push_back(i);
}
// cout << res.size() << endl;
for (int i = 0; i < res.size(); i++) {
if (N / res[i] - 1 > 0) {
ans += N / res[i] - 1;
}
}
cout << ans << endl;
} | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> res;
for (long long i = 1; i * i < N; i++) {
if (N % i != 0)
continue;
res.push_back(i);
}
// cout << res.size() << endl;
for (int i = 0; i < res.size(); i++) {
if (N / res[i] - 1 > res[i]) {
ans += N / res[i] - 1;
}
}
cout << ans << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,324 | 867,323 | u660341491 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
unsigned long long res = 0, n;
int main() {
cin >> n;
int x = ceil(sqrt(n));
for (int i = 1; i < x; ++i)
if (n % i == 0 && n / (n / i - i) == n % (n / i - 1))
res = res + n / i - 1;
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
unsigned long long res = 0, n;
int main() {
cin >> n;
int x = ceil(sqrt(n));
for (int i = 1; i < x; ++i)
if (n % i == 0 && n / (n / i - 1) == n % (n / i - 1))
res = res + n / i - 1;
cout << res;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 867,327 | 867,328 | u641294972 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define MOD 1000000007
int add(int a, int b) {
int z = (a % MOD + b % MOD) % MOD;
return z;
}
void solve() {
int n;
cin >> n;
int sum = 0;
if (n == 1 || n == 2) {
cout << '0' << endl;
return;
}
if (n == 3) {
cout << '2' << endl;
return;
}
for (int i = 1; i <= sqrt(n); i++) {
if ((n - i) % i == 0) {
int z = (n - i) / i;
if (n % z == i)
sum = add(sum, (n - i) / i);
}
}
cout << sum << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define MOD 1000000007
int add(int a, int b) {
int z = (a % MOD + b % MOD) % MOD;
return z;
}
void solve() {
int n;
cin >> n;
int sum = 0;
if (n == 1 || n == 2) {
cout << '0' << endl;
return;
}
if (n == 3) {
cout << '2' << endl;
return;
}
for (int i = 1; i <= sqrt(n); i++) {
if ((n - i) % i == 0) {
int z = (n - i) / i;
if (n % z == i)
sum += (n - i) / i;
}
}
cout << sum << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
} | [
"assignment.change",
"call.arguments.change"
] | 867,331 | 867,332 | u531372048 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, sum{};
cin >> N;
for (long long i = 1; N / i > sqrt(N); i++) {
if (N % i == 0) {
sum += N / i - 1;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, sum{};
cin >> N;
for (long long i = 1; N / i - 1 > sqrt(N); i++) {
if (N % i == 0) {
sum += N / i - 1;
}
}
cout << sum << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,335 | 867,336 | u936790121 | cpp |
p03050 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
signed main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1;; i++) {
if ((n - i) % i == 0) {
int res = (n - i) / i;
if (res >= i)
ans += res;
}
if ((n - i) / i < i)
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
signed main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1;; i++) {
if ((n - i) % i == 0) {
int res = (n - i) / i;
if (res > i)
ans += res;
}
if ((n - i) / i <= i)
break;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,337 | 867,338 | u147049801 | cpp |
p03050 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define REP(i, e) for (int i = 0; i < (int)(e); i++)
#define FOR(i, b, e) for (int i = (int)(b); i < (int)(e); i++)
#define ALL(c) (c).begin(), (c).end()
#define EACH(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define RALL(c) (c).rbegin(), (c).rend()
#define ALLA(a, n) ((a) + 0), ((a) + n)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<string> vstring;
typedef vector<double> vdouble;
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
template <class T> void pp(T v) {
EACH(it, v) cout << *it << ' ';
cout << endl;
}
template <class T> T &ls(T &a, T b) {
if (b < a)
a = b;
return a;
}
template <class T> T &gs(T &a, T b) {
if (b > a)
a = b;
return a;
}
inline ll to_i(const string &s) {
ll n;
sscanf(s.c_str(), "%lld", &n);
return n;
}
inline string to_s(ll n) {
char buf[32];
sprintf(buf, "%lld", n);
return string(buf);
}
string pop(vstring &v) {
string s = v.back();
v.pop_back();
return s;
}
int main() {
ll n;
while (cin >> n) {
ll result = 0;
for (ll q = 1;; ++q) {
ll m = (n - q) / q;
if (m < q)
break;
if ((n - q) % q == 0) {
// cout << "qm " << q << ' ' << m << endl;
result += m;
}
}
cout << result << endl;
}
}
| #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define REP(i, e) for (int i = 0; i < (int)(e); i++)
#define FOR(i, b, e) for (int i = (int)(b); i < (int)(e); i++)
#define ALL(c) (c).begin(), (c).end()
#define EACH(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define RALL(c) (c).rbegin(), (c).rend()
#define ALLA(a, n) ((a) + 0), ((a) + n)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<string> vstring;
typedef vector<double> vdouble;
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
template <class T> void pp(T v) {
EACH(it, v) cout << *it << ' ';
cout << endl;
}
template <class T> T &ls(T &a, T b) {
if (b < a)
a = b;
return a;
}
template <class T> T &gs(T &a, T b) {
if (b > a)
a = b;
return a;
}
inline ll to_i(const string &s) {
ll n;
sscanf(s.c_str(), "%lld", &n);
return n;
}
inline string to_s(ll n) {
char buf[32];
sprintf(buf, "%lld", n);
return string(buf);
}
string pop(vstring &v) {
string s = v.back();
v.pop_back();
return s;
}
int main() {
ll n;
while (cin >> n) {
ll result = 0;
for (ll q = 1;; ++q) {
ll m = (n - q) / q;
if (m <= q)
break;
if ((n - q) % q == 0) {
// cout << "qm " << q << ' ' << m << endl;
result += m;
}
}
cout << result << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,349 | 867,350 | u943277588 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long N;
long answer = 0;
cin >> N;
for (long i = 1; i * i < N; i++) {
if (N % i == 0 && i < N / i) {
answer += (N / i - 1);
}
}
cout << answer << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long N;
long answer = 0;
cin >> N;
for (long i = 1; i * i < N; i++) {
if (N % i == 0 && i < N / i - 1) {
answer += (N / i - 1);
}
}
cout << answer << '\n';
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,353 | 867,354 | u518623219 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long N;
long answer = 0;
cin >> N;
for (long i = 1; i * i <= N; i++) {
if (N % i == 0 && i < N / i) {
answer += (N / i - 1);
}
}
cout << answer << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long N;
long answer = 0;
cin >> N;
for (long i = 1; i * i < N; i++) {
if (N % i == 0 && i < N / i - 1) {
answer += (N / i - 1);
}
}
cout << answer << '\n';
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 867,355 | 867,354 | u518623219 | cpp |
p03050 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n;
for (ll i = 1; i * (i + 1) <= n; ++i) {
if (n % i == 0) {
ans += (n / i - 1);
}
}
cout << ans << " ";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n;
for (ll i = 1; i * (i + 1) < n; ++i) {
if (n % i == 0) {
ans += (n / i - 1);
}
}
cout << ans << " ";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,356 | 867,357 | u305721160 | cpp |
p03050 | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
long long sqrt(int N) {
for (long long i = 0; i < N; i++) {
if (i * i > N) {
return i - 1;
}
}
return -1;
}
int main() {
long long N;
cin >> N;
long long sqrt_N = sqrt(N);
long long ans = 0;
for (long long i = sqrt_N + 1; i >= 1; i--) {
if (N % i == 0 && N / i > 1) {
long long m = N / i - 1;
if (N / m == N % m) {
ans += m;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
long long sqrt(long long N) {
for (long long i = 0; i < N; i++) {
if (i * i > N) {
return i - 1;
}
}
return -1;
}
int main() {
long long N;
cin >> N;
long long sqrt_N = sqrt(N);
long long ans = 0;
for (long long i = sqrt_N + 1; i >= 1; i--) {
if (N % i == 0 && N / i > 1) {
long long m = N / i - 1;
if (N / m == N % m) {
ans += m;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 867,363 | 867,364 | u623349537 | cpp |
p03050 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define repX(i, j, n) for (ll i = j; i < n; i++)
#define rep(i, n) repX(i, 0, n)
int main() // https://atcoder.jp/contests/diverta2019/tasks/diverta2019_d
{
ll n, sum = 0;
cin >> n;
for (ll m = 1; m * m <= n; m++) {
if (n % m == 0 && n / m - m > 0)
sum += n / m - 1;
}
cout << sum << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define repX(i, j, n) for (ll i = j; i < n; i++)
#define rep(i, n) repX(i, 0, n)
int main() // https://atcoder.jp/contests/diverta2019/tasks/diverta2019_d
{
ll n, sum = 0;
cin >> n;
for (ll m = 1; m * m <= n; m++) {
if (n % m == 0 && n / m - m > 1)
sum += n / m - 1;
}
cout << sum << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 867,372 | 867,373 | u997648604 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p, ans = 0;
cin >> n;
p = sqrt(n);
for (long long i = 1; i <= p; ++i)
if (n % i == 0) {
if (n / (i - 1) * i == n)
ans += i - 1;
if (i * i != n) {
long long k = n / i;
if (n / (k - 1) * k == n)
ans += k - 1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p, ans = 0;
cin >> n;
p = sqrt(n);
for (long long i = 1; i <= p; ++i)
if (n % i == 0) {
if (i != 1 && n / (i - 1) * i == n)
ans += i - 1;
if (i * i != n) {
long long k = n / i;
if (n / (k - 1) * k == n)
ans += k - 1;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,394 | 867,395 | u087205264 | cpp |
p03050 | #include <cmath>
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll r;
ll total = 0;
if (N >= 2) {
ll c = (ll)(sqrt((double)N + 0.25) - 0.5);
for (ll r = 1; r <= c; r++) {
if (N % r == 0) {
total += (N / r) - 1;
}
}
cout << total;
} else if (N == 1) {
cout << 0;
}
return 0;
} | #include <cmath>
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll r;
ll total = 0;
if (N >= 2) {
ll c = (ll)(sqrt((double)N + 1) - 1);
for (ll r = 1; r <= c; r++) {
if (N % r == 0) {
total += (N / r) - 1;
}
}
cout << total;
} else if (N == 1) {
cout << 0;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 867,402 | 867,403 | u904123392 | cpp |
p03050 | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#define orta ((bas + son) / 2)
#define all(x) x.begin(), x.end()
#define pw(x) (1 << (x))
#define inf 1000000000
#define MOD 1000000007
#define N 200005
#define M 1000003
#define MAX 2000000
#define LOG 20
#define KOK 300
#define EPS 0.0000001
using namespace std;
struct query {
ll l, r, num;
};
int main() {
ll n;
scanf("%lld", &n);
vector<query> v;
for (ll i = 1; i * i <= n; i++) {
ll l = n / (i + 1) + 1;
ll r = n / i;
v.pb({l, r, n - i});
}
reverse(all(v));
ll ans = 0;
for (ll i = 1; i * i <= n; i++) {
ll mod = v[0].num % i;
ll beg = (mod ? i - mod : 0);
for (ll j = beg; j < sz(v); j += i) {
if (i * i <= v[j].num) {
ll ot = v[j].num / i;
if (i >= v[j].l && i <= v[j].r)
ans += i;
if (ot >= v[j].l && ot <= v[j].r && ot != i)
ans += ot;
}
}
}
printf("%lld", ans);
} | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#define orta ((bas + son) / 2)
#define all(x) x.begin(), x.end()
#define pw(x) (1 << (x))
#define inf 1000000000
#define MOD 1000000007
#define N 200005
#define M 1000003
#define MAX 2000000
#define LOG 20
#define KOK 300
#define EPS 0.0000001
using namespace std;
struct query {
ll l, r, num;
};
int main() {
ll n;
scanf("%lld", &n);
vector<query> v;
for (ll i = 1; i * i < n; i++) {
ll l = n / (i + 1) + 1;
ll r = n / i;
v.pb({l, r, n - i});
}
reverse(all(v));
ll ans = 0;
for (ll i = 1; i * i < n; i++) {
ll mod = v[0].num % i;
ll beg = (mod ? i - mod : 0);
for (ll j = beg; j < sz(v); j += i) {
if (i * i < v[j].num) {
ll ot = v[j].num / i;
if (i >= v[j].l && i <= v[j].r)
ans += i;
if (ot >= v[j].l && ot <= v[j].r && ot != i)
ans += ot;
}
}
}
printf("%lld", ans);
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 867,404 | 867,405 | u918828564 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 0;
// r * m + r = N (r <= m - 1)
for (ll r = 1; r * (r + 1) <= N; r++) {
if (N % r == 0) {
ans += N / r - 1;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 0;
// r * m + r = N (r <= m - 1)
for (ll r = 1; r * (r + 2) <= N; r++) {
if (N % r == 0) {
ans += N / r - 1;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,410 | 867,411 | u426057057 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2147483600; // 10^9
ll MOD = 1000000007;
ll N;
//約数の列挙O(√n)
vector<P> divisor(ll n) {
vector<P> res(0);
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back({n / i, i});
}
}
return res;
}
void solve() {
cin >> N;
ll res = 0;
vector<P> list = divisor(N);
for (int i = 0; i < list.size(); i++) {
ll f = list.at(i).first, s = list.at(i).second;
if (f > s)
res += f - 1;
}
cout << res << endl;
}
int main(void) { solve(); } | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2147483600; // 10^9
ll MOD = 1000000007;
ll N;
//約数の列挙O(√n)
vector<P> divisor(ll n) {
vector<P> res(0);
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back({n / i, i});
}
}
return res;
}
void solve() {
cin >> N;
ll res = 0;
vector<P> list = divisor(N);
for (int i = 0; i < list.size(); i++) {
ll f = list.at(i).first, s = list.at(i).second;
if (f - 1 > s)
res += f - 1;
}
cout << res << endl;
}
int main(void) { solve(); } | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,412 | 867,413 | u633284019 | cpp |
p03050 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
// N= t*m + t=(t+1)*m;
vector<ll> get_divs(ll N) {
vector<ll> divs;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
divs.push_back(i);
if (i * i != N)
divs.push_back(N / i);
}
}
sort(divs.begin(), divs.end());
return divs;
}
int main() {
ll N;
cin >> N;
vector<ll> divs = get_divs(N);
ll ans = 0;
for (auto m : divs) {
ll t = N / m - 1;
if (m > t)
ans += m;
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
// N= t*m + t=(m+1)*t;
vector<ll> get_divs(ll N) {
vector<ll> divs;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
divs.push_back(i);
if (i * i != N)
divs.push_back(N / i);
}
}
sort(divs.begin(), divs.end());
return divs;
}
int main() {
ll N;
cin >> N;
vector<ll> divs = get_divs(N);
ll ans = 0;
for (auto t : divs) {
ll m = N / t - 1;
if (m > t)
ans += m;
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"variable_declaration.name.change",
"expression.operation.binary.change"
] | 867,414 | 867,415 | u019239408 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * x < n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * (x + 1) < n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 867,416 | 867,417 | u027091475 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * x <= n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * (x + 1) < n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 867,418 | 867,417 | u027091475 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 2; x * x <= n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll x = 1; x * (x + 1) < n; x++)
if (n % x == 0)
ans += n / x - 1;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 867,419 | 867,417 | u027091475 | cpp |
p03050 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdbool.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define N (1000000000 + 7)
#define INF 1e16
using namespace std;
typedef pair<ll, ll> P;
int main(void) {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (ll m = 1; m + 1 <= sqrt(n); m++) {
if (n == (m + 1) * (n % m))
ans += m;
if ((n % (m + 1) == 0) && n == (n / (m + 1)) * (n % (n / (m + 1) - 1)))
ans += n / (m + 1) - 1;
}
cout << ans + (n - 1) << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdbool.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define N (1000000000 + 7)
#define INF 1e16
using namespace std;
typedef pair<ll, ll> P;
int main(void) {
ll n;
cin >> n;
if (n == 2) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (ll m = 1; m + 1 <= sqrt(n); m++) {
if (n == (m + 1) * (n % m))
ans += m;
if ((n % (m + 1) == 0) && n == (n / (m + 1)) * (n % (n / (m + 1) - 1)))
ans += n / (m + 1) - 1;
}
cout << ans + (n - 1) << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 867,420 | 867,421 | u744305661 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;*/
long long n;
cin >> n;
long long r = sqrt(n);
vector<long long> a;
if (n % r == 0) {
a.push_back(r);
}
for (int i = 1; i <= r; i++) {
if (r * r == n)
continue;
if (n % i == 0) {
a.push_back(i);
a.push_back(n / i);
}
}
sort(a.begin(), a.end());
long long ans = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == 1)
continue;
if (n / (a[i] - 1) == n % (a[i] - 1)) {
ans += (a[i] - 1);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;*/
long long n;
cin >> n;
long long r = sqrt(n);
vector<long long> a;
if (n % r == 0) {
a.push_back(r);
}
for (long long i = 1; i <= r; i++) {
if (i * i == n)
continue;
if (n % i == 0) {
a.push_back(i);
a.push_back(n / i);
}
}
sort(a.begin(), a.end());
long long ans = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == 1)
continue;
if (n / (a[i] - 1) == n % (a[i] - 1)) {
ans += (a[i] - 1);
}
}
cout << ans;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 867,428 | 867,429 | u482034961 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;*/
long long n;
cin >> n;
int r = sqrt(n);
vector<long long> a;
if (n % r == 0) {
a.push_back(r);
}
for (int i = 1; i <= r; i++) {
if (r * r == n)
continue;
if (n % i == 0) {
a.push_back(i);
a.push_back(n / i);
}
}
sort(a.begin(), a.end());
long long ans = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == 1)
continue;
if (n / (a[i] - 1) == n % (a[i] - 1)) {
ans += (a[i] - 1);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;*/
long long n;
cin >> n;
long long r = sqrt(n);
vector<long long> a;
if (n % r == 0) {
a.push_back(r);
}
for (long long i = 1; i <= r; i++) {
if (i * i == n)
continue;
if (n % i == 0) {
a.push_back(i);
a.push_back(n / i);
}
}
sort(a.begin(), a.end());
long long ans = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == 1)
continue;
if (n / (a[i] - 1) == n % (a[i] - 1)) {
ans += (a[i] - 1);
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 867,430 | 867,429 | u482034961 | cpp |
p03050 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
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...));
}
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);
}
#define ARRAY_MAX 5005
const ll INF = 1e9 + 7;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
const ll MOD = 1e9 + 7;
//約数の列挙
template <typename T> vector<T> divisor(T n) {
vector<T> res;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> a = divisor(n);
sort(a.begin(), a.end());
ll ans = 0;
for (int i = 0; i < a.size(); i++) {
if (n / a[i] < a[i]) {
ans += a[i] - 1;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
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...));
}
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);
}
#define ARRAY_MAX 5005
const ll INF = 1e9 + 7;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
const ll MOD = 1e9 + 7;
//約数の列挙
template <typename T> vector<T> divisor(T n) {
vector<T> res;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> a = divisor(n);
sort(a.begin(), a.end());
ll ans = 0;
for (int i = 0; i < a.size(); i++) {
if (n / a[i] < a[i] - 1) {
// cout << a[i] << endl;
ans += a[i] - 1;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,433 | 867,434 | u504142483 | cpp |
p03050 | #include <iostream>
#include <math.h>
#include <string>
#define min(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i <= (ll)sqrt(n); i++) {
if ((n % i) == 0) {
ll m = n / i - 1;
if (i == m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
#define min(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i <= (ll)sqrt(n); i++) {
if ((n % i) == 0) {
ll m = n / i - 1;
if (i < m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,437 | 867,438 | u817141277 | cpp |
p03050 | #include <iostream>
#include <math.h>
#include <string>
#define min(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i <= (ll)sqrt(n); i++) {
if ((n % i) == 0) {
ll m = n / i - 1;
if (i <= m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
#define min(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i <= (ll)sqrt(n); i++) {
if ((n % i) == 0) {
ll m = n / i - 1;
if (i < m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,439 | 867,438 | u817141277 | cpp |
p03050 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
typedef long long ll;
int M, H, W, K, A, B;
string S;
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll N;
cin >> N;
ll ans = 0;
/*for(ll m = N-1; m > 0; m--){
if(N%m == N/m) ans += m;
if(m*(m+1)<N) {
cout << m << endl;
break;
}
}*/
ll N_i = N;
ll ii = 0;
reps(i, 1, N) {
N_i--;
ii += i + i;
ii--;
if (N_i < ii)
break;
if (N_i % i == 0) {
ans += N_i / i;
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
typedef long long ll;
int M, H, W, K, A, B;
string S;
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll N;
cin >> N;
ll ans = 0;
/*for(ll m = N-1; m > 0; m--){
if(N%m == N/m) ans += m;
if(m*(m+1)<N) {
cout << m << endl;
break;
}
}*/
ll N_i = N;
ll ii = 0;
reps(i, 1, N) {
N_i--;
ii += i + i;
ii--;
if (N_i <= ii)
break;
if (N_i % i == 0) {
ans += N_i / i;
}
// cout << ans << endl;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,440 | 867,441 | u016531517 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i <= n - 1; ++i) {
if ((n - i) < i * i)
break;
if ((n - i) % i == 0)
ans += (n - i) / i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i <= n - 1; ++i) {
if ((n - i) < i * (i + 1))
break;
if ((n - i) % i == 0)
ans += (n - i) / i;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,447 | 867,448 | u123896133 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
ll cnt = 0;
// vector<ll> ans;
cin >> n;
for (int i = 1; i * i <= 1000000; i++) {
if (n % i == 0) {
ll v = n / i - 1;
if (v > i)
cnt += v;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
ll cnt = 0;
// vector<ll> ans;
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ll v = n / i - 1;
if (v > i)
cnt += v;
}
}
cout << cnt << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 867,453 | 867,452 | u484962958 | cpp |
p03050 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
typedef complex<double> xy_t;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
/*
double a = 1e12;
cout << a << endl;
*/
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; ++i) {
int flg = 0;
if ((n - i) % i == 0) {
if ((n - i) / i <= i) {
flg = 1;
break;
}
sum += (n - i) / i;
} else {
double tmp = (double)(n - i) / i;
// cout << tmp << endl;
if (tmp <= i)
flg = 1;
break;
}
if (flg)
break;
}
cout << sum << endl;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
typedef complex<double> xy_t;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; ++i) {
int flg = 0;
if ((n - i) % i == 0) {
if ((n - i) / i <= i) {
flg = 1;
break;
}
sum += (n - i) / i;
} else {
long double tmp = (double)(n - i) / i;
if (tmp <= i) {
flg = 1;
break;
}
}
if (flg)
break;
}
cout << sum << endl;
}
| [
"variable_declaration.type.widen.change"
] | 867,462 | 867,463 | u277556971 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pi(a) printf("%d\n", a)
#define psi(a) printf(" %d", a)
#define poi(a) printf("%d", a)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define Nline() printf("\n")
#define sstr(str) scanf("%s", str)
#define pstr(str) printf("%s\n", str)
#define SET(a) memset(a, -1, sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define vi vector<int>
#define vvi vector<vi>
#define all(v) (v).begin(), (v).end()
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
#define VI(a, n) \
vi a(n); \
rep(i, n) cin >> a[i];
#define sq(n) (n) * (n)
#define iso \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL);
int main() {
iso;
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i * i < n; i++) {
if (n % i == 0)
sum += n / i - 1;
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pi(a) printf("%d\n", a)
#define psi(a) printf(" %d", a)
#define poi(a) printf("%d", a)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define Nline() printf("\n")
#define sstr(str) scanf("%s", str)
#define pstr(str) printf("%s\n", str)
#define SET(a) memset(a, -1, sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define vi vector<int>
#define vvi vector<vi>
#define all(v) (v).begin(), (v).end()
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
#define VI(a, n) \
vi a(n); \
rep(i, n) cin >> a[i];
#define sq(n) (n) * (n)
#define iso \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL);
int main() {
iso;
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i * (i + 1) < n; i++) {
if (n % i == 0)
sum += n / i - 1;
}
cout << sum;
} | [
"control_flow.loop.for.condition.change"
] | 867,470 | 867,471 | u207685829 | cpp |
p03050 | #include <iostream>
#define int long long int
using namespace std;
int N;
signed main() {
cin >> N;
int ans = N - 1, m;
for (int i = 2; i * i <= N; i++) {
if (!(N % i) && N / i - 1 > i) {
ans += N / i - 1;
}
}
cout << ans << endl;
}
| #include <iostream>
#define int long long int
using namespace std;
int N;
signed main() {
cin >> N;
int ans = 0, m;
for (int i = 1; i * i <= N; i++) {
if (!(N % i) && N / i - 1 > i) {
ans += N / i - 1;
}
}
cout << ans << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 867,477 | 867,478 | u020560659 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#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 each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
ll ans = 0, m;
for (int i = 1; i < m; ++i) {
m = N / i - 1;
int div = N / m, rem = N % m;
if (div == rem)
ans += m;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#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 each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
ll ans = 0, m = N;
for (int i = 1; i < m; ++i) {
m = N / i - 1;
int div = N / m, rem = N % m;
if (div == rem)
ans += m;
}
cout << ans << endl;
}
| [
"variable_declaration.value.change"
] | 867,481 | 867,482 | u569778242 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
llong N, ans;
int main() {
cin >> N;
ans = 0;
for (llong i = 1; i * i < N; i++) {
if (N % i == 0) {
if (N % (N / i - 1) == N / i - 1)
ans += N / i - 1;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
llong N, ans;
int main() {
cin >> N;
ans = 0;
for (llong i = 1; i * i < N; i++) {
if (N % i == 0) {
if (N % (N / i - 1) == N / (N / i - 1))
ans += N / i - 1;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,498 | 867,499 | u740232619 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
int main(int argc, char **argv) {
int64_t n, ans{0};
cin >> n;
for (int64_t i = 1; i < floor(sqrt(n)); ++i) {
if (n % i == 0) {
if ((n / i - 1) > i)
ans += (n / i - 1);
else
break;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
int main(int argc, char **argv) {
int64_t n, ans{0};
cin >> n;
for (int64_t i = 1; i < floor(sqrt(n)) + 1; ++i) {
if (n % i == 0) {
if ((n / i - 1) > i)
ans += (n / i - 1);
else
break;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,500 | 867,501 | u603356062 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define clr(a, x) memset(a, x, sizeof(a))
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define X first
#define Y second
#define fastin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
int main() {
ll n;
ll ans = 0;
ll now = 1;
ll r = 1;
now = 1;
r = 1;
ans = 0;
for (; now <= n; now = n / (n / now) + 1) {
r = n / (n / now);
if (n / (n / now) - 1 >= now && n / (n / now) - 1 <= r &&
n % (n / now) == 0)
ans += n / (n / now) - 1;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define clr(a, x) memset(a, x, sizeof(a))
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define X first
#define Y second
#define fastin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
int main() {
ll n;
ll ans = 0;
ll now = 1;
ll r = 1;
cin >> n;
now = 1;
r = 1;
ans = 0;
for (; now <= n; now = n / (n / now) + 1) {
r = n / (n / now);
if (n / (n / now) - 1 >= now && n / (n / now) - 1 <= r &&
n % (n / now) == 0)
ans += n / (n / now) - 1;
}
cout << ans << endl;
}
| [] | 867,504 | 867,505 | u723875010 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define y0 y12345
#define y1 y54321
typedef unsigned long ul;
typedef long long ll;
// typedef pair<int, int> mpair;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ul sum;
ul n;
cin >> n;
sum = n - 1;
ul m = (ul)(sqrt(n) + 0.9999999999);
if (n < 3) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i < m; i++) {
if (n % i == 0) {
if (n > i * (i - 1))
sum += n / i - 1;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define y0 y12345
#define y1 y54321
typedef unsigned long ul;
typedef long long ll;
// typedef pair<int, int> mpair;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ul sum;
ul n;
cin >> n;
sum = n - 1;
ul m = (ul)(sqrt(n) + 0.9999999999);
if (n < 3) {
cout << 0 << endl;
return 0;
}
for (int i = 2; i < m; i++) {
if (n % i == 0) {
if (n / i - 1 > i)
sum += n / i - 1;
}
}
// cout << sizeof(ul) << sizeof(ll)<< endl;
cout << sum << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 867,511 | 867,512 | u398437835 | cpp |
p03050 | #pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int, int>
#define twol pair<ll, ll>
#define four pair<two, two>
#define pb push_back
#define mk make_pair
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<int>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (int)(container.size())
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define mid(a, b) (a + b >> 1)
#define minN 0
#define maxN 10000000
#define na(x) ((x) < P ? (x) : (x)-P)
#define ab(a) (-(a) < (a) ? (a) : -(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef tree<int, // aq pair<int,int> shegidzlia
null_type, less /*_equal*/<int>, // aqac
rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template <class key, class value, class cmp = std::less<key>>
using ordered_map =
tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<int, int> my_map;
inline int in() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return w ? x : -x;
}
ll m, n, ans;
int main() {
FAST;
xRand;
cin >> n;
for (ll i = 2; i <= sqrt(n); i++) {
m = i;
if (n % m == 0) {
if (n % (m - 1) == n / (m - 1))
ans += m - 1;
if (n / m != m && n % (n / m - 1) == n / (n / m - 1))
ans += n / m - 1;
}
}
ans += n - 1;
cout << ans << endl;
}
/*
* *
* * * *
* * * *
* * * *
* * * * *
* * * *
* * * *
* * *
* *
*/
| #pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int, int>
#define twol pair<ll, ll>
#define four pair<two, two>
#define pb push_back
#define mk make_pair
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<int>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (int)(container.size())
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define mid(a, b) (a + b >> 1)
#define minN 0
#define maxN 10000000
#define na(x) ((x) < P ? (x) : (x)-P)
#define ab(a) (-(a) < (a) ? (a) : -(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef tree<int, // aq pair<int,int> shegidzlia
null_type, less /*_equal*/<int>, // aqac
rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template <class key, class value, class cmp = std::less<key>>
using ordered_map =
tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<int, int> my_map;
inline int in() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return w ? x : -x;
}
ll m, n, ans;
int main() {
FAST;
xRand;
cin >> n;
for (ll i = 2; i <= sqrt(n); i++) {
m = i;
if (n % m == 0) {
if (n % (m - 1) == n / (m - 1))
ans += m - 1;
if (n / m != m && n % (n / m - 1) == n / (n / m - 1))
ans += n / m - 1;
}
}
if (n > 2)
ans += n - 1;
cout << ans << endl;
}
/*
* *
* * * *
* * * *
* * * *
* * * * *
* * * *
* * * *
* * *
* *
*/
| [
"control_flow.branch.if.add"
] | 867,524 | 867,525 | u927221551 | cpp |
p03050 | /* `
`.:ossyyyyysssssyyyyyyhyyyhyyyyysssooo+//:-.```
-sdNNMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNmmdhhyso+/-.``
`odNNNmmdhysoo+//////::::::::::::://///+ooosyyhhdmmmNmmhs+:-.`
.--:/oo+:``` ``````...--:/oshdmmmdyo/-`
`.:oymd+. ``-:/ohdNNmhs/-.`
`./ydNNNh:` `.:+ydNNNmdy+:.`
`-ohNMMNho-` `-/oydNMNmdyo/-`
`:smNMMNdo-` ``-/oydmNNNmhs/.` .odNMMNh+-`
`-/+shmNNmdyo:.`
`:hNMNmy/.` `.-+ydNNNNdo:.`
`+dNMmy/. `.-/shNMNmhs:.
.+mMNh/. `./shNMMmh+-` .oNMNo. `./ymNMNdo-`
`+mMms. .:odNMNmo-` -hNNy- `-odNMNdo- `sNMd+` `:smMMNh+.
`:mMNy- `/hmMMNh/` .hNMNs. .+dNMMms-` -mMMmo` `-smNMNd+.
`/NMMd/ `.-://:-..` ./hNMMNy:`
.sNMMh/ `:oddddmmmmhs:` `.odNMMmo. -hNMMy- `:hNMh/-:/yNMNd+`
`-omMMNh:` -dMMMy- `-::::.`` .sNMMmy+:/ymMMm+`
`/hNMMm+. :mMMMy- `.+ymNNNNmho-` .oNMMMMMNNNNNNh.
.+dNMNy:`
`/mMMMs. `:hNMMNNMMMMMh: `-+syhhyyyyyys/`
`:yNMMd/`
`+NMMMs. -yNMNy::ohNMMd/` ````````` .odNMmo.
.oNMMMs. :dNMNy/:+hNMMd/ `/hNMNh:` .sMMMNo`
-yNMMMNNNMMMNh: :hNMMm+` -sMMMN+ `:oyhhhdhhyo/-` `-yNMMh:
-hMMMm+ ```...`` `:dNMNo :dMMMd/ .+mMMy.
/mMMMh: -yNMm+ .oNMMMy- `:dMMy. .sNMMNo. `smMm/` -yMMMN+`
`:hNNy. -yMMMm/` `omNd-` :yMMMd:` `/hMm+` :hMMNh:` .sNNh.
.:///:.`.////-..:///:.`.:///:..:///:.`.:/:..////-` `:/:-` `-:://///-`
`-///:..-////-.-:////////-` `-:::-` :hMMNy- `+mMm/`
./ymh/.`.+hms:..:smh/.`.+hms:../sdms-`:ss/.-odmy:` `/ys:`-syo//odh+-`
`:smh+.`-omdo--+/::ohy/:/+-`./+:::/os+. :hMMNs- :hMNy. `+ms. .sh/` `+ms.
`:yh/` `:yho:/:. `/hy:` `:/- `+my:``:hs. `/ms- -hy: `. `/yo`
..-oy:` -ods- :hMMNs- .oMMm: `+my+:::+hd/`
`+ms.`.--yh/` -odh/` `/hy:``:/- .+ys+/ods. `:my-```:hy:
`/yo` `/hy. `-hd/` :hMMNo. /NMNo. `+my/:::/yh/` `+ms:-.`.sh/` `-/+yh/.
`/yy::o-` `+hh+ods. .oys+/:/hy: `/yo` `/dh- -yh:`
:yMMNo. :dMMh: `+mo. .sh/` `+my:`
.sh/` `.::.`-ohs-` `/yds:` `-ohs-`:hs- ``````:hy: `/ho`
-sms-` `:y+. -yMMNs- -sNMm/ ./ymh/.`.+hms:../ymh/.`.+hds/..+yo-` `/hmh+-`
`/h+` ./yh+..:smho-` `:omdo-` ./ydh+:` .+yo+/:/+:` .sMMNs-
.+NMN+` `-:::-.`.::::-..-:::-``.::::-..:::. `-::::.`
`:+. .-:-` `-::::.` `-::::-` .-::::-` `-::-.`
`+NMNy- `/mMNs. `.-..//. /dMNd:` `:dNMy: .odhs/. -yMMm+` `:dMMd/
.--`` .oNMMs- `-hNMNo
`/mMMm+` `-yNMMs` .yNMMd/` ````...............``````` -yNMMy-
-dMMNy-` ``-/+osyhhhdddddddddddhhhhhyysssoo+///::---.......``
-yNMMy-
`/dMMNy-
`-ohmNMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNmmdddhy/. `-yNMMy-
`+dMMmy.
`/dmmdddhhhyyyyyyysyssssssssssssysyyyyyhhhdddddhys+-` `:dNMMy-
`+mMMNy-` `-....````
````````` `:dMMMy. .::/+o+:.
-+ooosssooo:` `-/oo+:.` -+ssso:.+ssso:./ssso/` `.:+oo+:` `.:/oo+:.
`+dMMNh:` `/mMMNo -/:.`./yy/``/:.`-sy/``-/..+o/.`.:yh+.
.ody-` `+hh:` `/hd/` `/yo.`.oho. .+o/.`.ohs.
`:hNMMh/` `+NMMm+ `` :hm/``
.sy:` `.+y+` -ydo` `/hs. :ys. :hd- `/+- `.+dy- `os/` `..`
-sNMMms. .sNMMh: `/osydNo.
.sy:` -yh/` `+dy. `/hs. :ys. :hd- `.:+/:odh- .yy:
`/dNMmy:` :hNMNs- ```-sm+` .sy: .sds. `+ho`
`/hs. :ys. :hd- .oy/.``/hh- .sdo. ``
`-smMNd/` `+NMMm+` .-` ./so.
-yh:` -ydo-` `:so. `+hs. :yy. :hd: :hd/..-+dh:.`:ydy/:-:/:.
`+dNMms-` -yMMMd: `.:/oo+/-` ./sddyo:`
./oooo+/-` -+ydhsoooydhsoooyddh+.`/syo/-:sy+.` ./shhyo:` -omMNh/`
`+mMMN+` ```` ``````` ````
`````````````````-/o- ``` `` ````
`:hNMms-` :yMMNy- `-` .odMNh/` .omMNh-`
`/hNMmo.` `+dMNd:` -smMNh+. `+dMMd/`
.+mMMNh+.` .+dNNh/` .oNMMMmhs:.` .odNNs-
`..-----` .shdmNMNNho/-`` ./hNNd+. -+syyyyso:`
``.-/ohmNNmdyo:.` `.:smNms-`
`-++:-...``
``-/shNNNmho/-` `.:ohmNms:`
./-`````` ``````` ``````` ```````.```` `````
`.:sdNNNNdy+-`` `.:ohmNNms:`
`:/-:/+ooo/.` ./shhs+- `:oydho-``:sysoooydyo-` `-//+ooo/.`
`./sdNMMNmho/-`
`.-/shmNMmh+-` .+ss:` `./hy:` `-yh:`
.+ds. .+-` .omo. .+s:` `./hh:`
`-+hmNMMNNdy+-``
``-/ohmNNNmds:. .smo` `+my-
-yh/..``` `+ho. `/-` .om+` `+ho` .+my-
`-+hmNMMMNdhs/-```````........````````
``.:/oydNNMNmho:.` .omo. `/mh:
-ydyoooso:``+ho` `/-` .om+` .sms` `:dy:
`-+ydmNMMMNmhyyhhdddddddddddhhhyyysoo+////:::::::---::::://+oshdNNMNNmdy+:`
`:hy:` `/do. -yh:` .+my:`+ho` ./. .om+` `/dh:` `/h+.
`.:+ydmNNNNNNNNNNNNNNmmmmmmmmmmmNNNNNNNmmmmmmmdddmmmmmmNNNNNNNmdy+:.`
`:yy/-..:o+. ./hh/..:odo-.+ds.`:+/:/```:sNs-` `/hy/-..:o+.
``.:/++oooo++//::--.......-:/ymmdmds+++++++++++++++++++++/:.`
.:+o+/-.` .:ossooo+/:.`-+s+-.:oo:. `/osyso-` `.:+o+/:.` .sdddh/` +hddds-
`sddddo.
`sdddh+`
`sdddho.
`odddds.
/ydddy-
`odddd+.
:ydddh:`
`/hdddy:
-oddddo.
`:hdddh+`
.+dddds-
.sdddho`
`/hdddy.
.ydddh/`
`ohddho`
`+hdddo`
`+hddho`
`/yhhs:`
*/
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rng(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
typedef long long ll;
ll n, ke;
ll pow(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
ll q = pow(a, n / 2);
return q * q;
} else
return a * pow(a, n - 1);
}
map<ll, ll> del;
set<ll> kek;
void go(ll v) {
if (ke % (v - 1) == ke / (v - 1)) {
ll flex = kek.size();
kek.insert(v - 1);
if (flex == kek.size())
return;
} else
return;
for (auto x : del) {
if (del[x.fi]) {
del[x.fi]--;
go(v / x.fi);
del[x.fi]++;
}
}
}
main() {
cin >> n;
ke = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
n /= i;
del[i]++;
i--;
}
}
del[n]++;
go(ke);
long long ans = 0;
for (auto x : kek)
ans += x;
cout << ans;
}
| /* `
`.:ossyyyyysssssyyyyyyhyyyhyyyyysssooo+//:-.```
-sdNNMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNmmdhhyso+/-.``
`odNNNmmdhysoo+//////::::::::::::://///+ooosyyhhdmmmNmmhs+:-.`
.--:/oo+:``` ``````...--:/oshdmmmdyo/-`
`.:oymd+. ``-:/ohdNNmhs/-.`
`./ydNNNh:` `.:+ydNNNmdy+:.`
`-ohNMMNho-` `-/oydNMNmdyo/-`
`:smNMMNdo-` ``-/oydmNNNmhs/.` .odNMMNh+-`
`-/+shmNNmdyo:.`
`:hNMNmy/.` `.-+ydNNNNdo:.`
`+dNMmy/. `.-/shNMNmhs:.
.+mMNh/. `./shNMMmh+-` .oNMNo. `./ymNMNdo-`
`+mMms. .:odNMNmo-` -hNNy- `-odNMNdo- `sNMd+` `:smMMNh+.
`:mMNy- `/hmMMNh/` .hNMNs. .+dNMMms-` -mMMmo` `-smNMNd+.
`/NMMd/ `.-://:-..` ./hNMMNy:`
.sNMMh/ `:oddddmmmmhs:` `.odNMMmo. -hNMMy- `:hNMh/-:/yNMNd+`
`-omMMNh:` -dMMMy- `-::::.`` .sNMMmy+:/ymMMm+`
`/hNMMm+. :mMMMy- `.+ymNNNNmho-` .oNMMMMMNNNNNNh.
.+dNMNy:`
`/mMMMs. `:hNMMNNMMMMMh: `-+syhhyyyyyys/`
`:yNMMd/`
`+NMMMs. -yNMNy::ohNMMd/` ````````` .odNMmo.
.oNMMMs. :dNMNy/:+hNMMd/ `/hNMNh:` .sMMMNo`
-yNMMMNNNMMMNh: :hNMMm+` -sMMMN+ `:oyhhhdhhyo/-` `-yNMMh:
-hMMMm+ ```...`` `:dNMNo :dMMMd/ .+mMMy.
/mMMMh: -yNMm+ .oNMMMy- `:dMMy. .sNMMNo. `smMm/` -yMMMN+`
`:hNNy. -yMMMm/` `omNd-` :yMMMd:` `/hMm+` :hMMNh:` .sNNh.
.:///:.`.////-..:///:.`.:///:..:///:.`.:/:..////-` `:/:-` `-:://///-`
`-///:..-////-.-:////////-` `-:::-` :hMMNy- `+mMm/`
./ymh/.`.+hms:..:smh/.`.+hms:../sdms-`:ss/.-odmy:` `/ys:`-syo//odh+-`
`:smh+.`-omdo--+/::ohy/:/+-`./+:::/os+. :hMMNs- :hMNy. `+ms. .sh/` `+ms.
`:yh/` `:yho:/:. `/hy:` `:/- `+my:``:hs. `/ms- -hy: `. `/yo`
..-oy:` -ods- :hMMNs- .oMMm: `+my+:::+hd/`
`+ms.`.--yh/` -odh/` `/hy:``:/- .+ys+/ods. `:my-```:hy:
`/yo` `/hy. `-hd/` :hMMNo. /NMNo. `+my/:::/yh/` `+ms:-.`.sh/` `-/+yh/.
`/yy::o-` `+hh+ods. .oys+/:/hy: `/yo` `/dh- -yh:`
:yMMNo. :dMMh: `+mo. .sh/` `+my:`
.sh/` `.::.`-ohs-` `/yds:` `-ohs-`:hs- ``````:hy: `/ho`
-sms-` `:y+. -yMMNs- -sNMm/ ./ymh/.`.+hms:../ymh/.`.+hds/..+yo-` `/hmh+-`
`/h+` ./yh+..:smho-` `:omdo-` ./ydh+:` .+yo+/:/+:` .sMMNs-
.+NMN+` `-:::-.`.::::-..-:::-``.::::-..:::. `-::::.`
`:+. .-:-` `-::::.` `-::::-` .-::::-` `-::-.`
`+NMNy- `/mMNs. `.-..//. /dMNd:` `:dNMy: .odhs/. -yMMm+` `:dMMd/
.--`` .oNMMs- `-hNMNo
`/mMMm+` `-yNMMs` .yNMMd/` ````...............``````` -yNMMy-
-dMMNy-` ``-/+osyhhhdddddddddddhhhhhyysssoo+///::---.......``
-yNMMy-
`/dMMNy-
`-ohmNMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNmmdddhy/. `-yNMMy-
`+dMMmy.
`/dmmdddhhhyyyyyyysyssssssssssssysyyyyyhhhdddddhys+-` `:dNMMy-
`+mMMNy-` `-....````
````````` `:dMMMy. .::/+o+:.
-+ooosssooo:` `-/oo+:.` -+ssso:.+ssso:./ssso/` `.:+oo+:` `.:/oo+:.
`+dMMNh:` `/mMMNo -/:.`./yy/``/:.`-sy/``-/..+o/.`.:yh+.
.ody-` `+hh:` `/hd/` `/yo.`.oho. .+o/.`.ohs.
`:hNMMh/` `+NMMm+ `` :hm/``
.sy:` `.+y+` -ydo` `/hs. :ys. :hd- `/+- `.+dy- `os/` `..`
-sNMMms. .sNMMh: `/osydNo.
.sy:` -yh/` `+dy. `/hs. :ys. :hd- `.:+/:odh- .yy:
`/dNMmy:` :hNMNs- ```-sm+` .sy: .sds. `+ho`
`/hs. :ys. :hd- .oy/.``/hh- .sdo. ``
`-smMNd/` `+NMMm+` .-` ./so.
-yh:` -ydo-` `:so. `+hs. :yy. :hd: :hd/..-+dh:.`:ydy/:-:/:.
`+dNMms-` -yMMMd: `.:/oo+/-` ./sddyo:`
./oooo+/-` -+ydhsoooydhsoooyddh+.`/syo/-:sy+.` ./shhyo:` -omMNh/`
`+mMMN+` ```` ``````` ````
`````````````````-/o- ``` `` ````
`:hNMms-` :yMMNy- `-` .odMNh/` .omMNh-`
`/hNMmo.` `+dMNd:` -smMNh+. `+dMMd/`
.+mMMNh+.` .+dNNh/` .oNMMMmhs:.` .odNNs-
`..-----` .shdmNMNNho/-`` ./hNNd+. -+syyyyso:`
``.-/ohmNNmdyo:.` `.:smNms-`
`-++:-...``
``-/shNNNmho/-` `.:ohmNms:`
./-`````` ``````` ``````` ```````.```` `````
`.:sdNNNNdy+-`` `.:ohmNNms:`
`:/-:/+ooo/.` ./shhs+- `:oydho-``:sysoooydyo-` `-//+ooo/.`
`./sdNMMNmho/-`
`.-/shmNMmh+-` .+ss:` `./hy:` `-yh:`
.+ds. .+-` .omo. .+s:` `./hh:`
`-+hmNMMNNdy+-``
``-/ohmNNNmds:. .smo` `+my-
-yh/..``` `+ho. `/-` .om+` `+ho` .+my-
`-+hmNMMMNdhs/-```````........````````
``.:/oydNNMNmho:.` .omo. `/mh:
-ydyoooso:``+ho` `/-` .om+` .sms` `:dy:
`-+ydmNMMMNmhyyhhdddddddddddhhhyyysoo+////:::::::---::::://+oshdNNMNNmdy+:`
`:hy:` `/do. -yh:` .+my:`+ho` ./. .om+` `/dh:` `/h+.
`.:+ydmNNNNNNNNNNNNNNmmmmmmmmmmmNNNNNNNmmmmmmmdddmmmmmmNNNNNNNmdy+:.`
`:yy/-..:o+. ./hh/..:odo-.+ds.`:+/:/```:sNs-` `/hy/-..:o+.
``.:/++oooo++//::--.......-:/ymmdmds+++++++++++++++++++++/:.`
.:+o+/-.` .:ossooo+/:.`-+s+-.:oo:. `/osyso-` `.:+o+/:.` .sdddh/` +hddds-
`sddddo.
`sdddh+`
`sdddho.
`odddds.
/ydddy-
`odddd+.
:ydddh:`
`/hdddy:
-oddddo.
`:hdddh+`
.+dddds-
.sdddho`
`/hdddy.
.ydddh/`
`ohddho`
`+hdddo`
`+hddho`
`/yhhs:`
*/
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rng(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
typedef long long ll;
ll n, ke;
ll pow(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
ll q = pow(a, n / 2);
return q * q;
} else
return a * pow(a, n - 1);
}
map<ll, ll> del;
set<ll> kek;
void go(ll v) {
if (v > 1 && ke % (v - 1) == ke / (v - 1)) {
ll flex = kek.size();
kek.insert(v - 1);
if (flex == kek.size())
return;
} else
return;
for (auto x : del) {
if (del[x.fi]) {
del[x.fi]--;
go(v / x.fi);
del[x.fi]++;
}
}
}
main() {
cin >> n;
ke = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
n /= i;
del[i]++;
i--;
}
}
del[n]++;
// for(auto x : del){
// cout << x.fi << ' ' << x.se << endl;
//}
go(ke);
unsigned long long ans = 0;
for (auto x : kek)
ans += x;
cout << ans;
}
| [
"control_flow.branch.if.condition.change",
"variable_declaration.type.widen.change"
] | 867,539 | 867,540 | u122149278 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define out(x) cout << (x) << endl;
int main() {
ll n;
cin >> n;
int i;
ll ans = 0;
for (i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
int m = n / i - 1;
if (m == 0)
continue;
if (n % m == 0)
continue;
ans += m;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
// vvi(n, vector<int>(m, -1))
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define out(x) cout << (x) << endl;
int main() {
ll n;
cin >> n;
int i;
ll ans = 0;
for (i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ll m = n / i - 1;
if (m == 0)
continue;
if (n % m == n / m)
ans += m;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,541 | 867,542 | u854612287 | cpp |
p03050 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (long long int LoopVariable = (numberOFbegin)-1; \
(LoopVariable) >= (numberOFend); (LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (long long int LoopVariable = 0; (LoopVariable) < (numberOFend); \
LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
long long int n;
cin >> n;
long long int loop = 1, m = n, result = 0;
while ((n - loop) / loop >= loop) {
result += ((n - loop) / loop) * (0 == (n - loop) % loop);
loop++;
}
cout << result << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (long long int LoopVariable = (numberOFbegin)-1; \
(LoopVariable) >= (numberOFend); (LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (long long int LoopVariable = 0; (LoopVariable) < (numberOFend); \
LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
long long int n;
cin >> n;
long long int loop = 1, m = n, result = 0;
while ((n - loop) / loop > loop) {
result += ((n - loop) / loop) * (0 == (n - loop) % loop);
loop++;
}
cout << result << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 867,546 | 867,547 | u039805629 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int main() {
long long N;
std::cin >> N;
// long long ans = 0;
// for (long long i = N/100; 0 < i; --i)
// {
// if (N / i == N % i)
// std::cout << i << ": " << N / i << std::endl;
// }
// std::cout << ans << std::endl;
if (N == 1) {
std::cout << 0 << std::endl;
return 0;
}
long long ans = N - 1;
long long limit = std::sqrt(N) + 1LL;
for (long long i = 2; i <= limit; ++i) {
long long left = 1;
long long right = N;
long long n = -1;
while (left < right) {
long long mid = left + (right - left) / 2LL;
long long quot = N / mid;
if (i < quot)
left = mid + 1;
else if (quot < i)
right = mid;
else {
long long res = N % mid;
if (res == quot) {
n = mid;
break;
} else if (res < i)
right = mid;
else
left = mid + 1;
}
}
if (0 < n) {
// std::cout << n << ": " << i << std::endl;
ans += n;
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int main() {
long long N;
std::cin >> N;
// int ans1 = 0;
// for (long long i = N - 1; 0 < i; --i)
// {
// if (N / i == N % i)
// ans1 += i;
// }
if (N < 3) {
std::cout << 0 << std::endl;
return 0;
}
long long ans = N - 1;
long long limit = std::sqrt(N) + 1LL;
for (long long i = 2; i <= limit; ++i) {
long long left = 1;
long long right = N;
long long n = -1;
while (left < right) {
long long mid = left + ((right - left) / 2LL);
long long quot = N / mid;
if (i < quot)
left = mid + 1;
else if (quot < i)
right = mid;
else {
long long res = N % mid;
if (res == quot) {
n = mid;
break;
} else if (res < i)
right = mid;
else
left = mid + 1;
}
}
if (0 < n) {
// std::cout << n << ": " << i << std::endl;
ans += n;
}
}
std::cout << ans << std::endl;
return 0;
}
| [] | 867,555 | 867,556 | u866733412 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int main() {
long long N;
std::cin >> N;
// long long ans = 0;
// for (long long i = N/100; 0 < i; --i)
// {
// if (N / i == N % i)
// std::cout << i << ": " << N / i << std::endl;
// }
// std::cout << ans << std::endl;
if (N == 1) {
std::cout << 0 << std::endl;
return 0;
}
long long ans = N - 1;
long long limit = (std::sqrt(N) + 1LL) * 3;
for (long long i = 2; i <= limit; ++i) {
long long left = 1;
long long right = N;
long long n = -1;
while (left < right) {
long long mid = left + ((right - left) / 2LL);
long long quot = N / mid;
if (i < quot)
left = mid + 1;
else if (quot < i)
right = mid;
else {
long long res = N % mid;
if (res == quot) {
n = mid;
break;
} else if (res < i)
right = mid;
else
left = mid + 1;
}
}
if (0 < n) {
// std::cout << n << ": " << i << std::endl;
ans += n;
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int main() {
long long N;
std::cin >> N;
// int ans1 = 0;
// for (long long i = N - 1; 0 < i; --i)
// {
// if (N / i == N % i)
// ans1 += i;
// }
if (N < 3) {
std::cout << 0 << std::endl;
return 0;
}
long long ans = N - 1;
long long limit = (std::sqrt(N) + 1LL) * 3;
for (long long i = 2; i <= limit; ++i) {
long long left = 1;
long long right = N;
long long n = -1;
while (left < right) {
long long mid = left + ((right - left) / 2LL);
long long quot = N / mid;
if (i < quot)
left = mid + 1;
else if (quot < i)
right = mid;
else {
long long res = N % mid;
if (res == quot) {
n = mid;
break;
} else if (res < i)
right = mid;
else
left = mid + 1;
}
}
if (0 < n) {
// std::cout << n << ": " << i << std::endl;
ans += n;
}
}
std::cout << ans << std::endl;
return 0;
}
| [] | 867,557 | 867,558 | u866733412 | cpp |
p03050 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
#define cinf(n, x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define pi pair<int, int>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll m = sqrtl(n + 1);
ll ans = 0;
for (ll i = 1; i <= m; i++) {
if (n % i == 0 && i / n >= 2 + i) {
ans += (n / i) - 1;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
#define cinf(n, x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define pi pair<int, int>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll m = sqrtl(n + 1);
ll ans = 0;
for (ll i = 1; i <= m; i++) {
if (n % i == 0 && n / i >= 2 + i) {
ans += (n / i) - 1;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 867,562 | 867,563 | u139300044 | cpp |
p03050 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using pii = pair<int64_t, int64_t>;
int main() {
vector<int> isPrime(1000000, 1);
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
for (int k = 2; i * k < 1000000; k++) {
isPrime[i * k] = 0;
}
}
vector<int64_t> P;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
P.push_back(i);
}
int64_t N;
cin >> N;
map<int64_t, int64_t> M;
int64_t temp = N;
for (auto p : P) {
while (temp && temp % p == 0) {
M[p]++;
temp /= p;
}
}
if (temp != 1)
M[temp] = 1;
vector<pii> V;
for (auto p : M)
V.push_back(p);
int64_t ans = 0;
function<void(int, int64_t)> rec = [&](int i, int64_t num) {
if (i == V.size()) {
int64_t m = num - 1, k = N / num;
if (k < m)
ans += m;
} else {
for (int j = 0, k = 1; j <= V[i].second; j++, k *= V[i].first)
rec(i + 1, num * k);
}
};
rec(0, 1);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using pii = pair<int64_t, int64_t>;
int main() {
vector<int> isPrime(1000000, 1);
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
for (int k = 2; i * k < 1000000; k++) {
isPrime[i * k] = 0;
}
}
vector<int64_t> P;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
P.push_back(i);
}
int64_t N;
cin >> N;
map<int64_t, int64_t> M;
int64_t temp = N;
for (auto p : P) {
while (temp && temp % p == 0) {
M[p]++;
temp /= p;
}
}
if (temp != 1)
M[temp] = 1;
vector<pii> V;
for (auto p : M)
V.push_back(p);
int64_t ans = 0;
function<void(int, int64_t)> rec = [&](int i, int64_t num) {
if (i == V.size()) {
int64_t m = num - 1, k = N / num;
if (k < m)
ans += m;
} else {
for (int64_t j = 0, k = 1; j <= V[i].second; j++, k *= V[i].first)
rec(i + 1, num * k);
}
};
rec(0, 1);
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 867,568 | 867,569 | u587172770 | cpp |
p03050 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using pii = pair<int64_t, int64_t>;
int main() {
vector<int> isPrime(1000000, 1);
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
for (int k = 2; i * k < 1000000; k++) {
isPrime[i * k] = 0;
}
}
vector<int64_t> P;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
P.push_back(i);
}
int64_t N;
cin >> N;
map<int64_t, int64_t> M;
int64_t temp = N;
for (auto p : P) {
while (temp && temp % p == 0) {
M[p]++;
temp /= p;
}
}
if (temp)
M[temp] = 1;
vector<pii> V;
for (auto p : M)
V.push_back(p);
int64_t ans = 0;
function<void(int, int64_t)> rec = [&](int i, int64_t num) {
if (i == V.size()) {
int64_t m = num - 1, k = N / num;
if (k < m)
ans += m;
} else {
for (int64_t j = 0, k = 1; j <= V[i].second; j++, k *= V[i].first)
rec(i + 1, num * k);
}
};
rec(0, 1);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using pii = pair<int64_t, int64_t>;
int main() {
vector<int> isPrime(1000000, 1);
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
for (int k = 2; i * k < 1000000; k++) {
isPrime[i * k] = 0;
}
}
vector<int64_t> P;
for (int i = 2; i < 1000000; i++) {
if (isPrime[i])
P.push_back(i);
}
int64_t N;
cin >> N;
map<int64_t, int64_t> M;
int64_t temp = N;
for (auto p : P) {
while (temp && temp % p == 0) {
M[p]++;
temp /= p;
}
}
if (temp != 1)
M[temp] = 1;
vector<pii> V;
for (auto p : M)
V.push_back(p);
int64_t ans = 0;
function<void(int, int64_t)> rec = [&](int i, int64_t num) {
if (i == V.size()) {
int64_t m = num - 1, k = N / num;
if (k < m)
ans += m;
} else {
for (int64_t j = 0, k = 1; j <= V[i].second; j++, k *= V[i].first)
rec(i + 1, num * k);
}
};
rec(0, 1);
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 867,570 | 867,569 | u587172770 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using namespace std;
int main() {
int64 n, ans = 0;
rep1(i, sqrt(n) + 1) {
if (n % i == 0) {
int64 x = n / i;
if (x >= 1 + sqrt(n + 1)) {
ans += x - 1;
}
}
}
cout << ans;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using namespace std;
int main() {
int64 n, ans = 0;
cin >> n;
rep1(i, sqrt(n) + 1) {
if (n % i == 0) {
int64 x = n / i;
if (x >= 1 + sqrt(n + 1)) {
ans += x - 1;
}
}
}
cout << ans;
}
| [] | 867,577 | 867,578 | u170301438 | cpp |
p03050 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
//各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
//クラスを作るときは、Parentの値を全て-1にする。
//以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
long long n;
cin >> n;
long long dsum = 0;
long long cnt = 0;
if (n >= 2) {
dsum += n;
cnt++;
}
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i <= n / i - 2) {
dsum += n / i;
cnt++;
}
}
}
long long ans;
ans = dsum - cnt;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
//各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
//クラスを作るときは、Parentの値を全て-1にする。
//以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
long long n;
cin >> n;
long long dsum = 0;
long long cnt = 0;
if (n >= 3) {
dsum += n;
cnt++;
}
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i <= n / i - 2) {
dsum += n / i;
cnt++;
}
}
}
long long ans;
ans = dsum - cnt;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 867,579 | 867,580 | u222293734 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define fin << '\n'
typedef long long ll;
inline void solve() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i < n; i++) {
if (n % i == 0)
ans += n / i - 1;
}
cout << ans fin;
}
struct xyz {
xyz() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
};
} xyzzy;
signed main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fin << '\n'
typedef long long ll;
inline void solve() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * (1 + i) < n; i++) {
if (n % i == 0)
ans += n / i - 1;
}
cout << ans fin;
}
struct xyz {
xyz() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
};
} xyzzy;
signed main() {
solve();
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 867,591 | 867,592 | u678146855 | cpp |
p03050 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> enum_div(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int main() {
ll n;
CI n;
ll ans = 0;
vector<ll> d = enum_div(n);
FOR(i, 1, d.size() - 1) {
if (n / (d[i] - 1) == n % (d[i] - 1)) {
ans += d[i];
ans--;
}
}
ans += n;
ans--;
if (n == 2)
CO 0 EN;
CO ans EN;
} | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).end()
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
using VI = vector<int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> enum_div(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int main() {
ll n;
CI n;
ll ans = 0;
vector<ll> d = enum_div(n);
FOR(i, 1, d.size() - 1) {
if (n / (d[i] - 1) == n % (d[i] - 1)) {
ans += d[i];
ans--;
}
}
ans += n;
ans--;
if (n == 2)
CO 0 EN;
else
CO ans EN;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 867,599 | 867,600 | u165567408 | cpp |
p03050 | #include <iostream>
#include <stdio.h>
using namespace std;
long long int N;
int main() {
cin >> N;
long long int ans = 0;
for (long long int i = 1; i * i < N; i++) {
if ((N - i) % i == 0)
ans += (N - i) / i;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
long long int N;
int main() {
cin >> N;
long long int ans = 0;
for (long long int i = 1; i * i + i < N; i++) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 867,601 | 867,602 | u090967649 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pair<ll, ll> cp2;
typedef pair<ll, cp2> cp3;
#define fi first
#define se second
#define sec se.fi
#define thr se.se
const ll mod = 1000000007;
// 123456789
///////////////////////////////////////////////
//
//
///////////////////////////////////////////////
////////////////////////////////////////////////
////////////////////////////////////////////////
ll N;
int x;
ll ans = 0;
int main() {
cin >> N;
x = sqrt(N) + 0.999999999999;
FOR(i, 1, x) if (N % i == 0) ans += (N / i - 1);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pair<ll, ll> cp2;
typedef pair<ll, cp2> cp3;
#define fi first
#define se second
#define sec se.fi
#define thr se.se
const ll mod = 1000000007;
// 123456789
///////////////////////////////////////////////
//
//
///////////////////////////////////////////////
////////////////////////////////////////////////
////////////////////////////////////////////////
ll N;
int x;
ll ans = 0;
int main() {
cin >> N;
x = int(sqrt(N) + 0.5);
FOR(i, 1, x) if (N % i == 0) ans += (N / i - 1);
cout << ans << endl;
return 0;
}
| [
"call.add",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 867,609 | 867,610 | u701131323 | cpp |
p03050 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, m, ans = 0;
cin >> n;
for (ll k = 1; k < sqrt(n) + 1; k++) {
if (n % k == 0) {
m = n / k - 1;
if (n % m == k)
ans += m;
}
}
cout << ans << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, m, ans = 0;
cin >> n;
for (ll k = 1; k < sqrt(n) + 1; k++) {
if (n % k == 0) {
m = n / k - 1;
if (m > 0 && n % m == k)
ans += m;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,613 | 867,614 | u521271286 | cpp |
p03050 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
long long a, d, e, s, sum;
cin >> a;
s = sqrt(a) / 1;
sum = 0;
for (int i = 1; i < s + 1; i++) {
if ((a - i) / i < i) {
continue;
}
if ((a - i) % i == 0) {
sum += (a - i) / i;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
long long a, d, e, s, sum;
cin >> a;
s = sqrt(a) / 1;
sum = 0;
for (int i = 1; i < s + 1; i++) {
if ((a - i) / i <= i) {
continue;
}
if ((a - i) % i == 0) {
sum += (a - i) / i;
}
}
cout << sum << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,621 | 867,622 | u902787159 | cpp |
p03050 | #include <iostream>
main() {
long n, i, x = 0;
std::cin >> n;
for (i = 1; i * i + i < n; i++)
if (n % i == 0)
x += n / i - 1;
printf("%d\n", x);
} | #include <iostream>
main() {
long n, i, x = 0;
std::cin >> n;
for (i = 1; i * i + i < n; i++)
if (n % i == 0)
x += n / i - 1;
printf("%ld\n", x);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 867,627 | 867,628 | u073082475 | cpp |
p03050 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e10)
#define PI (acos(-1))
ll N;
ll i = 1;
ll ans = 0;
int main() {
cin >> N;
while (true) {
if ((N - i) / i < i)
break;
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
i++;
}
cout << ans << endl;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e10)
#define PI (acos(-1))
ll N;
ll i = 1;
ll ans = 0;
int main() {
cin >> N;
while (true) {
if ((N - i) / i <= i)
break;
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
i++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,636 | 867,637 | u815863697 | cpp |
p03050 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
for (long long i = 1; i < n; i++) {
if ((double)(n - i) / (double)i <= i)
break;
if ((n - i) % i == 0) {
sum += (n - i) / i;
}
}
printf("%I64d\n", sum);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
for (long long i = 1; i < n; i++) {
if ((double)(n - i) / (double)i <= i)
break;
if ((n - i) % i == 0) {
sum += (n - i) / i;
}
}
printf("%lld\n", sum);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 867,639 | 867,640 | u756776234 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.