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 <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 < ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 756 | 2 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 579 | 6 |
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 451 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(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> v... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(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 double ld;
typedef vector<int> vi;
ty... | [["-", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22]] | 1 | 448 | 3 |
#include <algorithm>
#include <stdio.h>
using namespace std;
long long dist[40];
int main() {
long long a, b, c, d, e, f;
scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &e, &f);
if (c == 1 && d == 1) {
long long v = b % (e + f);
long long g = b / (e + f);
long long ret = v + max(0LL, g - a) * (e + ... | #include <algorithm>
#include <stdio.h>
using namespace std;
long long dist[40];
int main() {
long long a, b, c, d, e, f;
scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &e, &f);
if (c == 1 && d == 1) {
long long v = b % (e + f);
long long g = b / (e + f);
long long ret = v + max(0LL, g - a) * (e + ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 614 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 53;
ll Sum[100];
ll n, m, a, b, p, q;
ll calc(ll k) {
static ll used[101] = {}, mem[101] = {};
if (used[k]++)
return mem[k];
ll A = 1, B = 1;
ll &res = mem[k] = p + q;
while (0 < res && res <= INF && k--)
A *= a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 53;
ll Sum[100];
ll n, m, a, b, p, q;
ll calc(ll k) {
static ll used[101] = {}, mem[101] = {};
if (used[k]++)
return mem[k];
ll A = 1, B = 1;
ll &res = mem[k] = p + q;
while (0 < res && res <= INF && k--)
A *= a... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 541 | 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... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 25]] | 1 | 757 | 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 "=... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 547 | 3 |
char *c, b[];
t, s;
main() {
read(0, b, c);
for (c = strchr(b, 10); *c++; t *= !!(*c - 10))
*c - 49 || (s = s < ++t ? t : s);
printf("%d\n", s);
exit(0);
} | char *c, b[999];
t, s;
main() {
read(0, b, 999);
for (c = strchr(b, 10); *c++; t *= !!(*c - 10))
*c - 49 || (s = s < ++t ? t : s);
printf("%d\n", s);
exit(0);
} | [["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 0 | 86 | 3 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 270 | 2 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int M, N;
cin >> M >> N;
int ans = 0;
REP(m, M) {
int t = 0;
REP(n, M) {
int a;
cin >> a;
t += a;
}
ans = max(ans,... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int M, N;
cin >> M >> N;
int ans = 0;
REP(m, M) {
int t = 0;
REP(n, N) {
int a;
cin >> a;
t += a;
}
ans = max(ans,... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 92 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int m, n;
scanf("%d%d", &m, &n);
int M = 0;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
int s;
scanf("%d", &s);
sum += s;
}
M = max(M, sum);
}
printf("%d\n", m);
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int m, n;
scanf("%d%d", &m, &n);
int M = -1;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
int s;
scanf("%d", &s);
sum += s;
}
M = max(M, sum);
}
printf("%d\n", M);
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 110 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int M, N, tmp;
cin >> M >> N;
vector<int> cnt(N, 0);
for (int i = 0; i < M; ++i)
for (int j = 0; j < N; ++j) {
cin >> tmp;
cnt[j] += tmp;
}
int ans = 0;
for (int i = 0; i < N; ++i)
ans = max(ans, cnt[i]);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int M, N, tmp;
cin >> M >> N;
vector<int> cnt(M, 0);
for (int i = 0; i < M; ++i)
for (int j = 0; j < N; ++j) {
cin >> tmp;
cnt[i] += tmp;
}
int ans = 0;
for (int i = 0; i < M; ++i)
ans = max(ans, cnt[i]);
... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 119 | 6 |
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);
char[] in = sc.next().toCharArray();
int count = 0;
for (int i = 0; i < in.length / 2; i++) {
char a = in[i];
... | 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);
char[] in = sc.next().toCharArray();
int count = 0;
for (int i = 0; i < in.length / 2; i++) {
char a = in[i];
... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 509, 500, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 509, 0, 131], ["+", 31, 16, 31, 16, 31, 16, 31, 509, 119, 22]] | 3 | 215 | 4 |
#include <iostream>
#include <string>
using namespace std;
string S;
int sum;
int main() {
cin >> S;
for (int i = 0; i < S.size() / 2; i++) {
if (S[i] != S[S.size() - i - 1] && (S[i] == 'i' || S[i] == 'w')) {
if (S[i] == ')' && S[S.size() - i - 1] == '(') {
goto E;
}
if (S[i] == '(' &&... | #include <iostream>
#include <string>
using namespace std;
string S;
int sum;
int main() {
cin >> S;
for (int i = 0; i < S.size() / 2; i++) {
if ((S[i] != S[S.size() - i - 1]) || (S[i] == '(' || S[i] == ')')) {
if (S[i] == ')' && S[S.size() - i - 1] == '(') {
goto E;
}
if (S[i] == '(' ... | [["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 12, 23, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 12, 23, 0, 16, 31, 16, 12, 103, 0, 125], ["-", 12, 23, 0, 16, 12, 16, 12, 103, 0, 1... | 1 | 220 | 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>
#inc... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 660 | 4 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string in;
void init() { in = ""; }
void input() { cin >> in; }
int solve() {
int k, u, p, c;
k = u = p = c = 0;
for (int i = 0; i < in.size(); i++) {
if (in[i] == 'K') {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string in;
void init() { in = ""; }
void input() { cin >> in; }
int solve() {
int k, u, p, c;
k = u = p = c = 0;
for (int i = 0; i < in.size(); i++) {
if (in[i] == 'K') {
... | [["-", 0, 14, 8, 9, 0, 37, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 37, 0, 2, 63, 22], ["-", 0, 37, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 37, 0, 2, 3, 4, 0, 2, 63, 22]] | 1 | 192 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++) {
mp[s[i]]++;
}
cout << max(max(mp['K'], mp['U']), max(mp['P'], mp['C'])) << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++) {
mp[s[i]]++;
}
cout << min(min(mp['K'], mp['U']), min(mp['P'], mp['C'])) << endl;
} | [["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 2, 63, 22]] | 1 | 103 | 6 |
s=gets;'KUPC'.split('').map{|c|s.count c}.min | s=gets;p 'KUPC'.split('').map{|c|s.count c}.min | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 26 | 1 |
#include <stdio.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
main() {
int H, W;
scanf("%d %d\n", &H, &W);
int semi[H][W];
int fukai[H][W];
int i, j, k;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++)
semi[i][j] = getchar() - '0';
getchar();
}
fukai[0][0] = 0;
for (i = 1; i < H + W;... | #include <stdio.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
main() {
int H, W;
scanf("%d %d\n", &H, &W);
int semi[H][W];
int fukai[H][W];
int i, j, k;
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++)
semi[i][j] = getchar() - '0';
getchar();
}
fukai[0][0] = 0;
for (i = 1; i < H + W - ... | [["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22]] | 0 | 316 | 4 |
#include <iostream>
#include <string>
using namespace std;
const static int HEIGHT_MAX = 50;
const static int WIDTH_MAX = 50;
int main() {
int height;
int width;
int semi[HEIGHT_MAX][WIDTH_MAX];
cin >> height >> width;
for (int i = 0; i < height; ++i) {
string s;
cin >> s;
for (int j = 0; j ... | #include <iostream>
#include <string>
using namespace std;
const static int HEIGHT_MAX = 50;
const static int WIDTH_MAX = 50;
int main() {
int height;
int width;
int semi[HEIGHT_MAX][WIDTH_MAX];
cin >> height >> width;
for (int i = 0; i < height; ++i) {
string s;
cin >> s;
for (int j = 0; j ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 8, 9, 0, 1, 0, 11, 12, 41, 64, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 41, 0, 102], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 0, 102], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 75, 22]] | 1 | 290 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
char A;
int a, b, t[50][50], dp[50][50];
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> A;
t[i][j] = A - '0';
dp[i][j] = 0;
}
}
for (int i = 1; i < a; i++) {
dp[0][i] =... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char A;
int a, b, t[50][50], dp[50][50];
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> A;
t[i][j] = A - '0';
dp[i][j] = 0;
}
}
for (int i = 1; i < b; i++) {
dp[0][i] =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 278 | 4 |
#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<char, char> cc;
vector<cc> opr;
int ep;
class Parsing {
private:
string parse;
int pos;
public:
bool error;
Parsing(string s) {
parse = s;
pos = 0;
error =... | #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<char, char> cc;
vector<cc> opr;
int ep;
class Parsing {
private:
string parse;
int pos;
public:
bool error;
Parsing(string s) {
parse = s;
pos = 0;
error =... | [["+", 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, 52, 8, 9, 0, 1, 0, 35]] | 1 | 730 | 6 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int N, K;
static double[][] a;
public static void main(String[] args) {
N = sc.nextInt();
K = sc.nextInt();
a = new do... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int N, K;
static double[][] a;
public static void main(String[] args) {
N = sc.nextInt();
K = sc.nextInt();
a = new do... | [["-", 8, 196, 0, 57, 64, 37, 0, 91, 17, 33]] | 3 | 966 | 1 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
const int INF = 100000000;
const double EPS = 1e-8;
typedef pair<double, double> P;
double dp[... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
const int INF = 100000000;
const double EPS = 1e-8;
typedef pair<double, double> P;
double dp[... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 85], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 569 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | [["+", 51, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 17, 72], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 51, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 220 | 4 |
#include <iostream>
#include <string>
#pragma warning(disable : 4996)
using namespace std;
int N, A[100], B[100];
string S;
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
cin >> S;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
scanf("%d", &B[i]);
}
... | #include <iostream>
#include <string>
#pragma warning(disable : 4996)
using namespace std;
int N, A[100], B[100];
string S;
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
cin >> S;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
scanf("%d", &B[i]);
}
... | [["+", 49, 50, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 237 | 6 |
#include <iostream>
#include <string>
using namespace std;
string S;
int N, A[10000], B[10000];
int main() {
while (true) {
cin >> N;
if (N == 0) {
break;
}
cin >> S;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (int i = N - 1; i >= 0; i--) {
swap(S[A[i] - 1],... | #include <iostream>
#include <string>
using namespace std;
string S;
int N, A[10000], B[10000];
int main() {
while (true) {
cin >> N;
if (N == 0) {
break;
}
cin >> S;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (int i = N - 1; i >= 0; i--) {
swap(S[A[i] - 1],... | [["+", 15, 16, 12, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 16, 12, 16, 31, 69, 341, 342, 0, 73], ["+", 15, 16, 12, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 16, 12, 16, 12, 69, 341, 342, 0, 73]] | 1 | 236 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | [["-", 0, 30, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 0, 30, 0, 43, 49, 50, 51, 5, 0, 6], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 12, 22], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 12, 22]] | 1 | 407 | 8 |
#include <stdio.h>
int main() {
int n, m, i, c, mi, max, d[10010];
while (scanf("%d %d", &n, &m), n || m) {
for (i = max = 0; i < n; i++)
scanf("%d", &d[i]);
for (i = 0; i < n; i++) {
if (m % d[mi] == m % d[i]) {
if (d[i] == d[mi])
c++;
if (d[i] < d[mi]) {
mi ... | #include <stdio.h>
int main() {
int n, m, i, c, mi, d[10010];
while (scanf("%d %d", &n, &m), n || m) {
for (i = c = mi = 0; i < n; i++)
scanf("%d", &d[i]);
for (i = 1; i < n; i++) {
if (m % d[mi] == m % d[i]) {
if (d[i] == d[mi])
c++;
if (d[i] < d[mi]) {
mi = ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 8, 9, 0, 7, 10, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 11, 17, 32], ["+", 0, 7, 10, 11, 12, 11, 12, 11, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0... | 0 | 190 | 8 |
#include <iostream>
using namespace std;
int main() {
int min, minc, n, m, a, t, mini, minqd, minqdc, minqdi;
cin >> n >> m;
while (n != 0 || m != 0) {
cin >> a;
min = m - m % a;
minc = 1;
mini = 1;
minqd = a;
minqdi = 1;
minqdc = 1;
for (int i = 1; i < n; i++) {
cin >> a... | #include <iostream>
using namespace std;
int main() {
int min, minc, n, m, a, t, mini, minqd, minqdc, minqdi;
cin >> n >> m;
while (n != 0 || m != 0) {
cin >> a;
min = m - m % a;
minc = 1;
mini = 1;
minqd = a;
minqdi = 1;
minqdc = 1;
for (int i = 1; i < n; i++) {
cin >> a... | [["-", 0, 57, 64, 1, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22]] | 1 | 263 | 2 |
#include <iostream>
using namespace std;
int n, m, a[10000];
int main() {
while (true) {
cin >> n >> m;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
int m1 = 1 << 30, m2 = 0, m3 = n;
for (int i = 0; i < n; i++) {
int M = (m / a[i]) * a[i];
if (m1 > M) {
... | #include <iostream>
using namespace std;
int n, m, a[10000];
int main() {
while (true) {
cin >> n >> m;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
int m1 = 1 << 30, m2 = 0, m3 = n;
for (int i = 0; i < n; i++) {
int M = (m / a[i]) * a[i];
if (m1 > M) {
... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95]] | 1 | 192 | 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;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #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;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | [["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 147], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 252 | 4 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
struct prog {
int myt... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
struct prog {
int myt... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 63, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 63, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 377 | 7 |
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp ... | #include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 1,759 | 2 |
#include <stdio.h>
#define MAX 301
int main() {
char array[MAX] = {'\0'};
int i, j;
int count[4] = {0};
int temp;
scanf("%s", &array);
for (i = 0; i < MAX; i++) {
if (array[i] == 'K')
count[0]++;
if (array[i] == 'U')
count[1]++;
if (array[i] == 'P')
count[2]++;
if (array... | #include <stdio.h>
#define MAX 301
int main() {
char array[MAX] = {'\0'};
int i, j;
int count[4] = {0};
int temp;
scanf("%s", &array);
for (i = 0; i < MAX; i++) {
if (array[i] == 'K')
count[0]++;
if (array[i] == 'U')
count[1]++;
if (array[i] == 'P')
count[2]++;
if (array... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 31, 13], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 0 | 226 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string word;
int cou[256];
cin >> word;
for (int i = 0; i < word.length(); i++)
cou[word[i]]++;
cout << min(min(cou['K'], cou['U']), min(cou['P'], cou['C'])) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string word;
int cou[256] = {0};
cin >> word;
for (int i = 0; i < word.length(); i++)
cou[word[i]]++;
cout << min(min(cou['K'], cou['U']), min(cou['P'], cou['C'])) << endl;
} | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 99 | 4 |
#include <iostream>
#include <string>
int main() {
std::string str;
std::getline(std::cin, str);
int k = 0;
int u = 0;
int p = 0;
int c = 0;
int kanban = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == 'K')
k++;
if (str[i] == 'U')
++u;
if (str[i] == 'P')
p++;
if... | #include <iostream>
#include <string>
int main() {
std::string str;
std::getline(std::cin, str);
int k = 0;
int u = 0;
int p = 0;
int c = 0;
int kanban = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == 'K')
k++;
if (str[i] == 'U')
++u;
if (str[i] == 'P')
p++;
if... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22]] | 1 | 194 | 4 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
int least = m + 1;
int num = 0, d = 0, c... | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
int least = m;
int num = 0, d = 10000, c... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 213 | 4 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,077 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int MAX = 500;
const int INF = 1e9;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
map<string, int> mp;
int dist[MAX + 1][MAX + 1];
string a, b, start, goal, via;
int c, d;
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int MAX = 500;
const int INF = 1e9;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
map<string, int> mp;
int dist[MAX + 1][MAX + 1];
string a, b, start, goal, via;
int c, d;
for (int i = 0; i <= n; i++)... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 353 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (int)s; i < (int)e; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp nake_pair
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (int)s; i < (int)e; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp nake_pair
typedef long long ll;
typ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 478 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#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 ((i) = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#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 ((i) = ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 91, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 91, 28, 22]] | 1 | 480 | 3 |
// Aizu 2286: Farey Sequence
// 2017.9.23 bal4u@uu
// ?????????????????¢??° ??(n)???????????????????????¬?????°??? Fn ????????°:
//???????????(1)?????(2)???...+??(n)
// ?????????, Fn(n) = Fn(n-1) + ??(n)???????????????Fn(0) = 1
// 2017.11.22
#include <stdio.h>
#define MAX 1000000
int phi[MAX + 1]; // ???????????... | // Aizu 2286: Farey Sequence
// 2017.9.23 bal4u@uu
// ?????????????????¢??° ??(n)???????????????????????¬?????°??? Fn ????????°:
//???????????(1)?????(2)???...+??(n)
// ?????????, Fn(n) = Fn(n-1) + ??(n)???????????????Fn(0) = 1
// 2017.11.22
#include <stdio.h>
#define MAX 1000000
int phi[MAX + 1]; // ???????????... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72]] | 0 | 345 | 2 |
#include <stdio.h>
int primeCount;
int primeList[500000];
char primeFlag[1000001];
void makePrimeList(void) {
int i, j;
for (i = 0; i <= 1000000; i++)
primeFlag[i] = 1;
primeFlag[0] = primeFlag[1] = 0;
primeCount = 0;
for (i = 2; i <= 1000000; i++) {
if (primeFlag[i]) {
primeList[primeCount++]... | #include <stdio.h>
int primeCount;
int primeList[500000];
char primeFlag[1000001];
void makePrimeList(void) {
int i, j;
for (i = 0; i <= 1000000; i++)
primeFlag[i] = 1;
primeFlag[0] = primeFlag[1] = 0;
primeCount = 0;
for (i = 2; i <= 1000000; i++) {
if (primeFlag[i]) {
primeList[primeCount++]... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 618 | 2 |
#include <algorithm>
#include <stdio.h>
using namespace std;
long long ans[1100000];
int prime[1100];
int p[1100];
int main() {
int t;
scanf("%d", &t);
p[0] = p[1] = -1;
for (int i = 2; i < 1100; i++) {
if (~p[i]) {
p[i] = 1;
for (int j = i + i; j < 1100; j += i)
p[j] = -1;
}
}
i... | #include <algorithm>
#include <stdio.h>
using namespace std;
long long ans[1100000];
int prime[1100];
int p[1100];
int main() {
int t;
scanf("%d", &t);
p[0] = p[1] = -1;
for (int i = 2; i < 1100; i++) {
if (~p[i]) {
p[i] = 1;
for (int j = i + i; j < 1100; j += i)
p[j] = -1;
}
}
i... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 291 | 2 |
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include ... | [["-", 15, 339, 51, 16, 31, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 2, 63, 22], ["-", 15, 339, 51, 16, 31, 16, 12, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 2, 63, 22]] | 1 | 5,427 | 4 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T INF = numeric_limits<T>::max() / 100;
class CostFlow {
public:
using Cost = int;
using Ind = short;
// using Capacity = char;
u... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <limits>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T INF = numeric_limits<T>::max() / 2;
class CostFlow {
public:
using Cost = int;
using Ind = short;
using Capacity = char;
using T =... | [["-", 0, 359, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 359, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 353, 8, 123, 0, 360, 39, 77, 39, 40], ["+", 0, 353, 8, 123, 0, 360, 39, 77, 39, 40]] | 1 | 1,398 | 4 |
#include <bits/stdc++.h>
#define MAX_V 10000
#define INF 1e9
using namespace std;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int dist[MAX_V];
int prevv[MAX_V], preve[MAX_V];
void add_edge(int from, int to, int cap, int cost) {
G[from].push_back((edge){to, cap, cost, G[to].size()});
G... | #include <bits/stdc++.h>
#define MAX_V 10000
#define INF 1e9
using namespace std;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int dist[MAX_V];
int prevv[MAX_V], preve[MAX_V];
void add_edge(int from, int to, int cap, int cost) {
G[from].push_back((edge){to, cap, cost, G[to].size()});
G... | [["+", 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, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 828 | 4 |
#include <bits/stdc++.h>
using namespace std;
#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_pair
#define all(in) in.begin(), in.end()
const int inf = 1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | #include <bits/stdc++.h>
using namespace std;
#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_pair
#define all(in) in.begin(), in.end()
const int inf = 1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22]] | 1 | 1,020 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX_V = 1001;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
ll dist[MAX_V];
ll h[MAX_V]; // |eV
// ¼O̸_ÆÓ
int prevv[MAX_V];
int... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX_V = 10001;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
ll dist[MAX_V];
ll h[MAX_V]; // |eV
// ¼O̸_ÆÓ
int prevv[MAX_V];
in... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 1,017 | 4 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T> vector<vector<T>> make_v(size_t a, size_t b) {
return vector<vector<T>>(a, make_v<T>(b));
}
template <typename T>
vector<vector<vector<T>>> make_v(size_... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define double long double
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T> vector<vector<T>> make_v(size_t a, size_t b) {
return vector<vector<T>>(a, make_v<T>(b));
}
template <typename T>
vector<vect... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 754 | 5 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define REP(i, b, n) for (int i = b; i < (int)n; i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, o) ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define REP(i, b, n) for (int i = b; i < (int)n; i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, o) ... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 85], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 85], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 12, 22]] | 1 | 740 | 4 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <array>
#include <cmath>
#include <map>
using namespace std;
// const int T=5;
// array<int,T> a;
// map<array<int,T>,array<int,T> > m;
// double pow(array<int,T> a){
// double d=a[T-1];
// for(int x=T-2;x>=0;x--){
// d=(a[x]==0&&d==0)?1:po... | #include <algorithm>
#include <deque>
#include <iostream>
#include <array>
#include <cmath>
#include <map>
using namespace std;
// const int T=5;
// array<int,T> a;
// map<array<int,T>,array<int,T> > m;
// double pow(array<int,T> a){
// double d=a[T-1];
// for(int x=T-2;x>=0;x--){
// d=(a[x]==0&&d==0)?1:po... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-",... | 1 | 345 | 9 |
#include <bits/stdc++.h>
using namespace std;
int N;
void mk_one(int zc, int oc) {
if (zc % 2 == 0) { // 0 is even
for (int i = 0; i < zc; i++)
cout << 0 << endl;
for (int i = 0; i < oc; i++)
cout << 1 << endl;
} else { // 0 is odd
for (int i = 0; i < zc - 1; i++)
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int N;
void mk_one(int zc, int oc) {
if (zc % 2 == 0) { // 0 is even
for (int i = 0; i < zc; i++)
cout << 0 << endl;
for (int i = 0; i < oc; i++)
cout << 1 << endl;
} else { // 0 is odd
for (int i = 0; i < zc - 1; i++)
cout << 0 << endl;
... | [["-", 51, 16, 12, 23, 0, 16, 12, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 12, 13]] | 1 | 843 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> last;
while (A.size() && A[0] == 0)
last.push_back(0), A.erase(A.begin());
if (A.size() && last.size() % 2)
last.ins... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> last;
while (A.size() && A[0] == 0)
last.push_back(0), A.erase(A.begin());
if (A.size() && last.size() % 2)
last.ins... | [["-", 0, 34, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 34, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 299 | 2 |
#include <algorithm>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, a[200];
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
int m = 0, c0 = 0, c1 = 0;
rep(i, n) {
if (a[i] == 0)
c0++;
else if (a[i] == 1)
c1++;
else
... | #include <algorithm>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, a[200];
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
int m = 0, c0 = 0, c1 = 0;
rep(i, n) {
if (a[i] == 0)
c0++;
else if (a[i] == 1)
c1++;
else
... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 79], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 306 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M, W, T;
map<string, int> mp;
string s[7];
ll v[7], p[7], l[7], x[7], y[7];
ll dp[100001];
vector<string> R[7];
vector<ll> Q[7];
ll a[(1 << 7)], b[(1 << 7)];
int main() {
cin >> N >> M >> W >> T;
for (int i = 0; i < M; i++) {
cin >> s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M, W, T;
map<string, int> mp;
string s[7];
ll v[7], p[7], l[7], x[7], y[7];
ll dp[100001];
vector<string> R[7];
vector<ll> Q[7];
ll a[(1 << 7)], b[(1 << 7)];
int main() {
cin >> N >> M >> W >> T;
for (int i = 0; i < M; i++) {
cin >> s[... | [["-", 8, 9, 0, 82, 8, 9, 0, 43, 0, 21], ["-", 0, 82, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 82, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 82, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 808 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define syos... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define syos... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 970 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define rep(i, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define rep(i, n... | [["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25], ["+", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 0, 11, 12, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 1,084 | 5 |
#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, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 16, 12, 69, 28, 22]] | 1 | 681 | 4 |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dp[1 << 16], n;
vector<pair<int, int>> x;
int col[4][4];
queue<int> Q;
int main() {
for (int i = 0; i < (1 << 16); i++)
dp[i] = 999999999;
dp[0] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
ci... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dp[1 << 16], n;
vector<pair<int, int>> x;
int col[4][4];
queue<int> Q;
int main() {
for (int i = 0; i < (1 << 16); i++)
dp[i] = 999999999;
dp[0] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
ci... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 643 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N, K, T, U, V, L;
queue<int> C;
int main() {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N, K, T, U, V, L;
queue<int> C;
int main() {... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 351 | 2 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["+", 0, 57, 64, 9, 0, 1, 0, 34, 0, 21], ["+", 64, 9, 0, 1, 0, 34, 12, 27, 17, 68], ["+", 64, 9, 0, 1, 0, 34, 12, 27, 28, 22]] | 1 | 559 | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t, u, v, l, d[210] = {};
cin >> n >> k >> t >> u >> v >> l;
for (int i = 1; i <= n; i++)
cin >> d[i];
d[n + 1] = l;
long long a = 0, p = 0;
for (int i = 1; i <= n + 1; i++) {
if (a > d[i] - d[i - 1]) {
a -= d[i] - d[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, t, u, v, l, d[210] = {};
cin >> n >> k >> t >> u >> v >> l;
for (int i = 1; i <= n; i++)
cin >> d[i];
d[n + 1] = l;
long long a = 0, p = 0;
for (int i = 1; i <= n + 1; i++) {
if (a > d[i] - d[i - 1]) {
a -= d[i] - d[i -... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 207 | 31 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, K, T, U, V, L;
bool mp[10010];
int main() {
cin >> N >> K >> T >> U >> V >> L;
int cnt = 0;
for (int i = 0, a, A; i < N; i++) {
cin >> a;
A = a;
while (mp[a])
a++;
while ((1.0 * a - A) / V > K)
a--;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, K, T, U, V, L;
bool mp[10010];
int main() {
cin >> N >> K >> T >> U >> V >> L;
int cnt = 0;
for (int i = 0, a, A; i < N; i++) {
cin >> a;
A = a;
while (mp[a])
a++;
while ((1.0 * a - A) / V / T > K)
a--;
for... | [["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 85], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 178 | 35 |
#include <iostream>
#include <map>
#include <memory.h>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
const bool SUBMIT = 0;
struct Edge {
int v, d, c;
bool operator<(const Edge &b) const {
// return d < b.d || d == b.d && c < b.c ;
return (d == b.d) ? ((c == b.c) ? v < b.v : c < b... | #include <iostream>
#include <map>
#include <memory.h>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
const bool SUBMIT = 1;
struct Edge {
int v, d, c;
bool operator<(const Edge &b) const {
// return d < b.d || d == b.d && c < b.c ;
return (d == b.d) ? ((c == b.c) ? v < b.v : c < b... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 611 | 2 |
#include <deque>
#include <iostream>
#include <memory.h>
#include <stdio.h>
#include <vector>
using namespace std;
const int MAXN = 10000;
const int INF = 100000000;
const int redirect = 1;
int N, M;
struct Edge {
int v, d, c;
};
int dist[MAXN], cost[MAXN];
bool inQueue[MAXN];
vector<Edge> g[MAXN];
deque<int> queue;... | #include <deque>
#include <iostream>
#include <memory.h>
#include <stdio.h>
#include <vector>
using namespace std;
const int MAXN = 10000;
const int INF = 100000000;
const int redirect = 0;
int N, M;
struct Edge {
int v, d, c;
};
int dist[MAXN], cost[MAXN];
bool inQueue[MAXN];
vector<Edge> g[MAXN];
deque<int> queue;... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 626 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = "... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = "... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 823 | 2 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
struct NODE {
int to, dist, cost, used;
NODE(int a, int b, int c, int d) { to = a, dist = b, cost = c, used = d; }
};
bool operator<(const NODE &a, const NODE &b) {
return a.dist != b.dist ? a... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
struct NODE {
int to, dist, cost, used;
NODE(int a, int b, int c, int d) { to = a, dist = b, cost = c, used = d; }
};
bool operator<(const NODE &a, const NODE &b) {
return a.dist != b.dist ? a... | [["-", 0, 2, 3, 4, 0, 16, 31, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 16, 31, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 16, 31, 118, 119, 120], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 436 | 4 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
struct Event {
int time;
int type; // 0 - custermer on, 1 - custermer off, 2 - operation end,
int id;
};
bool operator<(const Event &e, const Event &f) { // !!! reversed !!!
if (e.time != f.time)
return e.ti... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
struct Event {
int time;
int type; // 0 - custermer on, 1 - custermer off, 2 - operation end,
int id;
};
bool operator<(const Event &e, const Event &f) { // !!! reversed !!!
if (e.time != f.time)
return e.ti... | [["+", 0, 2, 3, 4, 0, 83, 0, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 83, 0, 16, 12, 13]] | 1 | 591 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, t, m[1000], l[1000], k[1000];
bool check(int x) {
int c[1001] = {}, used[1000] = {}, cnt = n;
for (int i = 0; i < t; i++, x += c[i])
for (int j = 0; j < n && x; j++) {
if (used[j])
continue;
if (i + m[j] > t)
return 0;
if (... | #include <bits/stdc++.h>
using namespace std;
int n, t, m[1000], l[1000], k[1000];
bool check(int x) {
int c[1001] = {}, used[1000] = {}, cnt = n;
for (int i = 0; i < t; i++, x += c[i])
for (int j = 0; j < n && x; j++) {
if (used[j])
continue;
if (i + m[j] > t)
return 0;
if (... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 272 | 2 |
#include <bits/stdc++.h>
#define M 1005
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
int n, t, m[M], l[M], k[M], add[M];
bool used[M];
bool ch(int x) {
memset(add, 0, sizeof(add));
memset(used, 0, sizeof(used));
int cnt = 0;
r(i, t + 1) {
x += add[i];
r(j, n) if (!used[j] && x) {
... | #include <bits/stdc++.h>
#define M 1003
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
int n, t, m[M], l[M], k[M], add[M];
bool used[M];
bool ch(int x) {
memset(add, 0, sizeof(add));
memset(used, 0, sizeof(used));
int cnt = 0;
r(i, t + 1) {
x += add[i];
r(j, n) if (!used[j] && x) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]... | 1 | 252 | 8 |
int t, n, m, l, i, j, a, b, k, P[1001], T[1001], Q[2001], C[2001][2001],
V[2001], d[1001][1001];
int match(s) {
int i = l;
for (; i < l + l; i++)
if (C[s][i] && !V[i])
if (V[i] = 1, Q[i] < 0 || match(Q[i]))
return Q[s] = i, Q[i] = s, 1;
return 0;
}
main() {
for (; scanf("%d%d%d", &n, &m, &... | int t, n, m, l, i, j, a, b, k, P[1001], T[1001], Q[2001], C[2001][2001],
V[2001], d[1001][1001];
int match(s) {
int i = l;
for (; i < l + l; i++)
if (C[s][i] && !V[i])
if (V[i] = 1, Q[i] < 0 || match(Q[i]))
return Q[s] = i, Q[i] = s, 1;
return 0;
}
main() {
for (; scanf("%d%d%d", &n, &m, &... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 0 | 535 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int N, M, L;
ll W[111][111];
const ll INF = 100000000000000LL;
P pt[1111];
vector<int> G[2111];
void init() {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
W[i][j] = INF;
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int N, M, L;
ll W[111][111];
const ll INF = 100000000000000LL;
P pt[1111];
vector<int> G[2111];
void init() {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
W[i][j] = INF;
for (int i = 0; i < N; i++)
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48]] | 1 | 700 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool G[1000][1000];
int match[1000];
bool used[1000];
int V;
void add_edge(int v, int u) { G[v][u] = G[u][v] = true; }
bool dfs(int v) {
used[... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool G[2000][2000];
int match[2000];
bool used[2000];
int V;
void add_edge(int v, int u) { G[v][u] = G[u][v] = true; }
bool dfs(int v) {
used[... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8,... | 1 | 662 | 12 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> match;
vector<bool> used;
Bipartite_Matching(int n) { graph.resize(n); }
void add_edge(int u, int v) {
graph[u].push_back(v);
graph[v].push_back(u);
}
boo... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> match;
vector<bool> used;
Bipartite_Matching(int n) { graph.resize(n); }
void add_edge(int u, int v) {
graph[u].push_back(v);
graph[v].push_back(u);
}
boo... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 645 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> dist, match;
vector<bool> used, vv;
Bipartite_Matching(int n, int m) {
graph.resize(n);
match.assign(m, -1);
used.assign(n, false);
}
void add_edge(int u... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> dist, match;
vector<bool> used, vv;
Bipartite_Matching(int n, int m) {
graph.resize(n);
match.assign(m, -1);
used.assign(n, false);
}
void add_edge(int u... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 814 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_V 3050
#define INF 1 << 28
vector<int> G[MAX_V];
int match[MAX_V], V;
bool used[MAX_V];
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < (int)G[v].size(); i++) {
int u = G[v][... | #include <bits/stdc++.h>
using namespace std;
#define MAX_V 3050
#define INF 1 << 28
vector<int> G[MAX_V];
int match[MAX_V], V;
bool used[MAX_V];
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < (int)G[v].size(); i++) {
int u = G[v][... | [["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 57, 64, 1, 0, 2, 3, 4, 0, 22], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 635 | 4 |
#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 fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)... | #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 fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 809 | 6 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(u, a, b) for (int u = (a); u < (b); u++)
#define rrep(u, a, b) for (int u = (b)-1; u >= (a); u--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(u, a, b) for (int u = (a); u < (b); u++)
#define rrep(u, a, b) for (int u = (b)-1; u >= (a); u--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 0, 52, 8, 9, 0, 338, 39, 361, 0, 190], ["-", 0, 52, 8, 9, 0, 338, 49, 352, 0, 67], ["+", 8, 9, 0, 52, 8, 9, 0, 338, 39, 40], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22]] | 1 | 976 | 5 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 763 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 29)
#define MAX 5000
using namespace std;
typedef pair<int, int> ii;
// flow --- start
struct edge {
int to... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 29)
#define MAX 5000
using namespace std;
typedef pair<int, int> ii;
// flow --- start
struct edge {
int to... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 908 | 6 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 22]] | 1 | 381 | 6 |
N, K, T, U, V, L = map(int, input().split())
ans = 0
l = 0
t = 0
k = 0
for _ in range(N + 1):
if _ == N:
d = L
else:
d = int(input())
length = d - l
l = d
while t > 0 or k > 0:
if t > 0:
if t * V >= length:
tmp = (t * V - length) / V
... | N, K, T, U, V, L = map(int, input().split())
ans = 0
l = 0
t = 0
k = 0
for _ in range(N + 1):
if _ == N:
d = L
else:
d = int(input())
length = d - l
l = d
while t > 0 or k > 0:
if t > 0:
if t * V >= length:
tmp = (t * V - length) / V
... | [["-", 8, 196, 0, 52, 8, 196, 0, 57, 0, 121], ["+", 0, 52, 8, 196, 0, 57, 75, 665, 0, 683], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 188 | 7 |
#include <bits/stdc++.h>
#define int long long
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int h, w;
string s[600];
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};
int sum = 0;
bool ng[555][555];
void knock(int Y, int X) {
map<char, vector<P>> M;
r(i, 4) {
... | #include <bits/stdc++.h>
#define int long long
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int h, w;
string s[600];
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};
int sum = 0;
bool ng[555][555];
void knock(int Y, int X) {
map<char, vector<P>> M;
r(i, 4) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 28, 22], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 91, 28, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 91, 28, 2, 3, 4, 0, 25]] | 1 | 401 | 6 |
#include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | #include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22]] | 1 | 628 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define LINE() cerr << " (L" << __LINE__ << ")"
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define LINE() cerr << " (L" << __LINE__ << ")"
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {... | [["-", 0, 57, 64, 1, 0, 2, 63, 118, 28, 22], ["+", 0, 57, 64, 1, 0, 2, 63, 118, 28, 22]] | 1 | 779 | 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | #include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 527 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int six_dx[] = {1, 1, 0, -1, -1, 0};
c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int six_dx[] = {1, 1, 0, -1, -1, 0};
c... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 390 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
double l[20], a[20], b[20];
cin >> n >> m;
rep(i, n) { cin >> l[i] >> a[i] >> b[i]; }
if (m == 1) {
cout << 0 << endl;
} else {
double ans = 0;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
double l[20], a[20], b[20];
cin >> n >> m;
rep(i, n) { cin >> l[i] >> a[i] >> b[i]; }
if (m == 1) {
cout << 0 << endl;
} else {
double ans = 0;
... | [["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 302 | 2 |
#include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
double a[21][3], ans = 0, p;
int n, m, c[21];
using namespace std;
double cal() {
p = 0;
r(i, 0, m) r(j, i + 1, m) p += pow(a[c[i]][0] - a[c[j]][0], 2) +
pow(a[c[i]][1] - a[c[j]][1], 2) +
... | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
double a[21][3], ans = 0, p;
int n, m, c[21];
using namespace std;
double cal() {
p = 0;
r(i, 0, m) r(j, i + 1, m) p += pow(a[c[i]][0] - a[c[j]][0], 2) +
pow(a[c[i]][1] - a[c[j]][1], 2) +
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 287 | 2 |
#include <cstdio>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define N 20
#define DELTA 0.000001
#define Lab 3
double cl[N][Lab];
int slct[N];
int n, m;
double mx;
void combi(int, int);
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i1 = 0; i1 < n; i1++) {
... | #include <cstdio>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define N 20
#define DELTA 0.000001
#define Lab 3
double cl[N][Lab];
int slct[N];
int n, m;
double mx;
void combi(int, int);
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i1 = 0; i1 < n; i1++) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 33], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 320 | 6 |
n, m = gets.split.map(&:to_i)
p m == 1 ? 0 : n.times.map{ gets.split.map(&:to_f) }.combination(m).map{ |a|
a.combination(2).to_a.map{ |p, q|
p.zip(q).reduce(0){ |sum, (c, d)| sum + (c - d) ** 2 }
}.reduce(:+)
}.max | n, m = gets.split.map(&:to_i)
p m < 2 || n < 2 ? 0 : n.times.map{ gets.split.map(&:to_f) }.combination(m).map{ |a|
a.combination(2).to_a.map{ |p, q|
p.zip(q).reduce(0){ |sum, (c, d)| sum + (c - d) ** 2 }
}.reduce(:+)
}.max | [["-", 0, 652, 3, 4, 0, 754, 15, 738, 17, 60], ["-", 0, 652, 3, 4, 0, 754, 15, 738, 12, 612], ["+", 3, 4, 0, 754, 15, 738, 31, 738, 17, 18], ["+", 3, 4, 0, 754, 15, 738, 31, 738, 12, 612], ["+", 0, 652, 3, 4, 0, 754, 15, 738, 17, 106], ["+", 3, 4, 0, 754, 15, 738, 12, 738, 31, 22], ["+", 3, 4, 0, 754, 15, 738, 12, 738,... | 4 | 103 | 8 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 336 | 2 |
#include <bits/stdc++.h>
using namespace std;
int k, r, l;
double p, e, t;
double solve(int k, double r, double l) {
if (t + e < r || l < t - e) {
return 0.0;
}
if (t - e <= r && t + e <= l) {
return 1.0;
}
double h = (r + l) / 2;
if (k == 0) {
if (t - e <= h && h <= t + e) {
return 1.... | #include <bits/stdc++.h>
using namespace std;
int k, r, l;
double p, e, t;
double solve(int k, double r, double l) {
if (t + e < r || l < t - e) {
return 0.0;
}
if (t - e <= r && l <= t + e) {
return 1.0;
}
double h = (r + l) / 2;
if (k == 0) {
if (t - e <= h && h <= t + e) {
return 1.... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 204 | 4 |
#include <bits/stdc++.h>
#define EPS (1e-10)
using namespace std;
double P, E, T;
double dfs(int k, double L, double R) {
double H = (R + L) / 2, PP = H >= T ? 1 - P : P;
if (k == 0)
return abs(H - T) <= E;
if (T < R - EPS || L + EPS < T)
return 0;
return PP * dfs(k - 1, H, R) + (1 - PP) * dfs(k - 1, L... | #include <bits/stdc++.h>
#define EPS (1e-10)
using namespace std;
double P, E, T;
double dfs(int k, double L, double R) {
double H = (R + L) / 2, PP = H >= T ? 1 - P : P;
if (k == 0)
return abs(H - T) <= E;
if (T < R - E || L + E < T)
return 0;
return PP * dfs(k - 1, H, R) + (1 - PP) * dfs(k - 1, L, H)... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 22]] | 1 | 164 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const double EPS = 1e-9;
double solve(int k, double l, double r, double p, double e, double t) {
if (k == 0)
return abs((l + r) / 2 - t) <= e + EPS ? 1 : 0;
if (t - e - EPS < l && r < t + e + EPS)
return 1; // [l,r] \subset [t-e,... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const double EPS = 1e-10;
double solve(int k, double l, double r, double p, double e, double t) {
if (k == 0)
return abs((l + r) / 2 - t) < e + EPS ? 1 : 0;
if (t - e - EPS < l && r < t + e + EPS)
return 1; // [l,r] \subset [t-e,... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 64, 37, 0, 41, 15, 16, 17, 19], ["+", 0, 57, 64, 37, 0, 41, 15, 16, 17, 18]] | 1 | 279 | 4 |
def query(l,r,c)
h = (l + r) / 2
if c == K
if (h - T).abs <= E then return 1.0
else return 0.0
end
end
return 0.0 if T - E > r || l > T + E
return 1.0 if T - E <= l && r <= T + E
if h <= T
return P * query(l, h, c + 1) + (1 - P) * query(h, r, c + 1)
else
return (1 - P) * query(l, h, ... | def query(l,r,c)
h = (l + r) / 2
if c == K
if (h - T).abs <= E then return 1.0
else return 0.0
end
end
return 0.0 if T - E > r || l > T + E
return 1.0 if T - E <= l && r <= T + E
if h <= T
return P * query(l, h, c + 1) + (1 - P) * query(h, r, c + 1)
else
return (1 - P) * query(l, h, ... | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 62], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6], ["+", 0, 493, 0, 652, 3, 4, 0, 738, 17, 109]] | 4 | 177 | 6 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int N, M, L;
double a[105][105], b[105][105], t[105][105], P, T, V;
long double f(int x) {
long double r = 1;
for (; x;)
r *= x--;
return r;
}
int main() {
scanf("%d%d%d", &N, &M, &L);
for (int i = 0; i < N; i++) {
scanf(... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int N, M, L;
double a[105][105], b[105][105], t[105][105], P, T, V;
long double f(int x) {
long double r = 1;
for (; x;)
r *= x--;
return r;
}
int main() {
scanf("%d%d%d", &N, &M, &L);
for (int i = 0; i < N; i++) {
scanf(... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 51, 16, 31, 2, 3, 4, 0, 69, 28, 22], ["+", 51, 16, 31, 2, 3, 4, 0, 69, 28, 22], ["-", 3, 4, 0, 16, 31, 16, 31, 69, 28, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 69, 28, 22], ["-", 3, 4, 0, 16, 31, 69, 28, 69, 28, 22], ["+", 3, 4, 0, 16, ... | 1 | 370 | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.