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>
using namespace std;
#define int long long
#define MKP make_pair
#define fi first
#define se second
typedef pair<int, int> pii;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 205;
constexpr int MAX_W = 10005;
constexpr int INF = 1LL << 60;
/* 基本要素 */
typedef double D; // 座標値の型。doub... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MKP make_pair
#define fi first
#define se second
typedef pair<int, int> pii;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 205;
constexpr int MAX_W = 10005;
constexpr int INF = 1LL << 60;
/* 基本要素 */
typedef double D; // 座標値の型。doub... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 559 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define EPS (1e-4)
typedef complex<double> P;
int main() {
int n;
while (cin >> n, n) {
vector<P> a(n);
for (auto &e : a) {
double x, y;
cin >> x >> y;
e.real(x);
e.imag(y);
}
int m = 1;
for (int i = 0; i < n; i++) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-4)
typedef complex<double> P;
int main() {
int n;
while (cin >> n, n) {
vector<P> a(n);
for (auto &e : a) {
double x, y;
cin >> x >> y;
e.real(x);
e.imag(y);
}
int m = 1;
for (int i = 0; i < n; i++) {
fo... | [["+", 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 | 292 | 4 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define rep(i, n) REP(i, ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define rep(i, n) REP(i, ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,055 | 2 |
#include <complex>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define EPS 1e-8
using namespace std;
typedef complex<double> P;
int main() {
int n;
double x, y;
while (cin >> n, n) {
P p[n];
rep(i, n) cin >> x >> y, p[i] = P(x, y);
int mx = 0, m1, m2;
rep(i, n) rep(j, i) if (... | #include <complex>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define EPS 1e-8
using namespace std;
typedef complex<double> P;
int main() {
int n;
double x, y;
while (cin >> n, n) {
P p[n];
rep(i, n) cin >> x >> y, p[i] = P(x, y);
int mx = 1, m1, m2;
rep(i, n) rep(j, i) if (... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 302 | 2 |
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> coor;
#define EPS 1e-5
double in_cir(coor o, coor x) { return abs(x - o); }
int search(vector<coor> P) {
int mx = 0;
/*for (int i = 0; i < P.size(); i++) {
printf("%lf, %l... | #include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> coor;
#define EPS 1e-5
double in_cir(coor o, coor x) { return abs(x - o); }
int search(vector<coor> P) {
int mx = 1;
/*for (int i = 0; i < P.size(); i++) {
printf("%lf, %l... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 428 | 2 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i =... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 312 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
//eÍÍÌë·
// 1 * 10^(-5)
#define EPS (1e-8)
int n;
pair<double, double> p[301];
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
//eÍÍÌë·
// 1 * 10^(-5)
#define EPS (1e-8)
int n;
pair<double, double> p[301];
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
... | [["-", 0, 16, 31, 23, 0, 16, 31, 118, 119, 120], ["+", 0, 16, 31, 23, 0, 16, 31, 118, 119, 120], ["-", 0, 16, 31, 23, 0, 16, 12, 118, 119, 120], ["+", 0, 16, 31, 23, 0, 16, 12, 118, 119, 120]] | 1 | 420 | 8 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 512 | 2 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
const double EPS = 1e-8;
typedef complex<double> Point;
int calc(Point p, vector<Point> &ps) {
int ans = 0;
for (int i = 0; i < ps.size(); i++) {
if (abs(ps[i] - p) < 1.0 + EPS) {
ans++;
}
}
retu... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
const double EPS = 1e-8;
typedef complex<double> Point;
int calc(Point p, vector<Point> &ps) {
int ans = 0;
for (int i = 0; i < ps.size(); i++) {
if (abs(ps[i] - p) < 1.0 + EPS) {
ans++;
}
}
retu... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 347 | 2 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
#define X real()
#define Y imag()
typedef double D;
D EPS = 1e-8;
typedef complex<D> P;
struct L {
P a, b;
P vec() { return b - a; }
};
typedef vector<P> Pol;
int sig(D a) { return a < -EPS ? -1 : a > EPS ? 1 : 0... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
#define X real()
#define Y imag()
typedef double D;
D EPS = 1e-8;
typedef complex<D> P;
struct L {
P a, b;
P vec() { return b - a; }
};
typedef vector<P> Pol;
int sig(D a) { return a < -EPS ? -1 : a > EPS ? 1 : 0... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 488 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef double Num;
typedef complex<Num> Pt2;
struct Circle2 {
Pt2 p;
Num r;
Circle2(Pt2 p, Num r) : p(p), r(r) {}
};
const double eps = 1e-10;
const double pi = 3.14159265358979323846;
Pt2 orth... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef double Num;
typedef complex<Num> Pt2;
struct Circle2 {
Pt2 p;
Num r;
Circle2(Pt2 p, Num r) : p(p), r(r) {}
};
const double eps = 1e-10;
const double pi = 3.14159265358979323846;
Pt2 orth... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 459 | 2 |
#include <algorithm>/*{{{*/
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | #include <algorithm>/*{{{*/
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 872 | 4 |
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<double, double> pos;
const double r = 1;
const double eps = 0.0001;
int count(vector<pos> ps, double x, double y, int ban1, int ban2) {
int c = 0; // 2;
for (int i = 0; i < ps.size(); i++) {
if ( // i!=... | #include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<double, double> pos;
const double r = 1;
const double eps = 0.0000000001;
int count(vector<pos> ps, double x, double y, int ban1, int ban2) {
int c = 0; // 2;
for (int i = 0; i < ps.size(); i++) {
if ( ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 673 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS 1e-10
#define PI 3.141592653589793238
// sqrtは重い
using namespace std;
typedef pair<double, double> P;
void display(complex<double> a, complex<double> ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS 1e-10
#define PI 3.141592653589793238
// sqrt重い
using namespace std;
typedef pair<double, double> P;
void display(complex<double> a, complex<double> b... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13]] | 1 | 549 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
const double EPS = 1e-9;
bool tolerant_eq(double a, double b) { return abs(a - b) < EPS; }
struct Point {
double x, y;
explicit Point(const double &x = 0.0, const double &y = 0.0... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
const double EPS = 1e-9;
bool tolerant_eq(double a, double b) { return abs(a - b) < EPS; }
struct Point {
double x, y;
explicit Point(const double &x = 0.0, const double &y = 0.0... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,344 | 2 |
#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... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 634 | 2 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 421 | 4 |
#include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (int)(n); ++i)
#define X real()
#define Y imag()
typedef complex<double> Pt;
const double EPS = 1e-9;
int main() {
int n;
while (cin >> n, ... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (int)(n); ++i)
#define X real()
#define Y imag()
typedef complex<double> Pt;
const double EPS = 1e-9;
int main() {
int n;
while (cin >> n, ... | [["+", 3, 4, 0, 16, 12, 16, 31, 16, 17, 48], ["+", 3, 4, 0, 16, 12, 16, 31, 16, 12, 22], ["-", 12, 2, 3, 4, 0, 16, 12, 16, 12, 13], ["+", 12, 2, 3, 4, 0, 16, 12, 16, 12, 13]] | 1 | 311 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
const double eps = 1e-8;
while (true) {
cin >> n;
if (n ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
const double eps = 1e-8;
while (true) {
cin >> n;
if (n ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 510 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
const double eps = 1e-8;
while (true) {
cin >> n;
if (n ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
const double eps = 1e-8;
while (true) {
cin >> n;
if (n ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 510 | 2 |
// AOJ 1133: Water Tank
// 2018.2.20 bal4u
#include <stdio.h>
#include <string.h>
int n;
int b[12];
int h[12];
double x[12], ans[12];
//#define getchar_unlocked() getchar()
int in() {
int n = 0;
int c = getchar_unlocked();
do
n = (n << 3) + (n << 1) + (c & 0xf), c = getchar_unlocked();
while (c >= '0');... | // AOJ 1133: Water Tank
// 2018.2.20 bal4u
#include <stdio.h>
#include <string.h>
int n;
int b[12];
int h[12];
double x[12], ans[12];
//#define getchar_unlocked() getchar()
int in() {
int n = 0;
int c = getchar_unlocked();
do
n = (n << 3) + (n << 1) + (c & 0xf), c = getchar_unlocked();
while (c >= '0');... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 69, 71, 11, 31, 22], ["+", 0, 2, 3, 4, 0, 69, 71, 11, 17, 32]] | 0 | 635 | 4 |
#ifndef _WIN32
#include <iostream>
#endif
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).be... | #ifndef _WIN32
#include <iostream>
#endif
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).be... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 689 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
const int H = 50;
const int D = 30;
const int W = 100;
const double EPS = 0.0... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
const int H = 50;
const int D = 30;
const int W = 100;
const double EPS = 0.0... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+"... | 1 | 1,587 | 9 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | [["+", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 25]] | 1 | 358 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, M;
cin >> N >> M;
if (N == 0)
break;
int r;
cin >> r;
vector<int> t(r), n(r), m(r), s(r);
for (int i = 0; i < r; i++) {
cin >> t[i] >> n[i] >> m[i] >> s[i];
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, M;
cin >> N >> M;
if (N == 0)
break;
int r;
cin >> r;
vector<int> t(r), n(r), m(r), s(r);
for (int i = 0; i < r; i++) {
cin >> t[i] >> n[i] >> m[i] >> s[i];
}
... | [["+", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 25]] | 1 | 300 | 5 |
#include <iostream>
using namespace std;
int main() {
int N, M;
int r;
while (cin >> N >> M) {
if (N == 0 && M == 0)
break;
cin >> r;
int *t = new int[r];
int *n = new int[r];
int *m = new int[r];
int *s = new int[r];
for (int i = 0; i < r; i++) {
cin >> t[i] >> n[i]... | #include <iostream>
using namespace std;
int main() {
int N, M;
int r;
while (cin >> N >> M) {
if (N == 0 && M == 0)
break;
cin >> r;
int *t = new int[r];
int *n = new int[r];
int *m = new int[r];
int *s = new int[r];
for (int i = 0; i < r; i++) {
cin >> t[i] >> n[i]... | [["-", 0, 1, 0, 11, 12, 16, 31, 69, 28, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 70], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 73], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 340 | 7 |
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, M, r, q, t, n, m, s, ts, te, mm;
vector<pair<int, pair<int, int>>> lg[10001];
cin >> N >> M;
if (!(N || M))
break;
cin >> r;
for (int i = 0; i < r; ++i) {
cin >> t >> n >> ... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, M, r, q, t, n, m, s, ts, te, mm;
vector<pair<int, pair<int, int>>> lg[10001];
cin >> N >> M;
if (!(N || M))
break;
cin >> r;
for (int i = 0; i < r; ++i) {
cin >> t >> n >> ... | [["+", 75, 76, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 75, 76, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 415 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<int, Pii> Pip;
const int INF =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<int, Pii> Pip;
const int INF =... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, ... | 1 | 261 | 8 |
#include <algorithm>
#include <iostream>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
int m;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
unordered_map<int, int> wip;
using Range = tuple<i... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
int m;
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
unordered_map<int, int> wip;
using Range = tuple<i... | [["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38]] | 1 | 619 | 1 |
#include <iostream>
#include <vector>
using namespace std;
class student {
public:
int st[51], ed[51];
int num, cnt;
student() {
num = 0;
cnt = 0;
}
};
int main() {
int N; // 学生数
int M; // PC数
while (cin >> N >> M, N || M) {
int r; // 利用記録数
int q; // 質問数
vector<student> std(N);
... | #include <iostream>
#include <vector>
using namespace std;
class student {
public:
int st[50], ed[50];
int num, cnt;
student() {
num = 0;
cnt = 0;
}
};
int main() {
int N; // PC数
int M; // 学生数
while (cin >> N >> M, N || M) {
int r; // 利用記録数
int q; // 質問数
vector<student> std(M + 1);... | [["-", 0, 353, 8, 123, 0, 124, 49, 80, 81, 13], ["+", 0, 353, 8, 123, 0, 124, 49, 80, 81, 13], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 492 | 8 |
#include <iostream>
#include <vector>
using namespace std;
const int MaxN = 1001;
const int MaxM = 10001;
int N, M;
int main() {
int count[MaxM];
while (cin >> N >> M && !(N == 0 && M == 0)) {
vector<vector<pair<int, int>>> logg(MaxM);
int r;
cin >> r;
int t, n, m, s;
for (int i = 0; i < Ma... | #include <iostream>
#include <vector>
using namespace std;
const int MaxN = 1001;
const int MaxM = 10001;
int N, M;
int main() {
int count[MaxM];
while (cin >> N >> M && !(N == 0 && M == 0)) {
vector<vector<pair<int, int>>> logg(MaxM);
int r;
cin >> r;
int t, n, m, s;
for (int i = 0; i < Ma... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 390 | 2 |
#! /usr/bin/python
# -*- coding: utf-8 -*-
from bisect import *
while True:
(N, M) = list(map(int, input().split()))
if N == 0: break
r = int(input())
used = [0]*(N+1)
imos = [[0]*1301 for i in range(M+1)]
for i in range(r):
(t, n, m, s) = list(map(int, input().split()))
if s =... | #! /usr/bin/python
# -*- coding: utf-8 -*-
from bisect import *
while True:
(N, M) = list(map(int, input().split()))
if N == 0: break
r = int(input())
used = [0]*(N+1)
imos = [[0]*1301 for i in range(M+1)]
for i in range(r):
(t, n, m, s) = list(map(int, input().split()))
if s =... | [["-", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["-", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["-", 0, 7, 8, 196, 0, 1, 0, 677, 17, 107], ["-", 0, 7, 8, 196, 0, 1, 0, 677, 12, 612]] | 5 | 255 | 5 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, m, i, j;
int tarou[101];
int hanako[101];
int tarou_sum = 0, hanako_sum = 0;
int sa;
int min_tarou = 999, min_hanako = 999;
int min = 999;
int hen = 0;
while (1) {
scanf("%d %d", &m, &n);
if (m == 0)
break;
min_tarou = ... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, m, i, j;
int tarou[101];
int hanako[101];
int tarou_sum = 0, hanako_sum = 0;
int sa;
int min_tarou = 999, min_hanako = 999;
int min = 999;
int hen = 0;
while (1) {
scanf("%d %d", &m, &n);
if (m == 0)
break;
min_tarou = 9... | [["-", 0, 1, 0, 11, 12, 16, 31, 2, 63, 22], ["-", 15, 23, 0, 16, 31, 16, 31, 2, 63, 22]] | 0 | 330 | 2 |
#include <stdio.h>
int main(void) {
int taro[100] = {0}, hanako[100] = {0};
int i, j, n, m, min, tarotrade, hanakotrade;
int taroall, hanakoall;
scanf("%d%d", &n, &m);
while (m + n) {
taroall = 0;
hanakoall = 0;
min = 201;
for (i = 0; i < n; i++) {
scanf("%d", &taro[i]);
// prin... | #include <stdio.h>
int main(void) {
int taro[100] = {0}, hanako[100] = {0};
int i, j, n, m, min, tarotrade, hanakotrade;
int taroall, hanakoall;
scanf("%d%d", &n, &m);
while (m + n) {
taroall = 0;
hanakoall = 0;
min = 201;
for (i = 0; i < n; i++) {
scanf("%d", &taro[i]);
// prin... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 309 | 2 |
#include <stdio.h>
void sorting(int x[], int first, int end) {
int t;
int i = first;
int j = end;
int p = (first + end) / 2;
int pivot = x[p];
while (1) {
while (x[i] < pivot)
i++;
while (x[j] > pivot)
j--;
if (i >= j)
break;
t = x[i];
x[i] = x[j];
x[j] = t;
i... | #include <stdio.h>
void sorting(int x[], int first, int end) {
int t;
int i = first;
int j = end;
int p = (first + end) / 2;
int pivot = x[p];
while (1) {
while (x[i] < pivot)
i++;
while (x[j] > pivot)
j--;
if (i >= j)
break;
t = x[i];
x[i] = x[j];
x[j] = t;
i... | [["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 72], ["+", 15, 23, 0, 16, 12, 16, 12, 16, 31, 22], ["+", 15, 23, 0, 16, 12, 16, 12, 16, 17, 85], ["+", 15, 23, 0, 16, 12, 16, 12, 16, 12, 13]] | 0 | 552 | 4 |
#include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
vector... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
vector... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 420 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF 1000000000
#define EPS 1e-9
using namespace std;
typedef list<int> L;
typedef pair<int, i... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INF 1000000000
#define EPS 1e-9
using namespace std;
typedef list<int> L;
typedef pair<int, i... | [["-", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22]] | 1 | 371 | 4 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int i, j, k;
int n, m;
int sa, sb; // a,bの合計
int a[100], b[100];
int ans[3];
while (1) {
scanf("%d %d", &n, &m);
if ((n == 0) && (m == 0))
break;
//初期化
sa = 0;
sb = 0;
... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int i, j, k;
int n, m;
int sa, sb; // a,bの合計
int a[100], b[100];
int ans[3];
while (1) {
scanf("%d %d", &n, &m);
if ((n == 0) && (m == 0))
break;
//初期化
sa = 0;
sb = 0;
... | [["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22]] | 1 | 370 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int s[100], t[100], sumS, sumT;
int N, M;
bool Exists(int target) {
int *p = lower_bound(t, t + M, target);
if (p >= t + M)
return false;
if (*p == target)
return true;
return false;
}
signed main() {
while (cin >> N >> M, N || M... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int s[100], t[100], sumS, sumT;
int N, M;
bool Exists(int target) {
int *p = lower_bound(t, t + M, target);
if (p >= t + M)
return false;
if (*p == target)
return true;
return false;
}
signed main() {
while (cin >> N >> M, N || M... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 90], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 289 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, m, flower[100], tarou[100], cnt = 0, fsum = 0, tsum = 0, tchange,
fchange;
int ff, tt;
int fma = 99999, tma = 99999;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, m, flower[100], tarou[100], cnt = 0, fsum = 0, tsum = 0, tchange,
fchange;
int ff, tt;
int fma = 99999, tma = 99999;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 283 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 72], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 366 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int N, M;
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0)
break;
int n[102] = {}, m[102] = {};
int ns = 0, ms = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &n[i]);
ns += n[i];
}
for (int i = 0; i < M; i++... | #include <stdio.h>
#include <stdlib.h>
int main() {
int N, M;
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0)
break;
int n[102] = {}, m[102] = {};
int ns = 0, ms = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &n[i]);
ns += n[i];
}
for (int i = 0; i < M; i++... | [["-", 8, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 447 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 1 << 20;
int main() {
int i, j, n, m, diff, anstaro, anshanako, taro[101], hanako[101];
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
anstaro = MAX;
anshanako = MAX;
diff = 0;
for (i = 0; ... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 1 << 20;
int main() {
int i, j, n, m, diff, anstaro, anshanako, taro[101], hanako[101];
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
anstaro = MAX;
anshanako = MAX;
diff = 0;
for (i = 0; ... | [["+", 0, 52, 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, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 275 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m && n) {
int sum = 0;
vector<int> p(n), q(n);... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m && n) {
int sum = 0;
vector<int> p(n), q(m);... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 217 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b;
int taro[100], hanako[100], tsum, hsum;
while (cin >> a >> b) {
if (a == 0 && b == 0)
break;
tsum = hsum = 0;
for (int i = 0; i < a; i++) {
cin >> taro[i];
tsum += taro[i];
}
for (int i = 0; i < b; i++) {
... | #include <iostream>
using namespace std;
int main() {
int a, b;
int taro[100], hanako[100], tsum, hsum;
while (cin >> a >> b) {
if (a == 0 && b == 0)
break;
tsum = hsum = 0;
for (int i = 0; i < a; i++) {
cin >> taro[i];
tsum += taro[i];
}
for (int i = 0; i < b; i++) {
... | [["-", 8, 9, 0, 52, 8, 9, 0, 37, 0, 38], ["-", 8, 9, 0, 52, 8, 9, 0, 37, 0, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 37, 0, 35]] | 1 | 266 | 3 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 377 | 8 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(), (a).end()
#define ifnot(a) if (not a)
#define dump(x) cerr ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(), (a).end()
#define ifnot(a) if (not a)
#define dump(x) cerr ... | [["-", 64, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 64, 9, 0, 57, 64, 1, 0, 11, 31, 22]] | 1 | 1,036 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 376 | 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... | [["-", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["+", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120]] | 1 | 418 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main(void) {
int n, m;
int a[101], b[101];
bool flag;
while (cin >> n >> m && n) {
rep(i, n) scanf("%d", &a[i]);
rep(i, m) scanf("%d", &b[i]);
int suma = 0, sumb = 0;
rep(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main(void) {
int n, m;
int a[101], b[101];
bool flag;
while (cin >> n >> m && n) {
rep(i, n) scanf("%d", &a[i]);
rep(i, m) scanf("%d", &b[i]);
int suma = 0, sumb = 0;
rep(i,... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 244 | 2 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a | b) {
map<int, vector<int>> l;
vector<vector<int>> s;
vector<int> c(a);
vector<int> d(b);
int x, y;
x = y = 0;
for (int e = 0; e < a; e++) {
... | #include <iostream>
#include <map>
#include <string>
#include <vector>
#define int double
using namespace std;
signed main() {
signed a, b;
while (cin >> a >> b, a | b) {
map<int, vector<int>> l;
vector<vector<int>> s;
vector<int> c(a);
vector<int> d(b);
int x, y;
x = y = 0;
for (int e ... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 156]] | 1 | 327 | 7 |
#include <iostream>
using namespace std;
int sum(int *, int);
int main(void) {
int n, m, sub, flag, cnum1, cnum2, i, j, sum1, sum2;
cin >> n >> m;
int a[101], b[101];
while ((n == 0 && m == 0) != 1) {
//
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (j = 0; j < m; j++) {
cin >>... | #include <iostream>
using namespace std;
int sum(int *, int);
int main(void) {
int n, m, sub, flag, cnum1, cnum2, i, j, sum1, sum2;
cin >> n >> m;
int a[101], b[101];
while ((n == 0 && m == 0) != 1) {
//
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (j = 0; j < m; j++) {
cin >>... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 44]] | 1 | 335 | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int sn[100], sm[100];
int i, j, n, m, cn = 0, cm = 0;
cin >> n >> m;
while (n != 0 && m != 0) {
cn = 0;
cm = 0;
for (i = 0; i < n; i++) {
cin >> sn[i];
cn += sn[i];
}
for (j = 0; j < m; j++) {
cin >... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int sn[100], sm[100];
int i, j, n, m, cn = 0, cm = 0;
cin >> n >> m;
while (n != 0 && m != 0) {
cn = 0;
cm = 0;
for (i = 0; i < n; i++) {
cin >> sn[i];
cn += sn[i];
}
for (j = 0; j < m; j++) {
cin >... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 317 | 4 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (m == 0)
break;
int t[n], h[n];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < m; i++)
cin >> h[i];
int sumt = 0, sumh = 0;
for (int i = 0; i < n; i++)
... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (m == 0)
break;
int t[n], h[m];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < m; i++)
cin >> h[i];
int sumt = 0, sumh = 0;
for (int i = 0; i < n; i++)
... | [["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 22]] | 1 | 280 | 2 |
#include <stdio.h>
int main() {
int n, m, suma = 0, sumb = 0, x, sa[100], sb[100], i, j, blank, a;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
suma = 0;
sumb = 0;
for (i = 0; i < n; i++) {
scanf("%d", &sa[i]);
suma += sa[i];
}
for (j = 0; j < ... | #include <stdio.h>
int main() {
int n, m, suma = 0, sumb = 0, x, sa[100], sb[100], i, j, blank, a, sumx;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
suma = 0;
sumb = 0;
for (i = 0; i < n; i++) {
scanf("%d", &sa[i]);
suma += sa[i];
}
for (j = 0... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22]] | 1 | 536 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, temp, tempa, c, i;
while (1) {
cin >> n >> m;
if (n == m && n == 0)
break;
int a[n], b[m], suma = 0, sumb = 0, d = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
suma += a[i];
}
for (i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, temp, tempa, c, i;
while (1) {
cin >> n >> m;
if (n == m && n == 0)
break;
int a[n], b[m], suma = 0, sumb = 0, d = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
suma += a[i];
}
for (i = 0; i < m; i++) {
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 539 | 2 |
#include "iostream"
using namespace std;
int main() {
while (1) {
int n, m, t[100], h[100], sumt = 0, sumh = 0, mint = 101, minh = 101;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
cin >> t[i];
sumt += t[i];
}
for (int i = 0; i < m; i++) {
... |
#include "iostream"
using namespace std;
int main() {
while (1) {
int n, m, t[100], h[100], sumt = 0, sumh = 0, mint = 101, minh = 101;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
cin >> t[i];
sumt += t[i];
}
for (int i = 0; i < m; i++) {
... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 255 | 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... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 349 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i >= n; i--)
#define rep(i, n) FOR(i, 0, n)
#def... | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i >= n; i--)
#define rep(i, n) FOR(i, 0, n)
#def... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 307 | 2 |
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m, tarou_ch = 0, hanako_ch = 0, min = 201;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
int input;
vector<int> tarou, hanako;
for (int i = 0; i < n; i++... | #include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m, tarou_ch = 0, hanako_ch = 0, min = 201;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
int input;
vector<int> tarou, hanako;
for (int i = 0; i < n; i++... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 335 | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#def... | [["-", 0, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25], ["-", 51, 16, 31, 16, 31, 16, 31, 2, 63, 22]] | 1 | 392 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
int main() {
while (1) {
int a, b;
int t[111];
int h[111];
cin >> a >> b;
if... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
int main() {
while (1) {
int a, b;
int t[111];
int h[111];
cin >> a >> b;
if... | [["-", 75, 76, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 75, 76, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 75, 76, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 75, 76, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 276 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
Scanner in = new Scanner(System.in);
int n, w, d;
int[] W = new int[102];
int[] D = new int[102];
int[] area = new int[102];
final int INF = 100001;
public void run() {
while (true) {
n = in.nextInt();
w = in.nextInt(... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
Scanner in = new Scanner(System.in);
int n, w, d;
int[] W = new int[102];
int[] D = new int[102];
int[] area = new int[102];
final int INF = 100001;
public void run() {
while (true) {
n = in.nextInt();
w = in.nextInt(... | [["-", 0, 52, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 618 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["+", 0, 57, 15, 339, 51, 16, 12, 118, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 118, 17, 131]] | 1 | 579 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 5000
#define INF 10000000
int cake[MAX_N][5]; // num,x1,y1,x2,y2//
int N, H, W, P, S;
int X1, Y1, X2, Y2, pos;
int W1, H1, C1, C2, C3, C4, A, SIS, SIS1, mens, enshu;
vector<int> cake2;
void MEMSET() {
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 5000
#define INF 10000000
int cake[MAX_N][5]; // num,x1,y1,x2,y2//
int N, H, W, P, S;
int X1, Y1, X2, Y2, pos;
int W1, H1, C1, C2, C3, C4, A, SIS, SIS1, mens, enshu;
vector<int> cake2;
void MEMSET() {
for (int i = 0; i < ... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 1,488 | 4 |
#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 repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | #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 repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21]] | 1 | 587 | 7 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool larger(pair<int, int> &a, pair<int, int> &b) {
return a.first * a.second < b.first * b.second;
}
int main() {
while (1) {
int n, w, d;
cin >> n >> w >> d;
if (w == 0)
break;
vector<pair<i... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool larger(pair<int, int> &a, pair<int, int> &b) {
return a.first * a.second < b.first * b.second;
}
int main() {
while (1) {
int n, w, d;
cin >> n >> w >> d;
if (w == 0)
break;
vector<pair<i... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 397 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct cake {
int w, d, p;
cake(int w_, int d_, int p_) {
w = w_;
d = d_;
p = p_;
}
cake() {
w = 0;
d = 0;
p = 0;
}
};
typedef pair<cake, cake> P;
// c := 切ろうとしているケーキ, s := 切る位置
P cut(cake ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct cake {
int w, d, p;
cake(int w_, int d_, int p_) {
w = w_;
d = d_;
p = p_;
}
cake() {
w = 0;
d = 0;
p = 0;
}
};
typedef pair<cake, cake> P;
// c := 切ろうとしているケーキ, s := 切る位置
P cut(cake ... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 545 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | [["-", 12, 2, 3, 4, 0, 16, 31, 118, 119, 120], ["+", 12, 2, 3, 4, 0, 16, 31, 118, 119, 120]] | 1 | 710 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
class Tpair {
public:
int first, second;
Tpair(int x, int y) {
first = x;
second = y;
}
bool operator<(const T... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
class Tpair {
public:
int first, second;
Tpair(int x, int y) {
first = x;
second = y;
}
bool operator<(const T... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 519 | 4 |
#
# 1149: Cut the Cakes
#
loop do
n, w, h = gets.split.map(&:to_i)
break if (n | w | h) == 0
cakes = [[w, h]]
n.times do
pi, si = gets.split.map(&:to_i)
pi -= 1
wi, hi = cakes[pi]
cakes.delete_at(pi)
si %= wi + hi
if si < wi
... | #
# 1149: Cut the Cakes
#
loop do
n, w, h = gets.split.map(&:to_i)
break if (n | w | h) == 0
cakes = [[w, h]]
n.times do
pi, si = gets.split.map(&:to_i)
pi -= 1
wi, hi = cakes[pi]
cakes.delete_at(pi)
si %= wi + hi
if si < wi
... | [["-", 0, 662, 12, 738, 12, 739, 0, 738, 31, 22], ["-", 0, 662, 12, 738, 12, 739, 0, 738, 17, 33], ["+", 0, 662, 12, 738, 12, 739, 0, 738, 17, 33], ["+", 0, 662, 12, 738, 12, 739, 0, 738, 12, 22]] | 4 | 204 | 4 |
/*
AizuOnline A1145
Title The Genome Database of All Space Life
*/
#include <stdio.h>
#include <string.h>
// Global data section
char s[101];
int idx;
int node_ptr;
struct NODE {
int car;
int cdr;
char *genum;
int glen; // mojiretu no nagasa
int blen; // tenkai go no nagasa never .GE. 1000000
int coef; //... | /*
AizuOnline A1145
Title The Genome Database of All Space Life
*/
#include <stdio.h>
#include <string.h>
// Global data section
char s[101];
int idx;
int node_ptr;
struct NODE {
int car;
int cdr;
char *genum;
int glen; // mojiretu no nagasa
int blen; // tenkai go no nagasa never .GE. 1000000
int coef; //... | [["-", 64, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 79]] | 0 | 1,730 | 2 |
#include <bits/stdc++.h>
#define int long long
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i,... | #include <bits/stdc++.h>
#define int long long
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i,... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72]] | 1 | 879 | 2 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, char>;
string S;
int n, it;
int num() {
int res = 0;
while (it < n && isdigit(S[it])) {
res = res * 10 + S[it] - '0';
it++;
}
return res;
}
P parser(int t) {
P res(0, '0');
while (it < n && S[it] != ')') {
if (isdigit(S[it])) {... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, char>;
string S;
int n, it;
int num() {
int res = 0;
while (it < n && isdigit(S[it])) {
res = res * 10 + S[it] - '0';
it++;
}
return res;
}
P parser(int t) {
P res(0, '0');
while (it < n && S[it] != ')') {
if (isdigit(S[it])) {... | [["+", 75, 76, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 75, 76, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 374 | 2 |
#include <iostream>
#include <string>
using namespace std;
string s;
int n;
void calc(string &p, int k) {
// cout << p << " " << k << endl;
if (k >= s.size())
return;
if (p.size() > n)
return;
if (s[k] == ')')
return;
if (s[k] <= 'Z' && s[k] >= 'A') {
p.push_back(s[k]);
calc(p, k + 1);
... | #include <iostream>
#include <string>
using namespace std;
string s;
int n;
void calc(string &p, int k) {
// cout << p << " " << k << endl;
if (k >= s.size())
return;
if (p.size() > n)
return;
if (s[k] == ')')
return;
if (s[k] <= 'Z' && s[k] >= 'A') {
p.push_back(s[k]);
calc(p, k + 1);
... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 488 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 960 | 4 |
#!/usr/bin/ruby
def dfs(s,_l,_r)
r=''
i=_l
n=nil
while i<_r
if ('0'..'9').include?(s[i])
if !n
n=s[i].to_i
else
n=n*10+s[i].to_i
end
i+=1
elsif s[i]=='('
n=1 if !n
cnt=1
j=i+1
while cnt>0
if s[j]=='('
cnt+=1
elsif s[j]==')'
cnt-=1
end
j+=1
end
_r=d... | #!/usr/bin/ruby
def dfs(s,_l,_r)
r=''
i=_l
n=nil
while i<_r
if ('0'..'9').include?(s[i])
if !n
n=s[i].to_i
else
n=n*10+s[i].to_i
end
i+=1
elsif s[i]=='('
n=1 if !n
cnt=1
j=i+1
while cnt>0
if s[j]=='('
cnt+=1
elsif s[j]==')'
cnt-=1
end
j+=1
end
r0=d... | [["-", 0, 121, 75, 759, 64, 749, 0, 662, 31, 22], ["+", 0, 121, 75, 759, 64, 749, 0, 662, 31, 22], ["-", 0, 652, 196, 196, 8, 734, 0, 755, 12, 22], ["+", 0, 652, 196, 196, 8, 734, 0, 755, 12, 22]] | 4 | 239 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String args[]) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
while (true) {
int parson = Integer.parseInt(br.readLine());
... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String args[]) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
while (true) {
int parson = Integer.parseInt(br.readLine());
... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 277 | 2 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String s = reader.readLine();
int n = Integer.parseInt(s);
if (n == 0) {
System.exit(0);
... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
while (true) {
String s = reader.readLine();
int n = Integer.parseInt(s);
if (n == 0) {... | [["+", 8, 498, 0, 195, 8, 196, 0, 52, 0, 89], ["+", 0, 195, 8, 196, 0, 52, 15, 15, 0, 24], ["+", 0, 195, 8, 196, 0, 52, 15, 15, 0, 146], ["+", 0, 195, 8, 196, 0, 52, 15, 15, 0, 25], ["+", 0, 195, 8, 196, 0, 52, 8, 196, 0, 45], ["+", 0, 195, 8, 196, 0, 52, 8, 196, 0, 46]] | 3 | 182 | 6 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
while (n != 0) {
int i = 0;
int[] a = new int[n];
for (i = 0; i <= n - 1; i++) {
int j = s.nextInt();
a[i] = j;
}
int max... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
while (n != 0) {
int i = 0;
int[] a = new int[n];
for (i = 0; i <= n - 1; i++) {
int j = s.nextInt();
a[i] = j;
}
int max... | [["-", 8, 196, 0, 7, 8, 196, 0, 57, 0, 95]] | 3 | 213 | 1 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int sum = 0, maxi = 0, mini = 1000;
for (int i = 0; i < n; i++) {
int a = sc.nextInt();
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int sum = 0, maxi = 0, mini = 1000;
for (int i = 0; i < n; i++) {
int a = sc.nextInt();
... | [["-", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22]] | 3 | 145 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] point = new int[n];
int sum = 0, max = 0, min = 1000;
for (int i = 0; i < n; i++) {
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] point = new int[n];
int sum = 0, max = 0, min = 1000;
for (int i = 0; i < n; i++) {
... | [["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 85], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 31, 22], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 12, 499], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 165 | 6 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int s = 0;
int i = 0;
int n = 0;
int w = 0;
while (w == 0) {
s = sc.nextInt();
if (s == 0) {
break;
}
int a[] = new int[s];
... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int s = 0;
int i = 0;
int n = 0;
int w = 0;
while (w == 0) {
s = sc.nextInt();
if (s == 0) {
break;
}
int[] a = new int[s];
... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 499], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 3 | 189 | 6 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int max = 0;
int min = 1000;
int ten = 0;
for (int i = 0; i < n; i+... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int max = 0;
int min = 1000;
int ten = 0;
for (int i = 0; i < n; i+... | [["-", 8, 196, 0, 7, 8, 196, 0, 57, 0, 95]] | 3 | 164 | 1 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int judge[], i, n, max, min, ave;
Scanner sc = new Scanner(System.in);
while (true) {
n = sc.nextInt();
if (n == 0)
break;
judge = new int[n];
ave = 0;
max = -1;
min = 101;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int judge[], i, n, max, min, ave;
Scanner sc = new Scanner(System.in);
while (true) {
n = sc.nextInt();
if (n == 0)
break;
judge = new int[n];
ave = 0;
max = -1;
min = 1001;
... | [["-", 0, 52, 8, 196, 0, 1, 0, 11, 12, 499], ["+", 0, 52, 8, 196, 0, 1, 0, 11, 12, 499]] | 3 | 181 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String arg[]) {
Scanner in = new Scanner(System.in);
for (;;) {
int n = in.nextInt();
if (n == 0)
return;
boolean a[] = new boolean[300001];
Arrays.fill(a, true);
for (int i = 2... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String arg[]) {
Scanner in = new Scanner(System.in);
for (;;) {
int n = in.nextInt();
if (n == 1)
return;
boolean a[] = new boolean[300001];
Arrays.fill(a, true);
for (int i = 2... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 252 | 2 |
import java.util.Scanner;
public class Main {
static final int N = 300000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int answer;
int[] table = new int[N + 1];
for (int i = 0; i < N; i++)
table[i] = 0;
for (int i = 6; i <= N; i += 7) {
table[i] = ... | import java.util.Scanner;
public class Main {
static final int N = 300000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int answer;
int[] table = new int[N + 1];
for (int i = 0; i < N; i++)
table[i] = 0;
for (int i = 6; i <= N; i += 7) {
table[i] = ... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 255 | 2 |
#include <math.h>
#include <stdio.h>
#define MAX 300000
int main() {
int i, j;
int n;
int board[MAX + 1];
for (i = 0; i < MAX; i++) {
board[i] = (i % 7 == 1 || i % 7 == 6);
}
board[1] = 0;
j = 6;
while (j < MAX) {
for (i = 2 * j; i < MAX; i++)
board[i] = 0;
j++;
while (!board[j]... | #include <stdio.h>
#include <math.h>
#define MAX 300000
int main() {
int i, j;
int n;
int board[MAX + 1];
for (i = 0; i < MAX; i++) {
board[i] = (i % 7 == 1 || i % 7 == 6);
}
board[1] = 0;
j = 6;
while (j < MAX) {
for (i = 2 * j; i < MAX; i += j)
board[i] = 0;
j++;
wh... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 11, 17, 107], ["+", 0, 52, 8, 9, 0, 7, 26, 11, 12, 22], ["-"... | 0 | 218 | 9 |
#include <math.h>
#include <stdio.h>
int main(void) {
int tg, i, j, n, l[300001] = {0}, c = 0;
for (i = 2; i < 300001; i++) {
if (i % 7 == 1 | i % 7 == 6) {
l[c] = i;
c++;
}
}
for (i = 0; i < (int)(sqrt(c)); i++) {
if (!l[i]) {
continue;
}
for (j = i + 1; j < c; j++) {
... | #include <math.h>
#include <stdio.h>
int main(void) {
int tg, i, j, n, l[300001] = {0}, c = 0;
for (i = 2; i < 300001; i++) {
if (i % 7 == 1 | i % 7 == 6) {
l[c] = i;
c++;
}
}
for (i = 0; i < (int)(sqrt(c)); i++) {
if (!l[i]) {
continue;
}
for (j = i + 1; j < c; j++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 242 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 300000;
vector<int> msprimes;
bool isprime[MAXN + 1];
void seive() {
for (int i = 0; i <= MAXN; i++)
isprime[i] = true;
isprime[0] = isprime[1] = false;
for (int i = 2; i <= MAXN; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 300000;
vector<int> msprimes;
bool isprime[MAXN + 1];
void seive() {
for (int i = 0; i <= MAXN; i++)
isprime[i] = true;
isprime[0] = isprime[1] = false;
for (int i = 2; i <= MAXN; i++) {
if... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 90], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 264 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, b) for (int i = 0; i < b; i++)
using namespace std;
bool smp[300001... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, b) for (int i = 0; i < b; i++)
using namespace std;
bool smp[300001... | [["-", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 0, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 0, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 205 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 300010;
vector<int> primes;
void sieve() {
vector<bool> is_prime(N_MAX, true);
int cnt = 1;
while (true) {
for (int i = -1; i <= 2; i += 2) {
int x = cnt * 7 + i;
if (is_prime[x]) {
for (int j = 2 * x; j < N_MAX; j += x)
... | #include <bits/stdc++.h>
using namespace std;
const int N_MAX = 300010;
vector<int> primes;
void sieve() {
vector<bool> is_prime(N_MAX, true);
int cnt = 1;
while (true) {
for (int i = -1; i <= 2; i += 2) {
int x = cnt * 7 + i;
if (is_prime[x]) {
for (int j = 2 * x; j < N_MAX; j += x)
... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 192 | 4 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 13]] | 1 | 315 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
bool G[300000] = {};
int main() {
for (int i = 8; i <= 300000; i += 7) {
G[i] = true;
for (int j = 6; j * j <= i; j += 7) {
if (i % (j) == 0 || i % (j + 2) == 0) {
G[i] = false;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
bool G[300000] = {};
int main() {
for (int i = 8; i <= 300000; i += 7) {
G[i] = true;
for (int j = 6; j * j <= i; j += 7) {
if (i % (j) == 0 || i % (j + 2) == 0) {
G[i] = false;
... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 296 | 4 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
#define FOR(i, init, n) for (int i = init; i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define MON 1
#define SAT 6
int isPrime(int cand) {
// int i, limit;
int limit = sqrt(cand);
// limit = (int)sqrt((double)cand);
int i = limit... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
#define FOR(i, init, n) for (int i = init; i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define MON 1
#define SAT 6
int isPrime(int cand) {
// int i, limit;
int limit = sqrt(cand);
// limit = (int)sqrt((double)cand);
int i = limit... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 380 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i... |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 292 | 2 |
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, x, y) for (int(i) = (x); (i) < (y); (i)++)
int main() {
while (true) {
vector<int> temp;
rep(i, 0, 300001) { temp.push_back(i); }
int n;
cin >> n;
if (n == 1) {
break;
}
cout << n << ":";
rep(i, 6, 30... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, x, y) for (int(i) = (x); (i) < (y); (i)++)
int main() {
while (true) {
vector<int> temp;
rep(i, 0, 300001) { temp.push_back(i); }
int n;
cin >> n;
if (n == 1) {
break;
}
cout << n << ":";
rep(i, 6, 30... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 176 | 4 |
// #define USE_CPP11
// #define USE_PRINTF
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#in... | // #define USE_CPP11
// #define USE_PRINTF
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#in... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 687 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
const int MAX = 300200;
int p[MAX];
int q[MAX];
int l = 0;
void prime() {
int n = 0;
for (int i = 6; i < MAX; i++) {
bool flag = 1;
if (i % 7 == 1 || i % 7 == 6) {
q[n] = i;
for (int j = 0; q[j] < sqrt(i); j++) {
if (i % q[j] ... | #include <cmath>
#include <iostream>
using namespace std;
const int MAX = 300200;
int p[MAX];
int q[MAX];
int l = 0;
void prime() {
int n = 0;
for (int i = 6; i < MAX; i++) {
bool flag = 1;
if (i % 7 == 1 || i % 7 == 6) {
q[n] = i;
for (int j = 0; q[j] < i; j++) {
if (i % q[j] == 0) ... | [["-", 64, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["-", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["-", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]] | 1 | 232 | 3 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 519 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.