buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std... | [["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 113 | 5 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, ... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, ... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 350 | 4 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, ans;
while (cin >> n && n > 0) {
ans = 0;
for (int i = 2; i < n; i++) {
if (i % 2 == 0) {
if ((2 * n) % i == 0 && n % i != 0 && n / i - i / 2 > 0)
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, ans;
while (cin >> n && n > 0) {
ans = 0;
for (int i = 2; i < n; i++) {
if (i % 2 == 0) {
if ((2 * n) % i == 0 && n % i != 0 && n / i - i / 2 >= 0)
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 129 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans[1111] = {0};
for (int i = 0; i < 1001; i++) {
int sum = i;
for (int j = i + 1; j < 1001; j++) {
sum += j;
if (sum > 1000)
break;
ans[sum]++;
}
}
while (cin >> n, n) {
cout << ans[n] << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans[1111] = {0};
for (int i = 1; i < 1001; i++) {
int sum = i;
for (int j = i + 1; j < 1001; j++) {
sum += j;
if (sum > 1000)
break;
ans[sum]++;
}
}
while (cin >> n, n) {
cout << ans[n] << endl;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 101 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <stack>
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep_to(a, i, x) for (int i = a; i < x; i++)
using namespace std;
int main() {
in... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <stack>
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep_to(a, i, x) for (int i = a; i < x; i++)
using namespace std;
int main() {
in... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 142 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 181 | 4 |
#include <iostream>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int res = 0;
for (int i = 1; i < n; i++) {
int sum = i;
for (int j = i; j < n; j++) {
sum += j;
if (sum == n) {
res++;
}
}
}
... | #include <iostream>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int res = 0;
for (int i = 1; i < n; i++) {
int sum = i;
for (int j = i + 1; j < n; j++) {
sum += j;
if (sum == n) {
res++;
}
}
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 100 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
signed main() {
while (... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
signed main() {
while (... | [["-", 12, 16, 31, 16, 12, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 17, 33]] | 1 | 142 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 1; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
sum += j;
if (sum + j == n) {
++ans;
break;
} else if (sum > n) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 1; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
sum += j;
if (sum == n) {
++ans;
break;
} else if (sum > n) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 103 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int count = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += j;
if (sum == n) {
count++;
break;
}
if (sum > n)
brea... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int count = 0;
for (int i = 1; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += j;
if (sum == n) {
count++;
break;
}
if (sum > n)
brea... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 101 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 675 | 2 |
#include <iostream>
using namespace std;
int inc(int n, int max, int cnt) {
if (n > max) {
return 0;
} else if (n == max) {
return 1;
} else {
return inc(n + cnt + 1, max, cnt + 1);
}
}
int soci(int n) {
int res = 0;
for (int i = 0; i <= n / 2; ++i) {
res += inc(i, n, i);
}
return res;... | #include <iostream>
using namespace std;
int inc(int n, int max, int cnt) {
if (n > max) {
return 0;
} else if (n == max) {
return 1;
} else {
return inc(n + cnt + 1, max, cnt + 1);
}
}
int soci(int n) {
int res = 0;
for (int i = 1; i < n; ++i) {
res += inc(i, n, i);
}
return res;
}
i... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 146 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, j) for (int i = 0; i < j; i++)
// sp_rep
#define sp_rep(i, j) for (int i = 1; i <= j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
using namespace std;
st... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, j) for (int i = 0; i < j; i++)
// sp_rep
#define sp_rep(i, j) for (int i = 1; i <= j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
using namespace std;
st... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 157 | 4 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, count;
while (cin >> n, n) {
count = 0;
for (int i = 2; i < n; i++) {
for (int j = 1; j < i; j++) {
... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, count;
while (cin >> n, n) {
count = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 111 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for... | [["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 277 | 5 |
#include <stdio.h>
int main() {
int n, v, a = 0, i, x, V;
while (1) {
a = 0;
scanf("%d", &v);
if (v == 0)
break;
else {
for (i = 0;; i++) {
V = i;
for (x = i + 1;; x++) {
V += x;
if (V < v)
continue;
else if (V == v) {
... | #include <stdio.h>
int main() {
int n, v, a = 0, i, x, V;
while (1) {
a = 0;
scanf("%d", &v);
if (v == 0)
break;
else {
for (i = 1;; i++) {
V = i;
for (x = i + 1;; x++) {
V += x;
if (V < v)
continue;
else if (V == v) {
... | [["-", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13]] | 1 | 144 | 2 |
#include <iostream>
using namespace std;
int main() {
int n = 0;
int count = 0;
while (true) {
cin >> n;
if (n == 0) {
break;
} else {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if ((j - i + 1) * (i + j) / 2 == n) {
count++;
}
... | #include <iostream>
using namespace std;
int main() {
int n = 0;
int count = 0;
while (true) {
cin >> n;
if (n == 0) {
break;
} else {
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if ((j - i + 1) * (i + j) / 2 == n) {
count++;
}
... | [["-", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 114 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, c;
int sum[1000];
sum[0] = 1;
for (int i = 1; i < 1000; i++) {
sum[i] = sum[i - 1] + i + 1;
}
while (1) {
cin >> n;
if (n == 0)
return 0;
c = 0;
for (int i = 2; i <= 1000; i++) { // i????????£?¶?????????´??°
if (i... | #include <iostream>
using namespace std;
int main() {
int n, c;
int sum[1000];
sum[0] = 1;
for (int i = 1; i < 1000; i++) {
sum[i] = sum[i - 1] + i + 1;
}
while (1) {
cin >> n;
if (n == 0)
return 0;
c = 0;
for (int i = 2; i <= 1000; i++) { // i????????£?¶?????????´??°
if (i... | [["-", 31, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["-", 31, 69, 341, 342, 0, 16, 31, 16, 17, 72]] | 1 | 202 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 260 | 2 |
#include <iostream>
using namespace std;
int main() {
int N;
int n = 0;
int counter = 0;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 0; i <= N / 2; i++) {
for (int j = i + 1; j <= N / 2 + 1; j++) {
// cout << "I " << i << " J " << j << "NUM " << (j-i+1) << endl;
... | #include <iostream>
using namespace std;
int main() {
int N;
int n = 0;
int counter = 0;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 1; i <= N / 2; i++) {
for (int j = i + 1; j <= N / 2 + 1; j++) {
// cout << "I " << i << " J " << j << "NUM " << (j-i+1) << endl;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 139 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <v... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <v... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 177 | 6 |
#include <bits/stdc++.h>
#include <stdio.h>
int plus(int data[], int start, int num) {
int sum = 0;
for (int i = start; i < start + num; i++) {
sum += data[i];
}
return sum;
}
int main() {
int N;
int i, j;
scanf("%d", &N);
while (N != 0) {
int data[1000] = {0};
int ctr = 0;
for (i = 0; ... | #include <bits/stdc++.h>
#include <stdio.h>
int plus(int data[], int start, int num) {
int sum = 0;
for (int i = start; i < start + num; i++) {
sum += data[i];
}
return sum;
}
int main() {
int N;
int i, j;
scanf("%d", &N);
while (N != 0) {
int data[1000] = {0};
int ctr = 0;
for (i = 0; ... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 209 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sum = 1, ans = 0;
int s = 1, e = 2;
while (s <= e && e < n) {
if (sum == n)
ans++;
else if (sum > n) {
sum -= s;
s++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sum = 1, ans = 0;
int s = 1, e = 2;
while (s <= e && e <= n) {
if (sum == n)
ans++;
else if (sum > n) {
sum -= s;
s++;
... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 105 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int count = 0;
int end = (n + 1) / 2;
for (int start = 0; start < end; ++start) {
int sum = start;
for (int i = start + 1; i <= end; ++i) {
count += (sum += i) == n;
if (sum >= n)
... | #include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int count = 0;
int end = (n + 1) / 2;
for (int start = 1; start < end; ++start) {
int sum = start;
for (int i = start + 1; i <= end; ++i) {
count += (sum += i) == n;
if (sum >= n)
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 105 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
typedef vector<int> Ivec;
typedef pair<int, int> Pos;
... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
typedef vector<int> Ivec;
typedef pair<int, int> Pos;
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 152 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int sum(int i) { return (1 + i) * i / 2; }
int main() {
int n;
while (scanf("%d", &n), n) {
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
if (sum(j) - sum(i) == n)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int sum(int i) { return (1 + i) * i / 2; }
int main() {
int n;
while (scanf("%d", &n), n) {
int cnt = 0;
for (int i = 0; i <= n; i++) {
for (int j = i + 2; j <= n; j++) {
if (sum(j) - sum(i) == n)
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43... | 1 | 126 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 250 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int N;
int f(int n) { return n * (n - 1) / 2; }
int calc(int s, int t) { return f(t + 1) - f(s); }
int main() {
while (cin ... | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int N;
int f(int n) { return n * (n - 1) / 2; }
int calc(int s, int t) { return f(t + 1) - f(s); }
int main() {
while (cin ... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 168 | 2 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int count = 0;
for (int i = 0; i <= n / 2; i++) {
int sum = i;
for (int j = i + 1;; j++) {
sum += j;
if (sum == n) {
count++;
break;
... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int count = 0;
for (int i = 1; i <= n / 2; i++) {
int sum = i;
for (int j = i + 1;; j++) {
sum += j;
if (sum == n) {
count++;
break;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 113 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
while (1) {
int num;
int count = 0;
cin >> num;
if (num == 0) {
break;
}
for (int i = 2; num / i - i / 2 > 0; i++) {
if (i % 2 == 0) {
if (num % i == i / 2) {
count += 1;
}
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
while (1) {
int num;
int count = 0;
cin >> num;
if (num == 0) {
break;
}
for (int i = 2; double(num) / i - i / 2 > 0; i++) {
if (i % 2 == 0) {
if (num % i == i / 2) {
count += 1;
}
} e... | [["+", 15, 16, 31, 16, 31, 16, 31, 2, 63, 40], ["+", 31, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 16, 31, 16, 31, 2, 3, 4, 0, 25]] | 1 | 115 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main() {
int N;
while (cin >> N, N) {
int sum = 0;
int p = 1, cnt = 0;
Reps(i, 1, N / 2 + 2) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main() {
int N;
while (cin >> N, N) {
int sum = 0;
int p = 1, cnt = 0;
Reps(i, 1, N / 2 + 2) {
... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 120 | 4 |
//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 622 | 2 |
/* vim:set foldmethod=marker: */
#include <bits/stdc++.h>
using namespace std;
//{{{
#define all(x) (x).begin(), (x).end()
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= b; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, n, 0)
#define pb(... | /* vim:set foldmethod=marker: */
#include <bits/stdc++.h>
using namespace std;
//{{{
#define all(x) (x).begin(), (x).end()
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= b; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, n, 0)
#define pb(... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 603 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, m, ans, i;
ans = 0;
i = 0;
while (1) {
ans = 0;
cin >> N;
for (int a = 0; a < N; a++) {
m = 0;
for (i = a; i < N; i++) {
m += i;
if (m == N) {
ans++;
}
}
}
if (N == 0) {
br... | #include <iostream>
using namespace std;
int main() {
int N, m, ans, i;
ans = 0;
i = 0;
while (1) {
ans = 0;
cin >> N;
for (int a = 1; a < N; a++) {
m = 0;
for (i = a; i < N; i++) {
m += i;
if (m == N) {
ans++;
}
}
}
if (N == 0) {
br... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 112 | 2 |
#include <cstdio>
int main() {
int N;
while (true) {
scanf("%d", &N);
if (N == 0)
break;
int cnt = 0;
for (int i = 1; i < N; i++) {
for (int j = i + 2; j <= N; j++) {
if (j * (j + 1) / 2 - i * (i + 1) / 2 == N)
cnt++;
}
}
printf("%d\n", cnt);
}
return... | #include <cstdio>
int main() {
int N;
while (true) {
scanf("%d", &N);
if (N == 0)
break;
int cnt = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 2; j <= N; j++) {
if (j * (j + 1) / 2 - i * (i + 1) / 2 == N)
cnt++;
}
}
printf("%d\n", cnt);
}
return... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 114 | 2 |
#include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
while (cin >> N, N) {
int l = 0, r = 0;
int sum = 0;
int ans = 0;
while (true) {
// cout << l << " " << r << " " << sum << endl;
if (sum < N) {
r++;
if (r > N)
... | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
while (cin >> N, N) {
int l = 1, r = 1;
int sum = 1;
int ans = 0;
while (true) {
// cout << l << " " << r << " " << sum << endl;
if (sum < N) {
r++;
if (r > N)
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 147 | 6 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, ans = 0, sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 1; i <= 500; i++) {
sum = 0;
for (int j = i; j <= 500; j++) {
sum += j;
if (sum == n)
ans++;
if (sum > n)
b... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, ans = 0, sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 1; i <= 500; i++) {
sum = i;
for (int j = i + 1; j <= 500; j++) {
sum += j;
if (sum == n)
ans++;
if (sum > n)
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 109 | 6 |
// {{{ include and macros
#define debug(x) cout << #x << ": " << x << endl
#define rep(a, b) for (int unsafe_cnt = a; unsafe_cnt < b; unsafe_cnt++)
#include <iostream>
// #include <stdio.h>
// #include <vector>
// #include <math.h>
// #include <algorithm>
// #include <string>
// #include <map>
// #include <set>
using n... | // {{{ include and macros
#define debug(x) cout << #x << ": " << x << endl
#define rep(a, b) for (int unsafe_cnt = a; unsafe_cnt < b; unsafe_cnt++)
#include <iostream>
// #include <stdio.h>
// #include <vector>
// #include <math.h>
// #include <algorithm>
// #include <string>
// #include <map>
// #include <set>
using n... | [["+", 8, 9, 0, 7, 15, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 79], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 98], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 183 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 999999999
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < int(n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 999999999
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < int(n... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 242 | 2 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define vsort(v) sort(v.begin... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define vsort(v) sort(v.begin... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 196 | 4 |
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int sum[1010];
void init() {
sum[0] = 0;
for (int i = 1; i < 1001; i++)
sum[i] = sum[i - 1] + i;
}
int main() {
init();
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 2; i < n / 2; i++) {
for... | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int sum[2010];
void init() {
sum[0] = 0;
for (int i = 1; i < 2001; i++)
sum[i] = sum[i - 1] + i;
}
int main() {
init();
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 2; i < n; i++) {
for (in... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 153 | 8 |
//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int sum(int l, int r) { return (r * (r + 1) - l * (l - 1)) / 2; }
int main() {
int n;
while (cin >> n, n) {
int l, r;
int ans = 0;
for (int l = 0; l < n; l++) {
for (int r ... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int sum(int l, int r) { return (r * (r + 1) - l * (l - 1)) / 2; }
int main() {
int n;
while (cin >> n, n) {
int l, r;
int ans = 0;
for (int l = 1; l <= n; l++) {
for (int r... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 138 | 6 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
while (cin >> n && n) {
int ans = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += j;
if (sum >= n) {
if (sum == n)
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
while (cin >> n && n) {
int ans = 0;
for (int i = 1; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += j;
if (sum >= n) {
if (sum == n)
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 109 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int cnt = 0;
for (int i = 0; i < 500; i++) {
int sum = 0;
int j = i;
while (sum <= n) {
sum += j;
if (sum == n && j != n) {
cnt++;
}
j++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int cnt = 0;
for (int i = 1; i < 500; i++) {
int sum = 0;
int j = i;
while (sum <= n) {
sum += j;
if (sum == n && j != n) {
cnt++;
}
j++;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 97 | 2 |
///
// File: 2197.cpp
// Author: ymiyamoto
//
// Created on Fri Nov 10 06:14:48 2017
//
#include <cstdint>
#include <iostream>
using namespace std;
int32_t main() {
while (true) {
uint32_t N;
cin >> N;
if (N == 0)
break;
uint32_t count = 0;
for (uint32_t i = 0; i < N; i++) {
uint32... | ///
// File: 2197.cpp
// Author: ymiyamoto
//
// Created on Fri Nov 10 06:14:48 2017
//
#include <cstdint>
#include <iostream>
using namespace std;
int32_t main() {
while (true) {
uint32_t N;
cin >> N;
if (N == 0)
break;
uint32_t count = 0;
for (uint32_t i = 1; i < N; i++) {
uint32... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 109 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue> //キュー
#include <unordered_map> //ハッシュ連想配列
#include <vector> //可変長配列
#define ll long long int
#define INFTY (1 << 21)
using namespace std;
int main(void) {
cin.sync_with_s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue> //キュー
#include <unordered_map> //ハッシュ連想配列
#include <vector> //可変長配列
#define ll long long int
#define INFTY (1 << 21)
using namespace std;
int main(void) {
cin.sync_with_s... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 132 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
vector<int> v;
int main() {
while (cin >> n, n) {
int cnt = 0;
for (int i = 0; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
sum += j;
if (sum == n)
cnt++;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
vector<int> v;
int main() {
while (cin >> n, n) {
int cnt = 0;
for (int i = 1; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
sum += j;
if (sum == n) {
cnt++... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 109 | 6 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
while (cin >> n, n) {
int sum[1000];
int count = 0;
sum[0] = 1;
for (int i = 2; i < 1000; +... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
while (cin >> n, n) {
int sum[1000];
int count = 0;
sum[0] = 1;
for (int i = 2; i < 1000; +... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 187 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n != 0) {
int cnt = 0;
for (int i = 0; i <= n / 2; ++i) {
int sum = 0;
for (int j = i; sum < n; ++j) {
sum = sum + j;
if (sum == n) {
++cnt;
}
}
}
co... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n != 0) {
int cnt = 0;
for (int i = 1; i < n; ++i) {
int sum = 0;
for (int j = i; sum < n; ++j) {
sum = sum + j;
if (sum == n) {
++cnt;
}
}
}
cout <<... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 99 | 6 |
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int ans = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; sum <= n; j++) {
if (sum == n)
ans++;
sum += j;
}
... | #include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int ans = 0;
for (int i = 1; i < n; i++) {
int sum = 0;
for (int j = i; sum <= n; j++) {
if (sum == n)
ans++;
// if(sum == n) cout ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 113 | 2 |
#include <bits/stdc++.h>
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
us... | #include <bits/stdc++.h>
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
us... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 188 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long lo... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 157 | 6 |
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n) {
if (n == 0)
break;
int sum = 0, dp[1001] = {0};
for (int i = 1; i <= n; i++) {
sum = i;
for (int j = 1; sum < n; j++) {
sum += (i + j);
dp[sum] += 1;
}
}
cout << dp[n] << e... | #include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n) {
if (n == 0)
break;
int sum = 0, dp[100001] = {0};
for (int i = 1; i <= n; i++) {
sum = i;
for (int j = 1; sum < n; j++) {
sum += (i + j);
dp[sum] += 1;
}
}
cout << dp[n] <... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 109 | 2 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n and n > 0) {
int a[n + 1] = {}, ans = 0;
a[1] = 1;
for (int i = 2; i < n; i++)
a[i] = a[i - 1] + i;
for (int i = 1; i < n - 1; i++) {
for (int ... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n and n > 0) {
int a[n + 1] = {}, ans = 0;
a[1] = 1;
for (int i = 2; i < n; i++)
a[i] = a[i - 1] + i;
for (int i = 0; i < n - 1; i++) {
for (int ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 149 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define loop(i, a, b) for (int i = a; i <... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define loop(i, a, b) for (int i = a; i <... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 199 | 2 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
using na... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
using na... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 177 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int sum = 0;
int count;
while (1) {
count = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n - 1; i++) {
sum = 0;
for (int j = i; j < n; j++) {
sum += (i + j);
if (sum > n)
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int sum = 0;
int count;
while (1) {
count = 0;
cin >> n;
if (n == 0)
break;
for (int i = 1; i < n - 1; i++) {
sum = 0;
for (int j = 0; j < n; j++) {
sum += (i + j);
if (sum > n)
break;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22]] | 1 | 117 | 4 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
while (1) {
int n, ans = 0;
cin >> n;
if (n <= 0)
return 0;
for (int i = 2; i * (i + 1) < 2 * n; i++) {
if (i % 2 == 0 && (n - (i / 2)... | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
while (1) {
int n, ans = 0;
cin >> n;
if (n <= 0)
return 0;
for (int i = 2; i * (i + 1) <= 2 * n; i++) {
if (i % 2 == 0 && (n - (i / 2... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 134 | 2 |
#include <iostream>
using namespace std;
#define N 1001
int ans[N];
int sum[N];
int sumn(int n) { return (n * (n - 1)) / 2; }
int sumsub(int s, int e) { return sum[e] - sum[s]; }
int main() {
for (int i = 0; i < N; ++i) {
sum[i] = sumn(i);
// cout << "sum["<<i<<"]="<<sum[i]
}
for (int i = 0; i < N; ++i) {... | #include <iostream>
using namespace std;
#define N 1001
int ans[N];
int sum[N];
int sumn(int n) { return (n * (n - 1)) / 2; }
int sumsub(int s, int e) { return sum[e] - sum[s]; }
int main() {
for (int i = 0; i < N; ++i) {
sum[i] = sumn(i);
}
for (int i = 1; i < N; ++i) {
for (int j = i + 2; j < N; ++j) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 197 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int answer = 0;
for (int right = 1; right < n - 1; right++) {
for (int left = 1; left < right; left++) {
int sum = (right - left + 1) * (left + right) / 2;
if (sum == n)
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int answer = 0;
for (int right = 1; right < n; right++) {
for (int left = 1; left < right; left++) {
int sum = (right - left + 1) * (left + right) / 2;
if (sum == n)
a... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 104 | 2 |
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
for (;;) {
int N;
cin >> N;
if (N == 0)
break;
int ans = 0;
for (int start = 0; start < N; start++) {
int sum = 0;
for (int i = 0; sum < N; i++)
sum += start + i;
... | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
for (;;) {
int N;
cin >> N;
if (N == 0)
break;
int ans = 0;
for (int start = 1; start < N; start++) {
int sum = 0;
for (int i = 0; sum < N; i++)
sum += start + i;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 106 | 2 |
#include <iostream>
using namespace std;
#define MAX 1000
main() {
int n;
int T[MAX + 1];
while (cin >> n && n) {
T[0] = 0;
for (int i = 1; i <= n; i++)
T[i] = T[i - 1] + i;
int sum = 0;
for (int i = 1; i <= n - 2; i++) {
for (int j = i + 2; j <= n; j++) {
if (T[j] - T[i] == n... | #include <iostream>
using namespace std;
#define MAX 1000
main() {
int n;
int T[MAX + 1];
while (cin >> n && n) {
T[0] = 0;
for (int i = 1; i <= n; i++)
T[i] = T[i - 1] + i;
int sum = 0;
for (int i = 0; i <= n - 2; i++) {
for (int j = i + 2; j <= n; j++) {
if (T[j] - T[i] == n... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 136 | 2 |
#include <iostream>
using namespace std;
int main(int argc, char **argv) {
int n, t, l;
float m;
while (1) {
cin >> n;
if (n == 0) {
break;
}
t = 0;
for (int i = 3; i < n; i += 2) {
if (n % i == 0) {
t++;
l = i;
}
}
for (int i = 2; i < l; i += 2) ... | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int n, t, l;
float m;
while (1) {
cin >> n;
if (n == 0) {
break;
}
t = 0;
for (int i = 3; i < n; i += 2) {
if (n % i == 0) {
t++;
l = i;
}
}
for (int i = 2; i < n; i += 2) ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 157 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (!n)
break;
// cout<<"n:"<<n<<endl;
int count = 0;
for (int i = 2; i < n; i++) {
//ô
// cout<<" i:"<<i<<endl;
if (!(i % 2)) {
double tmp = (double)n / (double)i;
... | #include <iostream>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (!n)
break;
// cout<<"n:"<<n<<endl;
int count = 0;
for (int i = 2; i < n; i++) {
//ô
// cout<<" i:"<<i<<endl;
if (!(i % 2)) {
double tmp = (double)n / (double)i;
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 178 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num = 0;
int ans = 0;
for (int i = 0; i <= n / 2; i++) {
num = i;
int j = i;
while (num < n) {
num += ++j;
if (num == n)
ans++;
}
}
cout << ans << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num = 0;
int ans = 0;
for (int i = 1; i <= n / 2; i++) {
num = i;
int j = i;
while (num < n) {
num += ++j;
if (num == n)
ans++;
}
}
cout << ans << endl;
}
} | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 90 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 265 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 401 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, ans;
while (cin >> N, N) {
ans = 0;
for (int i = 0; i < N; i++) {
int s = 0;
for (int j = i; j < N; j++) {
s += j;
if (s < N)
continue;
if (s > N)
break;
ans++;
break;
}... | #include <iostream>
using namespace std;
int main() {
int N, ans;
while (cin >> N, N) {
ans = 0;
for (int i = 1; i < N; i++) {
int s = 0;
for (int j = i; j < N; j++) {
s += j;
if (s < N)
continue;
if (s > N)
break;
ans++;
break;
}... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 99 | 2 |
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
int a[1001];
memset(a, 0, sizeof(a));
for (int i = 1; i <= 1000; i++) {
a[i] = a[i - 1];
a[i] += i;
}
while (cin >> n && n != 0) {
int ans = 0;
for (int i = 1; i < n; i++) {
for (int j ... | #include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
int a[1001];
memset(a, 0, sizeof(a));
for (int i = 1; i <= 1000; i++) {
a[i] = a[i - 1];
a[i] += i;
}
while (cin >> n && n != 0) {
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 151 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 268 | 5 |
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cctype>
#include <complex>
#include <sstream>
#include <string>
usi... | #include <cstdio>
#include <iomanip>
#include <iostream>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cctype>
#include <complex>
#include <sstream>
#include <string>
usi... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 290 | 4 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 436 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["-", 12, 16, 31, 16, 12, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 57, 15, ... | 1 | 163 | 8 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int i1, i2;
int sum;
int count;
while (1) {
cin >> n;
if (n == 0)
break;
count = 0;
for (i1 = 0; i1 < n; i1++) {
sum = i1;
for (i2 = i1 + 1; i2 < n; i2++) {
sum += i2;
if (sum == n) {
... | #include <iostream>
using namespace std;
int main(void) {
int n;
int i1, i2;
int sum;
int count;
while (1) {
cin >> n;
if (n == 0)
break;
count = 0;
for (i1 = 1; i1 < n; i1++) {
sum = i1;
for (i2 = i1 + 1; i2 < n; i2++) {
sum += i2;
if (sum == n) {
... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 122 | 2 |
#include <stdio.h>
int main() {
int n, i, j, k;
int sum, count = 0;
scanf("%d\n", &n);
while (n != 0) {
count = 0;
for (i = 2; i <= n; i++) {
sum = 0;
for (j = 2; j <= n; j++) {
sum = 0;
for (k = 0; k < i; k++) {
sum += j + k;
}
if (sum == n) {
... | #include <stdio.h>
int main() {
int n, i, j, k;
int sum, count = 0;
scanf("%d\n", &n);
while (n != 0) {
count = 0;
for (i = 2; i <= n; i++) {
sum = 0;
for (j = 1; j <= n; j++) {
sum = 0;
for (k = 0; k < i; k++) {
sum += j + k;
}
if (sum == n) {
... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 143 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 207 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | [["-", 75, 76, 0, 9, 0, 1, 0, 27, 28, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 27, 17, 29], ["-", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 285 | 3 |
#include <iostream>
using namespace std;
int main(void) {
int a[505] = {0}, i, n, cnt, d;
for (i = 1; i < 505; ++i)
a[i] = a[i - 1] + i;
while (cin >> n, n) {
cnt = 0;
int from = 1, to = 1;
while (to < 505) {
d = a[to] - a[from];
if (d == n && to - from >= 2) {
++cnt;
... | #include <iostream>
using namespace std;
int main(void) {
int a[505] = {0}, i, n, cnt, d;
for (i = 1; i < 505; ++i)
a[i] = a[i - 1] + i;
while (cin >> n, n) {
cnt = 0;
int from = 0, to = 0;
while (to < 505) {
d = a[to] - a[from];
if (d == n && to - from >= 2) {
++cnt;
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 141 | 4 |
#include <iostream>
using namespace std;
int sum[1010];
int main(void) {
for (int i = 1; i < 1010; i++)
sum[i] = sum[i - 1] + i;
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 1; i < 1010; i++) {
for (int j = i + 2; j < 1010; j++) {
if (sum[j] - sum[i] == n)
ans++;
... | #include <iostream>
using namespace std;
int sum[1010];
int main(void) {
for (int i = 1; i < 1010; i++)
sum[i] = sum[i - 1] + i;
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i < 1010; i++) {
for (int j = i + 2; j < 1010; j++) {
if ((sum[j] - sum[i]) == n)
ans++... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25]] | 1 | 125 | 4 |
#include <cstdio>
int main(void) {
for (int n = 1; scanf("%d", &n), n != 0;) {
int r = 0;
for (int i = 2; ((n + 1) / i) - (i / 2) > 0; i++) {
if (i % 2 == 0 && (n - i / 2) % i == 0) {
r++;
} else if (i % 2 != 0 && n % i == 0) {
r++;
}
}
printf("%d\n", r);
}
retu... | #include <cstdio>
int main(void) {
for (int n = 1; scanf("%d", &n), n != 0;) {
int r = 0;
for (int i = 2; (n + i / 2) / i - (i / 2) > 0; i++) {
if (i % 2 == 0 && (n - i / 2) % i == 0) {
r++;
} else if (i % 2 != 0 && n % i == 0) {
r++;
}
}
printf("%d\n", r);
}
re... | [["-", 31, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["-", 31, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 16, 31, 23, 0, 16, 12, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 12, 16, 17, 85], ["+", 31, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 7, 15, 16, 31, 16, 31, 23, 0, 25]] | 1 | 126 | 6 |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int head = 1;
int tail = 0;
long long sum = 1;
long long count = 0;
while (tail != n) {
if... |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int head = 1;
int tail = 1;
long long sum = 1;
long long count = 0;
while (tail != n) {
i... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 111 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define AL... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define AL... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 474 | 2 |
s = Array.new(1001, 0)
1000.times do |i|
sum = i
(i+1).upto(1000) do |j|
sum += j
break if sum > 1000
s[sum] += 1
end
end
loop do
n = gets.to_i
break if n == 0
puts s[n]
end | s = Array.new(1001, 0)
1.upto(999) do |i|
sum = i
(i+1).upto(1000) do |j|
sum += j
break if sum > 1000
s[sum] += 1
end
end
loop do
n = gets.to_i
break if n == 0
puts s[n]
end | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 486, 612], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 486, 612], ["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 652, 3, 4, 0, 24], ["+", 36, 36, 0, 493, 0, 652, 3, 4, 0, 612], ["+", 36, 36, 0, 493, 0, 652, 3, 4, ... | 4 | 68 | 7 |
counter = [0] * 1001
(1..499).each do |i|
counter[i + (i + 1)] += 1
end
(3..50).each do |i|
(1..1000/i).each do |s|
k = s
num = 0
i.times{ num += k; k += 1}
break if num > 1000
counter[j] += 1
end
end
while n = gets.to_i
break if n == 0
p counter[n]
end | counter = [0] * 1001
(1..499).each do |i|
counter[i + (i + 1)] += 1
end
(3..50).each do |i|
(1..1000/i).each do |s|
k = s
num = 0
i.times{ num += k; k += 1}
break if num > 1000
counter[num] += 1
end
end
while n = gets.to_i
break if n == 0
p counter[n]
end | [["-", 196, 737, 8, 736, 0, 755, 31, 742, 0, 22], ["+", 196, 737, 8, 736, 0, 755, 31, 742, 0, 22]] | 4 | 103 | 2 |
while true
n = gets.to_i
break if n==0
s = 2*n
x = 2
ptn = 0
while x<sqrt(s)
if s%x == 0
k2 = s/x-x+1
ptn += 1 if k2>0 && k2%2==0
end
x += 1
end
puts ptn
end | include Math
while true
n = gets.to_i
break if n==0
s = 2*n
x = 2
ptn = 0
while x<sqrt(s)
if s%x == 0
k2 = s/x-x+1
ptn += 1 if k2>0 && k2%2==0
end
x += 1
end
puts ptn
end | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 652, 3, 4, 0, 743]] | 4 | 66 | 2 |
loop do
n = gets.chomp.to_i
break if n==0
ans = 0
for i in 1...n
for j in (i+1)...n
if (j*(j+1) - i*(i+1))/2==n
ans+=1
end
end
end
puts ans
end | loop do
n = gets.chomp.to_i
break if n==0
ans = 0
for i in 0...n
for j in (i+1)...n
t = (j*(j+1) - i*(i+1))/2
if t==n
ans+=1
end
end
end
puts ans
end | [["-", 8, 736, 0, 88, 51, 267, 0, 475, 756, 612], ["+", 8, 736, 0, 88, 51, 267, 0, 475, 756, 612], ["-", 8, 170, 0, 88, 8, 170, 0, 121, 0, 121], ["+", 8, 170, 0, 88, 8, 170, 0, 662, 31, 22], ["+", 8, 170, 0, 88, 8, 170, 0, 662, 0, 32], ["+", 8, 170, 0, 88, 8, 170, 0, 121, 0, 121], ["+", 0, 88, 8, 170, 0, 121, 15, 738, ... | 4 | 64 | 12 |
results = []
while True:
N = int(input())
if N == 0:
break
tmp = [0 for _ in range(N+1)]
res = 0
for i in range(1, N+1):
tmp[i] = tmp[i-1] + i
for i in range(1, N):
for j in range(i+2, N+1):
if tmp[j] - tmp[i] == N:
res +... | results = []
while True:
N = int(input())
if N == 0:
break
tmp = [0 for _ in range(N+1)]
res = 0
for i in range(N+1):
tmp[i] = tmp[i-1] + i
for i in range(N-1):
for j in range(i+2, N+1):
if tmp[j] - tmp[i] == N:
res += 1
... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 118 | 6 |
while True:
n = int(input())
if n == 0:
break
count = 0
for i in range(int((n+1)/2)):
s = 0
j = i
while s < n:
s += j
j += 1
if s == n:
count += 1
print(count) |
while True:
n = int(input())
if n == 0:
break
count = 0
for i in range(1, int((n+1)/2)):
s = 0
j = i
while s < n:
s += j
j += 1
if s == n:
count += 1
print(count) | [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 66 | 2 |
#!/usr/bin/python
import sys
if sys.version_info[0]>=3: raw_input=input
try:
while True:
n=int(input())
if n==0: break
r=0
i=1
while True:
n-=i
if n<0: break
i+=1
if n%i==0: r+=1
print(r)
except EOFError:
pass | #!/usr/bin/python
import sys
if sys.version_info[0]>=3: raw_input=input
try:
while True:
n=int(input())
if n==0: break
r=0
i=1
while True:
n-=i
if n<=i: break
i+=1
if n%i==0: r+=1
print(r)
except EOFError:
pass | [["-", 0, 52, 8, 196, 0, 57, 15, 666, 667, 18], ["-", 0, 52, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 19], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 0, 22]] | 5 | 74 | 4 |
while 1:
x=int(input())
if x==0:
break
y=0
for i in range(2,50):
if x//i - i//2<0:
break
if i%2==0:
if x/i-x//i==0.5:
y+=1
else:
if x%i==0:
y+=1
print(y) | # coding: utf-8
# Here your code !
while 1:
x=int(input())
if x==0:
break
y=0
for i in range(2,50):
if x/i - i/2<0.1:
break
if i%2==0:
if x/i-x//i==0.5:
y+=1
else:
if x%i==0:
y+=1
print(y) | [["-", 0, 57, 15, 666, 0, 657, 31, 657, 17, 676], ["+", 0, 57, 15, 666, 0, 657, 31, 657, 17, 85], ["-", 0, 57, 15, 666, 0, 657, 12, 657, 17, 676], ["+", 0, 57, 15, 666, 0, 657, 12, 657, 17, 85], ["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 531]] | 5 | 79 | 6 |
if __name__ == "__main__":
while True:
n = int(input())
if n ==0:break
nline = [i for i in range(n)]
count = 0
for i in range(n):
for j in range(i,n):
if sum(nline[i:j]) > n:break
if sum(nline[i:j]) == n:count +=1
print(co... | if __name__ == "__main__":
while True:
n = int(input())
if n ==0:break
nline = [i for i in range(1,n+1)]
count = 0
for i in range(n):
for j in range(i+1,n):
if sum(nline[i:j]) > n:break
if sum(nline[i:j]) == n:count +=1
pr... | [["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 21], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 91 | 6 |
if __name__ == "__main__":
while True:
n = int(input())
if n ==0:break
count = 0
for i in range(n):
for j in range(i+1,n):
sum = (i+j)*(i+j-1)/2
if sum> n:break
if sum == n:count +=1
print(count) | if __name__ == "__main__":
while True:
n = int(input())
if n ==0:break
count = 0
for i in range(1,n):
for j in range(i+1,n):
sum = (i+j)*(j-i+1)/2
if sum> n:break
if sum == n:count +=1
print(count) | [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["-", 31, 657, 12, 23, 0, 657, 31, 657, 31, 22], ["-", 31, 657, 12, 23, 0, 657, 31, 657, 17, 72], ["+", 31, 657, 12, 23, 0, 657, 31, 657, 12, 22], ["+", 12, 657, 31, 657, 12, 23, 0, 657, 17, 72]] | 5 | 82 | 6 |
while True:
n = int(input())
if n == 0:
break
ans = 0
for i in range(n):
s = i
for j in range(i + 1, n):
s += j
if s == n:
ans += 1
break
elif s > n:
break
print(ans)
| while True:
n = int(input())
if n == 0:
break
ans = 0
for i in range(1, n + 1):
s = i
for j in range(i + 1, n + 1):
s += j
if s == n:
ans += 1
break
elif s > n:
break
print(ans)
| [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 65 | 6 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int N, temp;
double[] efficiency;
Fruit[] fruits, answer;
boolean[] check;
while ((N = sc.nextInt()) != 0) {
efficiency = new double... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int N, temp;
double[] efficiency;
Fruit[] fruits, answer;
boolean[] check;
while ((N = sc.nextInt()) != 0) {
efficiency = new double... | [["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24]] | 3 | 689 | 2 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 51, 91, 28, 2, 3, 4, 0, 66, 17, 48], ["-", 3, 4, 0, 66, 28, 2, 63, 118, 28, 22], ["-", 3, 4, 0, 66, 28, 2, 63, 118, 17, 131], ["-", 3, 4, 0, 66, 28, 2, 63, 118, 119, 120], ["-", 3, 4, 0, 66, 28, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 66, 28, 2, 3, 4, 0, 25], ["+", 15, 339, 51, 91, 28, 2, 3, 4, 0, 22]] | 1 | 756 | 7 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | [["-", 341, 342, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 341, 342, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 1,988 | 2 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | [["-", 341, 342, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 341, 342, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 1,988 | 2 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
struct union_find {
vector<int> data;
union_find(int n) : data(n, -1) {}
int find(int a) { return data[a] < 0 ? a : data[a] = find(data[a]); }
bool same(int a, int b) { return find(a) == find(b); }
void unite(int a, int b) {
a = fi... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
struct union_find {
vector<int> data;
union_find(int n) : data(n, -1) {}
int find(int a) { return data[a] < 0 ? a : data[a] = find(data[a]); }
bool same(int a, int b) { return find(a) == find(b); }
void unite(int a, int b) {
a = fi... | [["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 671 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) repi(i, 0, a)
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) repi(i, 0, a)
#... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 1,071 | 4 |
#include <complex>
#include <iostream>
using namespace std;
typedef complex<double> P;
int W, H, N, R;
int x1[123], y_1[123], x2[123], y2[123], t[123];
double eps = 1e-9;
double cross(P a, P b) { return a.real() * b.imag() - a.imag() * b.real(); }
pair<pair<P, P>, pair<P, P>> sl(P a1, P a2, double dd) {
P a = a2... | #include <complex>
#include <iostream>
using namespace std;
typedef complex<double> P;
int W, H, N, R;
int x1[123], y_1[123], x2[123], y2[123], t[123];
double eps = 1e-9;
double cross(P a, P b) { return a.real() * b.imag() - a.imag() * b.real(); }
pair<pair<P, P>, pair<P, P>> sl(P a1, P a2, double dd) {
P a = a2... | [["+", 15, 339, 51, 16, 31, 16, 31, 2, 63, 22], ["+", 51, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 924 | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.