buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <array>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
struct team_t {
array<uint32_t, 11> wrongs;
uint64_t penalty;
uint32_t corrects;
uint32_t id;
team_t() : wrongs({}), penalty(0), corrects(0), id(0) {}
void correct(uint32_t pid, uint32_t ti... | #include <algorithm>
#include <array>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
struct team_t {
array<uint32_t, 11> wrongs;
uint64_t penalty;
uint32_t corrects;
uint32_t id;
team_t() : wrongs({}), penalty(0), corrects(0), id(0) {}
void correct(uint32_t pid, uint32_t ti... | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13]] | 1 | 353 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class St {
public:
int td, sc, pn, ac;
St() {}
St(int _td, int _sc, int _pn, int _ac) : td(_td), sc(_sc), pn(_pn), ac(_ac) {}
void print() { cout << td << " " << ac << " " << sc << endl; }
};
int t, r, p;
boo... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class St {
public:
int td, sc, pn, ac;
St() {}
St(int _td, int _sc, int _pn, int _ac) : td(_td), sc(_sc), pn(_pn), ac(_ac) {}
void print() { cout << td << " " << ac << " " << sc << endl; }
};
int t, r, p;
boo... | [["-", 0, 57, 64, 37, 0, 16, 31, 118, 119, 120], ["+", 0, 57, 64, 37, 0, 16, 31, 118, 119, 120], ["-", 0, 57, 64, 37, 0, 16, 12, 118, 119, 120], ["+", 0, 57, 64, 37, 0, 16, 12, 118, 119, 120]] | 1 | 457 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
type... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
type... | [["-", 0, 1, 0, 16, 31, 16, 12, 91, 17, 33]] | 1 | 458 | 1 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int wa[51][11];
struct Team {
int ac, wa, id;
};
bool operator<(const Team &t, const Team &s) {
return (t.ac != s.ac) ? t.ac > s.ac
: ((t.wa != s.wa) ? t.wa < s.wa : t.id > ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int wa[51][11];
struct Team {
int ac, wa, id;
};
bool operator<(const Team &t, const Team &s) {
return (t.ac != s.ac) ? t.ac > s.ac
: ((t.wa != s.wa) ? t.wa < s.wa : t.id < ... | [["-", 0, 41, 75, 23, 0, 41, 75, 16, 17, 47], ["+", 0, 41, 75, 23, 0, 41, 75, 16, 17, 18]] | 1 | 337 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
using namespace std;
struct st {
int num;
int point;
i... |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
using namespace std;
struct st {
int num;
int point;
i... | [["-", 0, 41, 64, 23, 0, 41, 64, 16, 17, 18], ["+", 0, 41, 64, 23, 0, 41, 64, 16, 17, 47]] | 1 | 445 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int T, P, R;
while (cin >> T >> P >> R) {
if (T == 0 && P == 0 && R == 0) {
break;
}
int team[50][10] = {0};
int pena[50][2] = {0};
for (int i = 0; i < R; i++) {
int tid, pid, time;
s... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int T, P, R;
while (cin >> T >> P >> R) {
if (T == 0 && P == 0 && R == 0) {
break;
}
int team[50][10] = {0};
int pena[50][2] = {0};
for (int i = 0; i < R; i++) {
int tid, pid, time;
s... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 476 | 4 |
while True:
t,p,r=list(map(int,input().split()))
if t==0: break
score=[]
for i in range(t):
score.append((p,0,i+1))
wrong=[[0]*p for _ in range(t)]
for _ in range(r):
tID,pID,time,mes=input().split()
tID=int(tID)-1
pID=int(pID)-1
time=int(time)
if ... | while True:
t,p,r=list(map(int,input().split()))
if t==0: break
score=[]
for i in range(t):
score.append((p,0,i+1))
wrong=[[0]*p for _ in range(t)]
for _ in range(r):
tID,pID,time,mes=input().split()
tID=int(tID)-1
pID=int(pID)-1
time=int(time)
if ... | [["-", 0, 652, 3, 4, 0, 657, 12, 660, 0, 22], ["-", 0, 652, 3, 4, 0, 657, 12, 660, 0, 21], ["+", 0, 652, 3, 4, 0, 657, 12, 660, 0, 21], ["+", 0, 652, 3, 4, 0, 657, 12, 660, 0, 22]] | 5 | 210 | 4 |
import java.util.*;
public class Main {
String line;
int pos;
private void doit() {
Scanner sc = new Scanner(System.in);
while (true) {
String str = sc.next() + "#";
if (str.equals("##"))
break;
str = str.replaceAll("--", "");
ArrayList<Character> list = new ArrayList<Cha... | import java.util.*;
public class Main {
String line;
int pos;
private void doit() {
Scanner sc = new Scanner(System.in);
while (true) {
String str = sc.next() + "#";
if (str.equals("##"))
break;
str = str.replaceAll("--", "");
ArrayList<Character> list = new ArrayList<Cha... | [["-", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["-", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 560 | 4 |
import static java.lang.System.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(in);
char[] eq;
char[] eq1, eq2;
boolean[] as = new boolean[11];
boolean[] check = new boolean[11];
boolean flag;
void calc(int depth) {
if (depth == 11) {
boolean a, b;
eq = eq1;
... | import static java.lang.System.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(in);
char[] eq;
char[] eq1, eq2;
boolean[] as = new boolean[11];
boolean[] check = new boolean[11];
boolean flag;
void calc(int depth) {
if (depth == 11) {
boolean a, b;
eq = eq1;
... | [["-", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 705 | 2 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<long long>;
using vlad = valarray<double>;
using ll = long long;
#define rep(i, n) for (int... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<long long>;
using vlad = valarray<double>;
using ll = long long;
#define rep(i, n) for (int... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 320 | 2 |
#include <bits/stdc++.h>
using namespace std;
int parse(const string &s, int i) {
if (i < s.size() && s[i] == 'm') {
i++;
i += parse(s, i);
if (s[i] != 'e')
return i;
i++;
i += parse(s, i);
if (s[i] != 'w')
return i;
i++;
}
return i;
}
int main() {
string s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
int parse(const string &s, int i) {
if (i < s.size() && s[i] == 'm') {
i++;
i = parse(s, i);
if (s[i] != 'e')
return i;
i++;
i = parse(s, i);
if (s[i] != 'w')
return i;
i++;
}
return i;
}
int main() {
string s;
cin >> s;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 141 | 4 |
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool catChecker(string str) {
stack<char> cnt;
for (int i = 0; i < str.size(); i++) {
char c = str.at(i);
switch (c) {
case 'm':
cnt.push(c);
break;
case 'e':
if (!cnt.empty() && cnt.top() == 'm') {
... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
bool catChecker(string str) {
stack<char> cnt;
for (int i = 0; i < str.size(); i++) {
char c = str.at(i);
switch (c) {
case 'm':
cnt.push(c);
break;
case 'e':
if (!cnt.empty() && cnt.top() == 'm') {
... | [["-", 64, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 237 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 0, 52, 8, 9, 0, 43, 39, 86, 0, 87], ["-", 0, 52, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 343, 345, 348], ["+", 0, 52, 8, 9, 0, 43, 39, 343, 0, 349], ["+", 0, 52, 8, 9, 0, 43, 39, 343, 141, 78]] | 1 | 408 | 5 |
s=*$<;p while s.gsub!(/(m|e)mew(e|w)/,'\\1\\2');puts s=="mew\n"?'Cat':'Rabbit' | s=gets;p while s.gsub!(/(m|e)mew(e|w)/,'\\1\\2');puts s=="mew\n"?'Cat':'Rabbit' | [["-", 36, 36, 0, 493, 0, 662, 12, 741, 0, 48], ["-", 36, 36, 0, 493, 0, 662, 12, 741, 0, 744], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 12, 22]] | 4 | 35 | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007ll
#define INF 1000000000ll
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007ll
#define INF 1000000000ll
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | [["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 440 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX_V 111111
#define int long long
int V, E;
vector<int> G[MAX_V];
int used[MAX_V];
void add_edge(int a, int b) {
G[a].push_back(b);
G[b].push_back(a);
}
int a[2];
bool dfs(int v, int c) {
if (~used[v])
return used[v] == c;
bool f =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX_V 111111
#define int long long
int V, E;
vector<int> G[MAX_V];
int used[MAX_V];
void add_edge(int a, int b) {
G[a].push_back(b);
G[b].push_back(a);
}
int a[2];
bool dfs(int v, int c) {
if (~used[v])
return used[v] == c;
bool f =... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 17, 18], ["+", 64, 9, 0, 7, 15, 16, 31, 16, 17, 19]] | 1 | 623 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [["-", 8, 9, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22]] | 1 | 676 | 5 |
#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define MAX 100010
#define inf 1 << 28
using namespace std;
typedef pair<int, int> pii;
class State {
public:
int n, cost, sum;
State(int n, int cost, int sum) : n(n), cost(cost), sum(sum) {}
bool operator<(State s) const {
if (c... | #include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define MAX 100010
#define inf 1 << 28
using namespace std;
typedef pair<int, int> pii;
class State {
public:
int n, cost, sum;
State(int n, int cost, int sum) : n(n), cost(cost), sum(sum) {}
bool operator<(State s) const {
if (c... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 913 | 2 |
#include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
int MOD = 1000000007;
vector<vector<int>> matmul(vector<vector<int>> &a, vector<ve... | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
int MOD = 1000000007;
vector<vector<int>> matmul(vector<vector<int>> &a, vector<ve... | [["+", 75, 76, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 109], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 541 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
long long k, _min, _max, x_y, x, y, fibx, fiby, a;
long double mid;
#define MOD 1000000007
int dp[3];
int main() {
cin >> k;
a = sqrt(k) / 16;
x_y = (long long)((2 * sqrtl(k - a - 1 / 100)) - 1);
_max = (long long)((x_y + 2) * (x_y + 2) / 4);
_min =... | #include <cmath>
#include <iostream>
using namespace std;
long long k, _min, _max, x_y, x, y, fibx, fiby, a;
long double mid;
#define MOD 1000000007
int dp[3];
int main() {
cin >> k;
a = sqrt(k) / 16;
x_y = (long long)((2 * sqrtl(k - a - 0.01)) - 1);
_max = (long long)((x_y + 2) * (x_y + 2) / 4);
_min = (l... | [["-", 12, 2, 3, 4, 0, 16, 12, 16, 31, 13], ["-", 12, 2, 3, 4, 0, 16, 12, 16, 17, 85], ["-", 12, 2, 3, 4, 0, 16, 12, 16, 12, 13], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 449 | 12 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,878 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_bac... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_bac... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 664 | 4 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
struct Matrix2x2 {
ll a[2][2];
Matrix2x2 operator*(const Matrix2x2 &m) {
Matrix2x2 c;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
ll sum = 0;
for (int k = 0; k < 2; ++k) {
... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
struct Matrix2x2 {
ll a[2][2];
Matrix2x2 operator*(const Matrix2x2 &m) {
Matrix2x2 c;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
ll sum = 0;
for (int k = 0; k < 2; ++k) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 109], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 502 | 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, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 16, 12, 23, 0, 24], ["-", 49, 50, 51, 16, 12, 23, 0, 16, 17, 33], ["-", 49, 50, 51, 16, 12, 23, 0, 16, 12, 22], ["-", 0, 43, 49, 50, 51, 16, 12, 23, 0, 25]] | 1 | 703 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> r(N);
for (int i = 0; i < N; i++)
cin >> r[i];
sort(r.begin(), r.end());
double ma = 0;
for (; N >= 3; N--, r.erase(r.begin())) {
do {
double ub = DBL_MAX;
for (int i = 0; i < N; i++)
ub = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> r(N);
for (int i = 0; i < N; i++)
cin >> r[i];
sort(r.begin(), r.end());
double ma = 0;
for (; N >= 3; N--, r.erase(r.begin())) {
do {
double ub = DBL_MAX;
for (int i = 0; i < N; i++)
ub = ... | [["-", 0, 82, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 82, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 337 | 2 |
#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
double l[8];
double f(double v, vector<double> L) {
double sum = 0;
for (int i = 0; i < L.size() - 1; i++) {
double t = v / L[i] / L[i + 1];
sum += acos(t);
}
return sum;
}
double calc(double v, vector<double> L) {
double sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
double l[8];
double f(double v, vector<double> L) {
double sum = 0;
for (int i = 0; i < L.size() - 1; i++) {
double t = v / L[i] / L[i + 1];
sum += acos(t);
}
return sum;
}
double calc(double v, vector<double> L) {
double sum = 0;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 470 | 2 |
#include <bits/stdc++.h>
#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "sz:" << v.size() << "\n[";
for (const auto &p : v) {
os << p << ",";
}
os << "]\n"... | #include <bits/stdc++.h>
#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "sz:" << v.size() << "\n[";
for (const auto &p : v) {
os << p << ",";
}
os << "]\n"... | [["+", 0, 11, 12, 16, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 12, 23, 0, 25]] | 1 | 636 | 2 |
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
typedef pair<long long, long long> result; // true, false
#define T first
#define F second
struct parse_t {
char c;
result value;
parse_t(char c_ = '#', const result &value_ = result())
: c(c_), value(value_) {}
};
templ... | #include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
typedef pair<long long, long long> result; // true, false
#define T first
#define F second
struct parse_t {
char c;
result value;
parse_t(char c_ = '#', const result &value_ = result())
: c(c_), value(value_) {}
};
templ... | [["-", 3, 4, 0, 2, 3, 4, 0, 118, 119, 120], ["+", 3, 4, 0, 2, 3, 4, 0, 118, 119, 120], ["-", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 794 | 8 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
typedef pair<long long, long long> result; // true, false
#define T first
#define F second
struct parse_t {
char c;
resu... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
typedef pair<long long, long long> result; // true, false
#define T first
#define F second
struct parse_t {
char c;
resu... | [["-", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 692 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < ... | [["+", 0, 57, 15, 339, 51, 16, 31, 91, 17, 111], ["+", 15, 339, 51, 16, 31, 91, 28, 69, 28, 22], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 70], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 980 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
ll m1 = 999979, m2 = 17;
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_inverse(ll ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
ll m1 = 999979, m2 = 999983;
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_inverse... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 377 | 2 |
// AOJ 2354 Fractional Knapsack
// 2018.3.17 bal4u
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
// library
//#define getchar_unlocked() getchar()
int in() {
int n = 0, c = getchar_unlocked();
if (c == '-') {
c = getchar_unlocked();
do
n = 10 * n + (c & 0xf), c = getchar_unlocked();
... | // AOJ 2354 Fractional Knapsack
// 2018.3.17 bal4u
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
// library
//#define getchar_unlocked() getchar()
int in() {
int n = 0, c = getchar_unlocked();
if (c == '-') {
c = getchar_unlocked();
do
n = 10 * n + (c & 0xf), c = getchar_unlocked();
... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20], ["+"... | 0 | 427 | 10 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
bool comp(const pii &a, const pii &b) {
return b.first * a.second > a.first * b.second;
}
int main() {
int n, w;
cin >> n >> w;
double res = 0;
vector<pii> item;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
bool comp(const pii &a, const pii &b) {
return b.first * a.second > a.first * b.second;
}
int main() {
int n, w;
cin >> n >> w;
double res = 0;
vector<pii> item;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 263 | 45 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define EPS 1e-9
using namespace std;
int n;
double W;
bool pred(pair<int, int> a, pair<int, int> b) {
return a.first * b.second < a.second * a.first;
}
int main() {
cin >> n >> W;
vector<pair<int, int>> vp;
double ret = 0;
doub... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define EPS 1e-9
using namespace std;
int n;
double W;
bool pred(pair<int, int> a, pair<int, int> b) {
return a.first * b.second > a.second * b.first;
}
int main() {
cin >> n >> W;
vector<pair<int, int>> vp;
double ret = 0;
doub... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47], ["-", 0, 37, 0, 16, 12, 16, 12, 118, 28, 22], ["+", 0, 37, 0, 16, 12, 16, 12, 118, 28, 22]] | 1 | 292 | 4 |
/*
* 2356.cc: Palindromic Anagram
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | /*
* 2356.cc: Palindromic Anagram
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 321 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
int cnt[26];
long long c[40][40];
long long combination(int n, int k) {
if (c[n][k] != -1)
return c[n][k];
if (k == 0 || n == k) {
return c[n][k] = 1;
}
c[n][k] = combination(n - 1, k) + combination(n - 1, k - 1);
return c[n][k];
}
int m... | #include <cstring>
#include <iostream>
using namespace std;
int cnt[28];
long long c[40][40];
long long combination(int n, int k) {
if (c[n][k] != -1)
return c[n][k];
if (k == 0 || n == k) {
return c[n][k] = 1;
}
c[n][k] = combination(n - 1, k) + combination(n - 1, k - 1);
return c[n][k];
}
int m... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 322 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int cost[9][9];
struct node {
string num;
int cost;
node(string n, int c) : num(n), cost(c) {}
node() {}
bool operator>(const node &arg) const { return cost >... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int cost[9][9];
struct node {
string num;
int cost;
node(string n, int c) : num(n), cost(c) {}
node() {}
bool operator>(const node &arg) const { return cost >... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 439 | 2 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var str = (input.trim()).replace(/egg/g, "E").replace(/chicken/g, "C");
while (/EE/.test(str))
str = str.replace(/EE/, "EAE");
while (/CC/.test(str))
str = str.replace(/CC/, "CAC");
var ary = str.split("A");
var ans = "";
ary.forEach(function(v) {
if (... | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var str = (input.trim()).replace(/egg/g, "E").replace(/chicken/g, "C");
while (/EE/.test(str))
str = str.replace(/EE/, "EAE");
while (/CC/.test(str))
str = str.replace(/CC/, "CAC");
var ary = str.split("A");
var ans = "";
ary.forEach(function(v) {
if (... | [["-", 0, 510, 15, 23, 0, 16, 12, 557, 0, 491], ["+", 0, 510, 15, 23, 0, 16, 12, 557, 0, 491]] | 2 | 179 | 2 |
char s[9999], t[1001];
main(i, j, m, r) {
scanf("%s", &s);
for (i = j = 0; i < strlen(s);) {
if (s[i] == 'e')
t[j++] = 'e', i += 3;
else
t[j++] = 'c', i += 7;
}
t[j] = 0;
for (m = i = 0; i < strlen(t);) {
for (j = i + 1; j < strlen(t); j++)
if (t[j] == t[i])
break;
if... | char s[9999], t[999];
main(i, j, m, r) {
scanf("%s", &s);
for (i = j = 0; i < strlen(s);) {
if (s[i] == 'e')
t[j++] = 'e', i += 3;
else
t[j++] = 'c', i += 7;
}
t[j] = 0;
for (m = i = 0; i < strlen(t);) {
for (j = i + 1; j < strlen(t); j++)
if (t[j] == t[j - 1])
break;
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 31, 22], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 198 | 6 |
#include <algorithm>
#include <stdio.h>
using namespace std;
char str[11000];
int main() {
scanf("%s", str);
int at = 0;
int last = -1;
int ret = 0;
int len = 0;
int now = 0;
while (str[at]) {
if (str[at] == 'e') {
if (last == 0) {
if (len < now) {
len = now;
ret = 0;... | #include <algorithm>
#include <stdio.h>
using namespace std;
char str[11000];
int main() {
scanf("%s", str);
int at = 0;
int last = -1;
int ret = 0;
int len = 0;
int now = 0;
while (str[at]) {
if (str[at] == 'e') {
if (last == 0) {
if (len < now) {
len = now;
ret = 0;... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 196 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13]] | 1 | 266 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string in;
cin >> in;
vector<vector<int>> buf;
int last = -1;
int j = -1;
for (int i = 0; i < in.size();) {
int now = in[i] == 'e' ? 0 : 1;
if (last == now || last == -1)... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string in;
cin >> in;
vector<vector<int>> buf;
int last = -1;
int j = -1;
for (int i = 0; i < in.size();) {
int now = in[i] == 'e' ? 0 : 1;
if (last == now || last == -1)... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6]] | 1 | 213 | 2 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define M 40
#define max(a, b) (a > b ? a : b)
typedef unsigned int uint;
typedef vector<int> Graph;
Graph g[M];
int power[M], sum[M], n, ans;
int solve(int s, int del[M], int pw) {
int del2[M], res = 0, r;
pw += power[... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define M 40
#define max(a, b) (a > b ? a : b)
typedef unsigned int uint;
typedef vector<int> Graph;
Graph g[M];
int power[M], sum[M], n, ans;
int solve(int s, int del[M], int pw) {
int del2[M], res = 0, r;
pw += power[... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 523 | 4 |
#include <stdio.h>
int main(void) {
int ans;
int n, t, e;
int i;
int x;
ans = -1;
scanf("%d %d %d", &n, &t, &e);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (t % x >= e || t % x <= x - e) {
ans = i + 1;
}
}
printf("%d\n", ans);
return (0);
} | #include <stdio.h>
int main(void) {
int ans;
int n, t, e;
int i;
int x;
ans = -1;
scanf("%d %d %d", &n, &t, &e);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (t % x <= e || t % x >= x - e) {
ans = i + 1;
}
}
printf("%d\n", ans);
return (0);
} | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 20], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20]] | 0 | 109 | 4 |
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <memory.h>
#include <stack>
#include <string>
#include <vector>
#define rep(idx, max) for (int idx = 0, idx##Max = (max); idx < idx##Max; idx++)
#define rrep(idx, min, max) \
for (i... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <memory.h>
#include <stack>
#include <string>
#include <vector>
#define rep(idx, max) for (int idx = 0, idx##Max = (max); idx < idx##Max; idx++)
#define rrep(idx, min, max) \
for (i... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 208 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, e;
cin >> n >> t >> e;
t -= e;
int num;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < e * 2 + 1; j++) {
if ((t + j) % a == 0)
num = i + 1;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, e;
cin >> n >> t >> e;
t -= e;
int num = -1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < e * 2 + 1; j++) {
if ((t + j) % a == 0)
num = i + 1... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 117 | 2 |
#include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int n, t, e, p = -1, a;
cin >> n >> t >> e;
r(i, 0, n) {
cin >> a;
if (t % a <= 2 * e)
p = i + 1;
}
cout << p << endl;
} | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int n, t, e, p = -1, a;
cin >> n >> t >> e;
r(i, 0, n) {
cin >> a;
if ((t + e) % a <= 2 * e)
p = i + 1;
}
cout << p << endl;
} | [["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25]] | 1 | 80 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string osr;
char ans;
cin >> osr;
int size = osr.size();
if (osr[0] == 'x' && osr[size] == 'x')
ans = 'x';
else
ans = 'o';
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string osr;
char ans;
cin >> osr;
int size = osr.size();
if (osr[0] == 'x' && osr[size - 1] == 'x')
ans = 'x';
else
ans = 'o';
cout << ans << endl;
return 0;
}
| [["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 77 | 2 |
#include <iostream>
main() {
std::string s;
std::cin >> s;
puts(s[0] & s[s.size() - 1] ^ 'x' == 'x' ? "x" : "o");
} | #include <iostream>
main() {
std::string s;
std::cin >> s;
puts(s[0] & s[s.size() - 1] ^ 'x' ? "o" : "x");
} | [["-", 3, 4, 0, 41, 15, 16, 12, 16, 17, 60], ["-", 0, 41, 15, 16, 12, 16, 12, 103, 0, 104], ["-", 0, 41, 15, 16, 12, 16, 12, 103, 0, 125], ["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 53 | 8 |
#include <iostream>
#include <string>
using namespace std;
main() {
string s;
if (s[0] == 'x' && s[s.size() - 1] == 'x')
cout << "x" << endl;
else
cout << "o" << endl;
} | #include <iostream>
#include <string>
using namespace std;
main() {
string s;
cin >> s;
if (s[0] == 'x' && s[s.size() - 1] == 'x')
cout << "x" << endl;
else
cout << "o" << endl;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 59 | 4 |
#include <stdio.h>
int main(void) {
int N, K, R, i, j, k, l, count, sum = 0;
int m[100][100] = {0};
int dame[51] = {0}, pq[10000][10000] = {0};
scanf("%d %d", &N, &K);
for (i = 1; i <= K; i++) {
scanf("%d", &m[i][0]);
for (j = 1; j <= m[i][0]; j++) {
scanf("%d", &m[i][j]);
}
}
scanf("... | #include <stdio.h>
int main(void) {
int N, K, R, i, j, k, l, count, sum = 0;
int m[100][100] = {0};
int dame[100] = {0}, pq[3000][2] = {0};
scanf("%d %d", &N, &K);
for (i = 1; i <= K; i++) {
scanf("%d", &m[i][0]);
for (j = 1; j <= m[i][0]; j++) {
scanf("%d", &m[i][j]);
}
}
scanf("%d",... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 367 | 8 |
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
string To_string(int i) {
stringstream ss;
ss << i;
return ss.str();
}
int GetDigit(int num) { return To_string(num).length(); }
int Q;
int main() {
cin >> Q;
for (int i = 0; i < Q; ++i) {
int n;
cin >>... | #include <iostream>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
string To_string(int i) {
stringstream ss;
ss << i;
return ss.str();
}
int GetDigit(int num) { return To_string(num).length(); }
int Q;
int main() {
cin >> Q;
for (int i = 0; i < Q; ++i) {
int n;
cin >>... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 254 | 4 |
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n, res = 0;
cin >> n;
set<int> t;
while (n / 10) {
t.insert(n);
res++;
int MAX = 0;
int j = 1, k = 0;
while (n) {
k += j * (n % 10);
... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n, res = 0;
cin >> n;
set<int> t;
while (n / 10) {
t.insert(n);
res++;
int MAX = 0;
int j = 1, k = 0;
while (n) {
k += j * (n % 10);
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 146 | 4 |
#include <bits/stdc++.h>
using namespace std;
string str;
int cnt;
int inf;
string solve(string x) {
int ret = INT_MIN;
string a;
string ans;
if (x.size() == 1)
return x;
if (inf <= atoi(x.c_str()) && cnt != 0) {
cnt = -1;
return 0;
}
for (int i = 0; i < (int)str.size(); i++) {
string b... | #include <bits/stdc++.h>
using namespace std;
string str;
int cnt;
int inf;
string solve(string x) {
int ret = INT_MIN;
string a;
string ans;
// cout << x << " " << cnt << endl;
if (x.size() == 1)
return x;
if (inf <= atoi(x.c_str()) && cnt != 0) {
cnt = -1;
return 0;
}
for (int i = 0; i ... | [["-", 15, 16, 12, 74, 51, 2, 63, 118, 28, 22], ["+", 15, 16, 12, 74, 51, 2, 63, 118, 28, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 258 | 7 |
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
int search(int num) {
if (num < 10)
return 0;
auto log = 10;
auto v = 0;
while (log < num) {
auto tmp = (num % 10) * (num / 10);
v = max(tmp, v);
log *= 10;
}
return 1 + search(v);
}
int main() {
auto n = 0... | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int search(int num) {
if (num < 10)
return 0;
auto log = 10;
auto v = 0;
while (log < num) {
auto tmp = (num % log) * (num / log);
v = max(tmp, v);
log *= 10;
}
return 1 + search(v);
}
int main() {
// ifstre... | [["-", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 22], ["-", 49, 50, 51, 16, 12, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 12, 23, 0, 16, 12, 22]] | 1 | 133 | 4 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int q;
int n;
int count;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n;
count = 0;
while (n / 10 >= 10) {
count += 1;
int max = 0;
for (int j = 1; j < 6; j++) {
int t = pow(10, j);
int tmp... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int q;
int n;
int count;
int max;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n;
count = 0;
while (n / 10 >= 1) {
count += 1;
max = 0;
for (int j = 1; j < 6; j++) {
int t = pow(10, j);
i... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 134 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int p(int r) {
int ans = -1;
for (int i = 10; i <= r; i *= 10)
ans = max(ans, ((r - r % 10) / 10) * (r % 10));
return ans;
}
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int k;
cin >> k;
int cnt = 0;
while (k >=... | #include <algorithm>
#include <iostream>
using namespace std;
int p(int r) {
int ans = -1;
for (int i = 10; i <= r; i *= 10) {
ans = max(ans, ((r - r % i) / i) * (r % i));
}
return ans;
}
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int k;
cin >> k;
int cnt = 0;
while (k... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["+", 0, 16, 31, 23, 0, 16, 12, 16, 12, 22], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 22], ["-", 3, 4, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 14, 8, 9,... | 1 | 129 | 8 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int n;
cin >> n;
int tans = 0;
vector<int> used;
while (n >= 10) {
int div = 10;
int next = 0;
for (int i = 0; i < 6... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int n;
cin >> n;
int tans = 0;
vector<int> used;
while (n >= 10) {
int div = 10;
int next = 0;
for (int i = 0; i < 6... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 214 | 4 |
#include <iostream>
#include <map>
using namespace std;
map<int, int> mem;
int main() {
int Q, n;
cin >> Q;
for (int q = 0; q < Q; q++) {
cin >> n;
int m = 0;
while (n >= 10) {
m++;
mem[n] = 1;
int tmp = 0;
for (int j = 10;; j *= 10) {
int a, b;
a = n / j;
... | #include <iostream>
#include <map>
using namespace std;
map<int, int> mem;
int main() {
int Q, n;
cin >> Q;
for (int q = 0; q < Q; q++) {
mem.clear();
cin >> n;
int m = 0;
while (n >= 10) {
m++;
mem[n] = 1;
int tmp = 0;
for (int j = 10;; j *= 10) {
int a, b;
... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 161 | 6 |
n = gets.to_i
n.times do
r = gets.to_i
break if r == 0
i = 0
while r >= 10
max = 0
(r.to_s.length - 1).times do |l|
str = r.to_s
a = str[0..l].to_i
b = str[(l + 1)...str.length].to_i
max = a * b if a * b > max
end
r = max
... | n = gets.to_i
n.times do
r = gets.to_i
i = 0
while r >= 10
max = 0
(r.to_s.length - 1).times do |l|
str = r.to_s
a = str[0..l].to_i
b = str[(l + 1)...str.length].to_i
max = a * b if a * b > max
end
r = max
i += 1
end... | [["-", 196, 737, 8, 736, 0, 751, 8, 94, 0, 94], ["-", 0, 652, 196, 737, 8, 736, 0, 751, 0, 121], ["-", 196, 737, 8, 736, 0, 751, 15, 738, 31, 22], ["-", 196, 737, 8, 736, 0, 751, 15, 738, 17, 60], ["-", 196, 737, 8, 736, 0, 751, 15, 738, 12, 612]] | 4 | 97 | 5 |
from math import log10
for i in range(int(input())):
n = int(input())
j = 0
while n >= 10:
n = max((n / (10**k)) * (n % (10**k))
for k in range(1, int(log10(n)) + 1))
j += 1
print(j) | from math import log10
for i in range(int(input())):
n = int(input())
j = 0
while n >= 10:
n = max((n // (10**k)) * (n % (10**k)) for k in range(1, int(log10(n)) + 1))
j += 1
print(j) | [["-", 3, 668, 8, 657, 31, 23, 0, 657, 17, 85], ["+", 3, 668, 8, 657, 31, 23, 0, 657, 17, 676]] | 5 | 81 | 2 |
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { solver(); }
static void solver() {
Scanner sc = new Scanner(System.in);
int sx = sc.nextInt() + 100;
int sy = sc.nextInt() + 100;
int gx = sc.nextInt() + 100;
int gy = sc.next... | import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { solver(); }
static void solver() {
Scanner sc = new Scanner(System.in);
int sx = sc.nextInt() + 100;
int sy = sc.nextInt() + 100;
int gx = sc.nextInt() + 100;
int gy = sc.next... | [["-", 0, 492, 3, 4, 0, 230, 3, 4, 0, 499], ["+", 0, 492, 3, 4, 0, 230, 3, 4, 0, 499]] | 3 | 979 | 8 |
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;
// A Holiday of Miss Brute Force
public class Main {
int[][][] dist;
int sx, sy, gx, gy, lx, ly;
boolean ok(int x, int y) {
return -lx + 100 <= x && x <= lx + 100 && -ly + 100 <= y && y <= ly + 100;
}
void run() {
... | import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;
// A Holiday of Miss Brute Force
public class Main {
int[][][] dist;
int sx, sy, gx, gy, lx, ly;
boolean ok(int x, int y) {
return -lx + 100 <= x && x <= lx + 100 && -ly + 100 <= y && y <= ly + 100;
}
void run() {
... | [["-", 0, 11, 31, 504, 516, 504, 516, 504, 71, 499], ["+", 0, 11, 31, 504, 516, 504, 516, 504, 71, 22], ["-", 0, 1, 0, 11, 31, 504, 516, 504, 71, 499], ["+", 0, 1, 0, 11, 31, 504, 516, 504, 71, 22], ["-", 0, 492, 3, 4, 0, 227, 51, 518, 0, 499], ["+", 0, 492, 3, 4, 0, 227, 51, 518, 0, 22], ["+", 0, 503, 49, 200, 51, 16,... | 3 | 919 | 10 |
import java.util.*;
public class Main {
final Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().init(); }
private void init() { new B(); }
class F {
int N, C;
int[][] W, E;
int[] wc, ec;
ArrayList<State1> recAns;
int stepAns;
HashMap<String, Integ... | import java.util.*;
public class Main {
final Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().init(); }
private void init() { new B(); }
class F {
int N, C;
int[][] W, E;
int[] wc, ec;
ArrayList<State1> recAns;
int stepAns;
HashMap<String, Integ... | [["+", 3, 4, 0, 230, 3, 4, 0, 16, 31, 22], ["+", 3, 4, 0, 230, 3, 4, 0, 16, 17, 72]] | 3 | 2,774 | 4 |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a... | #include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 2, 3, 4, 0, 16, 17, 72], ["+", 15, 339, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 861 | 5 |
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
int dx[][7] = {
{0, 1, 1, 0, -1, -1}, // even
{0, 1, 1, 0, -1, -1}, // odd
};
int dy[][7] = {
{1, 0, -1, -1, -1, 0}, // even
{1, 1, 0, -1, 0, 1}, // odd
};
... | #include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
int dx[][7] = {
{0, 1, 1, 0, -1, -1}, // even
{0, 1, 1, 0, -1, -1}, // odd
};
int dy[][7] = {
{1, 0, -1, -1, -1, 0}, // even
{1, 1, 0, -1, 0, 1}, // odd
};
... | [["+", 51, 16, 12, 23, 0, 16, 12, 2, 63, 22]] | 1 | 566 | 1 |
#include <bits/stdc++.h>
using namespace std;
struct state {
int x, y, z, cost;
bool operator<(const state &p) const { return cost > p.cost; }
};
int dx[7] = {0, 1, 1, 0, -1, -1, 0};
int dy[2][7] = {{1, 0, -1, -1, -1, 0, 0}, {1, 1, 0, -1, 0, 1, 0}};
int sx, sy, gx, gy, lx, ly;
int n;
bool t[500][500];
int d[500]... | #include <bits/stdc++.h>
using namespace std;
struct state {
int x, y, z, cost;
bool operator<(const state &p) const { return cost > p.cost; }
};
int dx[7] = {0, 1, 1, 0, -1, -1, 0};
int dy[2][7] = {{1, 0, -1, -1, -1, 0, 0}, {1, 1, 0, -1, 0, 1, 0}};
int sx, sy, gx, gy, lx, ly;
int n;
bool t[500][500];
int d[500]... | [["+", 28, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 12, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 22], ["-", 31, 2, 3, 4, 0, 16, 12, 118, 119, 120], ["+", 31, 2, 3, 4, 0, 16, 12, 118, 119, 120]] | 1 | 673 | 6 |
import java.io.*;
public class Main {
public static void main(String args[]) throws IOException {
InputStreamReader in = new InputStreamReader(System.in);
BufferedReader bf = new BufferedReader(in);
String str = bf.readLine();
char[] ch = str.toCharArray();
for (int i = 0; i < ch.length / 2; i++)... | import java.io.*;
public class Main {
public static void main(String args[]) throws IOException {
InputStreamReader in = new InputStreamReader(System.in);
BufferedReader bf = new BufferedReader(in);
String str = bf.readLine();
char[] ch = str.toCharArray();
for (int i = 0; i < ch.length / 2; i++)... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 422 | 4 |
import java.util.*;
public class Main {
public static void main(String[] args) { new Main().run(); }
Scanner sc = new Scanner(System.in);
StringBuffer ans;
String[] num = {"", "", "k", "s", "t", "n", "h", "m", "y", "r"};
String[] b = {"a", "i", "u", "e", "o"};
char[] st;
void run() {
while (sc.hasNe... | import java.util.*;
public class Main {
public static void main(String[] args) { new Main().run(); }
Scanner sc = new Scanner(System.in);
StringBuffer ans;
String[] num = {"", "", "k", "s", "t", "n", "h", "m", "y", "r"};
String[] b = {"a", "i", "u", "e", "o"};
char[] st;
void run() {
while (sc.hasNe... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 252]] | 3 | 348 | 2 |
#include <stdio.h>
int main() {
int i, j;
char s[1010];
char c[] = {"1234567890TLURD"};
char w[] = {" kstnhmyrwaiueo"};
scanf("%s", s);
for (i = 0; s[i]; i++) {
if (s[i] == '1')
continue;
if (s[i] == '0' && s[i + 1] == 'U') {
printf("nn");
continue;
}
for (j = 0; s[i] - c[j... | #include <stdio.h>
int main() {
int i, j;
char s[1010];
char c[] = {"1234567890TLURD"};
char w[] = {" kstnhmyrwaiueo"};
scanf("%s", s);
for (i = 0; s[i]; i++) {
if (s[i] == '1')
continue;
if (s[i] == '0' && s[i + 1] == 'U') {
printf("nn");
i++;
continue;
}
for (j = 0;... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 154 | 3 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 394 | 4 |
#include <iostream>
std::string table = " kstnhmyr", table2 = "aiueo", table3 = "TLURD";
int main() {
std::string S, T = "";
std::cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
if (S[i + 1] == 'T') {
T += "wa";
} else if (S[i + 1] == 'D') {
T += "wo";
} ... | #include <iostream>
std::string table = " kstnhmyr", table2 = "aiueo", table3 = "TLURD";
int main() {
std::string S, T = "";
std::cin >> S;
for (int i = 0; i < S.size(); i += 2) {
if (S[i] == '0') {
if (S[i + 1] == 'T') {
T += "wa";
} else if (S[i + 1] == 'D') {
T += "wo";
... | [["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13]] | 1 | 205 | 3 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s = "wakstnhmyrw";
string str;
cin >> str;
for (int i = 0; i < str.size(); i += 2) {
if (str[i] == 'w' && str[i + 1] == 'u')
cout << "nn";
else if (str[i] == '1') {
if (str[i + 1] == 'T')
cout << "a";
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s = "wakstnhmyrw";
string str;
cin >> str;
for (int i = 0; i < str.size(); i += 2) {
if (str[i] == '0' && str[i + 1] == 'U')
cout << "nn";
else if (str[i] == '1') {
if (str[i + 1] == 'T')
cout << "a";
... | [["-", 15, 339, 51, 16, 31, 16, 12, 103, 0, 125], ["+", 15, 339, 51, 16, 31, 16, 12, 103, 0, 125], ["-", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125], ["+", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125]] | 1 | 357 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i += 2) {
if (s[i] != '0' && s[i + 1] != 'U') {
if (s[i] == '0')
cout << 'w';
else if (s[i] == '2')
cout << 'k';
else if (s[i] == '3')
cout <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i += 2) {
if (s[i] != '0' || s[i + 1] != 'U') {
if (s[i] == '0')
cout << 'w';
else if (s[i] == '2')
cout << 'k';
else if (s[i] == '3')
cout <<... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 44], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 342 | 6 |
#include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
char c[1919];
c['2'] = 'k';
c['3'] = 's';
c['4'] = 't';
c['5'] = 'n';
c['6'] = 'h';
c['7'] = 'm';
c['8'] = 'y';
c['9'] = 'r';
c['0'] = 'w';
c['T'] = 'a';
c['L'] = 'i';
c['U'] = 'e';
c['R... | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
char c[1919];
c['2'] = 'k';
c['3'] = 's';
c['4'] = 't';
c['5'] = 'n';
c['6'] = 'h';
c['7'] = 'm';
c['8'] = 'y';
c['9'] = 'r';
c['0'] = 'w';
c['T'] = 'a';
c['L'] = 'i';
c['U'] = 'u';
c['R... | [["-", 8, 9, 0, 1, 0, 11, 12, 103, 0, 125], ["+", 8, 9, 0, 1, 0, 11, 12, 103, 0, 125]] | 1 | 263 | 2 |
#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;
string getst(int num, char way) {
string st = {'k', 's', 't', 'n', 'h', 'm', 'y', 'r', 'w'};
string wayst = "TLURD";
string to = "aiueo";
... | #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;
string getst(int num, char way) {
string st = {'k', 's', 't', 'n', 'h', 'm', 'y', 'r', 'w'};
string wayst = "TLURD";
string to = "aiueo";
... | [["-", 0, 37, 0, 16, 31, 69, 341, 342, 0, 13], ["+", 0, 37, 0, 16, 31, 69, 341, 342, 0, 13]] | 1 | 246 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string c[] = {"w", "", "k", "s", "t", "n", "h", "m", "y", "r"};
string s;
int main(void) {
cin >> s;
for (int i = 0; i < (int)s.size(); i += 2) {
if (s[i] == '0' && s[i] == 'U') {
cout << "nn";
continue... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string c[] = {"w", "", "k", "s", "t", "n", "h", "m", "y", "r"};
string s;
int main(void) {
cin >> s;
for (int i = 0; i < (int)s.size(); i += 2) {
if (s[i] == '0' && s[i + 1] == 'U') {
cout << "nn";
cont... | [["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 220 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string line;
cin >> line;
for (int i = 0; i < line.size(); i += 2) {
switch (line[i] - '0') {
case 1:
case 2:
cout << 'k';
break;
case 3:
cout << 's';
break;
case 4:
cout << 't';
br... | #include <iostream>
#include <string>
using namespace std;
int main() {
string line;
cin >> line;
for (int i = 0; i < line.size(); i += 2) {
switch (line[i] - '0') {
case 1:
break;
case 2:
cout << 'k';
break;
case 3:
cout << 's';
break;
case 4:
cout << 't';... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 99, 8, 9, 0, 100, 0, 93, 0, 94], ["+", 0, 99, 8, 9, 0, 100, 0, 93, 0, 35]] | 1 | 299 | 3 |
// AOJ 2418: Problem B War II
// 2017.12.2 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
int t[101], h[101];
int T, H;
int main() {
int n, L, i, tn, hn, sum, cng;
scanf("%d%d%d%d", &n, &T, &H, &L);
for (i = 0; i < n; i++)
scanf("%d%d", t + i, h + i);
for (tn = hn = 0, i = 0;; i++) {
if (i == n)
... | // AOJ 2418: Problem B War II
// 2017.12.2 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
int t[101], h[101];
int T, H;
int main() {
int n, L, i, tn, hn, sum, cng;
scanf("%d%d%d%d", &n, &T, &H, &L);
for (i = 0; i < n; i++)
scanf("%d%d", t + i, h + i);
for (tn = hn = 0, i = 0;; i++) {
if (i == n)
... | [["+", 8, 9, 0, 1, 0, 34, 12, 34, 0, 21], ["+", 0, 1, 0, 34, 12, 34, 12, 11, 31, 22], ["+", 0, 1, 0, 34, 12, 34, 12, 11, 17, 32], ["+", 0, 34, 12, 34, 12, 11, 12, 11, 31, 22], ["+", 0, 34, 12, 34, 12, 11, 12, 11, 17, 32], ["+", 0, 34, 12, 34, 12, 11, 12, 11, 12, 13]] | 0 | 278 | 6 |
t[99], h[99];
main(i, s, N, T, L) {
for (scanf("%d%d%d%d", &N, &T, &L, &L), i = 0; i++ < N;)
scanf("%d%d", t + i, h + i);
for (i = s = 0;; i = (i + 1) % N)
if (t[i]) {
t[i]--;
if (++T > L)
break;
if (++s == 9)
s = 0;
} else if (h[i]) {
h[i]--;
s++;
if ... | t[99], h[99];
main(i, s, N, T, L) {
for (scanf("%d%d%d%d", &N, &T, &L, &L), i = 0; i < N; i++)
scanf("%d%d", t + i, h + i);
for (i = s = 0;; i = (i + 1) % N)
if (t[i]) {
t[i]--;
if (++T > L)
break;
if (++s == 9)
s = 0;
} else if (h[i]) {
h[i]--;
s++;
i... | [["-", 0, 9, 0, 7, 15, 16, 31, 27, 17, 29], ["+", 0, 30, 0, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 30, 0, 9, 0, 7, 26, 27, 17, 29]] | 0 | 187 | 3 |
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, t, h, l, z = 0;
vector<int> vt(n + 1), vh(n + 1);
cin >> n >> t >> h >> l;
for (int i = 1; i <= n; i++) {
cin >> vt[i] >> vh[i];
}
while (1)
for (int i... | #include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, t, h, l, z = 0;
vector<int> vt(n + 1), vh(n + 1);
cin >> n >> t >> h >> l;
for (int i = 1; i <= n; i++) {
cin >> vt[i] >> vh[i];
}
while (1)
for (int i... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 237 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 351 | 6 |
#include <algorithm>
#include <cstdio>
#include <queue>
#include <stdexcept>
#include <utility>
#include <vector>
struct Person {
int id, t, h;
Person(int id, int t, int h) : id(id), t(t), h(h) {}
};
struct Machine {
int T, H, L;
int S = 0;
Machine(int T, int H, int L) : T(T), H(H), L(L) {}
std::pair<int,... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <stdexcept>
#include <utility>
#include <vector>
struct Person {
int id, t, h;
Person(int id, int t, int h) : id(id), t(t), h(h) {}
};
struct Machine {
int T, H, L;
int S = 0;
Machine(int T, int H, int L) : T(T), H(H), L(L) {}
std::pair<int,... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 476 | 4 |
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, T, H, L;
scanf("%d%d%d%d", &n, &T, &H, &L);
int t[100], h[100];
rep(i, n) scanf("%d%d", t + i, h + i);
int yen = 0;
while (1) {
rep(i, n) {
if (t[i] > 0) {
t[i]--;
T++;
... | #include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, T, H, L;
scanf("%d%d%d%d", &n, &T, &H, &L);
int t[100], h[100];
rep(i, n) scanf("%d%d", t + i, h + i);
int yen = 0;
while (1) {
rep(i, n) {
if (t[i] > 0) {
t[i]--;
T++;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]] | 1 | 302 | 4 |
#include <iostream>
using namespace std;
int main() {
int N, T, L;
int r;
int i;
cin >> N >> T >> T >> L;
int m[101], n[101];
for (i = 0; i < N; i++)
cin >> m[i] >> n[i];
i = r = 0;
while (1) {
if (m[i] + n[i] == 0)
break;
bool broken = false;
if (m[i]) {
m[i]--;
r += ... |
#include <iostream>
using namespace std;
int main() {
int N, T, L;
int r;
int i;
cin >> N >> T >> L >> L;
int m[101], n[101];
for (i = 0; i < N; i++)
cin >> m[i] >> n[i];
i = r = 0;
while (1) {
if (m[i] + n[i] == 0)
break;
bool broken = false;
if (m[i]) {
m[i]--;
r += ... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 221 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int dp[51][51][9];
fill(dp[0][0], dp[51][0], -(1 << 29));
dp[0][m][0] = 0;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
for (int j = 0; j <= m; j++) {
for (int k = 0; k <... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int dp[51][51][9];
fill(dp[0][0], dp[51][0], -(1 << 29));
dp[0][m][0] = 0;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
for (int j = 0; j <= m; j++) {
for (int k = 0; k <... | [["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 288 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define INF -50001
int main() {
int n, m;
cin >> n >> m;
// n本 i回目 残りk本
vector<vector<vector<int>>> dp(
n + 2, vector<vector<int>>(m + 1, vector<int>(9, INF)));
dp[0][m][0] = 0;
// for(int i=0;i<9;i++)for(int j=0;j<m+2;j++)for(int
// k=0;k<m+1;k++)cout<<... | #include <bits/stdc++.h>
using namespace std;
#define INF -50001
int main() {
int n, m;
cin >> n >> m;
// n本 i回目 残りk本
vector<vector<vector<int>>> dp(
n + 2, vector<vector<int>>(m + 1, vector<int>(9, INF)));
dp[0][m][0] = 0;
// for(int i=0;i<9;i++)for(int j=0;j<m+2;j++)for(int
// k=0;k<m+1;k++)cout<<... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 439 | 2 |
// Name: Code Art Online
// Level: 3
// Category: 幾何,Geometry,最小包含円,マッチング,辞書順最小
// Note:
/*
* まず、ある図形が穴を通れるかは、図形の最小包含円を求めて、その直径と穴の直径を比較すればよい。
*
* これを元に図形と円の二部グラフができるので、辞書順最小マッチングを求める。
* 左側のノード1を対応させる右側頂点をひとつ決めて、残りの頂点でマッチングができるなら採用、そうでなければ他の頂点を試す……という操作を繰り返せば良い。
*
* オーダーは O(MP log P + (NM)^2)。
* ただし、辞書順最小マッチングの実... | // Name: Code Art Online
// Level: 3
// Category: 幾何,Geometry,最小包含円,マッチング,辞書順最小
// Note:
/*
* まず、ある図形が穴を通れるかは、図形の最小包含円を求めて、その直径と穴の直径を比較すればよい。
*
* これを元に図形と円の二部グラフができるので、辞書順最小マッチングを求める。
* 左側のノード1を対応させる右側頂点をひとつ決めて、残りの頂点でマッチングができるなら採用、そうでなければ他の頂点を試す……という操作を繰り返せば良い。
*
* オーダーは O(MP log P + (NM)^2)。
* ただし、辞書順最小マッチングの実... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 11, 12, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 11, 12, 16, 12, 2, 3, 4, 0, 13]] | 1 | 839 | 4 |
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, nl, nr, i, j, max, q, count, d;
int[] c;
String s;
for (q = sc.nextInt(); q-- > 0; out.println(count)) {
n = sc.nextInt();
max = 0;
for... | public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, nl, nr, i, j, max, q, count, d;
int[] c;
String s;
for (q = sc.nextInt(); q-- > 0; out.println(count)) {
n = sc.nextInt();
max = 0;
for... | [["+", 0, 7, 8, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 17, 108], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 12, 499], ["+", 8, 196, 0, 7, 8, 196, 0, 1, 0, 35]] | 3 | 267 | 4 |
import java.util.Scanner;
import java.util.TreeSet;
import java.util.stream.IntStream;
public class Main {
static final Scanner s = new Scanner(System.in);
static int getInt() { return Integer.parseInt(s.next()); }
public static void main(String[] __) {
cases:
for (int q = getInt(); q > 0; q--) {
int... | import java.util.Scanner;
import java.util.TreeSet;
import java.util.stream.IntStream;
public class Main {
static final Scanner s = new Scanner(System.in);
static int getInt() { return Integer.parseInt(s.next()); }
public static void main(String[] __) {
cases:
for (int q = getInt(); q > 0; q--) {
int... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 0, 503, 49, 200, 51, 492, 3, 4, 0, 499]] | 3 | 267 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 516 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int N, M, a, tmp, cnt, maxm;
int used[100];
P t[100];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> t[i].first >> t[i].second;
for (int i = 0; i < M; i++)
used[i] = 0;
cnt = 0;
a = 1;
while (a !=... | #include <algorithm>
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int N, M, a, tmp, cnt, maxm;
int used[100];
P t[100];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> t[i].first >> t[i].second;
for (int i = 0; i < M; i++)
used[i] = 0;
cnt = 0;
a = 1;
while (a !=... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 229 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
int main() {
int N;
double R;
set<Pi> sets;
cin >> N >> R;
for (int i = 0; i < N; i++) {
double A, B;
cin >> A >> B;
sets.insert(make_pair((A + 1e7) / R, (B + 1e7) / R));
}
int ret = 0;
while (!sets.empty()) {
++re... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
int main() {
int N;
double R;
set<Pi> sets;
cin >> N >> R;
for (int i = 0; i < N; i++) {
double A, B;
cin >> A >> B;
sets.insert(make_pair((A + 1e6) / R, (B + 1e6) / R));
}
int ret = 0;
while (!sets.empty()) {
++re... | [["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 2, 3, 4, 0, 16, 31, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 16, 31, 118, 119, 120]] | 1 | 227 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const lli MAXN = 4004;
const lli INF = 1LL << 60;
lli N;
lli w[MAXN], dp[MAXN][MAXN], K[MAXN][MAXN];
int main() {
while (cin >> N) {
w[0] = 0;
for (lli i = 0; i < N; ++i) {
cin >> w[i + 1];
w[i + 1] += w[i];
}
fill(dp[... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const lli MAXN = 4004;
const lli INF = 1LL << 60;
lli N;
lli w[MAXN], dp[MAXN][MAXN], K[MAXN][MAXN];
int main() {
while (cin >> N) {
w[0] = 0;
for (lli i = 0; i < N; ++i) {
cin >> w[i + 1];
w[i + 1] += w[i];
}
fill(dp[... | [["+", 0, 7, 15, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 7, 15, 16, 31, 23, 0, 16, 12, 13]] | 1 | 317 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef string::const_iterator state;
string str;
string A, B;
string conv(string &S, int bit) {
string ret = S;
for (int i = 0; i < S.size(); i++) {
if ('a' <= S[i] && 'k' >= S[i]) {
ret[i] = ((bit >> (S[i] - 'a') & 1) ? '1' : '0');
}
}
return ret;
... | #include <bits/stdc++.h>
using namespace std;
typedef string::const_iterator state;
string str;
string A, B;
string conv(string &S, int bit) {
string ret = S;
for (int i = 0; i < S.size(); i++) {
if ('a' <= S[i] && 'k' >= S[i]) {
ret[i] = ((bit >> (S[i] - 'a') & 1) ? '1' : '0');
}
}
return ret;
... | [["-", 64, 9, 0, 37, 0, 16, 12, 2, 63, 22], ["+", 64, 9, 0, 37, 0, 16, 12, 2, 63, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 0, 101], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 64, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 0, 102], ["+", 0,... | 1 | 597 | 8 |
#include <functional>
#include <iostream>
#include <memory>
#include <string>
#include <unordered_set>
#include <vector>
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
template <typename A> using F = std::function<A>;
using namespace std;
template <typename T> struct ParseResult ... | #include <functional>
#include <iostream>
#include <memory>
#include <string>
#include <unordered_set>
#include <vector>
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
template <typename A> using F = std::function<A>;
using namespace std;
template <typename T> struct ParseResult ... | [["+", 51, 2, 3, 4, 0, 2, 63, 346, 141, 22], ["+", 3, 4, 0, 2, 63, 346, 3, 347, 0, 18], ["+", 0, 2, 63, 346, 3, 347, 0, 77, 39, 78], ["+", 3, 4, 0, 2, 63, 346, 3, 347, 0, 47], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 51, 2, 3, 4, 0, 2, 3, 4, 0, 24]] | 1 | 2,031 | 6 |
T=!!0
F=!T
[T,F].map{|c|
class<<c
alias:%:==
def!=x
!self|x
end
end
}
until gets<?#
puts (0..2047).all?{|x|
eval $_.tr"-=>*+abcdefghijk","!%=&|"+("%011b"%x).tr("01","TF")
}?'YES':'NO'
end | T=!!0
F=!T
[T,F].map{|c|
class<<c
alias:%:==
def!=x
!self|x
end
end
}
until gets=~/#/
puts (0..2047).all?{|x|
eval $_.tr"-=>*+abcdefghijk","!%=&|"+("%011b"%x).tr("01","TF")
}?'YES':'NO'
end | [["-", 36, 36, 0, 493, 0, 750, 15, 738, 17, 18], ["-", 36, 36, 0, 493, 0, 750, 15, 738, 12, 125], ["+", 36, 36, 0, 493, 0, 750, 15, 738, 17, 774], ["+", 0, 493, 0, 750, 15, 738, 12, 575, 0, 85], ["+", 0, 493, 0, 750, 15, 738, 12, 575, 0, 6]] | 4 | 93 | 6 |
T=!!0
F=!T
[T,F].map{|c|
class<<c
alias:%:==
def!=x
!self|x
end
end
}
until gets<?#
puts (0..2047).all?{|x|
eval $_.tr"-=>*+abcdefghijk","!%=&|"+("%011b"%x).tr("01","TF")
}?'YES':'NO'
end | T=!!0
F=!T
[T,F].map{|c|
class<<c
alias:%:==
def!=x
!self|x
end
end
}
until/#/=~gets
puts (0..2047).all?{|x|
eval$_.tr"-=>*+abcdefghijk","!%=&|"+("%011b"%x).tr("01","TF")
}?'YES':'NO'
end | [["+", 0, 493, 0, 750, 15, 738, 31, 575, 0, 85], ["+", 0, 493, 0, 750, 15, 738, 31, 575, 0, 6], ["+", 36, 36, 0, 493, 0, 750, 15, 738, 17, 774], ["-", 36, 36, 0, 493, 0, 750, 15, 738, 17, 18], ["-", 36, 36, 0, 493, 0, 750, 15, 738, 12, 125]] | 4 | 93 | 6 |
# -*- coding: utf-8 -*-
from itertools import product
"""
-> は @と表記する
"""
def parse(S):
"""
構文木を返す
Sは普通の記法の式
opは優先順序 通常は(*/: 1, +-: 2)
"""
S = "{}".format(S)
V = []
op = {"-": 1,
"+": 2,
"*": 2,
"@": 2}
variables = list("abcdefghijk")
for x in list... | # -*- coding: utf-8 -*-
from itertools import product
"""
-> は @と表記する
"""
def parse(S):
"""
構文木を返す
Sは普通の記法の式
opは優先順序 通常は(*/: 1, +-: 2)
"""
S = "{}".format(S)
V = []
op = {"-": 1,
"+": 2,
"*": 2,
"@": 2}
variables = list("abcdefghijk")
for x in list... | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 734 | 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>
// C++11
#if __cplusplus == 201103L
#include <tuple>
#endif
using n... | #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>
// C++11
#if __cplusplus == 201103L
#include <tuple>
#endif
using n... | [["-", 64, 9, 0, 1, 0, 11, 12, 16, 31, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 13], ["-", 51, 91, 28, 23, 0, 16, 31, 16, 17, 151], ["+", 51, 91, 28, 23, 0, 16, 31, 16, 17, 152]] | 1 | 655 | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.