buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
int n, m;
double l;
double p[100], t[100], v[100];
double cb[100][51];
void init() {
rep(u, n) {
rep(i, m + 1) {
int j = m - i;
cb[u][i] = 1.0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
int n, m;
double l;
double p[100], t[100], v[100];
double cb[100][51];
void init() {
rep(u, n) {
rep(i, m + 1) {
int j = m - i;
cb[u][i] = 1.0;
... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 685 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll P;
struct BIT {
int n, bit[(1 << 17) + 2];
void init(int _n) {
memset(bit, 0, sizeof(bit));
n = _n;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
bit[i] %= P;
i += i & -i;
}
}
int sum(int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll P;
struct BIT {
int n, bit[(1 << 17) + 2];
void init(int _n) {
memset(bit, 0, sizeof(bit));
n = _n;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
bit[i] %= P;
i += i & -i;
}
}
int sum(int i... | [["-", 0, 16, 31, 16, 12, 16, 31, 23, 0, 24], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 31, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 31, 16, 12, 16, 31, 23, 0, 16, 12, 13]] | 1 | 374 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
template <class T> class BIT {
private:
vector<T> bit;
int n;
public:
T sum(int, T);
void add(int, T, T);
BIT(int i) {
n = i;
bit.resize(i + 1);
}
};
template <typename T> T BIT<T>::sum(int i, T K) {
T s = (T)(0);
while... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
template <class T> class BIT {
private:
vector<T> bit;
int n;
public:
T sum(int, T);
void add(int, T, T);
BIT(int i) {
n = i;
bit.resize(i + 1);
}
};
template <typename T> T BIT<T>::sum(int i, T K) {
T s = (T)(0);
while... | [["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 384 | 2 |
#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, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 598 | 2 |
#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
const int D_MAX_V = 102;
const int D_v_size = 102;
struct D_wolf {
int t, c, r;
D_wolf() { t = c = r = 0; }
D_wolf(int t1, int c1, int r1) {
t = t1;
c = c1;
r = r1;
}
};
vector<D_wolf> D_G[D_MAX_V];
vecto... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
const int D_MAX_V = 102;
const int D_v_size = 102;
struct D_wolf {
int t, c, r;
D_wolf() { t = c = r = 0; }
D_wolf(int t1, int c1, int r1) {
t = t1;
c = c1;
r = r1;
}
};
vector<D_wolf> D_G[D_MAX_V];
vecto... | [["+", 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, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 1,408 | 4 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var n = input.trim() - 0;
var cnt = 0;
while (true) {
if (n < 1)
break;
n /= 3;
cnt++;
}
console.log(cnt); | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var n = input.trim() - 0;
var cnt = 0;
while (true) {
if (n <= 1)
break;
n /= 3;
cnt++;
}
console.log(cnt); | [["-", 8, 556, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 556, 0, 57, 15, 23, 0, 16, 17, 19]] | 2 | 65 | 2 |
<?php
fscanf(STDIN,"%d\n",$n);
echo ceil(log($n,3))."?\n";
?> | <?php
fscanf(STDIN,"%d\n",$n);
echo ceil(log($n,3));
?> | [["-", 36, 36, 0, 493, 0, 608, 0, 16, 17, 131], ["-", 0, 493, 0, 608, 0, 16, 12, 609, 0, 62], ["-", 0, 493, 0, 608, 0, 16, 12, 609, 0, 610], ["-", 0, 493, 0, 608, 0, 16, 12, 609, 0, 44]] | 6 | 32 | 5 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
double N = stdIn.nextDouble();
int count = 0;
while (N >= 1.0) {
N /= 3;
++count;
}
System.out.println(count);
}
} | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
double N = stdIn.nextDouble();
int count = 0;
while (N > 1.0) {
N /= 3;
++count;
}
System.out.println(count);
}
} | [["-", 8, 196, 0, 52, 15, 15, 0, 16, 17, 20], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 47]] | 3 | 73 | 2 |
#include <stdio.h>
int main() {
long long int a;
int x, i;
x = scanf("%lld", &a);
while (a > 3) {
if (a % 3 == 1)
i = 1;
else
i = 0;
a /= 3;
a += i;
x++;
}
printf("%d\n", x);
exit(0);
} | #include <stdio.h>
int main() {
long long int a;
int x, i;
x = scanf("%lld", &a);
while (a > 3) {
if (a % 3 != 0)
i = 1;
else
i = 0;
a /= 3;
a += i;
x++;
}
printf("%d\n", x);
exit(0);
} | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 81 | 4 |
i;
main(k, n) {
k = 1;
for (scanf("%d", &n); k < n; i++)
k *= 3;
printf("%d\n", i);
exit(0);
} | i;
main(n) {
unsigned k = 1;
for (scanf("%d", &n); k < n; i++)
k *= 3;
printf("%d\n", i);
exit(0);
} | [["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87]] | 0 | 53 | 8 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int count = 1;
while (pow(3, count) <= n) {
count++;
}
cout << count << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int count = 1;
while (pow(3, count) < n) {
count++;
}
cout << count << "\n";
}
| [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18]] | 1 | 49 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 249 | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double d;
cin >> d;
int ans = log(d) / log(3);
cout << ans + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double d;
cin >> d;
int ans = ceil(log(d) / log(3));
cout << ans << endl;
return 0;
} | [["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 43 | 5 |
#include <cstdio>
using namespace std;
int main() {
int n;
int cnt = 0;
scanf("%d", &n);
while (n > 0) {
cnt++;
if (n == 3) {
break;
}
n /= 3;
}
printf("%d\n", cnt);
return 0;
} | #include <cstdio>
using namespace std;
int main() {
double n;
int cnt = 0;
scanf("%lf", &n);
while (n >= 1) {
cnt++;
if (n == 3) {
break;
}
n /= 3;
}
printf("%d\n", cnt);
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 52, 15, 339... | 1 | 68 | 8 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ul... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ul... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 172 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define loop(i, a, b) for (int i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(a) (a).begin(), (a).end()
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
int main() {
long long i... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define loop(i, a, b) for (int i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(a) (a).begin(), (a).end()
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
int main() {
long long i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 112 | 6 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long n;
scanf(" %ld", &n);
int ans = 0;
while (1) {
if (pow(3, ans - 1) <= n && n < pow(3, ans))
break;
++ans;
}
printf("%d\n", ans);
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long n;
scanf(" %ld", &n);
int ans = 0;
while (1) {
if (pow(3, ans - 1) < n && n <= pow(3, ans))
break;
++ans;
}
printf("%d\n", ans);
} | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 77 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47]] | 1 | 133 | 2 |
#include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long double ld;
int main() {
_;
... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long double ld;
int main() {
_;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 71 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, i = 1;
main() {
cin >> n;
n++;
while (pow(3, i) < n) {
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, i = 1;
main() {
cin >> n;
while (pow(3, i) < n) {
i++;
}
cout << i << endl;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 47 | 3 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
//左辺に底 右辺に真数
long double mlog(const long double base, const long double anti) {
return log(anti) / log(base);
}
int main() {
int N... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
//左辺に底 右辺に真数
long double mlog(const long double base, const long double anti) {
return log(anti) / log(base);
}
int main() {
int N... | [["-", 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, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 90 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
while (n > 1)
n = n / 3 + min(1, n % (n / 3)), ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
while (n > 1)
n = n / 3 + min(1, n % 3), ans++;
cout << ans << endl;
return 0;
} | [["-", 12, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["-", 3, 4, 0, 16, 12, 23, 0, 16, 31, 22], ["-", 3, 4, 0, 16, 12, 23, 0, 16, 17, 85], ["-", 12, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 60 | 4 |
#include <iostream>
#include <math.h>
using namespace std;
int N;
int ans = 0;
int main() {
cin >> N;
while (N > 1) {
N = ceil(N / 3);
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int N;
int ans = 0;
int main() {
cin >> N;
while (N > 1) {
N = ceil((double)N / 3);
ans++;
}
cout << ans << endl;
return 0;
} | [["+", 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 | 55 | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e7 + 1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e7 + 1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 189 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
double n;
scanf("%d", &n);
int ans = 1;
while (1) {
if (n <= 3)
break;
n /= 3;
ans++;
}
printf... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
double n;
scanf("%lf", &n);
int ans = 1;
while (1) {
if (n <= 3)
break;
n /= 3;
ans++;
}
print... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 82 | 2 |
#include <iomanip>
#include <iostream>
using namespace std;
int n, m, l, p[111], t[111], v[111];
long double r[111][55], dp[55][55];
int main() {
cin >> n >> m >> l;
for (int i = 0; i < n; i++)
cin >> p[i] >> t[i] >> v[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= m; j++)
fill(dp[j], dp[j] ... | #include <iomanip>
#include <iostream>
using namespace std;
int n, m, l, p[111], t[111], v[111];
long double r[111][55], dp[55][55];
int main() {
cin >> n >> m >> l;
for (int i = 0; i < n; i++)
cin >> p[i] >> t[i] >> v[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= m; j++)
fill(dp[j], dp[j] ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35]] | 1 | 469 | 5 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
struct runner {
int t, v;
double p;
};
const int INF = 1000000000;
vector<runner> vr;
double mem[101][51][101];
// kÍxe·éêÌ
double calcPer(int n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
struct runner {
int t, v;
double p;
};
const int INF = 1000000000;
vector<runner> vr;
double mem[51][51][101];
// kÍxe·éêÌ
double calcPer(int n,... | [["-", 0, 43, 49, 80, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 80, 49, 80, 49, 80, 81, 13], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 568 | 6 |
class Array
def accum
inject([0]){|a, x| a + [a[-1] + x]}
end
def accum!
(1..size-1).each{|i|
self[i] += self[i-1]
}
self.unshift(0)
end
def accum_2d
ac = map{|r| r.accum}
(1..size-1).each{|i|
(1..ac[0].size-1).each{|j|
ac[i][j] += ac[i-1][j]
}
}
ac.unshift([0] * ac[0].size)
ac
en... | class Array
def accum
inject([0]){|a, x| a + [a[-1] + x]}
end
def accum!
(1..size-1).each{|i|
self[i] += self[i-1]
}
self.unshift(0)
end
def accum_2d
ac = map{|r| r.accum}
(1..size-1).each{|i|
(1..ac[0].size-1).each{|j|
ac[i][j] += ac[i-1][j]
}
}
ac.unshift([0] * ac[0].size)
ac
en... | [["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["+", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 62], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6], ["+", 8, 736, 0, 652, 3, 4, 0, 738, 17, 109]] | 4 | 726 | 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 each(itr, v) for (auto itr : v)
#define pb push_back
#defi... | #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 each(itr, v) for (auto itr : v)
#define pb push_back
#defi... | [["+", 3, 4, 0, 16, 31, 16, 31, 118, 28, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 118, 17, 131], ["+", 3, 4, 0, 16, 31, 16, 31, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 632 | 6 |
/*
* Author: Teletubbies
* Created Time: 2012年08月29日 星期三 12时39分28秒
* File Name: e.cpp
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <... | /*
* Author: Teletubbies
* Created Time: 2012年08月29日 星期三 12时39分28秒
* File Name: e.cpp
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <... | [["+", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 52, 8, 9, 0, 93, 0, 35]] | 1 | 906 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = float;
template <class T> using Table = vector<vector<T>>;
int main() {
int N;
cin >> N;
vector<int> as;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
as.push_... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
template <class T> using Table = vector<vector<T>>;
int main() {
int N;
cin >> N;
vector<int> as;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
as.push... | [["-", 36, 36, 0, 30, 0, 360, 39, 77, 39, 40], ["+", 36, 36, 0, 30, 0, 360, 39, 77, 39, 40], ["-", 49, 50, 51, 4, 0, 2, 3, 4, 0, 13], ["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 13]] | 1 | 340 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | [["+", 8, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 8, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 1,200 | 5 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [["+", 0, 1, 0, 11, 12, 69, 28, 69, 28, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 70], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 519 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 363 | 2 |
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
long long int i, l, flag[100][100][4],
dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}, h, w, d, j, k, x, y;
char str[100][101], dir[5] = {"NEST"};
while (1) {
scanf("%lld%lld%lld%*c", &h, &w, &l);
if (h == 0 && w == 0 && l == ... | #include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
long long int i, l, flag[100][100][4],
dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}, h, w, d, j, k, x, y;
char str[100][101], dir[5] = {"NESW"};
while (1) {
scanf("%lld%lld%lld%*c", &h, &w, &l);
if (h == 0 && w == 0 && l == ... | [["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]] | 1 | 494 | 2 |
import static java.lang.System.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(in);
void run() {
int INF = -1;
int l = 1 << 16;
long[] sat = new long[100];
int[] time = new int[100];
long[][] dp = new long[101][l];
while (true) {
int n = sc.nextInt();
if (... | import static java.lang.System.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(in);
void run() {
int INF = -1;
int l = 1 << 16;
long[] sat = new long[100];
int[] time = new int[100];
long[][] dp = new long[101][l];
while (true) {
int n = sc.nextInt();
if (... | [["-", 0, 1, 0, 11, 12, 23, 0, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 12, 22]] | 3 | 479 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["-", 0, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 9, 0, 57, 64, 9, 0, 116, 0, 117]] | 1 | 534 | 4 |
#include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
struct man {
long long int atime;
long long int sat;
};
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<man> men(N);
for (int i = 0; i < N; ++i) {
int M, L;
cin >> M >> L;
... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
struct man {
long long int atime;
long long int sat;
};
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<man> men(N);
for (int i = 0; i < N; ++i) {
int M, L;
cin >> M >> L;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 276 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 353 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct Man {
int l;
int bit;
};
int N, M, a, b;
int main() {
while (cin >> N, N) {
vector<Man> D(N);
for (int i = 0; i < N; i++) {
cin >> M >> D[i].l;
for (int j = 0; j < M; j++) {
cin >> a >> b;
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct Man {
int l;
int bit;
};
int N, M, a, b;
int main() {
while (cin >> N, N) {
vector<Man> D(N);
for (int i = 0; i < N; i++) {
cin >> M >> D[i].l;
for (int j = 0; j < M; j++) {
cin >> a >> b;
fo... | [["+", 12, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 291 | 4 |
///
// File: 2321.cpp
// Author: ymiyamoto
//
// Created on Fri Dec 29 10:09:56 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int32_t main() {
while (true) {
uint32_t N;
cin >> N;
if (N == 0)
break;
vector<uint64_t> sats(N + 1, 0);
vector<uint32_t... | ///
// File: 2321.cpp
// Author: ymiyamoto
//
// Created on Fri Dec 29 10:09:56 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int32_t main() {
while (true) {
uint32_t N;
cin >> N;
if (N == 0)
break;
vector<uint64_t> sats(N + 1, 0);
vector<uint32_t... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 35], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 358 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 686 | 2 |
#include <bits/stdc++.h>
using namespace std;
char fie[1001][1001];
int H, W, N;
int memo[1001][1001];
char S[1000001];
int Ds[1000001][4];
int dx[] = {0, 1, 0, -1}; // R -> +1 , L -> +1
int dy[] = {-1, 0, 1, 0};
int sx, sy, gx, gy;
struct state {
int x, y, c;
bool operator>(const state &st) const { return c > ... | #include <bits/stdc++.h>
using namespace std;
char fie[1001][1001];
int H, W, N;
int memo[1001][1001];
char S[1000001];
int Ds[1000001][4];
int dx[] = {0, 1, 0, -1}; // R -> +1 , L -> +1
int dy[] = {-1, 0, 1, 0};
int sx, sy, gx, gy;
struct state {
int x, y, c;
bool operator>(const state &st) const { return c > ... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 737 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
int main() {
vector<char> chs(2000);
vector<vector<int>> real_edges(2000);
{
int N, M;
cin >> N >> M;
vector<string> sts;
for (int i = 0; i < N; ++i) {
string st;
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
int main() {
vector<char> chs(2000);
vector<vector<int>> real_edges(2000);
{
int N, M;
cin >> N >> M;
vector<string> sts;
for (int i = 0; i < N; ++i) {
string st;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 771 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const double g = 9.8;
const double eps = 1e-10;
const int maxn = 500;
int n, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const double g = 9.8;
const double eps = 1e-10;
const int maxn = 500;
int n, ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 31, 22], ["-", 51, 16, 31, 23, 0, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 2... | 1 | 727 | 8 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | [["+", 0, 43, 49, 50, 51, 16, 31, 23, 0, 24], ["+", 0, 16, 12, 16, 12, 2, 3, 4, 0, 25]] | 1 | 724 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const double g = 9.8, eps = 1e-10;
const int maxn = 50;
int N, V, X, Y;
int L[maxn], B[maxn], R[maxn], T[maxn];
//计算以vy的速度竖直向上射出t秒后的位置
double calc(double vy, double t) { return vy * t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const double g = 9.8, eps = 1e-10;
const int maxn = 50;
int N, V, X, Y;
int L[maxn], B[maxn], R[maxn], T[maxn];
//计算以vy的速度竖直向上射出t秒后的位置
double calc(double vy, double t) { return vy * t... | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 705 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define pb push_back
const int W = 666;
const int INF = 1000000007;
int h, w;
vector... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define pb push_back
const int W = 666;
const int INF = 1000000007;
int h, w;
vector... | [["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 1,066 | 6 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef... | [["-", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 9, 0, 116, 0, 117]] | 1 | 832 | 2 |
#include <bits/stdc++.h>
#include <regex>
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) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pai... | #include <bits/stdc++.h>
#include <regex>
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) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pai... | [["-", 0, 11, 12, 2, 3, 4, 0, 103, 0, 125], ["+", 0, 11, 12, 2, 3, 4, 0, 103, 0, 125]] | 1 | 995 | 2 |
#include <cstdio>
#include <cstring>
char fie[9][9];
const char *dat = "ox";
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int check(int x, int y, int t) {
int cnt = 0;
for (int i = 0; i < 8; i++) {
int nx = x + dx[i], ny = y + dy[i];
int cc = 0;
while (nx >= 0 && n... | #include <cstdio>
#include <cstring>
char fie[9][9];
const char *dat = "ox";
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int check(int x, int y, int t) {
int cnt = 0;
for (int i = 0; i < 8; i++) {
int nx = x + dx[i], ny = y + dy[i];
int cc = 0;
while (nx >= 0 && n... | [["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 106], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 17, 79], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 768 | 4 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 740 | 4 |
#include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
vector<vector<int>> field(8, vector<int>(8));
bool ok(int y, int x) { return y >= 0 && y <= 7 && x >= 0 && x <= 7; }
int turn(bool mami, vector<vector<int>> ... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
vector<vector<int>> field(8, vector<int>(8));
bool ok(int y, int x) { return y >= 0 && y <= 7 && x >= 0 && x <= 7; }
int turn(bool mami, vector<vector<int>> ... | [["-", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["-", 0, 52, 8, 9, 0, 57, 64, 93, 0, 35], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 867 | 4 |
#include <bits/stdc++.h>
using namespace std;
string a[8];
int ax[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ay[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int i, j, turn = 1, x = 7, y = 7, cou, k = 0, c1 = 0, c2 = 0;
char mi[] = {'x', 'o'};
int dfs(int dx, int dy) {
int aa = dx + 1, bb = dy + 1;
if (y + ay[k] * aa == 8 || x + ax[k... | #include <bits/stdc++.h>
using namespace std;
string a[8];
int ax[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ay[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int i, j, turn = 1, x = 7, y = 7, cou, k = 0, c1 = 0, c2 = 0;
char mi[] = {'x', 'o'};
int dfs(int dx, int dy) {
int aa = dx + 1, bb = dy + 1;
if (y + ay[k] * aa == 8 || x + ax[k... | [["-", 0, 57, 15, 339, 51, 16, 31, 91, 17, 111], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 72], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25]] | 1 | 1,115 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
char board[8][8];
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int mami_dfs(int x, int y, int cnt, int idx) {
int nx = x + dx[idx], ny = y + dy[idx];
if (0 <= nx && nx <= 7 && 0 <= ny && ny <= 7 && board[n... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
char board[8][8];
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int mami_dfs(int x, int y, int cnt, int idx) {
int nx = x + dx[idx], ny = y + dy[idx];
if (0 <= nx && nx <= 7 && 0 <= ny && ny <= 7 && board[n... | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32]] | 1 | 985 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool stop;
int board[8][8];
int dr[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dc[] = {1, 1, 0, -1, -1, -1, 0, 1};
struct poc {
int row;
int col;
int count;
vector<int> dir;
bool operator<(const poc &right) const {
if (count == ri... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool stop;
int board[8][8];
int dr[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dc[] = {1, 1, 0, -1, -1, -1, 0, 1};
struct poc {
int row;
int col;
int count;
vector<int> dir;
bool operator<(const poc &right) const {
if (count == ri... | [["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 915 | 2 |
#include <cstdio>
#include <utility>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
int main() {
char B[8][9];
rep(i, 8) scanf("%s", B[i]);
rep(t, 64) {
char c1 = (t % 2 ? 'x' : 'o'),
... | #include <cstdio>
#include <utility>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
int main() {
char B[8][9];
rep(i, 8) scanf("%s", B[i]);
rep(t, 64) {
char c1 = (t % 2 ? 'x' : 'o'),
... | [["+", 12, 16, 12, 23, 0, 41, 15, 16, 17, 109], ["+", 12, 16, 12, 23, 0, 41, 15, 16, 12, 13]] | 1 | 636 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, ans;
cin >> n;
ans = log(n) / log(3);
cout << ans + 1 << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, ans;
cin >> n;
ans = ceil(log(n) / log(3));
cout << ans << endl;
return 0;
} | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 55 | 5 |
#include <iostream>
using namespace std;
int main() {
int a, b = 0;
cin >> a;
while (a != 0) {
a /= 3;
b++;
}
cout << b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b = 0;
cin >> a;
a--;
while (a != 0) {
a /= 3;
b++;
}
cout << b << endl;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 44 | 3 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 684 | 2 |
#include <algorithm>
#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 <set>
#include <sstr... | #include <algorithm>
#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 <set>
#include <sstr... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 27, 28, 69, 341, 342, 0, 27, 17, 68], ["+", 0, 27, 28, 69, 341, 342, 0, 27, 17, 29]] | 1 | 544 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 595 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int imos[111111];
int main() {
int n;
while (cin >> n) {
memset(imos, 0, sizeof(imos));
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
imos[a]++;
imos[b + 1]--;
}
for (int i = 1; i < 111... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int imos[111111];
int main() {
int n;
while (cin >> n) {
memset(imos, 0, sizeof(imos));
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
imos[a - 1]++;
imos[b]--;
}
for (int i = 1; i < 111... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 161 | 18 |
#include <stdio.h>
int n, x, y, imos[100003], table[100002];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
scanf("%d", &y);
y++;
imos[x]++;
imos[y]--;
}
for (int i = 1; i <= 100001; i++) {
table[i] = table[i - 1] + imos[i];
}
int ret = 0;
for (... | #include <stdio.h>
int n, x, y, imos[100003], table[100002];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
scanf("%d", &y);
y++;
imos[x]++;
imos[y]--;
}
for (int i = 1; i <= 100001; i++) {
table[i] = table[i - 1] + imos[i];
}
int ret = 0;
for (... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 170 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int A[100002] = {}, B[100002] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
A[a]++;
B[b]++;
}
int sum = 1, ans = 0;
for (int i = 1; i < 100002; i++) {
sum += (A[i] - B[i]);
// if(i<=10)cout<<i<<" "<<su... | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int A[100002] = {}, B[100002] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
A[a]++;
B[b + 1]++;
}
int sum = 1, ans = 0;
for (int i = 1; i < 100002; i++) {
sum += (A[i] - B[i]);
// if(i<=10)cout<<i<<" "... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 135 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int t[1000001];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
t[a - 1]++;
t[b - 1]--;
}
int ans = 0;
for (int i = 1; i <= 1000000; i++) {
t[i] += t[i - 1];
if (i <= t[i])
ans = i;
}
... | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int t[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
t[a - 1]++;
t[b]--;
}
int ans = 0;
for (int i = 1; i <= 100000; i++) {
t[i] += t[i - 1];
if (i <= t[i])
ans = i;
}
cout <... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 135 | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
cin >> n;
for (int i = 0, s, t; i < n; i++)
cin >> s >> t, a[s - 1]++, a[t - 1]--;
int ans = 0;
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
if (i <= a[i])
ans = max(i, ans);
}
cout << ans << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
cin >> n;
for (int i = 0, s, t; i < n; i++)
cin >> s >> t, a[s - 1]++, a[t]--;
int ans = 0;
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
if (i <= a[i])
ans = max(i, ans);
}
cout << ans << endl;
return 0;
} | [["-", 12, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 124 | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N;
int a[MAXN], b[MAXN];
int main() {
while (cin >> N) {
map<int, int> m;
for (int i = 0; i < N; ++i) {
cin >> a[i] >> b[i];
m[a[i]]++;
m[b[i]]--;
}
int res = 1, num = 1, prev = 0;
for (map<int, int>::it... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N;
int a[MAXN], b[MAXN];
int main() {
while (cin >> N) {
map<int, int> m;
for (int i = 0; i < N; ++i) {
cin >> a[i] >> b[i];
m[a[i]]++;
m[b[i] + 1]--;
}
// 1 3 3 4
// 1 +1
// 3 +1
// 4 -1
/... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 187 | 2 |
#include <iostream>
using namespace std;
int main() {
int ma[100005] = {};
int n;
cin >> n;
int i, j, k;
int a, b;
for (i = 0; i < n; i++) {
cin >> a >> b;
for (j = a; j <= b; j++)
ma[j]++;
}
int m = 0;
for (i = 0; i < 100001; i++) {
// if(i<10)
// cout << i <<":" << ma[i]<<endl;... | #include <iostream>
using namespace std;
int main() {
int ma[100005] = {};
int n;
cin >> n;
int i, j, k;
int a, b;
for (i = 0; i < n; i++) {
cin >> a >> b;
for (j = a; j <= b; j++)
ma[j]++;
}
int m = 0;
for (i = 0; i < 100005; i++) {
// if(i<10)
// cout << i <<":" << ma[i]<<endl;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 131 | 4 |
#include <bits/stdc++.h>
#define N 100002
using namespace std;
int n, a, b, d[N], ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = a; j <= b; j++)
d[j]++;
}
ans = 1;
for (int i = n + 1; i >= 0; i--)
if (d[i] >= i)
ans = max(ans, i);
cout << ans -... | #include <bits/stdc++.h>
#define N 100002
using namespace std;
int n, a, b, d[N], ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = a; j <= b; j++)
d[j]++;
}
ans = 1;
for (int i = n + 1; i >= 2; i--)
if (d[i] >= i - 1)
ans = max(ans, i);
cout << a... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 124 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 27, 17, 68]] | 1 | 227 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int num[100005];
int num2[100005];
int main() {
int N, a, b;
cin >> N;
for (int n = 0; n < N; n++) {
cin >> a >> b;
// cout<<a<<' '<<b<<endl;
num[a]++;
num[b + 1]--;
}
int ans = num2[0] = num[0];
for (int i = 1; i < 100005; i++)... | #include <algorithm>
#include <iostream>
using namespace std;
int num[100005];
int num2[100005];
int main() {
int N, a, b;
cin >> N;
for (int n = 0; n < N; n++) {
cin >> a >> b;
// cout<<a<<' '<<b<<endl;
num[a]++;
num[b + 1]--;
}
int ans = num2[0] = num[0];
for (int i = 1; i < 100005; i++)... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 147 | 2 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int *a, *b;
int *data;
cin >> n;
a = new int[n];
b = new int[n];
data = new int[100010];
REP(i, n) { cin >> a[i] >> b[i]; }
REP(i, 100010) { data[i] = 0; }
REP(i, n) {
data[a[i]]++;
... | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int *a, *b;
int *data;
cin >> n;
a = new int[n];
b = new int[n];
data = new int[100010];
REP(i, n) { cin >> a[i] >> b[i]; }
REP(i, 100010) { data[i] = 0; }
REP(i, n) {
data[a[i]]++;
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 218 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 449 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 288 | 2 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int c[N + 2] = {};
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
c[a]++;
c[b + 1]--;
}
int ans = 0;
int sum = 1;
for (int i = 0; i < N + 2; i++) {
sum += c[i];
ans = (i <= sum) ? i : ans;
}
cout ... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int c[100003] = {};
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
c[a]++;
c[b + 1]--;
}
int ans = 0;
int sum = 1;
for (int i = 0; i < 100003; i++) {
sum += c[i];
ans = (i <= sum) ? i : ans;
}
cou... | [["-", 0, 43, 49, 50, 49, 80, 81, 16, 31, 22], ["-", 0, 43, 49, 50, 49, 80, 81, 16, 17, 72], ["-", 0, 43, 49, 50, 49, 80, 81, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0,... | 1 | 126 | 8 |
#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, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16... | 1 | 213 | 8 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 551 | 2 |
#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 <string>
#include <tuple>
#include <unordered_map>
#inc... | #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 <string>
#include <tuple>
#include <unordered_map>
#inc... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 4,411 | 4 |
#include <bits/stdc++.h>
using namespace std;
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() {
int N = read();
int a[N], b[N];
int check[100050] = {0};
REP(i... | #include <bits/stdc++.h>
using namespace std;
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() {
int N = read();
int a[N], b[N];
int check[100050] = {0};
REP(i... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 189 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ll n;
cin >> n;
map<ll, int> mp... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ll n;
cin >> n;
map<ll, int> mp... | [["+", 8, 9, 0, 1, 0, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 27, 28, 69, 28, 22], ["+", 0, 1, 0, 27, 28, 69, 341, 342, 0, 70], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 181 | 5 |
#include "bits/stdc++.h"
using namespace std;
static int member[100004];
void solve() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
member[a]++;
member[b + 1]--;
}
partial_sum(begin(member), end(member), begin(member));
for (int i = 1e6 + 1; i > 0; i--) {
if (membe... | #include "bits/stdc++.h"
using namespace std;
static int member[101010];
void solve() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
member[a]++;
member[b + 1]--;
}
partial_sum(begin(member), end(member), begin(member));
for (int i = 101009; i > 0; i--) {
if (member... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 152 | 6 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
int change[100010] = {};
int main() {
int N = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a, b;
scanf("%d %d", &a, &b);
change[a]++;
change[b + 1]--;
}
int ans = 0;
int p = 0;
for (int i = 2; i <= N + 1; i++) {
p += c... | #include <algorithm>
#include <math.h>
#include <stdio.h>
int change[100010] = {};
int main() {
int N = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a, b;
scanf("%d %d", &a, &b);
change[a]++;
change[b + 1]--;
}
int ans = 0;
int p = 0;
for (int i = 2; i <= N + 1; i++) {
p += c... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 153 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 1e6 + 2;
int main() {
int n;
cin >> n;
vector<int> nf(MAX, 0);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
nf[a]++;
nf[b]--;
}
int ans = 0;
for (int i = 2; i < MAX; i++) {
nf[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 1e6 + 2;
int main() {
int n;
cin >> n;
vector<int> nf(MAX, 0);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
nf[a]++;
nf[b + 1]--;
}
int ans = 0;
for (int i = 2; i < MAX; i++) {
... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 140 | 2 |
//#include "bits/stdc++.h"
#include <array>
#include <iostream>
// #include <map>
// #include <string>
// #include <algorithm>
// #include <numeric>
// #include <limits>
using namespace std;
array<int, 100002> box; // initialized by 0 // use key 100001
int n;
int min_;
int max_;
int solve() {
cin >> n;
for (in... | //#include "bits/stdc++.h"
#include <array>
#include <iostream>
// #include <map>
// #include <string>
// #include <algorithm>
// #include <numeric>
// #include <limits>
using namespace std;
array<int, 100002> box; // use key 100001
int n;
int min_;
int max_;
int solve() {
cin >> n;
for (int i = 0; i < n; i++)... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 144 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> invert(n);
int nmax = -10, nmin = (int)1e7;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
invert[i].first = b;
invert[i].second = a;
nmin = min(nmin, a);
nmax = max(nmax, b);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> invert(n);
int nmax = -10, nmin = (int)1e7;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
invert[i].first = b;
invert[i].second = a;
nmin = min(nmin, a);
nmax = max(nmax, b);... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 282 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define P pair<int, int>
#define mp make_pair
int t[100002];
int x[100002];
int y[100002];
int z[100002];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define P pair<int, int>
#define mp make_pair
int t[100002];
int x[100002];
int y[100002];
int z[100002];
int n;
int main() {
cin >> n;
// for(int i=0;i<=n;i++)t[i]=1;
for (int i = 0; i < n; i++) {
... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 20], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 165 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[111111] = {};
cin >> n;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
h[a]++;
h[b + 1]--;
}
int ma = 0;
for (int i = 1; i <= n + 1; i++) {
h[i] += h[i - 1];
if (i <= h[i] + 1)
ma = max(ma, h[i] - 1);
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[111111] = {};
cin >> n;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
h[a]++;
h[b + 1]--;
}
int ma = 0;
for (int i = 1; i <= n + 1; i++) {
h[i] += h[i - 1];
if (i <= h[i] + 1)
ma = max(ma, i - 1);
}
... | [["-", 12, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 70], ["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 73]] | 1 | 137 | 3 |
#include <stdio.h>
int main(void) {
int i, j, n, sum[100010], a, b, now = 0, ans = 0;
for (i = 0; i < 100010; ++i)
sum[i] = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d%d", &a, &b);
sum[a]++;
sum[b + 1]--;
}
/*for(i = 0; i < 10; ++i) printf("%d ", sum[i]);
printf("\n");*/
for... | #include <stdio.h>
int main(void) {
int i, j, n, sum[100010], a, b, now = 0, ans = 0;
for (i = 0; i < 100010; ++i)
sum[i] = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d%d", &a, &b);
sum[a]++;
sum[b + 1]--;
}
/*for(i = 0; i < 10; ++i) printf("%d ", sum[i]);
printf("\n");*/
for... | [["-", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22]] | 1 | 165 | 2 |
#include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1e9 + 7
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
int rui[100010] = {};
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1e9 + 7
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
int rui[100010] = {};
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 155 | 2 |
#include <iostream>
int main() {
int imos[100001];
for (int i = 0; i < 100001; i++) {
imos[i] = 0;
}
int N;
std::cin >> N;
int range_min = 0, range_max = 100000;
for (int i = 0; i < N; i++) {
int a, b;
std::cin >> a >> b;
imos[a - 2]++;
imos[b - 1]--;
if (range_min > a - 2) {
... | #include <iostream>
int main() {
int imos[100001];
for (int i = 0; i < 100001; i++) {
imos[i] = 0;
}
int N;
std::cin >> N;
int range_min = 100000, range_max = 0;
for (int i = 0; i < N; i++) {
int a, b;
std::cin >> a >> b;
imos[a - 2]++;
imos[b - 1]--;
if (range_min > a - 2) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 215 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
int cnt[100005];
int main() {
cin >> n;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = a; j < b + 1; j++) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 1; i < n + 2... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
int cnt[100005];
int main() {
cin >> n;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
for (int j = a; j < b + 1; j++) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 1; i < n + 2... | [["-", 64, 1, 0, 11, 12, 16, 31, 69, 28, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 70], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 73]] | 1 | 134 | 3 |
using namespace std;
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
template <typename T> using fun = function<T>;
template <typename T> class Stream {
private:
vector<T> value;
template <typename F, typename U, typename... | using namespace std;
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
template <typename T> using fun = function<T>;
template <typename T> class Stream {
private:
vector<T> value;
template <typename F, typename U, typename... | [["-", 8, 9, 0, 37, 0, 41, 15, 16, 17, 47], ["+", 8, 9, 0, 37, 0, 41, 15, 16, 17, 20]] | 1 | 1,375 | 2 |
#include <cstdio>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
using namespace std;
int a[100000 + 1];
int b[100000 + 1];
int main() {
int n = getInt();
REP(i, n) {
int aa = getInt();
int bb = getInt();
a[aa]++;... | #include <cstdio>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
using namespace std;
int a[100000 + 3];
int b[100000 + 3];
int main() {
int n = getInt();
REP(i, n) {
int aa = getInt();
int bb = getInt();
a[aa]++;... | [["-", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 170 | 8 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [["-", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 70], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 22], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 73]] | 1 | 345 | 5 |
#include <cstring>
#include <iostream>
using namespace std;
int fav[100005];
int main() {
int N;
cin >> N;
memset(fav, 0, sizeof(fav));
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
fav[l]++;
fav[r]--;
}
int res = 0, mem = 1;
for (int i = 1; i <= N + 1; i++) {
mem += fav[i... | #include <cstring>
#include <iostream>
using namespace std;
int fav[100005];
int main() {
int N;
cin >> N;
memset(fav, 0, sizeof(fav));
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
fav[l - 1]++;
fav[r]--;
}
int res = 0, mem = 0;
for (int i = 1; i <= N + 1; i++) {
mem += f... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 130 | 6 |
def search(c,a,b):
r={'o':'x','x':'o'}
ans=0
direct=((-1,-1),(-1,0),(-1,1),(0,-1),(0,1),(1,-1),(1,0),(1,1))
for d in range(8):
y,x=a,b
i,j=direct[d]
while s[y+i][x+j]==r[c]:
y+=i
x+=j
if s[y+i][x+j]==c:
ans+=max(abs(y-a),abs(x-b))
... | def search(c,a,b):
r={'o':'x','x':'o'}
ans=0
direct=((-1,-1),(-1,0),(-1,1),(0,-1),(0,1),(1,-1),(1,0),(1,1))
for d in range(8):
y,x=a,b
i,j=direct[d]
while s[y+i][x+j]==r[c]:
y+=i
x+=j
if s[y+i][x+j]==c:
ans+=max(abs(y-a),abs(x-b))
... | [["+", 0, 656, 0, 7, 12, 206, 206, 663, 0, 612]] | 5 | 682 | 1 |
/* template.cpp {{{ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | /* template.cpp {{{ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | [["+", 64, 37, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 628 | 3 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 1 | 747 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define dump(n) cout << "# " << #n << '=' << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define peri(i, a, b) for (int i = int(b); i-- > int(a);)
#define rep(i, n) repi(i, 0, n)
#define per(i, n) peri(i, 0, n)
#define all(c) begin(c), end(c)
#d... | #include <bits/stdc++.h>
using namespace std;
#define dump(n) cout << "# " << #n << '=' << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define peri(i, a, b) for (int i = int(b); i-- > int(a);)
#define rep(i, n) repi(i, 0, n)
#define per(i, n) peri(i, 0, n)
#define all(c) begin(c), end(c)
#d... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 1,374 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.