problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n;
cin >> n;
LL ans = 0;
for (int i = 1; i * i * i <= n; i++) {
if (n % i == 0) {
LL c = n / i - 1;
if (n / c == n % c)
ans += c;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n;
cin >> n;
LL ans = 0;
for (LL i = 1; i * i <= n; i++) {
if ((n - i) % i == 0 && (n - i) / i > i)
ans += (n - i) / i;
}
cout << ans << endl;
} | replace | 9 | 15 | 9 | 12 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MO... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll MO... | insert | 16 | 16 | 16 | 20 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int64_t n, sum;
sum = 0;
cin >> n;
for (int64_t i = 1; i <= sqrt(n); i++) {
if ((n % i == 0) && (n ... | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int64_t n, sum;
sum = 0;
cin >> n;
for (int64_t i = 1; i <= sqrt(n); i++) {
if ((n % i == 0) && (n ... | replace | 16 | 18 | 16 | 20 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll ans;
int main() {
cin >> N;
for (ll i = 1; i * i <= N; i++)
if ((N - i) % i == 0 && N / ((N - i) / i) == N % ((N - i) / i))
ans += (N - i) / i;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll ans;
int main() {
cin >> N;
if (N == 1)
cout << 0 << endl;
else {
for (ll i = 1; i * i <= N; i++)
if ((N - i) % i == 0 && N / ((N - i) / i) == N % ((N - i) / i))
ans += (N - i) / i;
cout << ans << endl;
}
... | replace | 11 | 15 | 11 | 19 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i <= n; ++... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i <= n; ++... | replace | 16 | 17 | 16 | 18 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if ((n - i) % i != 0) {
continue;
}
ll x = (n - i) / i;
if (n / x == n % x) {
ans += x;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, ans = 0;
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if ((n - i) % i != 0) {
continue;
}
ll x = (n - i) / i;
if (x == 0) {
continue;
}
if (n / x == n % x) {
ans += x;
}
}
cout <... | insert | 12 | 12 | 12 | 15 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | insert | 87 | 87 | 87 | 93 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i... | #include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i... | replace | 36 | 38 | 36 | 40 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long res = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0 && n / (n / i - 1) == i) {
res += n / i - 1;
}
}
cout << res << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long res = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0 && n / i - 1 > 0 && n / (n / i - 1) == i) {
res += n / i - 1;
}
}
cout << res << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
vector<ll> comdiv(ll x) {
vector<ll> res;
stack<ll> big;
for (ll i = 1; i * i <= x; i++) {
if (x % i == 0) {
res.push_back(i);
big.push(x / i);
}
}
while (!big.empty()) {
res.push_back(big.... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
vector<ll> comdiv(ll x) {
vector<ll> res;
stack<ll> big;
for (ll i = 1; i * i <= x; i++) {
if (x % i == 0) {
res.push_back(i);
big.push(x / i);
}
}
while (!big.empty()) {
res.push_back(big.... | insert | 26 | 26 | 26 | 30 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)), t.end())
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 1000000007, mod9 = 1000000009;
template <class T> inline... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)), t.end())
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 1000000007, mod9 = 1000000009;
template <class T> inline... | replace | 19 | 22 | 19 | 24 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
usin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
usin... | replace | 36 | 39 | 36 | 40 | -8 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch &... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch &... | replace | 34 | 35 | 34 | 35 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
// #define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 1... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
// #define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 1... | replace | 43 | 44 | 43 | 44 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define vi vector<in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define vi vector<in... | insert | 58 | 58 | 58 | 63 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i <= n; i++) {
if ((n - i) % i == 0) {
ll tmp = (n - i) / i;
if (n / tmp == n % tmp)
res += tmp;
// cout<<i<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
ll n;
cin >> n;
ll res = 0;
for (ll i = 1; i * i <= n; i++) {
if ((n - i) % i == 0) {
ll tmp = (n - i) / i;
if (tmp == 0)
break;
if (n / tmp == n % tmp)
... | insert | 13 | 13 | 13 | 15 | 0 | |
p03050 | C++ | Time Limit Exceeded | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define pb push_back
#define ers erase
#define ins insert
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define kill(x) return cout << x, 0;
#define IOS ... | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define pb push_back
#define ers erase
#define ins insert
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define kill(x) return cout << x, 0;
#define IOS ... | replace | 35 | 36 | 35 | 36 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define sz(c) (static_cast<int>(c.size()))
#define endl "\n"
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (v) << "]" << endl;
#else
#define dump(v)
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define sz(c) (static_cast<int>(c.size()))
#define endl "\n"
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (v) << "]" << endl;
#else
#define dump(v)
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long... | replace | 40 | 41 | 40 | 41 | 0 | |
p03050 | C++ | Runtime Error | #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 <= n; i++) {
if (n % i == 0) {
int t = n / i - 1;
if (n / t == n % t)
ans += t;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
int ans = 0;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
int t = n / i - 1;
if (n / t == n % t)
ans += t;
}
}
c... | insert | 8 | 8 | 8 | 12 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll N;
cin >> N;
ll sum ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
ll N;
cin >> N;
ll sum ... | replace | 27 | 29 | 27 | 31 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
long long N;
std::map<long long, int> map;
long long ans;
void check(long long value) {
if (value =... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
long long N;
std::map<long long, int> map;
long long ans;
void check(long long value) {
if (value =... | replace | 55 | 56 | 55 | 57 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i * i <= N; i++) {
if (N... | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
int main() {
ll N;
cin >> N;
ll ans = 0;
if (N == 1) {
cout << 0 << endl;
re... | insert | 13 | 13 | 13 | 17 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define e... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define e... | insert | 30 | 30 | 30 | 32 | 0 | |
p03050 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
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... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
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... | insert | 58 | 58 | 58 | 60 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, cnt = 0;
cin >> N;
for (int a = 1; a <= N; a++) {
if (N % a == 0 && N / a - 1 > a) {
cnt += N / a - 1;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, cnt = 0;
cin >> N;
for (int a = 1; a <= sqrt(N); a++) {
if (N % a == 0 && N / a - 1 > a) {
cnt += N / a - 1;
}
}
cout << cnt << endl;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
#define inf (ll)1e9
#define debugone(x) \
cout << #x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
#define inf (ll)1e9
#define debugone(x) \
cout << #x ... | insert | 43 | 43 | 43 | 45 | 0 | |
p03050 | C++ | Runtime Error | //
// main.cpp
// DivRem Number
//
// Created by Dong Truong on 7/18/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <cmath>
#include <fstream>
#include <iostream>
#include <stdio.h>
using namespace std;
#define long long long
long n;
void nhap() {
cin >> n;
long i = sqrt(n), kq = 0;
... | //
// main.cpp
// DivRem Number
//
// Created by Dong Truong on 7/18/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <cmath>
#include <fstream>
#include <iostream>
#include <stdio.h>
using namespace std;
#define long long long
long n;
void nhap() {
cin >> n;
long i = sqrt(n), kq = 0;
... | insert | 23 | 23 | 23 | 25 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VB;
#define FOR(i, a, b) for (int i = (... | #include <bits/stdc++.h>
#include <iomanip>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VB;
#define FOR(i, a, b) for (int i = (... | insert | 202 | 202 | 202 | 206 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long tot = 0;
long long m;
for (long long i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
// cout << "i is " << i << "\n";
m = i - 1;
// c... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long tot = 0;
long long m;
for (long long i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
// cout << "i is " << i << "\n";
m = i - 1;
// c... | replace | 32 | 35 | 32 | 36 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 330030;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (e... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 330030;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (e... | insert | 30 | 30 | 30 | 34 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) ... | insert | 21 | 21 | 21 | 25 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int N, ans;
int main() {
cin >> N;
for (int i = 0; i <= sqrt(N); i++) {
if (N % (i + 1) == 0) {
if (i && (i + 1) * (N / i) == N)
ans += i;
if (i && i == N / i)
continue;
if ((N / (i + 1)) * (N / (N / (i + 1) - 1)) == N)
... | #include <bits/stdc++.h>
using namespace std;
long long int N, ans;
int main() {
cin >> N;
for (int i = 0; i <= sqrt(N); i++) {
if (N % (i + 1) == 0) {
if (i && (i + 1) * (N / i) == N)
ans += i;
if (i && i == N / i)
continue;
if (N / (i + 1) - 1 && (N / (i + 1)) * (N / (N / (... | replace | 13 | 14 | 13 | 14 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | insert | 27 | 27 | 27 | 32 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int main(void) {
unsigned long long N;
unsigned long long ans = 0;
std::cin >> N;
for (unsigned long long i = 1; i <= N; i++) {
if (N / i == N % i) {
ans += i;
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main(void) {
unsigned long long N;
unsigned long long ans = 0;
std::cin >> N;
for (unsigned long long i = 1; i <= std::pow(N / 2, 0.6); i++) {
unsigned long long t = N / i - 1;
if (N / t == N % t) {
ans += t;
}
}
std::cout << ans << std::endl;
return 0;
}
| replace | 7 | 10 | 7 | 11 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | insert | 42 | 42 | 42 | 44 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, ans;
int main() {
cin >> n;
for (ll i = 1; i <= n; i++) {
ll quotient, remainder;
quotient = n / i;
remainder = n % i;
if (quotient == remainder)
ans += i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, ans;
int main() {
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ll m = n / i - 1;
if (m > i)
ans += m;
}
}
cout << ans << endl;
} | replace | 6 | 12 | 6 | 12 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | insert | 30 | 30 | 30 | 35 | 0 | |
p03050 | C++ | Runtime Error | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVL... | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVL... | insert | 1,045 | 1,045 | 1,045 | 1,048 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | replace | 39 | 41 | 39 | 42 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> fac;
void fact(ll n) {
for (ll x = 1; x * x <= n; x++) {
if (n % x == 0) {
fac.push_back(x);
if (n / x != x)
fac.push_back(n / x);
}
}
sort(fac.begin(), fac.end(), great... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> fac;
void fact(ll n) {
for (ll x = 1; x * x <= n; x++) {
if (n % x == 0) {
fac.push_back(x);
if (n / x != x)
fac.push_back(n / x);
}
}
sort(fac.begin(), fac.end(), great... | insert | 28 | 28 | 28 | 30 | 0 | |
p03050 | C++ | Runtime Error | /*
ll used[10];
ll maxi;
ll dfs(Graph& graph, ll v, ll deep) {
used[v] = 1;
vector<ll> maxd;
maxd.push_back(deep);
for (int i = 0; i < graph[v].size(); i++) {
if (used[graph[v][i].to] == 0) {
maxd.push_back(dfs(graph, graph[v][i].to, deep + 1));
... | /*
ll used[10];
ll maxi;
ll dfs(Graph& graph, ll v, ll deep) {
used[v] = 1;
vector<ll> maxd;
maxd.push_back(deep);
for (int i = 0; i < graph[v].size(); i++) {
if (used[graph[v][i].to] == 0) {
maxd.push_back(dfs(graph, graph[v][i].to, deep + 1));
... | replace | 255 | 256 | 255 | 256 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long max = floor(sqrt(N * 1.0));
long long count = 0;
for (int i = 1; i < max + 1; ++i) {
long long a = N / i - 1;
if ((N - i) % i == 0 && N / a == N % a)
count += (N - i) / i;
}
cout << count << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long max = floor(sqrt(N * 1.0));
long long count = 0;
for (int i = 1; i < max + 1; ++i) {
long long a = N / i - 1;
if (a && (N - i) % i == 0 && N / a == N % a)
count += (N - i) / i;
}
cout << count << ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmi... | insert | 43 | 43 | 43 | 45 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
... | replace | 74 | 75 | 74 | 75 | TLE | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | replace | 60 | 61 | 60 | 61 | -8 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typ... | replace | 31 | 32 | 31 | 32 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define D... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define D... | insert | 61 | 61 | 61 | 66 | 0 | |
p03050 | C++ | Runtime Error |
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debugos cout
#define debug(v) \
{ \
printf("L%d %s > ", __LINE__, #... |
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debugos cout
#define debug(v) \
{ \
printf("L%d %s > ", __LINE__, #... | insert | 226 | 226 | 226 | 228 | 0 | |
p03050 | C++ | Runtime Error | #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 ==... | replace | 9 | 10 | 9 | 10 | -8 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define elif else if
using namespace std;
int a, c = 0;
signed main() {
cin >> a;
int b = sqrt(a);
for (int i = 1; i < b + 1; i++) {
if (a % i == 0) {
if (i > 1 && a / (i - 1) == a % (i - 1)) {
c += i - ... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define elif else if
using namespace std;
int a, c = 0;
signed main() {
cin >> a;
if (a == 1) {
cout << 0;
return 0;
}
int b = sqrt(a);
for (int i = 1; i < b + 1; i++) {
if (a % i == 0) {
if (i > 1 &... | insert | 8 | 8 | 8 | 12 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define PI 3.... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define PI 3.... | insert | 29 | 29 | 29 | 33 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<int, int> P;
typedef tuple<int, int, int> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<int, int> P;
typedef tuple<int, int, int> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for... | replace | 52 | 54 | 52 | 56 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
long t;
cin >> n;
long ans = 0;
for (long i = 1; i * i <= n; i++) {
if (n % i == 0) {
t = (n / i) - 1;
if (n % t == n / t) {
ans += t;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
long t;
cin >> n;
long ans = 0;
if (n == 1) {
ans = 0;
} else {
for (long i = 1; i * i <= n; i++) {
if (n % i == 0) {
t = (n / i) - 1;
if (n % t == n / t) {
ans += t;
}
}
}
}
cou... | replace | 8 | 13 | 8 | 17 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
using namespace std;
using ll = long long int;
int main() {
ll n;
cin >> n;
long long int ans = 0;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0 && n % (n / i - 1) == i) {
ans += n / i - 1;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
using ll = long long int;
int main() {
ll n;
cin >> n;
long long int ans = 0;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0 && n / i - 1 > 0 && n % (n / i - 1) == i) {
ans += n / i - 1;
}
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long ans = 0;
long long n;
cin >> n;
long long fav;
long long k;
k = sqrt(n);
for (long long i = 1; i <= k; i++) {
if ((n - i) % i == 0) {
fav = (n - i) / i;
if (n / fav == n % fav) {
ans += fav;
... | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long ans = 0;
long long n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
long long fav;
long long k;
k = sqrt(n);
for (long long i = 1; i <= k; i++) {
if ((n - i) % i == 0) {
fav = (n - i) / i;
... | insert | 7 | 7 | 7 | 11 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
vll divisors(ll n) {
vll res;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
int main() {
ll N;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
vll divisors(ll n) {
vll res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
int main() {
ll N;
cin >> N;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p03050 | C++ | Runtime Error | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | replace | 151 | 152 | 151 | 152 | 0 | |
p03050 | C++ | Runtime Error | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | insert | 60 | 60 | 60 | 63 | -8 | |
p03050 | C++ | Runtime Error | #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... | replace | 321 | 322 | 321 | 322 | -8 | |
p03050 | C++ | Runtime Error | // header{{{
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define setout(n, x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10)
#define int long long
using pii = pair<i... | // header{{{
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define setout(n, x) setw(n) << setfill(x)
#define Fixed fixed << setprecision(10)
#define int long long
using pii = pair<i... | replace | 26 | 27 | 26 | 27 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int main() {
ll N;
ci... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int main() {
ll N;
ci... | replace | 19 | 20 | 19 | 20 | 0 | |
p03050 | C++ | Runtime Error | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
... | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
... | replace | 35 | 36 | 35 | 36 | 0 | |
p03050 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | insert | 43 | 43 | 43 | 45 | 0 | |
p03050 | C++ | Runtime Error |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long l... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long l... | replace | 31 | 37 | 31 | 41 | 0 | |
p03050 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unistd.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for... | #include "bits/stdc++.h"
#include <unistd.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for... | replace | 45 | 46 | 45 | 46 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | insert | 95 | 95 | 95 | 99 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, fav;
cin >> n;
for (long long i = 1; i * i <= n; i++) {
if ((n - i) % i == 0) {
fav = (n - i) / i;
if ((n / fav) == (n % fav))
ans += fav;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, fav;
cin >> n;
for (long long i = 1; i * i <= n; i++) {
if ((n - i) % i == 0) {
fav = (n - i) / i;
if (fav != 0 && (n / fav) == (n % fav))
ans += fav;
}
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i <= sqrt(N); i++) {
if (N % i == 0) {
ll m = N / i - 1;
if (N / m == N % m) {
ans += m;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i <= sqrt(N); i++) {
if (N % i == 0) {
ll m = N / i - 1;
if (m == 0) {
continue;
}
if (N / ... | insert | 14 | 14 | 14 | 17 | 0 | |
p03050 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | replace | 70 | 71 | 70 | 71 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
// 約数の列挙O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1LL; i * i <= n; i++) {
if (n % i == 0) {
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
// 約数の列挙O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1LL; i * i <= n; i++) {
if (n % i == 0) {
r... | insert | 30 | 30 | 30 | 32 | -8 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n;
int cnt = 0;
int main() {
cin >> n;
if (n == 2) {
cout << 0 << endl;
return 0;
}
long long ans = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i)
continue;
if (n / (n / i - 1) == n % (n / i - 1))
ans += n / i - 1;
... | #include <bits/stdc++.h>
using namespace std;
long long n;
int cnt = 0;
int main() {
cin >> n;
if (n == 2) {
cout << 0 << endl;
return 0;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
long long ans = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i)
continue;
if (n / ... | insert | 9 | 9 | 9 | 13 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62)... | replace | 70 | 71 | 70 | 71 | TLE | |
p03050 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long n;
bool check(long long x) {
long long m = x - 1;
return (m + 1) * (n / m) == n;
}
int main() {
scanf("%lld", &n);
long long ans = 0;
for (long long i = 2; i <= sqrt(n); i++)
if (n % i == 0) {
if (check(i))
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long n;
bool check(long long x) {
long long m = x - 1;
return (m + 1) * (n / m) == n;
}
int main() {
scanf("%lld", &n);
long long ans = 0;
for (long long i = 2; i <= sqrt(n); i++)
if (n % i == 0) {
if (check(i))
... | replace | 19 | 20 | 19 | 20 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) for (ll i = a; i < b; i++)
typedef long long ll;
int main() {
FAST;
ll n;
cin >> n;
vector<l... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) for (ll i = a; i < b; i++)
typedef long long ll;
int main() {
FAST;
ll n;
cin >> n;
if (n ==... | insert | 17 | 17 | 17 | 21 | 0 | |
p03050 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans = 0, i, k;
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
k = n / i - 1;
if (n / k == n % k)
ans += k;
if (n / i != i && i > 1) {
k = i - 1;
if (n / k == n % k)... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans = 0, i, k;
if (n == 1) {
cout << ans << endl;
return 0;
}
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
k = n / i - 1;
if (n / k == n % k)
ans += k;
if (n / i != i... | insert | 6 | 6 | 6 | 10 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll n;
int main(void) {
scanf("%lld", &n);
ll ans = 0;
for (ll i = 1LL; i * i <= n; i++) {
if (n % i == 0LL) {
ll val = n / i - 1LL;
if (n % val != n / val)
continue;
... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll n;
int main(void) {
scanf("%lld", &n);
ll ans = 0;
for (ll i = 1LL; i * i <= n; i++) {
if (n % i == 0LL) {
ll val = n / i - 1LL;
if (val == 0LL)
continue;
if (n... | insert | 14 | 14 | 14 | 16 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
long long k = 0;
vector<long long> a;
cin >> n;
for (i = 1; i * i <= n; i = i + 1) {
if (n % i == 0) {
a.push_back(i - 1);
a.push_back((n / i) - 1);
}
}
for (i = 1; i < a.size(); i = i + 1) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
long long k = 0;
vector<long long> a;
cin >> n;
for (i = 1; i * i <= n; i = i + 1) {
if (n % i == 0) {
a.push_back(i - 1);
a.push_back((n / i) - 1);
}
}
for (i = 1; i < a.size() && a.at(i) != 0; i = i ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
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) {
long long m = n / i - 1;
if (n / m == n % m)
ans += m;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
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) {
long long m = n / i - 1;
if (m == 0)
continue;
if (n / m == n % m)
ans += m;
}
}
cout << ans << endl;
retu... | insert | 11 | 11 | 11 | 13 | 0 | |
p03050 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
f... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
f... | replace | 22 | 23 | 22 | 23 | 0 | |
p03050 | C++ | Runtime Error | #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 * i <= N; i++) {
if (N % i == 0) {
if (N / ((N - i) / i) == N % ((N - i) / i)) {
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 * i <= N && 1 < N; i++) {
if (N % i == 0) {
if (N / ((N - i) / i) == N % ((N - i) / i)) {
ans += (N - i) / i;
}
}
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define reptr(i, n) for (ll(i) = (n); (i) >= 0; --(i))
#define All(x) (x).begin(), (x).end()
#define Rall(a) (a).rbegin(), (a).rend()
#define vll vecto... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define reps(i, s, n) for (ll(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define reptr(i, n) for (ll(i) = (n); (i) >= 0; --(i))
#define All(x) (x).begin(), (x).end()
#define Rall(a) (a).rbegin(), (a).rend()
#define vll vecto... | insert | 31 | 31 | 31 | 33 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000005
ll n, ans, x, y;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= sqrt(n); i++) {
x = i + 1;
if (n % x == 0) {
if (n / i == n / x)
ans += i;
y = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000005
ll n, ans, x, y;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= sqrt(n); i++) {
x = i + 1;
if (n % x == 0) {
if (n / i == n / x)
ans += i;
y = ... | replace | 26 | 28 | 26 | 30 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | insert | 26 | 26 | 26 | 30 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;
ll N, S;
int main() {
cin >> N;
for (ll i = 1; i * i <= N; ++i) {
ll t = (N - i) / i;
if (t *... | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;
ll N, S;
int main() {
cin >> N;
for (ll i = 1; i * i <= N; ++i) {
ll t = (N - i) / i;
if (t) ... | replace | 16 | 18 | 16 | 20 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T inf =
numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, sto... | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T inf =
numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0, sto... | replace | 35 | 36 | 35 | 36 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n;
cin >> n;
ll root = pow(n, 0.5);
ll sum = 0;
for (int i = 1; i <= root; i++) {
if (n % i == 0) {
ll like = n / i - 1;
ll ans = n / like;
ll remain = n % like;
if (ans... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n;
cin >> n;
ll root = pow(n, 0.5);
if (n == 1) {
cout << 0 << endl;
return 0;
}
ll sum = 0;
for (int i = 1; i <= root; i++) {
if (n % i == 0) {
ll like = n / i - 1;
ll a... | replace | 9 | 10 | 9 | 13 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | insert | 35 | 35 | 35 | 38 | 0 | |
p03050 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | replace | 92 | 94 | 92 | 95 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll ans = 0;
ll flor = sqrt(n); // 商と余りが一致する可能性があるのはここから
for (ll i = n / flor; i >= 1; i--) {
ll d = (n - i) / i;
if ((n - i) % i == 0 &&
n / d == i) { // i余らせて割り切れる && 割り切れた数で割るとiになる
ans += ((... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll ans = 0;
ll flor = sqrt(n); // 商と余りが一致する可能性があるのはここから
for (ll i = n / flor; i >= 1; i--) {
ll d = (n - i) / i;
if (d == 0)
continue;
if ((n - i) % i == 0 &&
n / d == i) { // i余らせて割り切れる &... | insert | 10 | 10 | 10 | 12 | 0 | |
p03050 | C++ | Runtime Error |
// D - DivRem Number
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll q = 1; q * q <= N; q++) {
ll r = q;
if ((N - r) % q == 0) {
... |
// D - DivRem Number
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll q = 1; q * q < N; q++) {
ll r = q;
if ((N - r) % q == 0) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typedef vector<int> vint;
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typedef vector<int> vint;
t... | insert | 47 | 47 | 47 | 51 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i <= n * 2; i++) {
if ((n - i) % i == 0) {
ll num = (n - i) / i;
if (n / num == n % num) {
ans += num;
}
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
if (n == 2) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
for (ll i = 1; i * i <= n * 2; i++) {
if ((n - i) % i == 0) {
ll num = (n - i) / i;... | insert | 7 | 7 | 7 | 15 | 0 | |
p03050 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long qmax = sqrt(N);
long long sum = 0;
for (long long q = 1; q < qmax + 1; q++) {
if (N % q == 0) {
long long m = N / q - 1;
if ((N / m) == (N % m)) {
sum = sum + m;
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long qmax = sqrt(N);
long long sum = 0;
for (long long q = 1; q < qmax + 1; q++) {
if (N % q == 0) {
long long m = N / q - 1;
if (m != 0) {
if ((N / m) == (N % m)) {
... | replace | 12 | 14 | 12 | 16 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, ans = 0;
scanf("%lld", &n);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (n / (i - 1) == n % (i - 1))
ans += i - 1;
if (n / i != i && n / (n / i - 1) == n % (n / i - 1))
ans += n / i - 1... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, ans = 0;
scanf("%lld", &n);
if (n == 1) {
printf("0\n");
return 0;
}
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (n / (i - 1) == n % (i - 1))
ans += i - 1;
if (n / i != i && n / (n ... | insert | 6 | 6 | 6 | 10 | 0 | |
p03050 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans = 0;
for (long long int i = 1; i * i <= n; i++) {
if ((n - i) % i != 0)
continue;
long long int cnt = (n - i) / i;
if (n / cnt != n % cnt)
continue;
ans += cnt;
}
cout << ans ... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans = 0;
for (long long int i = 1; i * i <= n; i++) {
if ((n - i) % i != 0)
continue;
long long int cnt = (n - i) / i;
if (cnt == 0)
continue;
if (n / cnt != n % cnt)
continue;
... | insert | 15 | 15 | 15 | 17 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
uint64_t sum = 0;
// for (int64_t d = 1; d <= N; ++d) {
// if (N/d == N%d) {
// cout << d << " " << N/d << endl;
// }
// }
for (int64_t r = 1; r * r <= N; ++r) {
if (N % r == 0) {
int64_t test = N / r - 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
uint64_t sum = 0;
// for (int64_t d = 1; d <= N; ++d) {
// if (N/d == N%d) {
// cout << d << " " << N/d << endl;
// }
// }
for (int64_t r = 1; r * r <= N; ++r) {
if (N % r == 0) {
int64_t test = N / r - 1;
... | insert | 16 | 16 | 16 | 18 | 0 | |
p03050 | C++ | Runtime Error | #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) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll n;
cin >> n;
ll sum = 0;
for (ll k = 1; k * k <= n; ++k) {
ll km = n - k;
if (km % k != 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll n;
cin >> n;
ll sum = 0;
for (ll k = 1; k * k <= n; ++k) {
ll km = n - k;
if (km % k != 0... | insert | 22 | 22 | 22 | 24 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using nam... | insert | 52 | 52 | 52 | 55 | 0 | |
p03050 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = containe... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = containe... | replace | 61 | 62 | 61 | 62 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.