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
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 1,019 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <complex>
#include <utility>
//#inclu... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <complex>
#include <utility>
//#inclu... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 555 | 2 |
#include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 7,536 | 2 |
#ifndef _WIN32
#include <iostream>
#endif
#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); ... | #ifndef _WIN32
#include <iostream>
#endif
#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); ... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 1,368 | 2 |
#include <bits/stdc++.h>
#define N 800
using namespace std;
typedef pair<int, int> P;
int n, p[N], d, a, b, c, maxc;
bool used[N];
vector<P> e[N];
void delnode(int x, int sum) {
used[x] = true;
for (int i = 0; i < e[x].size(); i++) {
int nx = e[x][i].first;
if (used[nx])
continue;
if (e[nx].size(... | #include <bits/stdc++.h>
#define N 800
using namespace std;
typedef pair<int, int> P;
int n, p[N], d, a, b, c, maxc;
bool used[N];
vector<P> e[N];
void delnode(int x, int sum) {
used[x] = true;
for (int i = 0; i < e[x].size(); i++) {
int nx = e[x][i].first;
if (used[nx])
continue;
if (e[nx].size(... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117]] | 1 | 413 | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, ll>;
vector<P> G[800];
int used[800];
P dfs(int n) {
used[n] = 1;
int id = n;
ll ma = 0;
for (auto to : G[n]) {
if (G[to.first].size() == 1 || used[to.first])
continue;
auto p = dfs(to.first);
if (p.secon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, ll>;
vector<P> G[800];
int used[800];
P dfs(int n) {
used[n] = 1;
int id = n;
ll ma = 0;
for (auto to : G[n]) {
if (G[to.first].size() == 1 || used[to.first])
continue;
auto p = dfs(to.first);
if (p.secon... | [["-", 64, 9, 0, 1, 0, 11, 12, 118, 28, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 118, 28, 22]] | 1 | 464 | 2 |
require 'set'
require 'matrix'
include Math
class Circle
def initialize(*args)
@id, @x, @y, @r = args
end
def cross?(other)
(@x - other.x) ** 2 + (@y - other.y) ** 2 < (@r + other.r) ** 2
end
def include?(x, y)
(@x - x) ** 2 + (@y - y) **2 < @r ** 2
end
def inspect
@id
end
attr_reader :id, :x, :y,... | require 'set'
require 'matrix'
include Math
class Circle
def initialize(*args)
@id, @x, @y, @r = args
end
def cross?(other)
(@x - other.x) ** 2 + (@y - other.y) ** 2 < (@r + other.r) ** 2
end
def include?(x, y)
(@x - x) ** 2 + (@y - y) **2 < @r ** 2
end
def inspect
@id
end
attr_reader :id, :x, :y,... | [["-", 64, 749, 0, 662, 31, 742, 0, 516, 0, 753], ["+", 64, 749, 0, 662, 31, 742, 0, 516, 0, 753], ["-", 75, 95, 0, 662, 31, 742, 0, 516, 0, 753], ["+", 75, 95, 0, 662, 31, 742, 0, 516, 0, 753]] | 4 | 1,011 | 4 |
// 50000 for aizu0056
// 1000000 for aizu0185
#define M 32769
p[M + 1];
int main(n, i, j) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n;) {
int i = 2, s = 0;
for (; i <= n / 2; i++) {
if (p[i])
continue;
... | // 50000 for aizu0056
// 1000000 for aizu0185
#define M 32769
p[M + 1];
int main(i, j, n) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n;) {
int i = 2, s = 0;
for (; i <= n / 2; i++) {
if (p[i])
continue;
... | [["-", 0, 30, 0, 14, 49, 53, 54, 55, 0, 22], ["-", 0, 30, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 0, 30, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 0, 30, 0, 14, 49, 53, 54, 55, 0, 22]] | 0 | 149 | 4 |
// 50000 for aizu0056
// 1000000 for aizu0185
#define M 32769
p[M + 1];
main(n, i, j) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n;) {
for (i = 2, j = 0; i <= n / 2; i++) {
if (!p[i])
continue;
if (!p[n - i... | // 50000 for aizu0056
// 1000000 for aizu0185
#define M 32769
p[M + 1];
int main(i, j, n) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n;) {
for (i = 2, j = 0; i <= n / 2; i++) {
if (p[i])
continue;
if (!p[n... | [["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 30, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 0, 30, 0, 14, 49, 53, 54, 55, 0, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 8, 9, 0, 57, 15, 23, 0, 91, 17, 111]] | 0 | 148 | 12 |
// 50000 for aizu0056
// 1000000 for aizu0185
#define M 32769
p[M + 1];
main(n, i, j) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n; printf("%d\n", j))
for (i = 2, j = 0; i <= n / 2; i++)
if (!p[i] && !p[n - i])
j... | // 50000 for aizu0056
// 1000000 for aizu0185
#define M 32768
p[M + 1];
main(i, j, n) {
p[1] = 1;
for (; i <= M; i++)
if (!p[i])
for (j = i * 2; j <= M; j += i)
p[j] = 1;
for (; scanf("%d", &n), n; printf("%d\n", j))
for (i = 2, j = 0; i <= n / 2; i++)
if (!p[i] && !p[n - i])
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 137 | 6 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int pre[33000];
memset(pre, 0, sizeof(pre));
for (int i = 2; i < 33000; i++) {
for (int j = 2; j * i < 33000; j++) {
pre[i * j] = 1;
}
}
int n;
while (cin >> n) {
int c = 0;
for (int i = 2; i <= n / 2; i++) {
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int pre[33000];
memset(pre, 0, sizeof(pre));
for (int i = 2; i < 33000; i++) {
for (int j = 2; j * i < 33000; j++) {
pre[i * j] = 1;
}
}
int n;
while (cin >> n, n) {
int c = 0;
for (int i = 2; i <= n / 2; i++) {... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 138 | 2 |
#include <set>
#include <stdio.h>
#include <vector>
#define MYSCAN scanf
int primejudg(int num);
std::vector<int> prime_v;
std::set<int> prime_s;
int prime_size;
int main(void) {
int max = 0;
int i, n, count;
prime_s.insert(2);
prime_s.insert(3);
prime_v.push_back(2);
prime_v.push_back(3);
prime_siz... | #include <set>
#include <stdio.h>
#include <vector>
#define MYSCAN scanf
int primejudg(int num);
std::vector<int> prime_v;
std::set<int> prime_s;
int prime_size;
int main(void) {
int max = 0;
int i, n, count;
prime_s.insert(2);
prime_s.insert(3);
prime_v.push_back(2);
prime_v.push_back(3);
prime_siz... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 18], ["-", 0, 7, 15, 16, 31, 16, 12, 16, 17, 85], ["-", 0, 7, 15, 16, 31, 16, 12, 16, 12, 13]] | 1 | 276 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define RREP(i, n) for (i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define RREP(i, n) for (i... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 215 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
bool b[33000];
int main() {
fill(b, b + 33000, true);
b[0] = false;
b[1] = false;
for (int i = 2; i < 33000; i++) {
if (b[i]) {
int j = 2;
while (i * j < 33000) {
b[i * j] = false;
j++;
}
}
}... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
bool b[33000];
int main() {
fill(b, b + 33000, true);
b[0] = false;
b[1] = false;
for (int i = 2; i < 33000; i++) {
if (b[i]) {
int j = 2;
while (i * j < 33000) {
b[i * j] = false;
j++;
}
}
}... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 162 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
bool p[1000100];
void erato() {
fill(p, p + 1000100, true);
p[0] = p[1] = false;
for (int i = 0; i < 1000100; i++) {
if (!p[i])
continue;
for (int j = i + i; j < 1000100; j += i) {
p[j] = false;
}
}
}
int main() {
erato(... | #include <algorithm>
#include <iostream>
using namespace std;
bool p[1000100];
void erato() {
fill(p, p + 1000100, true);
p[0] = p[1] = false;
for (int i = 0; i < 1000100; i++) {
if (!p[i])
continue;
for (int j = i + i; j < 1000100; j += i) {
p[j] = false;
}
}
}
int main() {
erato(... | [["+", 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 | 181 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
const double EPS = 1e-10;
int r, n, xl[20], xr[20], h[20];
int right[20], left[20]; // right:(i, i+1) left:(-i-1, -i)
bool ok(double height) {
for (int i = 0; i < r; i++) {
double temp = sqrt(r * r - i * i) + height;
if (temp - (d... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
const double EPS = 1e-10;
int r, n, xl[20], xr[20], h[20];
int right[20], left[20]; // right:(i, i+1) left:(-i-1, -i)
bool ok(double height) {
for (int i = 0; i < r; i++) {
double temp = sqrt(r * r - i * i) + height;
if (temp - (d... | [["-", 8, 9, 0, 43, 49, 50, 51, 74, 0, 24], ["-", 0, 43, 49, 50, 51, 74, 39, 77, 39, 40], ["-", 8, 9, 0, 43, 49, 50, 51, 74, 0, 25], ["-", 8, 9, 0, 43, 49, 50, 51, 74, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 478 | 5 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, ... | [["-", 28, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["-", 63, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 28, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 63, 118, 28, 69, 341, 342, 0, 16, 17, 72]] | 1 | 520 | 4 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 364 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["-", 0, 9, 0, 1, 0, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 707 | 6 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 521 | 2 |
#include <algorithm>
#include <climits>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define d... | #include <algorithm>
#include <climits>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define d... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 481 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
while (cin >> s, s[0] != '#') {
vector<string> res;
for (int i = 0; i < (1 << s.size()); i++) {
string p = s;
bool flg = true;
bool found[26] = {0};
found[0] = tr... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
while (cin >> s, s[0] != '#') {
vector<string> res;
for (int i = 0; i < (1 << s.size()); i++) {
string p = s;
bool flg = true;
bool found[26] = {0};
found[0] = tr... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13]] | 1 | 362 | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<string> ans;
string Str, str;
bool check() {
bool alph[300] = {};
alph['a'] = 1;
for (int i = 0; i < str.size(); i++) {
int flg = 0;
if (!alph[str[i]])
flg = alph[str[i]] = 1;
if (str[i] - flg != Str[i])
return 0;
}
return 1;
}
boo... | #include <bits/stdc++.h>
using namespace std;
vector<string> ans;
string Str, str;
bool check() {
bool alph[300] = {};
alph['a'] = 1;
for (int i = 0; i < str.size(); i++) {
int flg = 0;
if (!alph[str[i]])
flg = alph[str[i]] = 1;
if (str[i] - flg != Str[i])
return 0;
}
return 1;
}
boo... | [["+", 51, 91, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 91, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 398 | 35 |
#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 = (a)-1; i >= b; i--)
#define all(... | #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 = (a)-1; i >= b; i--)
#define all(... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 628 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define tree_valtype int
typedef struct tree_edge_sub tree_edge;
typedef struct {
int num;
int nearnum;
tree_edge *near;
} tree_vertex_sub;
struct tree_edge_sub {
tree_vertex_sub *v;
int w;
tree_edge *next;
};
typedef struct tree_v_sub tree_vertex;
struct tree_v_s... | #include <stdio.h>
#include <stdlib.h>
#define tree_valtype int
typedef struct tree_edge_sub tree_edge;
typedef struct {
int num;
int nearnum;
tree_edge *near;
} tree_vertex_sub;
struct tree_edge_sub {
tree_vertex_sub *v;
int w;
tree_edge *next;
};
typedef struct tree_v_sub tree_vertex;
struct tree_v_s... | [["-", 49, 50, 51, 118, 28, 69, 28, 118, 119, 120], ["+", 49, 50, 51, 118, 28, 69, 28, 118, 119, 120], ["-", 0, 11, 12, 118, 28, 69, 28, 118, 119, 120], ["+", 0, 11, 12, 118, 28, 69, 28, 118, 119, 120]] | 0 | 1,418 | 4 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#pragma warning(disable : 4996)
#define INF (1 << 29)
using namespace std;
int main() {
int n, sum;
while (true) {
scanf("%d", &n);
sum = 0;
if (n == 0)
break;
vector<int> p(n - 1);
vec... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#pragma warning(disable : 4996)
#define INF (1 << 29)
using namespace std;
int main() {
int n, sum;
while (true) {
scanf("%d", &n);
sum = 0;
if (n == 0)
break;
vector<int> p(n - 1);
vec... | [["-", 3, 4, 0, 16, 31, 16, 12, 16, 17, 48], ["-", 3, 4, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 683 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
struct Box {
double x, y, r;
};
const double EPS = 1e-9;
void solve(int n) {
vector<double> h, w;
vector<Box> vb;
for_(i, 0, n) {
double x, y, r;
cin >> x >> y >> r;
vb.push_back(Box{x, y, r});
... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
struct Box {
double x, y, r;
};
const double EPS = 1e-9;
void solve(int n) {
vector<double> h, w;
vector<Box> vb;
for_(i, 0, n) {
double x, y, r;
cin >> x >> y >> r;
vb.push_back(Box{x, y, r});
... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 438 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, tc = 1;
while (cin >> N, N) {
vector<double> X1(N), Y1(N), X2(N), Y2(N);
vector<double> xs, ys;
for (int i = 0; i < N; i++) {
double x, y, r;
cin >> x >> y >> r;
X1[i] = x - r;
Y1[i] = y - r;
X2[i] = x + r;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, tc = 1;
while (cin >> N, N) {
vector<double> X1(N), Y1(N), X2(N), Y2(N);
vector<double> xs, ys;
for (int i = 0; i < N; i++) {
double x, y, r;
cin >> x >> y >> r;
X1[i] = x - r;
Y1[i] = y - r;
X2[i] = x + r;... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 431 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 548 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
int t = 0;
while (cin >> n, n) {
t++;
double x[101], y[101], r[101];
vector<double> X, Y;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> r[i];
X.push_back(x[i] - r[i]);
X.push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
int t = 0;
while (cin >> n, n) {
t++;
double x[101], y[101], r[101];
vector<double> X, Y;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> r[i];
X.push_back(x[i] - r[i]);
X.push_bac... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 624 | 4 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
struct Point {
double x;
double y;
Point(double x, double y) : x(x), y(y) {}
Point() : x(0), y(0) {}
};
struct Rectangle {
Point topLeft;
Point bottomRight;
Rectang... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
struct Point {
double x;
double y;
Point(double x, double y) : x(x), y(y) {}
Point() : x(0), y(0) {}
};
struct Rectangle {
Point topLeft;
Point bottomRight;
Rectang... | [["-", 0, 56, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 56, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 674 | 6 |
import java.awt.geom.*;
import java.util.*;
public class Main {
// 0033 cording start
// 0047 cording end
// 0118 sample matched
private void doit() {
Scanner sc = new Scanner(System.in);
while (true) {
int p = sc.nextInt();
int n = sc.nextInt();
if ((p | n) == 0)
break;
... | import java.awt.geom.*;
import java.util.*;
public class Main {
// 0033 cording start
// 0047 cording end
// 0118 sample matched
// 0119 WA * 2
private void doit() {
Scanner sc = new Scanner(System.in);
while (true) {
int p = sc.nextInt();
int n = sc.nextInt();
if ((p | n) == 0)
... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 19]] | 3 | 294 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
double mysqrt(double x) {
double l = 0, r = x;
for (int i = 0; i < 64; i++) {
double m = (l + r) / 2.0;
if (m * m < x) {
l = m;
} else {
r = m;
}
}
return l;
}
int main() {
int p, n;
while (cin >> p >> n, n) {
do... | #include <algorithm>
#include <iostream>
using namespace std;
double mysqrt(double x) {
double l = 0, r = x;
for (int i = 0; i < 64; i++) {
double m = (l + r) / 2.0;
if (m * m < x) {
l = m;
} else {
r = m;
}
}
return l;
}
int main() {
int p, n;
while (cin >> p >> n, n) {
do... | [["+", 49, 50, 51, 16, 31, 23, 0, 16, 17, 72], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["-", 49, 50, 51, 16, 31, 23, 0, 16, 17, 72], ["-", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13]] | 1 | 355 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 51, 16, 31, 16, 12, 16, 31, 16, 31, 22]] | 1 | 617 | 4 |
#include <cassert>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
const double eps = 1e-11;
bool eq(double a, double b) { return abs(b - a) < eps; }
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
const double inf = 1e30;
int main() {
int p, n;
while (c... | #include <cassert>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
const double eps = 1e-11;
bool eq(double a, double b) { return abs(b - a) < eps; }
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
const double inf = 1e30;
int main() {
int p, n;
while (c... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 425 | 6 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define kane 17
const int m[kane] = {1, 4, 9, 16, 25, 36, 49, 64, 81,
100, 111, 144, 169, 196, 225, 256, 289};
int cnt = 0;
int search(int num) {
int maxx;
if (num == 0 || num == 1) {
return 0;
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define kane 17
const int m[kane] = {1, 4, 9, 16, 25, 36, 49, 64, 81,
100, 121, 144, 169, 196, 225, 256, 289};
int cnt = 0;
int search(int num) {
int maxx;
if (num == 0 || num == 1) {
return 0;
}
... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 227 | 2 |
#include <stdio.h>
int n, dp[301][18];
int main() {
while (~scanf("%d", &n), n) {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 17; j++)
dp[i][j] = 0;
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j * j <= n; j++) {
for (int k = 0; k <= j; k++)
... | #include <stdio.h>
int n;
long long dp[301][18];
int main() {
while (~scanf("%d", &n), n) {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 17; j++)
dp[i][j] = 0;
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j * j <= i; j++) {
for (int k = 0; k <= j; k... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 197 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setpreci... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setpreci... | [["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13]] | 1 | 422 | 2 |
#include <iostream>
using namespace std;
#define KMAX 17
#define VMAX 300
static const int K[17] = {1, 4, 9, 16, 25, 36, 49, 64, 81,
100, 121, 144, 169, 196, 225, 256, 289};
int T[KMAX][VMAX + 1];
main() {
for (int j = 0; j <= VMAX; j++)
T[0][j] = 1;
for (int i = 0; i < KMA... | #include <iostream>
using namespace std;
#define KMAX 17
#define VMAX 300
static const int K[17] = {1, 4, 9, 16, 25, 36, 49, 64, 81,
100, 121, 144, 169, 196, 225, 256, 289};
int T[KMAX][VMAX + 1];
main() {
for (int j = 0; j <= VMAX; j++)
T[0][j] = 1;
for (int i = 0; i < KMA... | [["-", 8, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["-", 8, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 52, 8, 1, 0, 16, 17, 151]] | 1 | 250 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int dp[301][18];
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i <= n; i++)
dp[i][1] = dp[i][0] = 1;
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int dp[301][18];
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i <= n; i++)
dp[i][1] = dp[i][0] = 1;
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 | 180 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int dp[301];
void solve() {
vector<int> square;
for (int i = 1; i * i <= 300; ++i) {
square.push_back(i * i);
}
dp[0] = 1;
for (int i = 0; i < square.size(); ++i) {
for (int ii = square[i]; ii <= 300; ++ii) {
dp[ii] += dp[ii - square[i... | #include <iostream>
#include <vector>
using namespace std;
int dp[301];
void solve() {
vector<int> square;
for (int i = 1; i * i <= 300; ++i) {
square.push_back(i * i);
}
dp[0] = 1;
for (int i = 0; i < square.size(); ++i) {
for (int ii = square[i]; ii <= 300; ++ii) {
dp[ii] += dp[ii - square[i... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 149 | 2 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [["-", 0, 52, 8, 9, 0, 1, 0, 34, 0, 21], ["+", 8, 9, 0, 1, 0, 11, 31, 118, 17, 131], ["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 52, 0, 89], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 27, 17, 68]] | 1 | 422 | 7 |
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-7;
typedef complex<double> P;
typedef vector<P> G;
double cross(P a, P b) { return imag(conj(a) * b); }
// 多角形gの面積を求める
double polygonArea(G g) {
double res = 0.0;
for (int i = 0; i < g.size(); i++)
res += cro... | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-7;
typedef complex<double> P;
typedef vector<P> G;
double cross(P a, P b) { return imag(conj(a) * b); }
// 多角形gの面積を求める
double polygonArea(G g) {
double res = 0.0;
for (int i = 0; i < g.size(); i++)
res += cro... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 493 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define... | [["-", 8, 9, 0, 43, 49, 50, 51, 11, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 11, 12, 13]] | 1 | 4,061 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define _A_ true
#define EPS 1e-10
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
using namespace std;
c... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define _A_ true
#define EPS 1e-10
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
using namespace std;
c... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 1,297 | 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... | [["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 552 | 4 |
#include <math.h>
#include <stdio.h>
int main(void) {
int data_num, cur_data;
double qr, rp, pq;
int n, i;
int p, q, r;
int ap, aq, ar;
double x[30];
double y[30];
double z[30];
double nqr, nrp, npq;
scanf("%d", &data_num);
for (cur_data = 0; cur_data < data_num; cur_data++) {
scanf("%lf%lf%l... | #include <math.h>
#include <stdio.h>
int main(void) {
int data_num, cur_data;
double qr, rp, pq;
int n, i;
int p, q, r;
int ap, aq, ar;
double x[30];
double y[30];
double z[30];
double nqr, nrp, npq;
scanf("%d", &data_num);
for (cur_data = 0; cur_data < data_num; cur_data++) {
scanf("%lf%lf%l... | [["-", 15, 23, 0, 16, 31, 16, 31, 16, 12, 13], ["+", 15, 23, 0, 16, 31, 16, 31, 16, 12, 13], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 538 | 6 |
#include <bits/stdc++.h>
using namespace std;
struct P {
double x, y, z;
P() : x(0), y(0), z(0) {}
P(double x, double y, double z) : x(x), y(y), z(z) {}
P operator+(const P &b) const {
P res;
res.x = x + b.x;
res.y = y + b.y;
res.z = z + b.z;
return res;
}
P operator-(const P &b) const ... | #include <bits/stdc++.h>
using namespace std;
struct P {
double x, y, z;
P() : x(0), y(0), z(0) {}
P(double x, double y, double z) : x(x), y(y), z(z) {}
P operator+(const P &b) const {
P res;
res.x = x + b.x;
res.y = y + b.y;
res.z = z + b.z;
return res;
}
P operator-(const P &b) const ... | [["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 37, 0, 16, 31, 16, 12, 2, 63, 22], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13]] | 1 | 819 | 5 |
#include <bits/stdc++.h>
using namespace std;
double x[31], y[31], z[31];
double g(int i, int j) {
double X = x[i] - x[j], Y = y[i] - y[j], Z = z[i] - z[j];
return sqrt(X * X + Y * Y + Z * Z);
}
int main() {
int m, n, a1, a2, a3;
cin >> m;
while (m--) {
double Q, R, P;
cin >> Q >> R >> P;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
double x[31], y[31], z[31];
double g(int i, int j) {
double X = x[i] - x[j], Y = y[i] - y[j], Z = z[i] - z[j];
return sqrt(X * X + Y * Y + Z * Z);
}
int main() {
int m, n, a1, a2, a3;
cin >> m;
while (m--) {
double Q, R, P;
cin >> Q >> R >> P;
cin >> n... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 97, 128, 129], ["+", 8, 9, 0, 52, 8, 9, 0, 97, 0, 102], ["+", 0, 52, 8, 9, 0, 97, 0, 1, 0, 35], ["-", 0... | 1 | 302 | 11 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["+", 0, 1, 0, 11, 12, 16, 31, 2, 63, 22], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 21], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25]] | 1 | 422 | 5 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
const ld pi = acos(-1.0);
ld solve(int N, int M, vector<ld> ps) {
vector<vector<vector<ld>>> dp(N + 1,
vector<ve... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
const ld pi = acos(-1.0);
ld solve(int N, int M, vector<ld> ps) {
vector<vector<vector<ld>>> dp(N + 1,
vector<ve... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 485 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
double dp[40][40][40];
double p[40];
int main() {
double pi = acos(-1.0);
int n, m;
double x;
while (scanf("%d%d", &n, &m), n != 0) {
fill(**dp, **dp + sizeof(dp) / sizeof(double), 0.0);
for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
double dp[40][40][40];
double p[40];
int main() {
double pi = acos(-1.0);
int n, m;
double x;
while (scanf("%d%d", &n, &m), n != 0) {
fill(**dp, **dp + sizeof(dp) / sizeof(double), -1e300);
for (int i = 0;... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 392 | 2 |
i, table[151201];
main(j, n) {
for (; i < 54; i++)
for (j = 0; j < 54; j++)
if ((n = i * i * i + j * (j + 1) * (j + 2) / 6) < 151201)
table[n] = 1;
for (; scanf("%d", &n), n; printf("%d\n", n))
while (!table[n])
n--;
return 0;
} | i, table[151201];
main(j, n) {
for (; i < 54; i++)
for (j = 0; j < 97; j++)
if ((n = i * i * i + j * (j + 1) * (j + 2) / 6) < 151201)
table[n] = 1;
for (; scanf("%d", &n), n; printf("%d\n", n))
while (!table[n])
n--;
return 0;
} | [["-", 0, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 0, 9, 0, 7, 8, 7, 15, 16, 12, 13]] | 0 | 115 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int solve(int x) {
int ret = 0;
for (int i = 1; i * i * i <= x; i++) {
int l = 0, r = 100;
while (r - l > 1) {
int m = (l + r) / 2;
int res = m * (m + 1) * (m + 2) / 6;
if (res + i * i * i <= x)
l = m;
else
... | #include <algorithm>
#include <iostream>
using namespace std;
int solve(int x) {
int ret = 0;
for (int i = 0; i * i * i <= x; i++) {
int l = 0, r = 100;
while (r - l > 1) {
int m = (l + r) / 2;
int res = m * (m + 1) * (m + 2) / 6;
if (res + i * i * i <= x)
l = m;
else
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 172 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int ans = 0;
for (int i = 0; i * i * i < n; i++) {
int x = n - i * i * i;
for (int j = 0; j < x; j++) {
if (j * (j + 1) * (j + 2) / 6 > x)
break;
if (x >= j * (j + 1) * (j + 2) / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int ans = 0;
for (int i = 0; i * i * i <= n; i++) {
int x = n - i * i * i;
for (int j = 0; j <= x; j++) {
if (j * (j + 1) * (j + 2) / 6 > x)
break;
if (x >= j * (j + 1) * (j + 2) ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 157 | 4 |
while True:
n = eval(input())
if n == 0: break
ans = 0
for i in range(96):
tri = i*(i+1)*(i+2)/6
if tri > n: break
ans = max(ans,int((n-tri)**(1.0/3))**3 + tri)
print(ans) | while True:
n = eval(input())
if n == 0: break
ans = 0
for i in range(96):
tri = i*(i+1)*(i+2)/6
if tri > n: break
ans = max(ans,int((n-tri)**(1.0/3)+1e-8)**3 + tri)
print(ans) | [["+", 31, 657, 31, 652, 3, 4, 0, 657, 17, 72], ["+", 31, 657, 31, 652, 3, 4, 0, 657, 12, 531]] | 5 | 80 | 16 |
// AOJ 1225: e-market
// 2017.10.25 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASHSIZ 2003
typedef struct {
char *s;
int id;
} HASH;
HASH hash[HASHSIZ + 2], *hashend = hash + HASHSIZ; // Hash table
int lookup(char *s, int id) {
int w = strlen(s);
int i = (101 * *s + 103 * *(... | // AOJ 1225: e-market
// 2017.10.25 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASHSIZ 2003
typedef struct {
char *s;
int id;
} HASH;
HASH hash[HASHSIZ + 2], *hashend = hash + HASHSIZ; // Hash table
int lookup(char *s, int id) {
int w = strlen(s);
int i = (101 * *s + 103 * *(... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47]] | 0 | 1,010 | 6 |
#include <algorithm>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
char in[110];
int h[1100];
int g[1100];
int type[1100];
int v[1100];
int s[1100];
int sum[1100];
int L[1100];
int R[1100];
int t[1100];
int u[1100];
int c[1100];
int main() {
int a;
while (scanf("%d", &a), a) {
map<str... | #include <algorithm>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
char in[110];
int h[1100];
int g[1100];
int type[1100];
int v[1100];
int s[1100];
int sum[1100];
int L[1100];
int R[1100];
int t[1100];
int u[1100];
int c[1100];
int main() {
int a;
while (scanf("%d", &a), a) {
map<str... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 12, 22]] | 1 | 1,024 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int MAXN = 1005;
const int INF = 1 << 28;
int N;
bool used[MAXN];
string name[MAXN];
bool sell[MAXN];
string mono[MAXN];
int price[MAXN];
map<string, int> low, high, sum, num;
map<string, int> B, S;
int main() {
wh... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int MAXN = 1005;
const int INF = 1 << 28;
int N;
bool used[MAXN];
string name[MAXN];
bool sell[MAXN];
string mono[MAXN];
int price[MAXN];
map<string, int> low, high, sum, num;
map<string, int> B, S;
int main() {
wh... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 778 | 2 |
// AOJ 1226: Fishnet
// 2017.10.14 bal4u@uu
#include <math.h>
#include <stdio.h>
typedef struct {
double x, y;
} PP;
PP tbl[35][35];
double a[4][35];
void intersection(PP *p, PP *p1, PP *p2, PP *p3, PP *p4) {
double bo, ua;
bo = (p4->y - p3->y) * (p2->x - p1->x) - (p4->x - p3->x) * (p2->y - p1->y);
ua = (p4-... | // AOJ 1226: Fishnet
// 2017.10.14 bal4u@uu
#include <math.h>
#include <stdio.h>
typedef struct {
double x, y;
} PP;
PP tbl[35][35];
double a[4][35];
void intersection(PP *p, PP *p1, PP *p2, PP *p3, PP *p4) {
double bo, ua;
bo = (p4->y - p3->y) * (p2->x - p1->x) - (p4->x - p3->x) * (p2->y - p1->y);
ua = (p4-... | [["-", 31, 11, 31, 118, 28, 69, 28, 69, 71, 13], ["+", 31, 11, 31, 118, 28, 69, 28, 69, 71, 22], ["-", 0, 34, 31, 11, 31, 118, 28, 69, 71, 22], ["+", 0, 34, 31, 11, 31, 118, 28, 69, 71, 13], ["-", 12, 11, 31, 118, 28, 69, 28, 69, 71, 13], ["+", 12, 11, 31, 118, 28, 69, 28, 69, 71, 22], ["-", 0, 34, 12, 11, 31, 118, 28,... | 0 | 827 | 8 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class state {
public:
int n;
string str;
state() : n(0), str("") {}
};
bool word(char n, char c) {
return (n == '2' && (c == 'a' || c == 'b' || c == 'c') ||
n == '3' && (c == 'd' || c == 'e' || c == 'f')... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class state {
public:
int n;
string str;
state() : n(0), str("") {}
};
bool word(char n, char c) {
return (n == '2' && (c == 'a' || c == 'b' || c == 'c') ||
n == '3' && (c == 'd' || c == 'e' || c == 'f')... | [["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 57, 64, 1, 0, 16, 17, 151]] | 1 | 547 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(C) (C).begin(), (C).end()
#define pb push_back
#define mp make_pair
const int N = 100;
const int inf = (1 << 28);
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(C) (C).begin(), (C).end()
#define pb push_back
#define mp make_pair
const int N = 100;
const int inf = (1 << 28);
... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 17, 152], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 1,414 | 4 |
#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... | #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, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 904 | 2 |
N, i, M;
double X[30], Y[30], Z[30], cx, cy, cz, d, m;
#define Q(x) (x) * (x)
double D(i) { return sqrt(Q(X[i] - cx) + Q(Y[i] - cy) + Q(Z[i] - cz)); }
int L() {
for (m = i = 0; i < N; i++)
if (D(i) > m)
m = D(i), M = i;
return M;
}
main(t) {
for (; scanf("%d", &N), N; printf("%.f\n", D(L()))) {
for ... | N, i, M;
double X[30], Y[30], Z[30], cx, cy, cz, d, m;
#define Q(x) (x) * (x)
double D(i) { return sqrt(Q(X[i] - cx) + Q(Y[i] - cy) + Q(Z[i] - cz)); }
int L() {
for (m = i = 0; i < N; i++)
if (D(i) > m)
m = D(i), M = i;
return M;
}
main(t) {
for (; scanf("%d", &N), N; printf("%f\n", D(L()))) {
for (... | [["-", 0, 7, 26, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 7, 26, 2, 3, 4, 0, 5, 0, 6]] | 0 | 283 | 23 |
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef vector<double> point;
typedef const point &rpoint;
point add(rpoint p1, rpoint p2) {
point p(3);
for (int i = 0; i < 3; ++i)
p[i] = p1[i] + p2[i];
return p;
}
point sub(rpoint p1, rpoint p2) {
point p(3);
for (int i = 0; ... | #include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef vector<double> point;
typedef const point &rpoint;
point add(rpoint p1, rpoint p2) {
point p(3);
for (int i = 0; i < 3; ++i)
p[i] = p1[i] + p2[i];
return p;
}
point sub(rpoint p1, rpoint p2) {
point p(3);
for (int i = 0; ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 435 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
struct P {
double x, y, z;
};
double dist(P a, P b) {
double x = a.x - b.x;
double y = a.y - b.y;
double z = a.z - b.z;
return x * x + y * y + z * z;
}
int main() {
int N;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
struct P {
double x, y, z;
};
double dist(P a, P b) {
double x = a.x - b.x;
double y = a.y - b.y;
double z = a.z - b.z;
return x * x + y * y + z * z;
}
int main() {
int N;
... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 380 | 2 |
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int[] sosuu = new int[100001];
public void run() {
sosuuCalc();
while (sc.hasNext()) {
int m = sc.nextInt();
double a = sc.nextInt();
double b = sc.nextInt();
double c =... | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int[] sosuu = new int[100001];
public void run() {
sosuuCalc();
while (sc.hasNext()) {
int m = sc.nextInt();
double a = sc.nextInt();
double b = sc.nextInt();
double c =... | [["-", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491], ["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491]] | 3 | 357 | 2 |
#include <stdio.h>
char isprime[100000];
int pr[100000];
int primenum;
void mpl(void) {
int i, j;
for (i = 0; i < 100000; i++)
isprime[i] = 1;
isprime[0] = isprime[1] = 0;
primenum = 0;
for (i = 2; i < 100000; i++) {
if (isprime[i]) {
pr[primenum++] = i;
for (j = i + i; j < 100000; j += ... | #include <stdio.h>
char isprime[100000];
int pr[100000];
int primenum;
void mpl(void) {
int i, j;
for (i = 0; i < 100000; i++)
isprime[i] = 1;
isprime[0] = isprime[1] = 0;
primenum = 0;
for (i = 2; i < 100000; i++) {
if (isprime[i]) {
pr[primenum++] = i;
for (j = i + i; j < 100000; j += ... | [["+", 0, 16, 31, 16, 31, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 47], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 15, 23, 0, 16, 31, 16, 31, 16, 17, 98]] | 0 | 377 | 4 |
#include <stdio.h>
int main() {
int a, b, c, M = 100005, mi, mj, i, j, d[100010], r = 0, max;
char p[100010] = {1, 1};
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
for (i = r = 0; i < M; i++) {
if (p[i] == 0)
d[r++] = i;
}
while... | #include <stdio.h>
int main() {
int a, b, c, M = 100005, mi, mj, i, j, d[100010], r = 0, max;
char p[100010] = {1, 1};
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
for (i = r = 0; i < M; i++) {
if (p[i] == 0)
d[r++] = i;
}
while... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 19]] | 0 | 271 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define num 100000
#define true 1
#define false 0
void isPrime();
int isCheck(int i, int j, int m, int a, int b);
int isbigger(int num1, int num2);
int is1(int i, int j);
int N;
int *prime;
int main() {
prime = (int *)malloc(num);
isPrime();
int m, a, b;
int i, j, x, y;
... | #include <stdio.h>
#include <stdlib.h>
#define num 100000
#define true 1
#define false 0
void isPrime();
int isCheck(int i, int j, int m, int a, int b);
int isbigger(int num1, int num2);
int is1(int i, int j);
int N;
int *prime;
int main() {
prime = (int *)malloc(num);
isPrime();
int m, a, b;
int i, j, x, y;
... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 79], ["-", 8, 9, 0, 52, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 23, 0, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 23, 0, 34, 12, 22]] | 0 | 469 | 4 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1232
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1232
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... | [["-", 8, 9, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 2, 63, 22], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 376 | 4 |
import static java.lang.Math.*;
import java.awt.geom.*;
import java.util.*;
public class Main {
final Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().init(); }
void init() { new AOJ1237(); }
class AOJ1237 {
AOJ1237() {
while (true) {
target = sc.nextI... | import static java.lang.Math.*;
import java.awt.geom.*;
import java.util.*;
public class Main {
final Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().init(); }
void init() { new AOJ1237(); }
class AOJ1237 {
AOJ1237() {
while (true) {
target = sc.nextI... | [["-", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 519 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | [["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["-", 75, 76, 0, 57, 75, 76, 0, 1, 0, 35]] | 1 | 501 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int target;
while (cin >> target >> str, str != "0" || target != 0) {
int len = str.size() - 1;
int ans = -1;
int ansi = 0;
bool reject = false;
for (int i = 0; i < (1 << len); i++) {
int prev = 0;
int sum = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int target;
while (cin >> target >> str, str != "0" || target != 0) {
int len = str.size() - 1;
int ans = -1;
int ansi = 0;
bool reject = false;
for (int i = 0; i < (1 << len); i++) {
int prev = 0;
int sum = 0;... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 355 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define REPI... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define REPI... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 606 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#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>
#include <time.h>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#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>
#include <time.h>
#include ... | [["-", 12, 91, 28, 23, 0, 16, 12, 16, 17, 79], ["+", 12, 91, 28, 23, 0, 16, 12, 16, 17, 60]] | 1 | 602 | 2 |
#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, p1, p2;
while (scanf("%d%d%d", &n, &p1, &p2), n || p1 || p2) {
vector<vector<int>> G(p1 + p2 + 1);
for (int i = 0; i < n; ++i) {
int x, y;
char c;
scanf("%d%d %c%*s", &x, &y,... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, p1, p2;
while (scanf("%d%d%d", &n, &p1, &p2), n || p1 || p2) {
vector<vector<int>> G(p1 + p2 + 1);
for (int i = 0; i < n; ++i) {
int x, y;
char c;
scanf("%d%d %c%*s", &x, &y,... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 767 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 807 | 2 |
import java.io.IOException;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
final Scanner sc = new Scanner(System.in);
final int n = sc.nextInt();
for (in... | import java.io.IOException;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
final Scanner sc = new Scanner(System.in);
final int n = sc.nextInt();
for (in... | [["-", 3, 4, 0, 492, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 492, 3, 4, 0, 16, 12, 499]] | 3 | 576 | 2 |
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public void run() {
int n = sc.nextInt();
sc.nextLine();
for (int i = 0; i < n; i++) {
String order = sc.nextLine();
String message = sc.nextLine();
calc(order, message);
}
}
public void calc(S... | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public void run() {
int n = sc.nextInt();
sc.nextLine();
for (int i = 0; i < n; i++) {
String order = sc.nextLine();
String message = sc.nextLine();
calc(order, message);
}
}
public void calc(S... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 499], ["+", 8, 196, 0, 57, 64, 1, 0, 11, 12, 499]] | 3 | 971 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
while (n--) {
string m, s;
cin >> m >> s;
reverse(all(m));
for (int i = 0; i < m.size(); i++) {
if (m[i] == 'C') {
string a(s, 0, 1);
string b(s, 1, s.size() - 1... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
while (n--) {
string m, s;
cin >> m >> s;
reverse(all(m));
for (int i = 0; i < m.size(); i++) {
if (m[i] == 'C') {
string a(s, 0, 1);
string b(s, 1, s.size() - 1... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 460 | 6 |
// 1240
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
char table[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
string now;
void A() { reverse(now.begin(), now.end()); }
void J() {
char tmp = now[0];
for (int i = 0; i < now.size() - 1; i++)
now[i] = now[i + 1];
now... | // 1240
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
char table[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
string now;
void A() { reverse(now.begin(), now.end()); }
void J() {
char tmp = now[0];
for (int i = 0; i < now.size() - 1; i++)
now[i] = now[i + 1];
now... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 987 | 2 |
#include <algorithm>
#include <cstdio>
using std::swap;
void J(char s[], int len) {
char tmp = s[len - 1];
for (int i = len - 1; i > 0; i--) {
s[i] = s[i - 1];
}
s[0] = tmp;
}
void C(char s[], int len) {
char tmp = s[0];
for (int i = 0; i < len - 1; i++) {
s[i] = s[i + 1];
}
s[len - 1] = tmp;
}... | #include <algorithm>
#include <cstdio>
using std::swap;
void J(char s[], int len) {
char tmp = s[len - 1];
for (int i = len - 1; i > 0; i--) {
s[i] = s[i - 1];
}
s[0] = tmp;
}
void C(char s[], int len) {
char tmp = s[0];
for (int i = 0; i < len - 1; i++) {
s[i] = s[i + 1];
}
s[len - 1] = tmp;
}... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 627 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string c_j(string str);
string c_c(string str);
string c_e(string str);
strin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string c_j(string str);
string c_c(string str);
string c_e(string str);
strin... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 645 | 4 |
#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+... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 85], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 800 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string number = "0123456789";
int n;
cin >> n;
while (n--) {
string order, message;
cin >> order >> message;
for (int i = order.size() - 1; i >= 0; i--) {
if (order[i] == 'M') {
for (int j = 0; j < message.size(); j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string number = "0123456789";
int n;
cin >> n;
while (n--) {
string order, message;
cin >> order >> message;
for (int i = order.size() - 1; i >= 0; i--) {
if (order[i] == 'M') {
for (int j = 0; j < message.size(); j++) {
... | [["-", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22]] | 1 | 426 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | [["-", 341, 342, 0, 16, 31, 2, 63, 118, 28, 22], ["+", 341, 342, 0, 16, 31, 2, 63, 118, 28, 22]] | 1 | 407 | 2 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
#define pb push_back
using namespace std;
string num = "0123456789";
string mrj(string s... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
#define pb push_back
using namespace std;
string num = "0123456789";
string mrj(string s... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 568 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#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 <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#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 <numeric>
#include <queue>
#include ... | [["-", 64, 9, 0, 1, 0, 41, 64, 16, 17, 60], ["+", 64, 9, 0, 1, 0, 41, 64, 11, 17, 32]] | 1 | 734 | 4 |
#include <deque>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s, t;
char c, d;
deque<char> de, sub;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> t;
de.clear();
for (int j = 0; j < t.size(); j++) {
de.push_back(t[j]);
}
for (int j = s... | #include <deque>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s, t;
char c, d;
deque<char> de, sub;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> t;
de.clear();
for (int j = 0; j < t.size(); j++) {
de.push_back(t[j]);
}
for (int j = s... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18]] | 1 | 635 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string q, s;
cin >> q >> s;
for (int i = s.size() - 1; 0 <= i; i--) {
if (q[i] == 'C')
s = s.substr(1, s.size() - 1) + s[0];
if (q[i] == 'J')
s = s[s.size() - 1] + s.substr(0, s.size()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string q, s;
cin >> q >> s;
for (int i = q.size() - 1; 0 <= i; i--) {
if (q[i] == 'C')
s = s.substr(1, s.size() - 1) + s[0];
if (q[i] == 'J')
s = s[s.size() - 1] + s.substr(0, s.size()... | [["-", 49, 50, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 49, 50, 51, 16, 31, 2, 63, 118, 28, 22]] | 1 | 354 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
type... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
type... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 323 | 4 |
#include <iostream>
using namespace std;
#define PRIMENUM 200100
//その数は素数かどうか判定する変数
int isPrime[PRIMENUM];
void makePrimeNumber() {
isPrime[2] = 1;
isPrime[3] = 1;
for (int i = 4; i < PRIMENUM; i++) {
int flag = 0;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
flag = 1;
... | #include <iostream>
using namespace std;
#define PRIMENUM 200100
//その数は素数かどうか判定する変数
int isPrime[PRIMENUM];
void makePrimeNumber() {
isPrime[2] = 1;
isPrime[3] = 1;
for (int i = 4; i < PRIMENUM; i++) {
int flag = 0;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
flag = 1;
... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19]] | 1 | 376 | 2 |
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << endl
typedef long long ll;
const int MAX_M = 100000;
bool prime[MAX_M + 1];
int main() {
fill(prime, prime + MAX_M + 1, true);
prime[0] = prime[1] = false;
for (int... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << endl
typedef long long ll;
const int MAX_M = 100000;
bool prime[MAX_M + 1];
int main() {
fill(prime, prime + MAX_M + 1, true);
prime[0] = prime[1] = false;
for (int... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 260 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 999999999
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int pr[100001];
void erato() {
pr[0] = 0;
pr[1] = 0;
pr[2] = 1;
for (int i = 3; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 999999999
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int pr[100001];
void erato() {
pr[0] = 0;
pr[1] = 0;
pr[2] = 1;
for (int i = 3; i ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 271 | 6 |
#include <iostream>
#include <vector>
using namespace std;
#define MAX 100000
int m, a, b;
vector<int> t;
bool isP[MAX];
int main() {
for (int i = 2; i < MAX; i++)
isP[i] = true;
for (int i = 2; i * i < MAX; i++) {
if (!isP[i])
continue;
for (int j = i * i; j < MAX; j += i) {
isP[j] = false;... | #include <iostream>
#include <vector>
using namespace std;
#define MAX 100000
int m, a, b;
vector<int> t;
bool isP[MAX];
int main() {
for (int i = 2; i < MAX; i++)
isP[i] = true;
for (int i = 2; i * i < MAX; i++) {
if (!isP[i])
continue;
for (int j = i * i; j < MAX; j += i) {
isP[j] = false... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["+", 15, 339, 51, 16, 31, 16, 12, 69, 28, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 316 | 5 |
#include <iostream>
using namespace std;
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i < n / i; i += 3) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int m, a, b, prime[10000], n = 0, p, q;
double ab;
for (int ... | #include <iostream>
using namespace std;
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i <= n / i; i += 2) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int m, a, b, prime[10000], n = 0, p, q;
double ab;
for (int... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13]] | 1 | 285 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 297 | 6 |
#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 aa[1000000];
bool isprime(long long int a) {
if (a == 1 || a == 0)
return false;
for (long long int i = 2; i * i <= a; ++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 aa[1000000];
bool isprime(long long int a) {
if (a == 1 || a == 0)
return false;
for (long long int i = 2; i * i <= a; ++i... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 289 | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#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 ALL(a) (a).begin(), (a).end()
#define DEBUG(a) "(" << #... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#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 ALL(a) (a).begin(), (a).end()
#define DEBUG(a) "(" << #... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 9, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 507 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.