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 8
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<i... | #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<i... | [
"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__)
#de... | #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__)
#de... | [
"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... | #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... | [
"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, ... | #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, ... | [
"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 inse... | #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 inse... | [
"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 ... | #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 ... | [
"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) {
... | #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) {
... | [
"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 = v... | #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 = v... | [
"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++... | #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++... | [
"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++... | #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++... | [
"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>
#incl... | #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>
#incl... | [
"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;
... | #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;
... | [
"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... | #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... | [
"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 pa... | #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 pa... | [
"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()) { ... | #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()) { ... | [
"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) {
vect... | #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) {
vect... | [
"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... | #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 ... | #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 ... | [
"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... | #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... | [
"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;
... | #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;
... | [
"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 <s... | #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 <s... | [
"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... | #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... | [
"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... | #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... | [
"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 / ... | #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 / ... | [
"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;
ty... | #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;
ty... | [
"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); ... | #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); ... | [
"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... | #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... | [
"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) {
... | #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) {
... | #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) {
... | [
"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... | #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... | [
"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... | #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... | [
"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 ve... | #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 ve... | [
"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 < ... | #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 < ... | [
"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' << end... | #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' << end... | [
"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) prio... | #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) prio... | [
"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... | #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... | [
"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... |
#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... | [
"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 >> ... | #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;
c... | [
"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 ... |
#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 ... | [
"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)
... | #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 ==... | [
"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 << ... | #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... | [
"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 s... | #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 s... | [
"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... | #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... | [
"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)... | #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)... | [
"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());... | #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());... | [
"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... | #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... | [
"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 lo... | #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 lo... | [
"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;... | #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 lo... | [
"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 (in... | #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 (in... | [
"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 <<... | #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 << ... | [
"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 <<... | #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 << ... | [
"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... | #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... | [
"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 (i... | #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 (i... | [
"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)
#de... | #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)
#de... | [
"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)... | #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)... | [
"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 / ... | #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 / ... | [
"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;
}
in... | #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;
}
in... | [
"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); ... | #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); ... | [] | 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, ... | #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, ... | [
"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>
#defi... | #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>
#defi... | [
"control_flow.branch.if.add"
] | 867,524 | 867,525 | u927221551 | cpp |
p03050 | /* `
`.:ossyyyyysssssyyyyyyhyyyhyyyyysssooo+//:-.```
-sdNNMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNmmdhhyso+/-.``
`odNNNmmdhysoo+//////::::::::::::://///+ooosyyhhdmmmNmmhs+:-.`
... | /* `
`.:ossyyyyysssssyyyyyyhyyyhyyyyysssooo+//:-.```
-sdNNMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNmmdhhyso+/-.``
`odNNNmmdhysoo+//////::::::::::::://///+ooosyyhhdmmmNmmhs+:-.`
... | [
"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 ma... | #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 ma... | [
"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, numberOFbe... | #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, numberOFbe... | [
"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() {
l... | #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() {
l... | [] | 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() {
l... | #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() {
l... | [] | 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++) ... | #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++) ... | [
"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 (i... | #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 (i... | [
"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 (i... | #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 (i... | [
"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 names... | #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 names... | [] | 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 ... | #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 ... | [
"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);
... | #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(fal... | [
"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) (... | #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) (... | [
"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++)
#defin... | #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++)
#defin... | [
"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;
#def... | #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;
#def... | [
"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;
i... | #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;
i... | [
"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.