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 |
|---|---|---|---|---|---|
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | [["+", 12, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 713 | 2 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
struct UnionFind {
Int n;
vector<Int> r, p;
UnionFind() {}
UnionFind(Int sz) : n(sz), r(sz, 1), p(sz, 0) { iota(p.begin(), p.end(), 0); }
Int find(Int x) { return (x == p[x] ? x : p[x] = find(p[x])); }
bool same(Int x, Int y) { return fin... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
struct UnionFind {
Int n;
vector<Int> r, p;
UnionFind() {}
UnionFind(Int sz) : n(sz), r(sz, 1), p(sz, 0) { iota(p.begin(), p.end(), 0); }
Int find(Int x) { return (x == p[x] ? x : p[x] = find(p[x])); }
bool same(Int x, Int y) { return fin... | [["+", 49, 50, 51, 16, 12, 16, 12, 91, 17, 111], ["+", 51, 16, 12, 16, 12, 91, 28, 91, 17, 111]] | 1 | 1,322 | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | [["-", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 13]] | 1 | 416 | 2 |
import java.util.*;
class Main {
public class T {
int a, b, c;
T(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N, M;
N = sc.nextInt();
M = sc.nextInt();
int[][][] ne... | import java.util.*;
class Main {
public class T {
int a, b, c;
T(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N, M;
M = sc.nextInt();
N = sc.nextInt();
int[][][] ne... | [["-", 0, 195, 8, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 11, 31, 22]] | 3 | 606 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 56, 49, 185, 54, 55, 0, 56, 39, 78], ["+", 0, 56, 49, 185, 54, 55, 0, 56, 39, 78], ["-", 64, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14,... | 1 | 564 | 10 |
#include <iostream>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define F first
#define S second
typedef pair<int, int> P;
int n, m, x, y, K, a[102][102], flag, amin[102][102], amax[102][102];
string s;
vector<P> v1[102], v2[102];
bool ch() {
r(i, m) {
r(j, v1[i].size()) {
... | #include <iostream>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define F first
#define S second
typedef pair<int, int> P;
int n, m, x, y, K, a[102][102], flag, amin[102][102], amax[102][102];
string s;
vector<P> v1[102], v2[102];
bool ch() {
r(i, m) {
r(j, v1[i].size()) {
... | [["-", 75, 76, 0, 9, 0, 1, 0, 16, 17, 60], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 1, 0, 16, 12, 23, 0, 41, 75, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 75, 13], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 639 | 6 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
const string GL = ">=";
int n, m;
cin >> m >> n;
vector<vector<int>> g(m, vector<int>(n, 0));
vector<vector<int>> l(m, vector<int>(n, 100));
for (int i = 0; i < m; i++) {
int k;
... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
const string GL = ">=";
int n, m;
cin >> m >> n;
vector<vector<int>> g(m, vector<int>(n, 0));
vector<vector<int>> l(m, vector<int>(n, 100));
for (int i = 0; i < m; i++) {
int k;
... | [["-", 0, 57, 15, 339, 51, 69, 341, 342, 0, 22], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 22]] | 1 | 437 | 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" > "d:... | #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" > "d:... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 146], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 1,271 | 6 |
// template {{{
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define GET_MACRO(a, b, c, d, NAME, ...) NAME
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, a, b) REP4(i, a, b, 1)
#define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += s)
#define RREP2(i, ... | // template {{{
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define GET_MACRO(a, b, c, d, NAME, ...) NAME
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, a, b) REP4(i, a, b, 1)
#define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += s)
#define RREP2(i, ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 1,474 | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct edge {
int from, to, id;
ll cost;
edge(int f, int t, int i, ll c) : from(f), to(t), id(i), cost(c) {}
bool operator<(const edge &that) const { return cost < that.cost; }
};
using edges = vector<edge>;
class union_find {
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct edge {
int from, to, id;
ll cost;
edge(int f, int t, int i, ll c) : from(f), to(t), id(i), cost(c) {}
bool operator<(const edge &that) const { return cost < that.cost; }
};
using edges = vector<edge>;
class union_find {
vector<int> ... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["-", 0, 358, 0, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 358, 0, 4, 0, 2, 3, 4, 0, 22]] | 1 | 1,727 | 4 |
from string import digits
from itertools import product
S = input() + "$"
def parse(pri):
code = "+-*"
cur = 0
def number():
nonlocal cur
c = S[cur]
if c == '(':
cur += 1 # '('
v = expr(0)
cur += 1 # ')'
return v
num = 0
... | from string import digits
from itertools import product
S = input() + "$"
def parse(pri):
code = "+-*"
cur = 0
def number():
nonlocal cur
c = S[cur]
if c == '(':
cur += 1 # '('
v = expr(0)
cur += 1 # ')'
return v
num = 0
... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 17, 33], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 31, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 17, 578], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 12, 612]] | 5 | 236 | 5 |
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef unsigned long long wolf;
char S[310000];
char T[310000];
long long pow[310000];
wolf P = 1299709;
// long long mod=1145148931919LL;
int main() {
scanf("%s%s", S, T);
int n = strlen(S);
int m = strlen(T);
p... | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef unsigned long long wolf;
char S[310000];
char T[310000];
long long pow[310000];
wolf P = 1299709;
// long long mod=1145148931919LL;
int main() {
scanf("%s%s", S, T);
int n = strlen(S);
int m = strlen(T);
p... | [["-", 0, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["-", 12, 16, 31, 23, 0, 16, 12, 103, 0, 104], ["-", 12, 16, 31, 23, 0, 16, 12, 103, 0, 125]] | 1 | 451 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
unsigned long long h = 0;
unsigned long long B = 31;
for (int i = 0; i < T.size(); i++) {
h = h * B + T[i];
}
vector<unsigned long long> hashes;
unsigned long long b = 1;
for ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
unsigned long long h = 0;
unsigned long long B = 99999999943ULL;
for (int i = 0; i < T.size(); i++) {
h = h * B + T[i];
}
vector<unsigned long long> hashes;
unsigned long long b... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 345 | 2 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, k;
int rk[300100];
int tmp[300100];
bool compare_sa(int i, int j) {
if (rk[i] != rk[j])
return rk[i] < rk[j];
int ri, rj;
ri = i + k <= n ? rk[i + k] : -1;
rj = j + k <= n ? rk[j + k... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, k;
int rk[300100];
int tmp[300100];
bool compare_sa(int i, int j) {
if (rk[i] != rk[j])
return rk[i] < rk[j];
int ri, rj;
ri = i + k <= n ? rk[i + k] : -1;
rj = j + k <= n ? rk[j + k... | [["-", 8, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["-", 0, 11, 12, 16, 31, 16, 12, 103, 0, 104], ["-", 0, 11, 12, 16, 31, 16, 12, 103, 0, 125]] | 1 | 922 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define MAX_N 300005
ull B = 5575777;
ull mem[MAX_N];
ull pow(int x) {
if (x == 0)
return 1;
if (mem[x] > 0)
return mem[x];
if (x & 1)
return mem[x] = pow(x - 1) * B;
mem[x] = pow(x / 2);
mem[x] *= mem[x];
return mem... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define MAX_N 300005
ull B = 5575777;
ull mem[MAX_N];
ull pow(int x) {
if (x == 0)
return 1;
if (mem[x] > 0)
return mem[x];
if (x & 1)
return mem[x] = pow(x - 1) * B;
mem[x] = pow(x / 2);
mem[x] *= mem[x];
return mem... | [["+", 0, 7, 15, 16, 12, 16, 31, 16, 17, 33], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 596 | 4 |
#include <algorithm>
#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 < (n); i++)
#define all(c) (c).begin(),... | #include <algorithm>
#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 < (n); i++)
#define all(c) (c).begin(),... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 939 | 2 |
#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) : (b... | #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) : (b... | [["-", 12, 2, 3, 4, 0, 16, 31, 16, 31, 22], ["-", 12, 2, 3, 4, 0, 16, 31, 16, 17, 72]] | 1 | 1,240 | 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;
// namespace cent {
//
// struct Edge {
// int src;
// int dst;
// long long int cost;
// };
// using Graph = vector<vector<Edge>>;
//
// class... | #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;
// namespace cent {
//
// struct Edge {
// int src;
// int dst;
// long long int cost;
// };
// using Graph = vector<vector<Edge>>;
//
// class... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 1,221 | 2 |
import sys
sys.setrecursionlimi(9999)
def dfs(i, z):
print("." * z + name[i])
for j in child[i]:
dfs(j, z + 1)
n = int(input())
name = []
child = [[] for i in range(n)]
for i in range(n):
k = int(input())
m = input()
name.append(m)
if k == 0: continue
child[k - 1].append(i)
dfs(0, ... | import sys
sys.setrecursionlimit(9999)
def dfs(i, z):
print("." * z + name[i])
for j in child[i]:
dfs(j, z + 1)
n = int(input())
name = []
child = [[] for i in range(n)]
for i in range(n):
k = int(input())
m = input()
name.append(m)
if k == 0: continue
child[k - 1].append(i)
dfs(0,... | [["-", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 120 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 505
#define INF (1 << 24)
typedef pair<int, int> P;
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
int W, H, N, sy, sx, ty, tx;
int t[MAX][MAX][2];
int d[MAX][MAX];
int change(char ch) {
if (ch == 'U')
return 0;
if (ch == 'R')
return 1;
retur... | #include <bits/stdc++.h>
using namespace std;
#define MAX 505
#define INF (1 << 30)
typedef pair<int, int> P;
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
int W, H, N, sy, sx, ty, tx;
int t[MAX][MAX][2];
int d[MAX][MAX];
int change(char ch) {
if (ch == 'U')
return 0;
if (ch == 'R')
return 1;
retur... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 761 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 104], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 824 | 12 |
#include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
int n, ret, res, ptr;
tuple<int, int, int> d[100000];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d%d%d", &get<0>(d[i]), &get<1>(d[i]), &get<2>(d[i]));
sort(d, d + n);
for (int i = 0; i < n; i++) {
res = ... | #include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
int n, ret, res, ptr;
tuple<int, int, int> d[100000];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d%d%d", &get<0>(d[i]), &get<1>(d[i]), &get<2>(d[i]));
sort(d, d + n);
for (int i = 0; i < n; i++) {
res = ... | [["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 823 | 2 |
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
struct Info1 {
Info1(int arg_x, int arg_y, int arg_w) {
x = arg_x;
y = arg_y;
w = arg_w;
}
bool operator<(const struct... | #include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
struct Info1 {
Info1(int arg_x, int arg_y, int arg_w) {
x = arg_x;
y = arg_y;
w = arg_w;
}
bool operator<(const struct... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18]] | 1 | 1,232 | 2 |
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#defin... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#defin... | [["-", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["-", 0, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 31, 22]] | 1 | 506 | 12 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 676 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for ... | [["+", 64, 9, 0, 37, 0, 11, 31, 69, 28, 22], ["+", 0, 37, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 37, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 37, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 64, 9, 0, 37, 0, 11, 17, 32]] | 1 | 1,319 | 5 |
#include <stdio.h>
int main(void) {
int a, b, c, t = 0;
scanf("%d%d%d", &a, &b, &c);
while (t <= 3600) {
if (t + a >= c) {
t = c;
break;
} else {
t += (a + b);
c += 60;
}
}
if (t > 3600) {
printf("-1\n");
} else {
printf("%d\n", t);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, t = 0;
scanf("%d%d%d", &a, &b, &c);
while (t <= 3600) {
if (t + a >= c) {
t = c;
break;
} else {
t += (a + b);
if (t > c)
c += 60;
}
}
if (t > 3600) {
printf("-1\n");
} else {
printf("%d\n", t);
}
retur... | [["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 23, 0, 24], ["+", 0, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 75, 76, 0, 9, 0, 57, 15, 23, 0, 25]] | 0 | 107 | 6 |
#include <stdio.h>
int main(void) {
int a, b, c, sign, sign1 = 0, time, t, sum;
scanf("%d %d %d", &a, &b, &c);
if (!(60 % (a + b)))
sign1 = 1;
for (time = 0, t = 0, sign = 0;; sign = 1 - sign) {
if (!sign) {
time += a;
} else {
time += b;
}
if (time >= c && time - a <= c && !sig... | #include <stdio.h>
int main(void) {
int a, b, c, sign, sign1 = 0, time, t, sum;
scanf("%d %d %d", &a, &b, &c);
if (!(60 % (a + b)))
sign1 = 1;
for (time = 0, t = 0, sign = 0;; sign = 1 - sign) {
if (!sign) {
time += a;
} else {
time += b;
}
if (time >= c && time - a <= c && !sig... | [["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 24], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 98], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 25]] | 0 | 193 | 4 |
#include <iostream>
using namespace std;
int gcd(int m, int n) {
if ((0 == m) || (0 == n))
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
int lcm(int m, int n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
int solve(int ... | #include <iostream>
using namespace std;
int gcd(int m, int n) {
if ((0 == m) || (0 == n))
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
int lcm(int m, int n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
int solve(int ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 210 | 2 |
#include <iostream>
int main() {
int n, m, b, c;
std::cin >> n >> m >> b;
c = b;
for (int i = 0; i < 199999999; i++) {
if (c % (n + m) <= n) {
goto a;
}
c += 60;
}
c = -1;
a:
std::cout << c << "\n";
return 0;
} | #include <iostream>
int main() {
int n, m, b, c;
std::cin >> n >> m >> b;
c = b;
for (int i = 0; i < 99; i++) {
if (c % (n + m) <= n)
goto a;
c += 60;
}
c = -1;
a:
std::cout << c << "\n";
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 87 | 11 |
#include <iostream>
main() {
int n, m, b, c, i;
std::cin >> n >> m >> b;
c = b;
for (i = 0; i < 99; i++)
if (c % (n + m) <= n)
goto a;
c += 60;
c = -1;
a:
std::cout << c << "\n";
} | #include <iostream>
main() {
int n, m, b, c, i;
std::cin >> n >> m >> b;
c = b;
for (i = 0; i < 99; i++) {
if (c % (n + m) <= n)
goto a;
c += 60;
}
c = -1;
a:
std::cout << c << "\n";
} | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 80 | 10 |
#include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = ... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = ... | [["-", 0, 57, 15, 339, 51, 69, 341, 342, 0, 22], ["+", 0, 57, 15, 339, 51, 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 | 141 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = -1, sum = 0, cnt = 0;
while (ans == -1 && cnt++ < 10000000) {
if (sum % 60 + a < c)
sum += a + b;
else
ans = sum + (c - sum % 60);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = -1, sum = 0, cnt = 0;
while (ans == -1 && cnt++ < 10000000) {
if (sum % 60 + a < c || sum % 60 > c)
sum += a + b;
else
ans = sum + (c - sum % 60);
}
cout << ans << endl;
return 0;
} | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, 109], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 91 | 6 |
#include <iostream>
using namespace std;
int GCD(int m, int n) {
if (n == 0)
return m;
return GCD(n, m % n);
}
int main() {
int a, b, c, gcd, n, res = -1;
cin >> a >> b >> c;
gcd = GCD(60, c);
n = 60 / gcd;
for (int i = 0; i < n; i++) {
if ((c + 60 * i) % (a + b) >= 0 && (c + 60 * i) % (a + b) <... | #include <iostream>
using namespace std;
int GCD(int m, int n) {
if (n == 0)
return m;
return GCD(n, m % n);
}
int main() {
int a, b, c, gcd, n, res = -1;
cin >> a >> b >> c;
gcd = GCD(60, c);
n = 60 / gcd + (a + b);
for (int i = 0; i < n; i++) {
if ((c + 60 * i) % (a + b) >= 0 && (c + 60 * i) %... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 72], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 151 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, i, j, s = 0, s2 = 0, k = 0;
cin >> a >> b >> c;
for (i = 1; i < 120; i++) {
s = 0;
for (j = 1; j <= 60; j++) {
s += a + b;
if (s - b - b <= c && s - b >= c) {
k++;
break;
}
}
if (k == 1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, i, j, s = 0, s2 = 0, k = 0;
cin >> a >> b >> c;
for (i = 1; i < 120; i++) {
s = 0;
for (j = 1; j <= 60; j++) {
s += a + b;
if (s - a - b <= c && s - b >= c) {
k++;
break;
}
}
if (k == 1)
... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 138 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | [["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25]] | 1 | 163 | 6 |
def solve(a, b, c):
l = 0; r = a;
for t in range(50):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print(-1)
a, b, c = map(int, input().split())
solve(a,b,c) | def solve(a, b, c):
l = 0; r = a;
t = 0
for i in range(80):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print(-1)
a, b, c = map(int, input().split())
solve(a,b,c) | [["-", 0, 656, 0, 14, 8, 196, 0, 7, 0, 88], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 14, 8, 196, 0, 7, 0, 88], ["+", 0, 656, 0, 14, 8, 196, 0, 7, 31, 22], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 93 | 7 |
a, b, c = list(map(int, input().split()))
#if(a | b | c == 0):break
canArrive = False
i = 0
now = 0
while True:
if now % 60 <= c and c <= (now + a) % 60:
canArrive = True
break
#end if
now += (a + b)
if now % 60 == 0 : break
#end while
if canArrive:
print(c + 60 * (now // 60))
els... |
a, b, c = list(map(int, input().split()))
#if(a | b | c == 0):break
canArrive = False
i = 0
now = 0
while True:
if now % 60 <= c and c <= now % 60 + a:
canArrive = True
break
#end if
now += (a + b)
if now % 60 == 0 : break
#end while
if canArrive:
print(c + 60 * (now // 60))
else:... | [["-", 15, 679, 12, 666, 0, 657, 31, 23, 0, 24], ["-", 12, 666, 0, 657, 31, 23, 0, 657, 17, 72], ["-", 12, 666, 0, 657, 31, 23, 0, 657, 12, 22], ["-", 15, 679, 12, 666, 0, 657, 31, 23, 0, 25], ["+", 0, 57, 15, 679, 12, 666, 0, 657, 17, 72], ["+", 0, 57, 15, 679, 12, 666, 0, 657, 12, 22]] | 5 | 96 | 6 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdio.h>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdio.h>
#include <string>
#include <vector>
using na... | [["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13]] | 1 | 2,758 | 6 |
#include <cmath>
#include <iostream>
#include <queue>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
struct state {
int y, x, d, hy, hx, n;
bool operator<(const state &s) const { return n > s.n; }
};
int N, M, D, SY, SX, GY, GX;
char S[52][52];
int dd[5] = {0, 1, 0, -1, 0};
bo... | #include <cmath>
#include <iostream>
#include <queue>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
struct state {
int y, x, d, hy, hx, n;
bool operator<(const state &s) const { return n > s.n; }
};
int N, M, D, SY, SX, GY, GX;
char S[52][52];
int dd[5] = {0, 1, 0, -1, 0};
bo... | [["-", 28, 69, 28, 2, 3, 4, 0, 16, 31, 22], ["+", 28, 69, 28, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]] | 1 | 1,152 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef valarray<double> Point;
double dot(const Point &a, const Point &b) { return (a * b).sum(); }
double dist2(const Point &a, const Point &b) { return dot(a - b, a - b); }
int n, q;
Point p[50];
double r[50];
long long l[50];
Point s, t;
int calc() {
static const... | #include <bits/stdc++.h>
using namespace std;
typedef valarray<double> Point;
double dot(const Point &a, const Point &b) { return (a * b).sum(); }
double dist2(const Point &a, const Point &b) { return dot(a - b, a - b); }
int n, q;
Point p[50];
double r[50];
long long l[50];
Point s, t;
long long calc() {
static... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]] | 1 | 426 | 3 |
/*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#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)
#define rp(a) while (a--)
#... | /*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#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)
#define rp(a) while (a--)
#... | [["+", 51, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 72], ["+", 51, 16, 31, 16, 12, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 16, 12, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72]] | 1 | 3,923 | 6 |
// i??\??????i *
// P??????????????????????????????????????´????????????????°????????????????????§£?????????????????????????????????????????£??¨??????????????§????????????????§£?????????
#include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int n, p, q;
int c[500000];
int rc[500001];
sig... | // i??\??????i *
// P??????????????????????????????????????´????????????????°????????????????????§£?????????????????????????????????????????£??¨??????????????§????????????????§£?????????
#include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int n, p, q;
int c[500000];
int rc[500001];
sig... | [["+", 49, 50, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48]] | 1 | 211 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, p, Q;
ll calc(ll a, ll l, ll n) { return (a + l) * n / 2; }
int main() {
cin >> n >> p >> Q;
vector<ll> V;
for (int i = 0; i < n; i++) {
ll C;
cin >> C;
V.push_back(C - p * (Q + i) - 2 * p * (n - i - 1));
}
sort(V.begin(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, p, Q;
ll calc(ll a, ll l, ll n) { return (a + l) * n / 2; }
int main() {
cin >> n >> p >> Q;
vector<ll> V;
for (int i = 0; i < n; i++) {
ll C;
cin >> C;
V.push_back(C - p * (Q + i) - 2 * p * (n - i - 1));
}
sort(V.begin(... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 11, 12, 16, 12, 16, 31, 16, 31, 13], ["+", 0, 11, 12, 16, 12, 16, 31, 16, 17, 48], ["+", 0, 11, 12, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 22]] | 1 | 199 | 6 |
#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)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 500005;
int main() {
int n, p, q;
ll a[MAX_N];
scanf("%d%d%d", &n, &p, &q);
rep(i,... | #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)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 500005;
int main() {
int n, p, q;
ll a[MAX_N];
scanf("%d%d%d", &n, &p, &q);
rep(i,... | [["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 24], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25]] | 1 | 238 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
typedef long long LL;
int main() {
int n, p, q;
cin >> n >> p >> q;
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
c[i] += i * p;
}
sort(c.begin(), c.end(), greater<int>());
LL ans = (q * n + n... | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
typedef long long LL;
int main() {
LL n, p, q;
cin >> n >> p >> q;
vector<LL> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
c[i] += i * p;
}
sort(c.begin(), c.end(), greater<int>());
LL ans = (q * n + n *... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16,... | 1 | 212 | 10 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_ba... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_ba... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 13]] | 1 | 1,329 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 57, 64, 116, 0, 117]] | 1 | 2,084 | 5 |
#include "bits/stdc++.h"
using namespace std;
const int mod = 2;
struct Mod {
public:
int num;
Mod() : Mod(0) { ; }
Mod(long long int n) : num((n % mod + mod) % mod) {
static_assert(mod < INT_MAX / 2,
"mod is too big, please make num 'long long int' from 'int'");
}
Mod(int n) : Mod(stat... | #include "bits/stdc++.h"
using namespace std;
const int mod = 2;
struct Mod {
public:
int num;
Mod() : Mod(0) { ; }
Mod(long long int n) : num((n % mod + mod) % mod) {
static_assert(mod < INT_MAX / 2,
"mod is too big, please make num 'long long int' from 'int'");
}
Mod(int n) : Mod(stat... | [["-", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22]] | 1 | 3,518 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | [["-", 0, 14, 8, 9, 0, 9, 0, 57, 0, 121], ["-", 8, 9, 0, 9, 0, 57, 15, 339, 0, 24], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 9, 0, 57, 15, 339, 0, 25]] | 1 | 148 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii... | [["-", 0, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["+", 0, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 74, 0, 24], ["+", 3, 4, 0, 16, 31, 74, 39, 77, 39, 78], ["+", 0, 2, 3, 4, 0, 16, 31, 74, 0, 25], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 235 | 7 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long double d;
cin >> d;
cout.precision(12);
cout << fixed;
cout << max((ceil(d)), d * sqrt(2)) << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long double d;
cin >> d;
cout.precision(12);
cout << fixed;
cout << max((floor(d) + 1), d * sqrt(2)) << endl;
return 0;
} | [["-", 12, 2, 3, 4, 0, 23, 0, 2, 63, 22], ["+", 3, 4, 0, 23, 0, 16, 31, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 23, 0, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 23, 0, 16, 12, 13]] | 1 | 57 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double d;
cin >> d;
cout << fixed << setprecision(10)
<< max(d * 1.4142135623730950488, round(d) + 1.0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double d;
cin >> d;
cout << fixed << setprecision(10)
<< max(d * 1.4142135623730950488, floor(d) + 1.0) << endl;
return 0;
} | [["-", 12, 2, 3, 4, 0, 16, 31, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 16, 31, 2, 63, 22]] | 1 | 47 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double d;
cin >> d;
cout << fixed << setprecision(10) << max(sqrt(2) * d, d + 1.0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double d;
cin >> d;
cout << fixed << setprecision(10) << max(sqrt(2) * d, (int)d + 1.0) << endl;
} | [["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 24], ["+", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 25]] | 1 | 58 | 3 |
#include "bits/stdc++.h"
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2629&lang=jp
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double d;
cin >> d;
cout << fixed << setprecision(10) << max(sqrt(2) * d, d + 1.0) << endl;
} | #include "bits/stdc++.h"
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2629&lang=jp
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double d;
cin >> d;
cout << fixed << setprecision(10) << max(sqrt(2) * d, (int)d + 1.0) << endl;
} | [["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 24], ["+", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 25]] | 1 | 61 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int M = 1000000007;
int main() {
double d;
cin >> d;
int di = (int)d;
printf("%.12lf\n", max(max(sqrt(d * d - di * di), 1.0), d * sqrt(2)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int M = 1000000007;
int main() {
double d;
cin >> d;
int di = (int)d;
printf("%.12lf\n", max(max(sqrt(d * d - di * di), 1.0) + di, d * sqrt(2.0)));
return 0;
} | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 22], ["-", 3, 4, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 13]] | 1 | 79 | 4 |
#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<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, ... |
#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<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, ... | [["-", 31, 16, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 16, 31, 2, 63, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 173 | 4 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double d;
cin >> d;
if (d >= 1.0 && d <= sqrt(2)) {
d = 2.0;
} else if (d >= 2.0 && d <= 2.0 * sqrt(2)) {
d = 4.0;
} else {
d *= sqrt(2);
}
cout << setprecision(10) << d << endl;
return 0;
}
| #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double d;
cin >> d;
if (d >= 1.0 && d <= sqrt(2)) {
d = 2.0;
} else if (d >= 2.0 && d <= 3.0 * sqrt(2) / 2.0) {
d = 3.0;
} else {
d *= sqrt(2);
}
cout << setprecision(10) << d << endl;
return 0;
}
| [["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 13], ["+", 51, 16, 12, 16, 12, 16, 31, 16, 31, 13], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 85], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 88 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
float d;
cin >> d;
cout << fixed << setprecision(9) << max(d + 1, 2 * sqrt(d * d / 2)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double d;
cin >> d;
cout << fixed << setprecision(9) << max(floor(d) + 1, 2 * sqrt(d * d / 2))
<< endl;
return 0;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 12, 2, 3, 4, 0, 16, 31, 2, 63, 22], ["+", 3, 4, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 3, 4, 0, 16, 31, 2, 3, 4, 0, 25]] | 1 | 51 | 5 |
import math
d = float(input())
ans = math.sqrt(2) * d
for x in range(1, 11):
if x * x <= d * d <= x * 2 + 1:
ans = max(ans, d + 1.0)
print("%.10f" % ans) | import math
d = float(input())
ans = math.sqrt(2) * d
for x in range(1, 11):
if x * x <= d * d <= x * 2 + 1:
ans = max(ans, x + 1)
print("%.10f" % ans) | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 657, 12, 531], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 63 | 4 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// cin.sync_with_stdio(false);
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// cin.sync_with_stdio(false);
... | [["+", 64, 1, 0, 11, 12, 16, 12, 16, 17, 33], ["+", 64, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 679 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | [["-", 8, 9, 0, 57, 64, 37, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 37, 0, 16, 17, 33], ["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 625 | 4 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_se... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_se... | [["+", 51, 23, 0, 16, 31, 23, 0, 16, 17, 140], ["+", 51, 23, 0, 16, 31, 23, 0, 16, 12, 22]] | 1 | 4,427 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | [["-", 51, 218, 8, 9, 0, 37, 0, 16, 17, 19], ["+", 51, 218, 8, 9, 0, 37, 0, 16, 17, 20]] | 1 | 1,629 | 2 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define MAX_N 400050
int N, dat[2][2 * MAX_N - 1];
void init(int n_) {
N = 1;
while (N < n_)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++) {
dat[0][i] = INT_MAX;
dat[1][i] = INT_MIN;
}
}
void update(int k, int a) {
k += N - 1;
da... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define MAX_N 400050
int N, dat[2][2 * MAX_N - 1];
void init(int n_) {
N = 1;
while (N < n_)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++) {
dat[0][i] = INT_MAX;
dat[1][i] = INT_MIN;
}
}
void update(int k, int a) {
k += N - 1;
da... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12,... | 1 | 2,685 | 8 |
#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>
#in... | #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>
#in... | [["-", 51, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 328 | 4 |
#include <iostream>
using namespace std;
#define MAX_N 150
#define INF 9999999999LL
long long p[MAX_N];
long long x[MAX_N][MAX_N];
long long z[MAX_N][2];
long long N, M, D;
long long gcd(long long X, long long Y) { return Y ? gcd(Y, X % Y) : X; }
int main() {
cin >> N >> M >> D;
for (int i = 0; i < M; i++) {
... | #include <iostream>
using namespace std;
#define MAX_N 150
#define INF 9999999999LL
long long p[MAX_N];
long long x[MAX_N][MAX_N];
long long z[MAX_N][2];
long long N, M, D;
long long gcd(long long X, long long Y) { return Y ? gcd(Y, X % Y) : X; }
int main() {
cin >> N >> M >> D;
for (int i = 0; i < M; i++) {
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 426 | 2 |
#include <bits/stdc++.h>
#define int long long
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
struct NT {
ll m; // mod
vector<bool> ismrime;
vector<ll> euler;
vector<ll> fact;
NT(ll MOD) {
m = MOD;
fact.resize(500005);
fact[0] = 1;
for (ll i = 1; i < 5... | #include <bits/stdc++.h>
#define int long long
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
struct NT {
ll m; // mod
vector<bool> ismrime;
vector<ll> euler;
vector<ll> fact;
NT(ll MOD) {
m = MOD;
fact.resize(500005);
fact[0] = 1;
for (ll i = 1; i < 5... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 108]] | 1 | 1,702 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#pragma warning(disable : 4996)
using namespace std;
// ------ Defines ------ //
#define Point complex<long double>
#define px real()
#define py imag()
// ------ Classes ------ //
class Segment {
public:
Point p1, p2;
Segment(Point p1_, Poin... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#pragma warning(disable : 4996)
using namespace std;
// ------ Defines ------ //
#define Point complex<long double>
#define px real()
#define py imag()
// ------ Classes ------ //
class Segment {
public:
Point p1, p2;
Segment(Point p1_, Poin... | [["-", 31, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 31, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["-", 341, 342, 0, 16, 31, 69, 341, 342, 0, 13], ["+", 341, 342, 0, 16, 31, 69, 341, 342, 0, 13], ["-", 12, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 12, 11, 31, 69, 28, 69, 341, 342, 0, 13]] | 1 | 1,277 | 12 |
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] f = new int[n][5];
double AM = -1;
double BM = -1;
double A = -1;
double B = -1... | import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] f = new int[n][5];
double AM = -1;
double BM = -1;
double A = -1;
double B = -1... | [["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 45], ["+", 0, 57, 64, 196, 0, 57, 64, 196, 0, 46], ["+", 0, 7, 8, 196, 0, 57, 75, 196, 0, 45], ["+", 0, 57, 75, 196, 0, 57, 64, 196, 0, 46]] | 3 | 435 | 4 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#inclu... | #include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#inclu... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 381 | 8 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 19]] | 1 | 210 | 4 |
// {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9... | 1 | 159 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int d, e;
double mi = 10000.0;
double y;
while (1) {
cin >> d >> e;
if (d == 0 && e == 0)
break;
for (int i = 0, j = d; i < d; i++, j--) {
y = sqrt(i * i + j * j);
mi = min... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int d, e;
double mi = 10000.0;
double y;
while (1) {
mi = 10000;
cin >> d >> e;
if (d == 0 && e == 0)
break;
for (int i = 0, j = d; i < d; i++, j--) {
y = sqrt(i * i + j * j)... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 118 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (1) {
cin >> d >> e;
if (d + e == 0)
break;
double a, min = 1000000;
for (int i = 1; i <= d / 2; i++) {
a = sqrt((d - i) * (d - i) + i * i);
if (min > abs(e - a))
min = ... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (1) {
cin >> d >> e;
if (d + e == 0)
break;
double a, min = 1000000;
for (int i = 0; i <= d / 2; i++) {
a = sqrt((d - i) * (d - i) + i * i);
if (min > abs(e - a))
min = ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 122 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (1) {
cin >> d >> e;
if (d + e == 0)
break;
double a, min = 1000000;
for (int i = 1; i <= d / 2; i++) {
a = sqrt((d - i) * (d - i) + i * i);
if (min > abs(e - a))
min = abs(e - a);
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (1) {
cin >> d >> e;
if (d + e == 0)
break;
double a, min = 1000000;
for (int i = 0; i <= d / 2; i++) {
a = sqrt((d - i) * (d - i) + i * i);
if (min > abs(e - a))
min = abs(e - a);
}... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 114 | 4 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 397 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
#define INF 100000000
using namespace std;
int main() {
int D, E;
while (1) {
cin >> D >> E;
if (D == 0 && E == 0)
break;
double mini = INF;
for (int i = 1; i <= D / 2; i++) {
mini = min(mini, max(0.0, sqrt(i * i + (D - i) * (D - i)... | #include <cmath>
#include <cstdio>
#include <iostream>
#define INF 100000000
using namespace std;
int main() {
int D, E;
while (1) {
cin >> D >> E;
if (D == 0 && E == 0)
break;
double mini = INF;
for (int i = 0; i <= D / 2; i++) {
mini = min(mini, max(0.0, abs(sqrt(i * i + (D - i) * (D ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 117 | 5 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (cin >> d >> e, d) {
double min = 50;
for (int x = 0; x <= d; x++) {
if (abs(sqrt(x * x + (d - x) * (d - x)) - e) < min)
min = abs(sqrt(x * x + (d - x) * (d - x)) - e)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int d, e;
while (cin >> d >> e, d) {
double min = 200;
for (int x = 0; x <= d; x++) {
if (abs(sqrt(x * x + (d - x) * (d - x)) - e) < min)
min = abs(sqrt(x * x + (d - x) * (d - x)) - e... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 121 | 4 |
#include <bits/stdc++.h>
int main() {
int D, E;
int x, y;
while (std::cin >> D >> E, D != 0 && E != 0) {
double min = std::numeric_limits<double>::max();
for (x = 1; x < D; ++x) {
y = D - x;
min = std::min(min, std::fabs(std::sqrt(x * x + y * y) - E));
}
std::cout << std::fixed << std... | #include <bits/stdc++.h>
int main() {
int D, E;
int x, y;
while (std::cin >> D >> E, D != 0 && E != 0) {
double min = std::numeric_limits<double>::max();
for (x = 0; x <= D; ++x) {
y = D - x;
min = std::min(min, std::fabs(std::sqrt(x * x + y * y) - E));
}
std::cout << std::fixed << st... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 123 | 4 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int d, e;
while (cin >> d >> e, d) {
double min = 10000;
for (int i = 1; i < d; ++i) {
double tmp = i * i + (d - i) * (d - i);
tmp = fabs(sqrt(tmp) - e);
if (min > tmp) {
min = tmp;
}
... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int d, e;
while (cin >> d >> e, d) {
double min = 10000;
for (int i = 0; i <= d; ++i) {
double tmp = i * i + (d - i) * (d - i);
tmp = fabs(sqrt(tmp) - e);
if (min > tmp) {
min = tmp;
}
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 106 | 4 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) { solve(); }
public static void solve() {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0) {
break;
}
String[] s = new String[n];
for... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) { solve(); }
public static void solve() {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0) {
break;
}
String[] s = new String[n];
for... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 75, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["-", 75, 57, 15, 15, 0, 16, 12, 16, 12, 499]] | 3 | 513 | 4 |
#include <stdio.h>
#include <string.h>
char *make(char *s) {
int i, j;
static char out[52];
for (i = 0; i < 52; i++)
out[i] = 0;
out[0] = s[0];
for (i = 0, j = 1; i + 1 < strlen(s); i++) {
if (s[i] == 'a' || s[i] == 'i' || s[i] == 'u' || s[i] == 'e' ||
s[i] == 'o') {
out[j] = s[i + 1];
... | #include <stdio.h>
#include <string.h>
char *make(char *s) {
int i, j;
static char out[52];
for (i = 0; i < 52; i++)
out[i] = 0;
out[0] = s[0];
for (i = 0, j = 1; i + 1 < strlen(s); i++) {
if (s[i] == 'a' || s[i] == 'i' || s[i] == 'u' || s[i] == 'e' ||
s[i] == 'o') {
out[j] = s[i + 1];
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 500 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 499 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
template <class T, class U> inline bool chmax(T &t, const U &f) {
return t < f ? t = f, true : false;
}
inline bool isvowel(char c) {
for (char x : "aeiou")
if (c == x)
return true;
return false;
}
int ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
template <class T, class U> inline bool chmax(T &t, const U &f) {
return t < f ? t = f, true : false;
}
inline bool isvowel(char c) {
for (char x : "aeiou")
if (c == x)
return true;
return false;
}
int ma... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 285 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 373 | 2 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 520 | 2 |
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int isVowel(char c) {
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') {
return 1;
} else
return 0;
}
string code(string str, int num) {
int cnt = 1;
string tmp = str.substr(0, 1);
for (int i ... | #include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int isVowel(char c) {
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') {
return 1;
} else
return 0;
}
string code(string str, int num) {
int cnt = 1;
string tmp = str.substr(0, 1);
for (int i ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 334 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 567 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define N_PRIME 1000000007
#define ll int64_t
string getcode(string s) {
string ret = "";
ret = ret + s[0];
for (int i = 1; i < s.size(); i++) {
char c = s[i - 1];
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') {
ret = ret + s[i];
}... | #include <bits/stdc++.h>
using namespace std;
#define N_PRIME 1000000007
#define ll int64_t
string getcode(string s) {
string ret = "";
ret = ret + s[0];
for (int i = 1; i < s.size(); i++) {
char c = s[i - 1];
if (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') {
ret = ret + s[i];
}... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 356 | 4 |
#include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << (S) << endl
#define ck(a, b) (0 <= (a) && (a) < (b))
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = -1;
int maxs = 0;
string s[51];
REP(i, 0, n) {
string tmps;
cin >... | #include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << (S) << endl
#define ck(a, b) (0 <= (a) && (a) < (b))
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = -1;
int maxs = 0;
string s[51];
REP(i, 0, n) {
string tmps;
cin >... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 309 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 404 | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
bool boin[256] = {false};
boin['a'] = bo... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
bool boin[256] = {false};
boin['a'] = bo... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 433 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flip = false, judge = false;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A')
flip ^= true;
else if (S[i] == 'Z')
flip ^= true, judge = true, cout << "AZ";
}
if (!judge)
cout << -1;
cout << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flip = false, judge = false;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' && !flip)
flip ^= true;
else if (S[i] == 'Z' && flip)
flip ^= true, judge = true, cout << "AZ";
}
if (!judge)
cout <<... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 28, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 102 | 5 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#ifdef Debug
#define dump(x) cerr << #x << " = " << (x) << endl
#else
#define dump(x)
#... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#ifdef Debug
#define dump(x) cerr << #x << " = " << (x) << endl
#else
#define dump(x)
#... | [["-", 0, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60]] | 1 | 196 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string row;
cin >> row;
int f = 0, cnt = 0;
// cout<<row.size();
for (int i = 0; row.size(); i++) {
if (row[i] == 'A')
f = 1;
if (f == 1 && row[i] == 'Z') {
cnt++;
f = 0;
}
}
if (cnt != 0) {
for (int... | #include <iostream>
#include <string>
using namespace std;
int main() {
string row;
cin >> row;
int f = 0, cnt = 0;
// cout<<row.size();
for (int i = 0; i < row.size(); i++) {
if (row[i] == 'A')
f = 1;
if (f == 1 && row[i] == 'Z') {
cnt++;
f = 0;
}
}
if (cnt != 0) {
for ... | [["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 132 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
int main() {
int a, n, m;
scanf("%d", &a);
vector<Pi> datas;
for (int i = 0; i < a; i++) {
int H1, H2, M1, M2;
scanf("%d:%d-%d:%d", &H1, &M1, &H2, &M2);
datas.push_back(make_pair(H1 * 60 + M1, H2 * 60 + M2));
}
scanf("%d",... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
int main() {
int a, n, m;
scanf("%d", &a);
vector<Pi> datas;
for (int i = 0; i < a; i++) {
int H1, H2, M1, M2;
scanf("%d:%d-%d:%d", &H1, &M1, &H2, &M2);
datas.push_back(make_pair(H1 * 60 + M1, H2 * 60 + M2));
}
scanf("%d",... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 539 | 2 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef pair<string, string> string2;
vector<string2> classInfo;
vector<string2> teacher[110], student[110];
int numTeacher, numStudent;
string2 split(string s) {
string2 ret;
s[5] = ' '... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef pair<string, string> string2;
vector<string2> classInfo;
vector<string2> teacher[110], student[110];
int numTeacher, numStudent;
string2 split(string s) {
string2 ret;
s[5] = ' '... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 427 | 4 |
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
pair<int, int> next_time() {
int sh, sm, eh, em;
scanf("%d:%d-%d:%d", &sh, &sm, &eh, &em);
return make_pair(sh * 60 + sm, eh * 60 + em);
}
vector<pair<int, int>> input_schedule() {
int n;
scanf("%d", &n);
vector<pair<int, int>> re... | #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
pair<int, int> next_time() {
int sh, sm, eh, em;
scanf("%d:%d-%d:%d", &sh, &sm, &eh, &em);
return make_pair(sh * 60 + sm, eh * 60 + em);
}
vector<pair<int, int>> input_schedule() {
int n;
scanf("%d", &n);
vector<pair<int, int>> re... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 378 | 2 |
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
#define YEAR 10000
#define MAX_IDS 100
#define MAX_DIGIT 14
#define MAX_ID 7
#define HOUR 24
#define MINUTE 60
#define SECOND 60
#define MONTH 12
#define MAX_NUM 10
#define DAY_ID 2
#define MONTH_ID 2
#define YEAR_ID 4
#define ELSE_ID 2
#defin... | #include <iostream>
#include <tuple>
#include <vector>
using namespace std;
#define YEAR 10000
#define MAX_IDS 100
#define MAX_DIGIT 14
#define MAX_ID 7
#define HOUR 24
#define MINUTE 60
#define SECOND 60
#define MONTH 12
#define MAX_NUM 10
#define DAY_ID 2
#define MONTH_ID 2
#define YEAR_ID 4
#define ELSE_ID 2
#defin... | [["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 1,406 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.