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 <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[21][21], ans, c, h, w;
void dfs(int x, int y);
bool ch(int x, int y) {
return !(a[y][x - 1] != a[y - 1][x - 1] && a[y - 1][x] != a[y - 1][x - 1] &&
a[y][x - 1] != a[y - 1][x]);
}
void in(int x, int y) {
if (x ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[21][21], ans, c, h, w;
void dfs(int x, int y);
bool ch(int x, int y) {
return !(a[y][x - 1] != a[y - 1][x - 1] && a[y - 1][x] != a[y - 1][x - 1] &&
a[y][x - 1] != a[y - 1][x]);
}
void in(int x, int y) {
if (x ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 419 | 2 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int mod_pow(Int x, Int y, Int mod) {
Int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y /= 2;
}
return res;
}
Int extgcd(Int a, Int b, Int &x, Int &y) {
Int d = a;
if (b != 0) {
d = extgcd(b... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int mod_pow(Int x, Int y, Int mod) {
Int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y /= 2;
}
return res;
}
Int extgcd(Int a, Int b, Int &x, Int &y) {
Int d = a;
if (b != 0) {
d = extgcd(b... | [["-", 49, 50, 51, 4, 0, 16, 31, 16, 31, 13], ["-", 49, 50, 51, 4, 0, 16, 31, 16, 17, 48], ["-", 49, 50, 51, 4, 0, 16, 31, 16, 12, 22], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22]] | 1 | 900 | 6 |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int N = sc.nextInt();
if (N == 0)
break;
int[] I = new int[N];
for (int i = 0; i < N; ++i) {
I[i] = sc.nextInt();
}
... | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int N = sc.nextInt();
if (N == 0)
break;
int[] I = new int[N];
for (int i = 0; i < N; ++i) {
I[i] = sc.nextInt();
}
... | [["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 12, 515]] | 3 | 321 | 2 |
o[256], z[257];
main(N, S, A, C, s, a, c, r, i) {
for (; scanf("%d", &N), N; printf("%d %d %d\n", S, A, C)) {
double H = 2, h, n = N;
for (i = 1; i <= N; i++)
scanf("%d", z + i);
for (s = 0; s < 16; s++)
for (a = 0; a < 16; a++)
for (c = 0; c < 16; c++) {
for (r = s, h = 0, i... | o[256], z[257];
main(N, S, A, C, s, a, c, r, i) {
for (; scanf("%d", &N), N; printf("%d %d %d\n", S, A, C)) {
double H = 9, h, n = N;
for (i = 1; i <= N; i++)
scanf("%d", z + i);
for (s = 0; s < 16; s++)
for (a = 0; a < 16; a++)
for (c = 0; c < 16; c++) {
for (r = s, h = 0, i... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 263 | 23 |
o[256], z[256];
main(N, S, A, C, s, a, c, r, i) {
for (; scanf("%d", &N), N; printf("%d %d %d\n", S, A, C)) {
double H = 9, h, n = N;
for (i = 0; i < N; i++)
scanf("%d", z + i);
for (s = 0; s < 16; s++)
for (a = 0; a < 16; a++)
for (c = 0; c < 16; c++) {
for (r = s, i = 0; i ... | o[256], z[256];
main(N, S, A, C, s, a, c, r, i) {
for (; scanf("%d", &N), N; printf("%d %d %d\n", S, A, C)) {
double H = 9, h, n = N;
for (i = 0; i < N; i++)
scanf("%d", z + i);
for (s = 0; s < 16; s++)
for (a = 0; a < 16; a++)
for (c = 0; c < 16; c++) {
for (r = s, i = 0; i ... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13]] | 0 | 260 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-6
#define M 256
#define INF 1e9
int main() {
int N;
while (cin >> N, N > 0) {
int I[N + 1], R[N + 1], O[N + 1];
for (int i = 0; i < N; i++) {
cin >> I[i];
}
int S, A, C;
double ans = INF;
for (int s = 0; s <= 15; s++) {
... | #include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
#define M 256
#define INF 1e9
int main() {
int N;
while (cin >> N, N > 0) {
int I[N + 1], R[N + 1], O[N + 1];
for (int i = 0; i < N; i++) {
cin >> I[i];
}
int S, A, C;
double ans = INF;
for (int s = 0; s <= 15; s++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 324 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1145141919
#define MOD 1000000007
#define EPS 1e-6
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1145141919
#define MOD 1000000007
#define EPS 1e-6
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<i... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 422 | 2 |
#include <bits/stdc++.h>
using namespace std;
inline bool chmin(double &a, double b) {
if (a + 1e-8 > b) {
a = b;
return true;
}
return false;
}
const int M = 256;
int N;
int I[257], R[257], O[257];
int cnt[257];
double calc(int s, int a, int c) {
R[0] = s;
for (int i = 1; i <= N; i++) {
R[i] =... | #include <bits/stdc++.h>
using namespace std;
inline bool chmin(double &a, double b) {
if (a - 1e-8 > b) {
a = b;
return true;
}
return false;
}
const int M = 256;
int N;
int I[257], R[257], O[257];
int cnt[257];
double calc(int s, int a, int c) {
R[0] = s;
for (int i = 1; i <= N; i++) {
R[i] =... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33]] | 1 | 385 | 2 |
#include <cmath>
#include <cstdio>
#include <cstring>
#define mod 256
int n;
int l[258];
int r[16][16][16][258];
int cnt[258];
int main(void) {
for (int s = 0; s <= 15; s++) {
for (int a = 0; a <= 15; a++) {
for (int c = 0; c <= 15; c++) {
r[s][a][c][0] = s;
for (int q = 1; q <= 256; q++) {
... | #include <cmath>
#include <cstdio>
#include <cstring>
#define mod 256
int n;
int l[258];
int r[16][16][16][258];
int cnt[258];
int main(void) {
for (int s = 0; s <= 15; s++) {
for (int a = 0; a <= 15; a++) {
for (int c = 0; c <= 15; c++) {
r[s][a][c][0] = s;
for (int q = 1; q <= 256; q++) {
... | [["-", 12, 16, 12, 2, 3, 4, 0, 16, 17, 85], ["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 434 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pi 3.141592653589793
int main() {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pi 3.141592653589793
int main() {
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 479 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 578 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define M 256
#define EPS 1e-9
int main() {
int N;
while (cin >> N, N) {
int I[256];
for (int i = 0; i < N; i++)
cin >> I[i];
double H = 1000000.0;
int S, A, C;
for (int s = 0; s <= 15; s++) {
for (int a = 0; a <= 15; a++) {
f... | #include <bits/stdc++.h>
using namespace std;
#define M 256
#define EPS 1e-9
int main() {
int N;
while (cin >> N, N) {
int I[256];
for (int i = 0; i < N; i++)
cin >> I[i];
double H = 1000000.0;
int S, A, C;
for (int s = 0; s <= 15; s++) {
for (int a = 0; a <= 15; a++) {
f... | [["+", 0, 11, 12, 16, 31, 16, 31, 74, 0, 24], ["+", 12, 16, 31, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 11, 12, 16, 31, 16, 31, 74, 0, 25], ["+", 0, 11, 12, 16, 12, 2, 3, 4, 0, 24], ["+", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 25]] | 1 | 293 | 6 |
#include <iostream>
#include <math.h>
#define MOD 256
using namespace std;
int main() {
int n;
int i, j, k, l;
int s, a, c, bs, ba, bc;
int r[16][16][16][260];
for (s = 0; s < 16; s++) {
for (a = 0; a < 16; a++) {
for (c = 0; c < 16; c++) {
r[s][a][c][0] = s;
for (i = 0; i < 260 - 1;... | #include <iostream>
#include <math.h>
#define MOD 256
using namespace std;
int main() {
int n;
int i, j, k, l;
int s, a, c, bs, ba, bc;
int r[16][16][16][260];
for (s = 0; s < 16; s++) {
for (a = 0; a < 16; a++) {
for (c = 0; c < 16; c++) {
r[s][a][c][0] = s;
for (i = 0; i < 260 - 1;... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 452 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int n, a[256];
int main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> a[i];
int mi, mj, mk;
long double v = 1e+300L;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int n, a[256];
int main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> a[i];
int mi, mj, mk;
long double v = 1e+300L;
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
for (int k = 0; k < 16; k++) {... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 298 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 338 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_ba... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define mp make_pair
#define pb push_ba... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 392 | 2 |
#include <cmath>
#include <iostream>
#include <map>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
const int DIV = 256;
double calc(int S, int A, int C, int *I, int n) {
int R[n + 1];
int O[n];
map<int, int> M;
R[0] = S;
REP(i, 1, n + 1) R[i] = (A * R[i - ... | #include <cmath>
#include <iostream>
#include <map>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
const int DIV = 256;
double calc(int S, int A, int C, int *I, int n) {
int R[n + 1];
int O[n];
map<int, int> M;
R[0] = S;
REP(i, 1, n + 1) R[i] = (A * R[i - ... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 484 | 4 |
#include <cmath>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const double EPS = 1e-9;
int main() {
const int M = 256;
for (int N; scanf("%d", &N), N;) {
int I[257];
for (int i = 1; i <= N; i++)
scanf("%d", I + i);
int Smin, Amin, Cmin;
double Hmin... | #include <cmath>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const double EPS = 1e-9;
int main() {
const int M = 256;
for (int N; scanf("%d", &N), N;) {
int I[257];
for (int i = 1; i <= N; i++)
scanf("%d", I + i);
int Smin, Amin, Cmin;
double Hmin... | [["-", 8, 9, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 295 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#define EPS (1.0e-8)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
int S, A, C;
int M;
int N;
int R[256], I[256], O[256];
double m_log[300];
void calcR() {
for (int i = 0; i < N; ++i) {
if (i == 0)
R[i] = (A * S + C) % M;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#define EPS (1.0e-8)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
int S, A, C;
int M;
int N;
int R[256], I[256], O[256];
double m_log[300];
void calcR() {
for (int i = 0; i < N; ++i) {
if (i == 0)
R[i] = (A * S + C) % M;
... | [["+", 8, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 21], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 25]] | 1 | 525 | 5 |
// 57
#include <cmath>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int l[256];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
double me = 1 << 30;
int ms, ma, mc;
for (int s = 0; s < 16; s++) {
for (int a = 0; a < 16; a++) {
for (int c ... | // 57
#include <cmath>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int l[256];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
double me = 1 << 30;
int ms, ma, mc;
for (int s = 0; s < 16; s++) {
for (int a = 0; a < 16; a++) {
for (int c ... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 275 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 466 | 38 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 386 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
#define M 256
int num[M] = {0};
const double EPS = 1e-9;
using namespace std;
int main(void) {
int s, a, c;
int n;
int R, O;
double H;
double mini;
int mins, mina, minc;
int i1, i2;
wh... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
#define M 256
int num[M] = {0};
const double EPS = 1e-9;
using namespace std;
int main(void) {
int s, a, c;
int n;
int R, O;
double H;
double mini;
int mins, mina, minc;
int i1, i2;
wh... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 337 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int M = 256;
int n, I[M];
double calc(int S, int A, int C) {
int r = S, cnt[M];
fill(cnt, cnt + M, 0);
for (int i = 0; i < n; i++) {
r = (A * r + C) % M;
cnt[(I[i] + r) % M]++;
}
double res = 0.0;
for (int i = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int M = 256;
int n, I[M];
long double calc(int S, int A, int C) {
int r = S, cnt[M];
fill(cnt, cnt + M, 0);
for (int i = 0; i < n; i++) {
r = (A * r + C) % M;
cnt[(I[i] + r) % M]++;
}
long double res = 0.0;
for ... | [["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 12, 16, 31, 74, 39, 77, 39, 86, 0, 96], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 329 | 18 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define rep(i, e) for (int i = 0; i < e; i++)
#define eps 1e-10
typedef vector<int> vec;
int main() {
int N, M = 256;
while (cin >> N, N) {
vec I(N);
rep(i, N) cin >> I[i];
int S, A, C;
double H = 1000000;
rep(s, 16) ... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define rep(i, e) for (int i = 0; i < e; i++)
#define eps 1e-10
typedef vector<int> vec;
int main() {
int N, M = 256;
while (cin >> N, N) {
vec I(N);
rep(i, N) cin >> I[i];
int S, A, C;
double H = 1000000;
rep(s, 16) ... | [["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25]] | 1 | 254 | 3 |
#include <cmath>
#include <iostream>
using namespace std;
struct S {
double min;
int s, a, c;
};
int main() {
int N, l[257], r[257], o[257], x[257];
int s, a, c;
double H;
S ans;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 1; i <= N; i++) {
cin >> l[i];
}
... | #include <cmath>
#include <iostream>
using namespace std;
struct S {
double min;
int s, a, c;
};
int main() {
int N, l[257], r[257], o[257], x[257];
int s, a, c;
double H;
S ans;
while (1) {
cin >> N;
if (N == 0)
break;
for (int i = 1; i <= N; i++) {
cin >> l[i];
}
... | [["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 410 | 2 |
import math
M = 256
while True:
N = int(input())
if N == 0: break
H = 1e10
I = list(map(int,input().split()))
for S in range(16):
for A in range(16):
for C in range(16):
R = S
O = [0]*M
for i in I:
R = (A*R+C)%M
... | import math
M = 256
while True:
N = int(input())
if N == 0: break
H = 1e10
I = list(map(int,input().split()))
for S in range(16):
for A in range(16):
for C in range(16):
R = S
O = [0]*M
for i in I:
R = (A*R+C)%M
... | [["+", 3, 668, 8, 657, 12, 652, 3, 4, 0, 21], ["+", 3, 668, 8, 657, 12, 652, 3, 4, 0, 612]] | 5 | 167 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
using namespace std;
int T, N;
int t[30], ti[101];
int dp[101][30];
int main() {
while (cin >> T, T) {
rep(i, T) cin >> t[i];
rep(i, 101) ti[i] = INF;
rep(i, 101) rep(j, 30) dp[i][j] = INF;
dp[1][1] = 1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
using namespace std;
int T, N;
int t[30], ti[101];
int dp[101][30];
int main() {
while (cin >> T, T) {
rep(i, T) cin >> t[i];
rep(i, 101) ti[i] = INF;
rep(i, 101) rep(j, 30) dp[i][j] = INF;
dp[1][0] = 0;
... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 382 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int T;
cin >> T;
if (!T)
break;
vector<int> sleeps;
for (int i = 0; i < T; ++i) ... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int T;
cin >> T;
if (!T)
break;
vector<int> sleeps;
for (int i = 0; i < T; ++i) ... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 31, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69,... | 1 | 356 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 407 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 28;
int N, T;
void solve() {
vec t(T);
for (auto &i : t)
cin >> i;
cin >> N;
vec d(N), h(N);
for (int i = 0; i < N; i++) {
cin >> d[i] >> h[i];
d[i]--;
}
vec times(101, INF... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 28;
int N, T;
void solve() {
vec t(T);
for (auto &i : t)
cin >> i;
cin >> N;
vec d(N), h(N);
for (int i = 0; i < N; i++) {
cin >> d[i] >> h[i];
d[i]--;
}
vec times(101, INF... | [["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]] | 1 | 374 | 4 |
#include <iostream>
#define inf 1 << 28
using namespace std;
int main() {
while (1) {
int T, t[101], n, a, b;
int d[101];
for (int i = 0; i < 101; i++)
d[i] = inf;
cin >> T;
if (T == 0)
break;
for (int i = 0; i < T; i++)
cin >> t[i];
cin >> n;
for (int i = 0; i < n;... | #include <iostream>
#define inf 1 << 28
using namespace std;
int main() {
while (1) {
int T, t[101], n, a, b;
int d[101];
for (int i = 0; i < 101; i++)
d[i] = inf;
cin >> T;
if (T == 0)
break;
for (int i = 0; i < T; i++)
cin >> t[i];
cin >> n;
for (int i = 0; i < n;... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 67], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 109]] | 1 | 367 | 4 |
// 03
#include <algorithm>
#include <iostream>
using namespace std;
int nt;
int t[30];
int m[101];
int gd(int d) {
for (int i = 0; i + d <= 100; i++) {
if (t[i % 30] > m[d + i])
return d + i;
}
return 999;
}
int main() {
while (cin >> nt, nt) {
for (int i = 0; i < nt; i++) {
cin >> t[i];... | // 03
#include <algorithm>
#include <iostream>
using namespace std;
int nt;
int t[30];
int m[101];
int gd(int d) {
for (int i = 0; i + d <= 100; i++) {
if (t[i % nt] > m[d + i])
return d + i;
}
return 999;
}
int main() {
while (cin >> nt, nt) {
for (int i = 0; i < nt; i++) {
cin >> t[i];... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 266 | 2 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int T, N, t[50], d[110], a, b;
int dp[110][50];
int main() {
while (cin >> T, T) {
rep(i, T) cin >> t[i];
cin >> N;
rep(i, 100) d[i] = 24;
rep(i, N) {
cin >> a >> b;
d[a] = min(d[a... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int T, N, t[50], d[110], a, b;
int dp[110][50];
int main() {
while (cin >> T, T) {
rep(i, T) cin >> t[i];
cin >> N;
rep(i, 100) d[i] = 24;
rep(i, N) {
cin >> a >> b;
a--;
d[a... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 290 | 7 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22]] | 1 | 1,238 | 2 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int[][] trans = {
{0, 1, 2, 3, 4, 5, 6, 7}, {4, 5, 6, 7, 0, 1, 2, 3},
{0, 4, 5, 1, 3, 7, 6, 2}, {1, 5, 6, 2, 0, 4, 7, 3},
... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int[][] trans = {
{0, 1, 2, 3, 4, 5, 6, 7}, {4, 7, 6, 5, 0, 3, 2, 1},
{0, 4, 5, 1, 3, 7, 6, 2}, {1, 5, 6, 2, 0, 4, 7, 3},
... | [["-", 0, 124, 49, 200, 51, 518, 0, 518, 0, 499], ["+", 0, 124, 49, 200, 51, 518, 0, 518, 0, 499]] | 3 | 720 | 8 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int color[8];
map<string, int> used;
set<int> S;
int t;
void rot1() {
rep(i, 3) swap(color[i], color[i + 1]);
rep(i, 3) swap(color[i + 4], color[i + 5]);
}
void rot2() {
swap(color[0], color[4]);
swap(color[1], ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int color[8];
map<string, int> used;
set<int> S;
int t;
void rot1() {
rep(i, 3) swap(color[i], color[i + 1]);
rep(i, 3) swap(color[i + 4], color[i + 5]);
}
void rot2() {
swap(color[0], color[4]);
swap(color[1], ... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 470 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string name[8];
int color[8];
int perm[8];
bool used[1 << 24];
int mat[3][8][8];
int octa[8];
void make_mat() {
const int swap[3][8] = {{1, 2, 3, 0, 5, 6, 7, 4},
{1, 5, 6, 2, 0, 4, 7, 3},
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string name[8];
int color[8];
int perm[8];
bool used[1 << 24];
int mat[3][8][8];
int octa[8];
void make_mat() {
const int swap[3][8] = {{1, 2, 3, 0, 5, 6, 7, 4},
{1, 5, 6, 2, 0, 4, 7, 3},
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 715 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include... | [["-", 49, 53, 54, 55, 0, 56, 49, 159, 81, 22], ["+", 49, 53, 54, 55, 0, 56, 49, 159, 81, 22], ["-", 49, 159, 81, 16, 31, 23, 0, 16, 31, 22], ["+", 49, 159, 81, 16, 31, 23, 0, 16, 31, 22]] | 1 | 1,184 | 4 |
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#inc... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#inc... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 9, 0, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 9, 0, 43, 49, 50, 51, 22], ["-", 49, 50, 51, 16, 31, 23, 0, 16, 31, 22], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 9,... | 1 | 939 | 8 |
#include <bits/stdc++.h>
using namespace std;
int conv[128];
bool stronger(char *t1, char *t2, char p1, char p2) {
if (t1[1] != t2[1] &&
(t1[1] == p1 || t1[1] == p2 || t2[1] == p2 || t2[2] == p2)) {
if (t1[1] == p1)
return (0);
if (t2[1] == p1)
return (1);
if (t1[1] == p2)
retur... | #include <bits/stdc++.h>
using namespace std;
int conv[128];
bool stronger(char *t1, char *t2, char p1, char p2) {
if (t1[1] != t2[1] &&
(t1[1] == p1 || t1[1] == p2 || t2[1] == p2 || t2[2] == p2)) {
if (t1[1] == p1)
return (0);
if (t2[1] == p1)
return (1);
if (t1[1] == p2)
retur... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24]] | 1 | 484 | 7 |
#include <iostream>
#define T 13
using namespace std;
int Change(char);
int main() {
int cnt, c;
char trump, b;
string d[4][T]; // nesw
while (1) {
cin >> trump;
if (trump == '#')
break;
for (int i = 0; i < 4; i++)
for (int j = 0; j < T; j++)
cin >> d[i][j];
c = cnt = 0;
... | #include <iostream>
#define T 13
using namespace std;
int Change(char);
int main() {
int cnt, c;
char trump, b;
string d[4][T]; // nesw
while (1) {
cin >> trump;
if (trump == '#')
break;
for (int i = 0; i < 4; i++)
for (int j = 0; j < T; j++)
cin >> d[i][j];
c = cnt = 0;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 13], ["-", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13]] | 1 | 444 | 4 |
#include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF ... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 567 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n, d;
while (cin >> n >> d, n) {
vector<vector<int>> v(n);
rep(i, n) {
int m;
cin >> m;
v[i].resize(m);
... | #include <algorithm>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n, d;
while (cin >> n >> d, n) {
vector<vector<int>> v(n);
rep(i, n) {
int m;
cin >> m;
v[i].resize(m + 1)... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 28, 69, 28, 2, 3, 4, 0, 16, 17, 33], ["-", 28, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 372 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int n, d;
while (cin >> n >> d) {
if (n == 0 && d == 0)
break;
vector<queue<int>> vq(n, queue<int>());
vector<int> sum(n, 0);
for_(i, 0, n) {
int m;
cin >> m;
fo... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int n, d;
while (cin >> n >> d) {
if (n == 0 && d == 0)
break;
vector<stack<int>> vq(n, stack<int>());
vector<int> sum(n, 0);
for_(i, 0, n) {
int m;
cin >> m;
fo... | [["-", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["+", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["-", 49, 53, 54, 55, 0, 56, 39, 344, 141, 78], ["+", 49, 53, 54, 55, 0, 56, 39, 344, 141, 78], ["-", 0, 1, 0, 11, 12, 2, 63, 118, 119, 120], ["+", 0, 1, 0, 11, 12, 2, 63, 118, 119, 120]] | 1 | 284 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, d;
while (cin >> n >> d) {
if (n == 0 && d == 0)
break;
vector<int> missiles[110];
vector<pair<int, int>> potentials; // (potential, idx)
for... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, d;
while (cin >> n >> d) {
if (n == 0 && d == 0)
break;
vector<int> missiles[110];
vector<pair<int, int>> potentials; // (potential, idx)
for... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 587 | 8 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<long, long>, pair<int, int>> P;
int main() {
int n, d;
while (scanf("%d%d", &n, &d) && n) {
vector<ll> missile[n];
int m;
ll min... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<long, long>, pair<int, int>> P;
int main() {
int n, d;
while (scanf("%d%d", &n, &d) && n) {
vector<ll> missile[n];
int m;
ll min... | [["+", 12, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 451 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | [["-", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["+", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["-", 49, 50, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 49, 50, 51, 16, 12, 2, 63, 118, 119, 120]] | 1 | 354 | 4 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#inc... | [["+", 31, 2, 63, 118, 28, 69, 341, 342, 0, 70], ["+", 31, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 31, 2, 63, 118, 28, 69, 341, 342, 0, 73]] | 1 | 782 | 3 |
// AOJ 2177: Champernowne Constant
// 2017.11.5 bal4u@uu
#include <stdio.h>
#include <string.h>
long long len[11];
int ten[10] = {1};
int main() {
int n, k, i, j, num;
long long nine;
char buf[200], *p;
for (nine = 9, i = 1; i <= 10; i++, nine *= 10)
len[i] = i * nine, ten[i] = ten[i - 1] * 10;
for (i... | // AOJ 2177: Champernowne Constant
// 2017.11.5 bal4u@uu
#include <stdio.h>
#include <string.h>
long long len[11];
int ten[10] = {1};
int main() {
int n, k, i, j, num;
long long nine;
char buf[200], *p;
for (nine = 9, i = 1; i <= 10; i++, nine *= 10)
len[i] = i * nine, ten[i] = ten[i - 1] * 10;
for (i... | [["-", 0, 11, 31, 66, 28, 23, 0, 16, 12, 22], ["+", 0, 11, 31, 66, 28, 23, 0, 16, 12, 22]] | 0 | 259 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll po[15];
ll a[100], b[100];
ll n, m;
string change(ll y) {
stringstream ss;
string res;
ss << y;
ss >> res;
return res;
}
void solve(ll x, ll y, ll n, ll m) {
n -= b[x];
y += n / (x + 1);
n %= (x + 1);
string ans = "";
while (an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll po[15];
ll a[100], b[100];
ll n, m;
string change(ll y) {
stringstream ss;
string res;
ss << y;
ss >> res;
return res;
}
void solve(ll x, ll y, ll n, ll m) {
n -= b[x];
y += n / (x + 1);
n %= (x + 1);
string ans = "";
while (a... | [["+", 31, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 326 | 4 |
#include <iostream>
#include <string>
using namespace std;
long long a, b;
int digit(long long n) { return to_string(n).size(); }
long long sumsize(long long n) {
long long t = 1, sum = 0;
while (t <= n) {
if (t * 10 > n) {
sum += (n - t + 1) * digit(t);
} else {
sum += t * 9 * digit(t);
... | #include <iostream>
#include <string>
using namespace std;
long long a, b;
int digit(long long n) { return to_string(n).size(); }
long long sumsize(long long n) {
long long t = 1, sum = 0;
while (t <= n) {
if (t * 10 > n) {
sum += (n - t + 1) * digit(t);
} else {
sum += t * 9 * digit(t);
... | [["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 33], ["-", 51, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["-", 51, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["-", 64, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 318 | 6 |
#include <bits/stdc++.h>
using namespace std;
long long num[9] = {9, 2 * 90, 3 * 900, 4 * 9000, 5 * 90000,
6 * 900000, 7 * 9000000, 720000000, 81000000000};
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n + k == 0)
break;
string ans = "";
int i... | #include <bits/stdc++.h>
using namespace std;
long long num[9] = {9, 2 * 90, 3 * 900, 4 * 9000, 5 * 90000,
6 * 900000, 7 * 9000000, 720000000, 81000000000};
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n + k == 0)
break;
string ans = "";
int i... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 217 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll len(ll x) {
ll a = 1, k = 0, j = 1;
while (a * 10 <= x)
k += 9 * a * j, a *= 10, j++;
k += (x - a + 1) * j;
return k;
}
int main() {
ll n, k;
while (cin >> n >> k, n || k) {
ll l = 0, r = 1000000000, m, i, j;
string s;
wh... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll len(ll x) {
ll a = 1, k = 0, j = 1;
while (a * 10 <= x)
k += 9 * a * j, a *= 10, j++;
k += (x - a + 1) * j;
return k;
}
int main() {
ll n, k;
while (cin >> n >> k, n || k) {
ll l = 0, r = 1000000000LL, m, i, j;
string s;
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13]] | 1 | 211 | 31 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pai... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pai... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 2,021 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long lli;
lli n, k;
string toString(lli x) {
if (x == 0)
return "0";
string res;
while (x != 0) {
res += x % 10 + '0';
x /= 10;
}
reverse(res.begin(), res.end());
return res;
}
main() {
while (cin... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long lli;
lli n, k;
string toString(lli x) {
if (x == 0)
return "0";
string res;
while (x != 0) {
res += x % 10 + '0';
x /= 10;
}
reverse(res.begin(), res.end());
return res;
}
main() {
while (cin... | [["-", 51, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 49, 50, 51, 16, 31, 23, 0, 16, 17, 33], ["-", 49, 50, 51, 16, 31, 23, 0, 16, 12, 22], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 236 | 6 |
#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)
#... | [["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 33], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 303 | 6 |
import java.util.Scanner;
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N;
while ((N = scan.nextInt()) != 0) {
int count = 0;
int sum = 0;
for (int i = 0; i * 2 < N; i++) {
for (int j = i; sum < N; j++) {
... | import java.util.Scanner;
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N;
while ((N = scan.nextInt()) != 0) {
int count = 0;
int sum = 0;
for (int i = 1; i * 2 < N; i++) {
for (int j = i; sum < N; j++) {
... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 127 | 2 |
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
ArrayList<Integer> list = new ArrayList<>();
int a;
while (true) {
int c = 0;
a = sc.nextInt();
if (a == 0)
break;
fo... | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
ArrayList<Integer> list = new ArrayList<>();
int a;
while (true) {
int c = 0;
a = sc.nextInt();
if (a == 0)
break;
fo... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 162 | 2 |
import java.util.*;
class Main {
public static void main(String[] z) {
int i, j, k, c, t, b;
Scanner s = new Scanner(System.in);
for (b = 0; (t = s.nextInt()) > 0; System.out.println(b), b = 0)
for (i = 1; i < t; i++)
for (j = i + 2; j < t; b += c == t ? 1 : 0, j++)
for (c = 0, k =... | import java.util.*;
class Main {
public static void main(String[] z) {
int i, j, k, c, t, b;
Scanner s = new Scanner(System.in);
for (b = 0; (t = s.nextInt()) > 0; System.out.println(b), b = 0)
for (i = 1; i <= t; i++)
for (j = i + 2; j <= t; b += c == t ? 1 : 0, j++)
for (c = 0, k... | [["-", 8, 196, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 196, 0, 7, 8, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 7, 8, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 7, 8, 7, 15, 16, 17, 19]] | 3 | 137 | 4 |
import java.util.*;
class Main {
public static void main(String[] z) {
int i, j, k, c, t, b;
Scanner s = new Scanner(System.in);
for (; (t = s.nextInt()) > 0; System.out.println(b))
for (b = i = 0; i++ < t;)
for (j = i + 2; j <= t; b += c == t ? 1 : 0, j++)
for (c = 0, k = i; k++ <... | import java.util.*;
class Main {
public static void main(String[] z) {
int i, j, k, c, t, b;
Scanner s = new Scanner(System.in);
for (; (t = s.nextInt()) > 0; System.out.println(b))
for (b = i = 0; i++ < t;)
for (j = i + 2; j <= t; b += c == t ? 1 : 0, j++)
for (c = 0, k = i; k < j... | [["-", 8, 7, 8, 7, 15, 16, 31, 27, 0, 29], ["+", 8, 7, 8, 7, 8, 7, 26, 27, 0, 22], ["+", 8, 7, 8, 7, 8, 7, 26, 27, 0, 29]] | 3 | 130 | 3 |
import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int i, j, t, b; (t = s.nextInt()) > 0; System.out.println(b))
for (b = i = 0; i++ < t;)
for (j = 1; j++ < t - i;)
b += 2 * i + j - 1 == t * 2 / j ? 1 : 0;
}
} | import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int i, j, t, b; (t = s.nextInt()) > 0; System.out.println(b))
for (b = i = 0; i++ < t;)
for (j = 1; j++ < t - i;)
b += j * (2 * i + j - 1) == t * 2 ? 1 : 0;
}
} | [["+", 0, 11, 12, 510, 15, 16, 31, 16, 31, 22], ["+", 0, 11, 12, 510, 15, 16, 31, 16, 17, 48], ["+", 12, 510, 15, 16, 31, 16, 12, 23, 0, 24], ["+", 12, 510, 15, 16, 31, 16, 12, 23, 0, 25], ["-", 0, 11, 12, 510, 15, 16, 12, 16, 17, 85], ["-", 0, 11, 12, 510, 15, 16, 12, 16, 12, 22]] | 3 | 114 | 6 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
for (;;) {
int n = in.nextInt();
if (n == 0)
return;
int cnt = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
for (;;) {
int n = in.nextInt();
if (n == 0)
return;
int cnt = 0;
for (int i = 1; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 131 | 2 |
#include <stdio.h>
int main() {
int n, i, j, count, sum;
while (1) {
scanf("%d", &n);
if (n == 0)
;
break;
count = 0;
for (i = 1; i < n - 1; i++) {
sum = i;
for (j = i + 1; j < n; j++) {
sum += j;
if (sum == n) {
count++;
}
}
}
pr... | #include <stdio.h>
int main() {
int n, i, j, count, sum;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
count = 0;
for (i = 1; i < n - 1; i++) {
sum = i;
for (j = i + 1; j < n; j++) {
sum += j;
if (sum == n) {
count++;
}
}
}
... | [["-", 0, 52, 8, 9, 0, 57, 64, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 114 | 3 |
/*
AOJ 2198
Title:Sum of Consecutive Integers
@kankichi573
*/
#include <stdio.h>
main() {
int N, i, ret, c_s;
while (scanf("%d", &N) && N) {
ret = 0;
for (i = 2;; i++) {
c_s = i * (i - 1) / 2;
if (c_s > N)
break;
if (((N - c_s) % i) == 0)
ret++;
}
printf("%d... | /*
AOJ 2198
Title:Sum of Consecutive Integers
@kankichi573
*/
#include <stdio.h>
main() {
int N, i, ret, c_s;
while (scanf("%d", &N) && N) {
ret = 0;
for (i = 2;; i++) {
c_s = i * (i - 1) / 2;
if (c_s >= N)
break;
if (((N - c_s) % i) == 0)
ret++;
}
printf("%... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 102 | 2 |
#include <stdio.h>
int main() {
long long n;
for (; ~scanf("%lld", &n) && n;) {
long long r = 0;
int i = 2;
for (;; i++) {
long long x = n - (long long)i * (i - 1) / 2;
if (x < i)
break;
if (x % i == 0)
r += x / i;
}
printf("%lld\n", r);
}
return 0;
} | #include <stdio.h>
int main() {
long long n;
for (; ~scanf("%lld", &n) && n;) {
long long r = 0;
int i = 2;
for (;; i++) {
long long x = n - (long long)i * (i - 1) / 2;
if (x < i)
break;
if (x % i == 0)
r++;
}
printf("%lld\n", r);
}
return 0;
} | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 85], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 27, 17, 29]] | 0 | 106 | 5 |
#include <stdio.h>
int main() {
int n, i, j, c, s;
while (scanf("%d", &n), n) {
for (i = c = 0; i < n; i++) {
for (j = s = 0; s < n; j++)
s += i + j;
if (s == n)
c++;
}
printf("%d\n", c);
}
return 0;
}
| #include <stdio.h>
int main() {
int n, i, j, c, s;
while (scanf("%d", &n), n) {
for (i = c = 1; i < n; i++) {
for (j = s = 0; s < n; j++)
s += i + j;
if (s == n)
c++;
}
printf("%d\n", c - 1);
}
return 0;
}
| [["-", 8, 9, 0, 7, 10, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 7, 10, 11, 12, 11, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 95 | 4 |
#include <stdio.h>
int main() {
int i, j, k;
int N;
int sum = 0;
int count = 0;
while (1) {
i = 0;
j = 0;
k = 0;
N = 0;
sum = 0;
count = 0;
scanf("%d", &N);
if (N == 0) {
break;
}
for (i = 1; i <= N / 3; i++) {
// printf("%d ",i);
sum = i;
for... | #include <stdio.h>
int main() {
int i, j, k;
int N;
int sum = 0;
int count = 0;
while (1) {
i = 0;
j = 0;
k = 0;
N = 0;
sum = 0;
count = 0;
scanf("%d", &N);
if (N == 0) {
break;
}
for (i = 1; i <= N; i++) {
// printf("%d ",i);
sum = i;
for (j ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 156 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int sum(int);
int main() {
int n;
for (; ~fscanf(stdin, "%d", &n), n != 0; fprintf(stdout, "%d\n", sum(n)))
;
return 0;
}
int sum(int n) {
int i, j, s = 0, c = 0;
for (i = 0; i <= (n / 2) + 1; i++)
for (j = i, s = 0; s < n; j++) {
s += j;
... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int sum(int);
int main() {
int n;
for (; ~fscanf(stdin, "%d", &n), n != 0; fprintf(stdout, "%d\n", sum(n)))
;
return 0;
}
int sum(int n) {
int i, j, s = 0, c = 0;
for (i = 1; i < (n / 2) + 1; i++)
for (j = i, s = 0; s < n; j++) {
s += j;
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 133 | 4 |
#include <stdio.h>
int main() {
int n, i, j, res, sum;
while (1) {
scanf("%d", &n);
if (n == 0) {
return 0;
}
sum = 0;
for (i = 1; i < n - 3; i++) {
res = 0;
j = i;
while (res < n && j < n) {
res += j;
j++;
// printf("%d\n", j);
if (res ... | #include <stdio.h>
int main() {
int n, i, j, res, sum;
while (1) {
scanf("%d", &n);
if (n == 0) {
return 0;
}
sum = 0;
for (i = 1; i < n; i++) {
res = 0;
j = i;
while (res < n && j < n) {
res += j;
j++;
if (res == n) {
sum++;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 121 | 2 |
#include <stdio.h>
int main() {
int n, i, j, cnt, t;
while (scanf("%d", &n), n) {
cnt = 0;
for (i = 1; i < n; i++) {
t = 0;
for (j = i + 1; j < n; j++) {
t += j;
if (t == n) {
cnt++;
break;
} else if (t > n) {
break;
}
}
}... | #include <stdio.h>
int main() {
int n, i, j, cnt, t;
while (scanf("%d", &n), n) {
cnt = 0;
for (i = 1; i < n; i++) {
t = 0;
for (j = i; j < n; j++) {
t += j;
if (t == n) {
cnt++;
break;
} else if (t > n) {
break;
}
}
}
... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 116 | 2 |
#include <stdio.h>
int main(void) {
int n, i, s;
int ans;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
ans = 0;
s = 1;
i = 2;
while (s <= n) {
if ((n - s) % i == 0) {
ans++;
}
s += i;
i++;
}
printf("%d\n", ans);
}
return (0)... | #include <stdio.h>
int main(void) {
int n, i, s;
int ans;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
ans = 0;
s = 1;
i = 2;
while (s < n) {
if ((n - s) % i == 0) {
ans++;
}
s += i;
i++;
}
printf("%d\n", ans);
}
return (0);... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18]] | 0 | 104 | 2 |
#include "bits/stdc++.h"
using namespace std;
long long int N, M, K, L, R, H, W;
const long long int MOD = 1000000007;
int main() {
while (cin >> N, N) {
M = 0;
for (int i = 1; i <= N; i++) {
if ((N * 2) % i)
continue;
K = N * 2 / i;
R = K + i - 1;
if (R & 1)
contin... | #include "bits/stdc++.h"
using namespace std;
long long int N, M, K, L, R, H, W;
const long long int MOD = 1000000007;
int main() {
while (cin >> N, N) {
M = 0;
for (int i = 2; i <= N; i++) {
if ((N * 2) % i)
continue;
K = N * 2 / i;
R = K + i - 1;
if (R & 1)
contin... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 137 | 6 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 240 | 2 |
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++... | [["-", 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 | 282 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum, co = 0;
for (int i = 1; i < n / 2 + 1; i++) {
sum = 0;
// cout<<i<<" ";
for (int j = i + 1; sum < n; j++) {
sum += j;
// cout<<j<<" ";
if (sum == n)
co... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum, co = 0;
for (int i = 1; i < n; i++) {
sum = 0;
// cout<<i<<" ";
for (int j = i; sum < n; j++) {
sum += j;
// cout<<j<<" ";
if (sum == n)
co++;
}
... | [["-", 0, 7, 15, 16, 12, 16, 31, 16, 17, 85], ["-", 0, 7, 15, 16, 12, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 96 | 6 |
#include <iostream>
int consecutive_sum(int n) {
int cnt = 0;
int max = n / 2 + 1;
for (int i = 1; i <= max; i++) {
int total = i;
for (int j = i; total <= n; total += ++j) {
if (total == n) {
cnt++;
}
}
}
return cnt;
}
int main() {
int n = 0;
while (std::cin >> n, n !... | #include <iostream>
int consecutive_sum(int n) {
int cnt = 0;
int max = n / 2;
for (int i = 1; i <= max; i++) {
int total = i;
for (int j = i; total <= n; total += ++j) {
if (total == n) {
cnt++;
}
}
}
return cnt;
}
int main() {
int n = 0;
while (std::cin >> n, n != 0... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 118 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int sum;
while (cin >> sum, sum) {
int cnt = 0;
for (int n = 2; 2 * n + 1 <= sum; n++) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int sum;
while (cin >> sum, sum) {
int cnt = 0;
for (int n = 2; n <= sum; n++) {
in... | [["-", 0, 7, 15, 16, 31, 16, 31, 16, 31, 13], ["-", 0, 7, 15, 16, 31, 16, 31, 16, 17, 48], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13]] | 1 | 130 | 4 |
#include <stdio.h>
int p = 0;
int solve(int n) {
int i = 1, k = 0, l = 1;
while (i < n) {
k = i;
l = k + 1;
while (k <= n) {
k = k + l;
l++;
if (k == n) {
p++;
break;
}
}
i++;
}
return k;
}
int main(void) {
int n;
while (1) {
scanf("%d", &n)... |
#include <stdio.h>
int p = 0;
int solve(int n) {
int i = 1, k = 0, l = 1;
while (i < n) {
k = i;
l = k + 1;
while (k <= n) {
k = k + l;
l++;
if (k == n) {
p++;
break;
}
}
i++;
}
return k;
}
int main(void) {
int n;
while (1) {
scanf("%d", &n)... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 137 | 1 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 211 | 2 |
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define PI 3.14159265359
#define INF 1000000;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
using namespace ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define PI 3.14159265359
#define INF 1000000;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
using namespace ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 138 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["-", 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], ["+", 0, 9, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 9, 0, 9, 0, 57, 64, 9, 0, 46]] | 1 | 240 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
bool exist[1000 * 1000];
int main() {
int n;
for (int i = 0; i <= 1000; i++) {
exist[i * (i + 1) / 2] = true;
}
while (cin >> n, n) {
int res = 0;
for (int i = 0; i <= 500; i++) {
int x = i * (i + 1) / 2;
if (exist[x + n])
... | #include <algorithm>
#include <iostream>
using namespace std;
bool exist[1000 * 1000];
int main() {
int n;
for (int i = 0; i <= 1000; i++) {
exist[i * (i + 1) / 2] = true;
}
while (cin >> n, n) {
int res = 0;
for (int i = 0; i <= 1000; i++) {
int x = i * (i + 1) / 2;
if (exist[x + n])
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 123 | 2 |
#include <algorithm>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
int main() {
int a, b, c;
while (1) {
cin >> a;
if (!a) {
break;
}
int count = 0;
for (size_t i = 2; i < a; i++) {
double x = (double)a / i;
if (x - i / 2 < 0) {
break;
... | #include <algorithm>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
int main() {
int a, b, c;
while (1) {
cin >> a;
if (!a) {
break;
}
int count = 0;
for (size_t i = 2; i < a; i++) {
double x = (double)a / i;
if (x - (double)i / 2 < 0) {
br... | [["+", 51, 16, 31, 16, 12, 16, 31, 74, 0, 24], ["+", 31, 16, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 51, 16, 31, 16, 12, 16, 31, 74, 0, 25]] | 1 | 144 | 3 |
#include <iostream>
using namespace std;
int main() {
for (;;) {
int N;
cin >> N;
if (N == 0)
break;
int ans = 0;
for (int a = 2; a <= N / 2 + 1; a++) {
for (int b = a - 1; b >= 1; b++) {
int tmp = a * (a + 1) - b * (b - 1);
if (tmp == 2 * N) {
ans++;
... | #include <iostream>
using namespace std;
int main() {
for (;;) {
int N;
cin >> N;
if (N == 0)
break;
int ans = 0;
for (int a = 2; a <= N / 2 + 1; a++) {
for (int b = a - 1; b >= 1; b--) {
int tmp = a * (a + 1) - b * (b - 1);
if (tmp == 2 * N)
ans++;
... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68], ["-", 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 | 131 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<>
using namespace std;
typedef int64_t i64;
typedef int32_t i32;
typedef int16_t i16;
typedef int8_t i8;
typedef uint64_t ui... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<>
using namespace std;
typedef int64_t i64;
typedef int32_t i32;
typedef int16_t i16;
typedef int8_t i8;
typedef uint64_t ui... | [["-", 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 | 194 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int count = 0;
for (int i = 0; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int sum = (2 * i + j) * (j + 1) / 2;
if (sum == N)
count++;
if (sum >= N)
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int count = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int sum = (2 * i + j) * (j + 1) / 2;
if (sum == N)
count++;
if (sum >= N)
break;
}
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 107 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
int cnt = 0, shokika = 0;
for (int i = 1; i < n; i++) {
sum += i;
// cout << sum << endl;
shokika++;
if (sum == n) {
cnt++;
sum = 0;
}
// if(sho... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
int cnt = 0, shokika = 0;
for (int i = 1; i < n; i++) {
sum += i;
// cout << sum << endl;
shokika++;
if (sum == n) {
cnt++;
}
// if(shokika)
if (i... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 116 | 4 |
#include <iostream>
int main() {
while (true) {
int n;
std::cin >> n;
if (n == 0)
break;
int num = 0;
for (int j = 0; j < n; j++)
for (int i = 0; i < n; i++)
if ((2 * i + j - 1) * j == 2 * n)
num++;
std::cout << num << std::endl;
}
return 0;
} | #include <iostream>
int main() {
while (true) {
int n;
std::cin >> n;
if (n == 0)
break;
int num = 0;
for (int j = 2; j < n; j++)
for (int i = 1; i < n; i++)
if ((2 * i + j - 1) * j == 2 * n)
num++;
std::cout << num << std::endl;
}
return 0;
} | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13]] | 1 | 98 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool solve(int n, int i);
int main() {
int n;
while (1) {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool solve(int n, int i);
int main() {
int n;
while (1) {... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 204 | 4 |
#include <stdio.h>
int main() {
int n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int c = 0;
if (n <= 2)
c = 0;
else {
for (int i = 1; i <= (n / 2 + 1); i++) {
int s = 0;
for (int j = i; j <= (n / 2 + 1); j++) {
s += j;
if (s == n) {
... | #include <stdio.h>
int main() {
int n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int c = 0;
if (n <= 2)
c = 0;
else {
for (int i = 1; i <= (n / 2 + 1); i++) {
int s = 0;
for (int j = i; j <= (n / 2 + 1); j++) {
s += j;
if (s == n) {
... | [["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 132 | 2 |
#include <iostream>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int ans = 0;
for (int k = 1; k <= N; ++k) {
for (int l = 2; l < N; ++l) {
int s = k * l + l * (l + 1) / 2;
if (s == N) {
++ans;
}
if (s >= N) {
break;
}
... | #include <iostream>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int ans = 0;
for (int k = 1; k <= N; ++k) {
for (int l = 2; l < N; ++l) {
int s = (k - 1) * l + l * (l + 1) / 2;
if (s == N) {
++ans;
}
if (s >= N) {
break;
... | [["+", 49, 50, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 16, 31, 23, 0, 25]] | 1 | 106 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 257 | 2 |
#include <stdio.h>
int main() {
int n, i, j, a, x;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
x = 0;
for (i = 1; i <= 499; i++) {
if (2 * i > n)
break;
for (j = i + 1; j <= 500; j++) {
a = (i + j) * (j - i - 1) / 2;
if (a == n) {
x++;
... | #include <stdio.h>
int main() {
int n, i, j, a, x;
while (-1) {
scanf("%d", &n);
if (n == 0)
break;
x = 0;
for (i = 1; i <= 499; i++) {
if (2 * i > n)
break;
for (j = i + 1; j <= 500; j++) {
a = (i + j) * (j - i + 1) / 2;
if (a == n) {
x++;
... | [["-", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["-", 12, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 17, 72]] | 1 | 133 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
vector<int> sum;
sum.pb(0);
for (int i = 1; i <= 1000; i++) {
sum.pb(sum[i - 1] + i);
}
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int ans = 0;
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
vector<int> sum;
sum.pb(0);
for (int i = 1; i <= 1000; i++) {
sum.pb(sum[i - 1] + i);
}
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int ans = 0;
for (int i = 0;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 153 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | [["-", 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], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 333 | 6 |
#include <cstdio>
int main(void) {
while (1) {
int n;
scanf("%d", &n);
if (n == 0)
break;
int cnt = 0;
for (int i = 2; i <= n / 2; i++) {
int j = i, sum = i;
while (sum < n) {
j++;
sum += j;
}
if (sum == n)
cnt++;
}
printf("%d\n", cnt)... | #include <cstdio>
int main(void) {
while (1) {
int n;
scanf("%d", &n);
if (n == 0)
break;
int cnt = 0;
for (int i = 1; i <= n / 2; i++) {
int j = i, sum = i;
while (sum < n) {
j++;
sum += j;
}
if (sum == n)
cnt++;
}
printf("%d\n", cnt)... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 105 | 2 |
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int sum(int a, int b) {
int sum = 0;
REP(i, b - a + 1)
sum += a + i;
return sum;
}
int main() {
int N;
int ans;
while (1) {
cin >> N;
if (N == 0) {
break;
} else {
ans = 0;
for (i... | #include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int sum(int a, int b) {
int sum = 0;
REP(i, b - a + 1)
sum += a + i;
return sum;
}
int main() {
int N;
int ans;
while (1) {
cin >> N;
if (N == 0) {
break;
} else {
ans = 0;
for (i... | [["-", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 144 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int input = 0;
int n, m, i, cnt = 0;
int finish = 0;
scanf("%d", &input);
while (finish == 0) {
cnt = 0;
i = 0;
for (m = 2; i == 0; m++) {
n = input - ((m - 1) * m / 2);
// printf("%d\n",n);
if (n < -1) ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int input = 0;
int n, m, i, cnt;
int finish = 0;
scanf("%d", &input);
while (finish == 0) {
cnt = 0;
i = 0;
for (m = 2; i == 0; m++) {
n = input - ((m - 1) * m / 2);
if (n < m) {
i = 1;
} else if ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 155 | 4 |
#include <iostream>
using namespace std;
int main() {
int num = 0;
while (cin >> num) {
if (num > 0) {
int count = 0;
for (int i = 1; i <= num; i++) {
for (int j = i + 1; j <= num; j++) {
if ((double)(j - i + 1) * (i + j) / 2 == num)
count++;
}
}
if... | #include <iostream>
using namespace std;
int main() {
int num = 0;
while (cin >> num) {
if (num > 0) {
int count = 0;
for (int i = 1; i <= num; i++) {
for (int j = i + 1; j <= num; j++) {
if ((double)(j - i + 1) * (i + j) / 2 == num)
count++;
}
}
co... | [["-", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 51, 22], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25]] | 1 | 114 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.