problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000000000;
for (int i = 0; i < 26; i++) {
char ch = i + 'a';
vector<int> v;
for (int j = 0; j < s.size(); j++) {
if (s[j] == ch)
v.push_back(j);
}
if (v.size() == 0)
continue;
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000000000;
for (int i = 0; i < 26; i++) {
char ch = i + 'a';
vector<int> v;
for (int j = 0; j < s.size(); j++) {
if (s[j] == ch)
v.push_back(j);
}
if (v.size() == 0)
continue;
in... | [
"expression.operation.binary.remove"
] | 1,359,081 | 1,359,083 | u357265888 | cpp |
p03687 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#inclu... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,359,085 | 1,359,088 | u966854856 | cpp |
p03687 | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
int gcd(int a, int b) {
if (b == 0) {
re... | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
int gcd(int a, int b) {
if (b == 0) {
re... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,359,099 | 1,359,100 | u796269639 | cpp |
p03687 | #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 ... | [
"assignment.change"
] | 1,359,105 | 1,359,106 | u334351654 | cpp |
p03687 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using str = string;
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using str = string;
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) ... | [
"expression.operation.binary.remove"
] | 1,359,109 | 1,359,110 | u614421689 | cpp |
p03687 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using str = string;
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using str = string;
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) ... | [
"assignment.add",
"expression.operation.binary.remove"
] | 1,359,111 | 1,359,110 | u614421689 | cpp |
p03687 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... | [] | 1,359,125 | 1,359,126 | u874996917 | cpp |
p03687 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 1,359,127 | 1,359,126 | u874996917 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
string S;
bool used[109][109];
int ans = 10000;
int main() {
cin >> S;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < S.size(); j++) {
if ((S[j] - 'a') == i)
used[0][j] = true;
else
used[0][j] = false;
}
int ret = 10000;
... | #include <bits/stdc++.h>
using namespace std;
string S;
bool used[109][109];
int ans = 10000;
int main() {
cin >> S;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < S.size(); j++) {
if ((S[j] - 'a') == i)
used[0][j] = true;
else
used[0][j] = false;
}
int ret = 10000;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,358,996 | 1,358,997 | u504103417 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using R = double;
int main() {
string s;
cin >> s;
int b[26] = {1000};
int count = 0;
for (int i = 0; i < 26; i++) {
for (int j = ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using R = double;
int main() {
string s;
cin >> s;
int b[26] = {1000};
int count = 0;
for (int i = 0; i < 26; i++) {
for (int j = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,359,000 | 1,359,001 | u849513225 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 1e9, a[26] = {}, end[26] = {}, cnt = 0;
string s, alph = "abcdefghijklmnopqrstuvwxyz";
bool f = false;
cin >> s;
for (int i = 0; i < 26; i++) {
cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (alph[i] != s[j]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 1e9, a[26] = {}, end[26] = {}, cnt = 0;
string s, alph = "abcdefghijklmnopqrstuvwxyz";
bool f = false;
cin >> s;
for (int i = 0; i < 26; i++) {
cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (alph[i] != s[j]) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,002 | 1,359,003 | u710232726 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 1e9, a[26] = {}, end[26] = {}, cnt = 0;
string s, alph = "abcdefghijklmnopqrstuvwxyz";
bool f = false;
cin >> s;
for (int i = 0; i < 26; i++) {
cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (alph[i] != s[j]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 1e9, a[26] = {}, end[26] = {}, cnt = 0;
string s, alph = "abcdefghijklmnopqrstuvwxyz";
bool f = false;
cin >> s;
for (int i = 0; i < 26; i++) {
cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (alph[i] != s[j]) {
... | [
"assignment.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,004 | 1,359,003 | u710232726 | cpp |
p03687 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | [
"assignment.change"
] | 1,359,005 | 1,359,006 | u344412812 | cpp |
p03687 | #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;
int compute(string &s, int sp) {
int cost = (int)s.size() - sp, cnt = 0;
char c = s[sp];
rep(i, sp) {
if (s[i] != c)
++cnt;
else
cost = max(cost, cnt), cnt = 0;
}
... | #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;
int compute(string &s, int sp) {
int cost = (int)s.size() - sp - 1, cnt = 0;
char c = s[sp];
rep(i, sp) {
if (s[i] != c)
++cnt;
else
cost = max(cost, cnt), cnt = 0;
... | [
"assignment.change"
] | 1,359,007 | 1,359,008 | u079282332 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = INT_MAX;
for (char c = 'a'; c <= 'z'; c++) {
int k = 0, i = 0;
for (auto e : s) {
if (e == c) {
k = max(k, i);
i = 0;
} else {
i++;
}
}
m = min(m, k);
}
cout << m... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = INT_MAX;
for (char c = 'a'; c <= 'z'; c++) {
int k = 0, i = 0;
for (auto e : s) {
if (e == c) {
k = max(k, i);
i = 0;
} else {
i++;
}
}
m = min(m, max(k, i));
}
c... | [
"call.add",
"call.arguments.add"
] | 1,359,009 | 1,359,010 | u848737670 | cpp |
p03687 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <deque>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#defin... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <deque>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#defin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,359,013 | 1,359,014 | u483814783 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
#define INF (int)1e9
//コメントアウトするとdebug()を実行しない... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
#define INF (int)1e9
//コメントアウトするとdebug()を実行しない... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,359,251 | 1,359,252 | u389055093 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
char s1[1000];
int w[150], t[150], tt[150];
int ans, maxn, maxx, tot, ans2, ans22, anss, maxxx, maxnn, tott, minnn;
int main() {
int minn = 0x7fffffff, minnn = 0x7fffffff;
scanf("%s", s1);
int n = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
char s1[1000];
int w[150], t[150], tt[150];
int ans, maxn, maxx, tot, ans2, ans22, anss, maxxx, maxnn, tott, minnn;
int main() {
int minn = 0x7fffffff, minnn = 0x7fffffff;
scanf("%s", s1);
int n = ... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,359,253 | 1,359,254 | u485196090 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
char s1[1000];
int w[150], t[150], tt[150];
int ans, maxn, maxx, tot, ans2, ans22, anss, maxxx, maxnn, tott, minnn;
int main() {
int minn = 0x7fffffff, minnn = 0x7fffffff;
scanf("%s", s1);
int n = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
char s1[1000];
int w[150], t[150], tt[150];
int ans, maxn, maxx, tot, ans2, ans22, anss, maxxx, maxnn, tott, minnn;
int main() {
int minn = 0x7fffffff, minnn = 0x7fffffff;
scanf("%s", s1);
int n = ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 1,359,255 | 1,359,254 | u485196090 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::fixed;
us... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::fixed;
us... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,359,264 | 1,359,265 | u984427208 | cpp |
p03687 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int count[21] = {0};
int ans[26] = {0};
for (int j = 0; j < 26; j++) {
int t = -1, now = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'a' + j) {
now = i;
if (ans[j] < ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int count[21] = {0};
int ans[26] = {0};
for (int j = 0; j < 26; j++) {
int t = -1, now = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'a' + j) {
now = i;
if (ans[j] < ... | [] | 1,359,267 | 1,359,268 | u416560151 | cpp |
p03687 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int count[21] = {0};
int ans[21] = {0};
for (int j = 0; j < 21; j++) {
int t = -1, now = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'a' + j) {
now = i;
if (ans[j] < ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int count[21] = {0};
int ans[26] = {0};
for (int j = 0; j < 26; j++) {
int t = -1, now = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'a' + j) {
now = i;
if (ans[j] < ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,359,269 | 1,359,268 | u416560151 | cpp |
p03685 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | [
"identifier.change",
"call.arguments.change"
] | 1,359,022 | 1,359,023 | u079603018 | cpp |
p03685 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <string.h>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
int r, c, n;
int x1, ... |
#include <algorithm>
#include <iostream>
#include <stack>
#include <string.h>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
int r, c, n;
int x1, ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,359,024 | 1,359,025 | u629500233 | cpp |
p03685 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef complex<double> Point;
const int Nmax = 1e5;
int N;
ll R, C;
ll X1[N... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef complex<double> Point;
const int Nmax = 1e5;
int N;
ll R, C;
ll X1[N... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,359,026 | 1,359,027 | u534998883 | cpp |
p03685 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef complex<double> Point;
const int Nmax = 1e5;
int N;
ll R, C;
ll X1[N... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef complex<double> Point;
const int Nmax = 1e5;
int N;
ll R, C;
ll X1[N... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,028 | 1,359,027 | u534998883 | cpp |
p03685 | #include <algorithm>
#include <cstdio>
#define R register
#define maxn 100010
struct Poi {
int x, y, id, type;
inline bool operator<(const Poi &that) const {
return type < that.type || (type == that.type && type == 1 ? y < that.y
: type == 2 ? x < that.x
... | #include <algorithm>
#include <cstdio>
#define R register
#define maxn 100010
struct Poi {
int x, y, id, type;
inline bool operator<(const Poi &that) const {
return type < that.type ||
(type == that.type && (type == 1 ? y < that.y
: type == 2 ? x < that.x
... | [
"function.return_value.change"
] | 1,359,029 | 1,359,030 | u940850666 | cpp |
p03685 | #include <algorithm>
#include <cstdio>
#define R register
#define maxn 100010
struct Poi {
int x, y, id, type;
inline bool operator<(const Poi &that) const {
return type < that.type || (type == that.type && type == 1 ? y < that.y
: type == 2 ? x < that.x
... | #include <algorithm>
#include <cstdio>
#define R register
#define maxn 100010
struct Poi {
int x, y, id, type;
inline bool operator<(const Poi &that) const {
return type < that.type ||
(type == that.type && (type == 1 ? y < that.y
: type == 2 ? x < that.x
... | [
"function.return_value.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,359,031 | 1,359,030 | u940850666 | cpp |
p03685 | #include <algorithm>
#include <deque>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
// 整数の入力
long long R, C, N, x1, x2, y1, y2, i;
vector<vector<long long>> dots;
deque<long long> stack;
cin >> R >> C >> N;
for (i = 0; i < N; i++) {
cin >> x1 >> y1 >> x2 >> y2;
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
// 整数の入力
long long R, C, N, x1, x2, y1, y2, i;
vector<vector<long long>> dots;
deque<long long> stack;
cin >> R >> C >> N;
for (i = 0; i < N; i++) {
cin >> x1 >> y1 >> x2 >> y2;
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,359,032 | 1,359,033 | u902500155 | cpp |
p03685 | #include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 100005;
int R, C, N;
struct point {
int x, y, num;
void read() { scanf("%d%d", &x, &y); }
bool onedge() {
if (x == 0 || y == 0 || x == R || y == C)
return true;
else
return false;
}
int typ() const {
if (x == ... | #include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 100005;
int R, C, N;
struct point {
int x, y, num;
void read() { scanf("%d%d", &x, &y); }
bool onedge() {
if (x == 0 || y == 0 || x == R || y == C)
return true;
else
return false;
}
int typ() const {
if (x == ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,359,034 | 1,359,035 | u938723972 | cpp |
p03685 | #include <algorithm>
#include <cstdio>
#include <stack>
#include <vector>
#define fs first
#define sc second
#define mp make_pair
#define pii pair<int, int>
using namespace std;
int c, r, n, a, b, x, y, ctr;
vector<pii> v;
stack<pii> st;
bool cek(int a, int b) {
if (a == 0 || b == 0 || a == r || b == c) {
ret... | #include <algorithm>
#include <cstdio>
#include <stack>
#include <vector>
#define fs first
#define sc second
#define mp make_pair
#define pii pair<int, int>
using namespace std;
int c, r, n, a, b, x, y, ctr;
vector<pii> v;
stack<pii> st;
bool cek(int a, int b) {
if (a == 0 || b == 0 || a == r || b == c) {
ret... | [
"expression.operation.binary.add"
] | 1,359,040 | 1,359,041 | u727346050 | cpp |
p03685 | #include <algorithm>
#include <iostream>
#include <memory.h>
#include <queue>
#include <stdio.h>
using namespace std;
const int maxn = 200005;
int r, c, n, tot, stk[maxn], top, ins[maxn];
struct node {
int x, y, i, l;
} p[maxn];
int ask(int x, int y) {
if (x == 0)
return 1;
if (y == c)
return 2;
if (x ... | #include <algorithm>
#include <iostream>
#include <memory.h>
#include <queue>
#include <stdio.h>
using namespace std;
const int maxn = 200005;
int r, c, n, tot, stk[maxn], top, ins[maxn];
struct node {
int x, y, i, l;
} p[maxn];
int ask(int x, int y) {
if (x == 0)
return 1;
if (y == c)
return 2;
if (x ... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,359,044 | 1,359,045 | u683985668 | cpp |
p03685 | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1 << 40)); }
main() {... | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1 << 30)); }
main() {... | [
"literal.number.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 1,359,048 | 1,359,049 | u462437857 | cpp |
p03685 | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1 << 40)); }
main() {... | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1 << 30)); }
main() {... | [
"literal.number.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,048 | 1,359,052 | u462437857 | cpp |
p03685 | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1 << 40)); }
main() {... | #include <bits/stdc++.h>
#define L long
#define t first
#define u second
#define M push_back(make_pair(c(
using namespace std;
L R, C, N, a[9 << 14], b, i;
vector<pair<L, L>> p;
bool s(L x, L y) { return !(x ^ 0 && x ^ R && y ^ 0 && y ^ C); }
L c(L x, L y) { return L(atan2(x - R / 2, y - C / 2) * (1LL << 40)); }
main()... | [
"literal.number.type.widen.change"
] | 1,359,048 | 1,359,053 | u462437857 | cpp |
p03685 | // include
//------------------------------------------
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// math
//------------------------------------... | // include
//------------------------------------------
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// math
//------------------------------------... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,058 | 1,359,069 | u884379688 | cpp |
p03685 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include... | [
"call.arguments.change"
] | 1,359,086 | 1,359,087 | u555577504 | cpp |
p03685 | // AtCoder Regular Contest 076
// E - Connected?
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll R, C;
int N;
vector<pair<ll, int>> border;
stack<int> s;
bool used[MAX_N];
int main() {
ll x[2], y[2], idx;
bool is_border;
cin >> R >> C >> N;
for (int i ... | // AtCoder Regular Contest 076
// E - Connected?
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX_N = 100000;
ll R, C;
int N;
vector<pair<ll, int>> border;
stack<int> s;
bool used[MAX_N];
int main() {
ll x[2], y[2], idx;
bool is_border;
cin >> R >> C >> N;
for (int i ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,089 | 1,359,090 | u302149106 | cpp |
p03685 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | [
"call.arguments.change"
] | 1,359,091 | 1,359,093 | u764076797 | cpp |
p03685 | // E
// by Cydiater
// 2017.6.24
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define up(i, j, n) for (int i = j; i <= n; i++)
#define down(i, j, n) for (int i = j; i >= n; i--)
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define pii pair<int, int>
#define fi first
#define ... | // E
// by Cydiater
// 2017.6.24
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define up(i, j, n) for (int i = j; i <= n; i++)
#define down(i, j, n) for (int i = j; i >= n; i--)
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define pii pair<int, int>
#define fi first
#define ... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 1,359,128 | 1,359,129 | u220113889 | cpp |
p03685 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
#define pb push_back
#define Long long long
using namespace std;
stack<int> S;
int R, C, N, a, b, c, d;
bool isBound(int x, int y) {
if ((x == 0 || x == C) || (y == 0 || y == R))
return true;
return false;
}
typede... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
#define pb push_back
#define Long long long
using namespace std;
stack<int> S;
int R, C, N, a, b, c, d;
bool isBound(int x, int y) {
if ((x == 0 || x == C) || (y == 0 || y == R))
return true;
return false;
}
typede... | [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,359,130 | 1,359,131 | u951568855 | cpp |
p03685 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
#define pb push_back
#define Long long long
using namespace std;
stack<int> S;
int R, C, N, a, b, c, d;
bool isBound(int x, int y) {
if ((x == 0 || x == C) || (y == 0 || y == R))
return true;
return false;
}
typede... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
#define pb push_back
#define Long long long
using namespace std;
stack<int> S;
int R, C, N, a, b, c, d;
bool isBound(int x, int y) {
if ((x == 0 || x == C) || (y == 0 || y == R))
return true;
return false;
}
typede... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,359,132 | 1,359,131 | u951568855 | cpp |
p03685 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, P> PP;
int... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, P> PP;
int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,134 | 1,359,135 | u854869949 | cpp |
p03685 | #include <bits/stdc++.h>
//#define Min(a,b,c) min((a),min((b),(c)))
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<LL, LL>
#define pb(x) push_back(x)
#define x first
#define y second
#define sqr(x) ((x) * (x))
#define EPS 1e-11
#define MEM(x) memset(x, ... | #include <bits/stdc++.h>
//#define Min(a,b,c) min((a),min((b),(c)))
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<LL, LL>
#define pb(x) push_back(x)
#define x first
#define y second
#define sqr(x) ((x) * (x))
#define EPS 1e-11
#define MEM(x) memset(x, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,136 | 1,359,137 | u682550266 | cpp |
p03685 | //#include<stdio.h>
//#include<stdlib.h>
#include <bits/stdc++.h>
//#define Min(a,b,c) min((a),min((b),(c)))
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<LL, LL>
#define pb(x) push_back(x)
#define x first
#define y second
#define sqr(x) ((x) * (x))
#d... | #include <bits/stdc++.h>
//#define Min(a,b,c) min((a),min((b),(c)))
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<LL, LL>
#define pb(x) push_back(x)
#define x first
#define y second
#define sqr(x) ((x) * (x))
#define EPS 1e-11
#define MEM(x) memset(x, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,138 | 1,359,137 | u682550266 | cpp |
p03685 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#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 reg(i, a, b) for (int i = ((int)(a)); i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#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 reg(i, a, b) for (int i = ((int)(a)); i... | [
"identifier.change",
"call.arguments.change"
] | 1,359,149 | 1,359,150 | u844177429 | cpp |
p03685 | #pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) \
printf("L%d %s => ", __LINE__, #v); \
for... | #pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) \
printf("L%d %s => ", __LINE__, #v); \
for... | [
"expression.operation.binary.remove"
] | 1,359,151 | 1,359,152 | u079330987 | cpp |
p03685 | #include <bits/stdc++.h>
using namespace std;
#define maxn 211111
typedef pair<int, int> pii;
pii a[maxn][2], b[maxn];
int val[maxn], sval[maxn];
int d[maxn][2];
int m;
int n, r, c;
void addpoint(pii x) { b[++m] = x; }
bool onborder(pii x) {
return x.first == 0 || x.first == c || x.second == 0 || x.second == r;
}
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 211111
typedef pair<int, int> pii;
pii a[maxn][2], b[maxn];
int val[maxn], sval[maxn];
int d[maxn][2];
int m;
int n, r, c;
void addpoint(pii x) { b[++m] = x; }
bool onborder(pii x) {
return x.first == 0 || x.first == c || x.second == 0 || x.second == r;
}
... | [
"expression.operation.binary.remove"
] | 1,359,155 | 1,359,156 | u436177633 | cpp |
p03685 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L + R) / 2, N * 2 + 1
#define rseg (L + R) / 2 + 1, R, N... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L + R) / 2, N * 2 + 1
#define rseg (L + R) / 2 + 1, R, N... | [
"expression.operation.unary.add",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,163 | 1,359,162 | u964522424 | cpp |
p03685 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll h, w, n;
ll len(ll x, ll y) {
if (x == 0)
return y;
if (y == h)
return h + x;
if (x == w)
return h + w + (h - y);
if (y == 0)
return h + w + h + (w - x)... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll h, w, n;
ll len(ll x, ll y) {
if (x == 0)
return y;
if (y == h)
return h + x;
if (x == w)
return h + w + (h - y);
if (y == 0)
return h + w + h + (w - x)... | [
"expression.operation.binary.add"
] | 1,359,164 | 1,359,165 | u183203023 | cpp |
p03685 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll h, w, n;
ll len(ll x, ll y) {
if (x == 0)
return y;
if (y == h)
return h + x;
if (x == w)
return h + w + (h - y);
if (y == 0)
return h + w + h + (w - x)... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll h, w, n;
ll len(ll x, ll y) {
if (x == 0)
return y;
if (y == h)
return h + x;
if (x == w)
return h + w + (h - y);
if (y == 0)
return h + w + h + (w - x)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,359,166 | 1,359,165 | u183203023 | cpp |
p03685 | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
template <class T> string tostr(T x) {
stringstream o;
o << x;
return o.str();
}
template <class T> T sqr(T x) { return x * x; }
template <class T> T mypow(T x, int n) {
T r = 1;
while (n > 0) {
if (n & 1)
... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
template <class T> string tostr(T x) {
stringstream o;
o << x;
return o.str();
}
template <class T> T sqr(T x) { return x * x; }
template <class T> T mypow(T x, int n) {
T r = 1;
while (n > 0) {
if (n & 1)
... | [
"expression.operation.binary.remove"
] | 1,359,169 | 1,359,170 | u032865163 | cpp |
p03685 | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
template <class T> string tostr(T x) {
stringstream o;
o << x;
return o.str();
}
template <class T> T sqr(T x) { return x * x; }
template <class T> T mypow(T x, int n) {
T r = 1;
while (n > 0) {
if (n & 1)
... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
template <class T> string tostr(T x) {
stringstream o;
o << x;
return o.str();
}
template <class T> T sqr(T x) { return x * x; }
template <class T> T mypow(T x, int n) {
T r = 1;
while (n > 0) {
if (n & 1)
... | [
"expression.operation.binary.remove",
"expression.operation.binary.add",
"control_flow.return.add"
] | 1,359,171 | 1,359,170 | u032865163 | cpp |
p03685 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, true) : false;
}
typedef long long ll... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, true) : false;
}
typedef long long ll... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,172 | 1,359,173 | u657011188 | cpp |
p03685 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#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 syosu(x) fixed << setpr... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#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 syosu(x) fixed << setpr... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,359,174 | 1,359,175 | u434747175 | cpp |
p03685 | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define X first
#define Y second
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define D double
#define ll long long
#define REP(i, a) for (int i = 0; i < a; i++)
#define REP1(i, a, b) for (int i = a; i < b; i++)
#define REP2(i... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define X first
#define Y second
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define D double
#define ll long long
#define REP(i, a) for (int i = 0; i < a; i++)
#define REP1(i, a, b) for (int i = a; i < b; i++)
#define REP2(i... | [
"call.arguments.change",
"call.arguments.add"
] | 1,359,189 | 1,359,190 | u321788073 | cpp |
p03685 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int r, c, n;
struct P {
int x, y, id;
P() {}
P(int a, int b, int i) : x(a), y(b), id(i) {}
bool operator==(P const &o) { return id == o.id; }
int sc() const {
if (x == 0)
return... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int r, c, n;
struct P {
int x, y, id;
P() {}
P(int a, int b, int i) : x(a), y(b), id(i) {}
bool operator==(P const &o) { return id == o.id; }
int sc() const {
if (x == 0)
return... | [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,359,193 | 1,359,194 | u647100698 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begi... | [
"assignment.change",
"expression.operation.binary.add"
] | 1,359,205 | 1,359,206 | u879436400 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const c... | #include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const c... | [
"call.add",
"call.arguments.change"
] | 1,359,207 | 1,359,208 | u275786410 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,359,209 | 1,359,210 | u450832845 | cpp |
p03686 | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 1,359,213 | 1,359,214 | u379382721 | cpp |
p03686 | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"assignment.value.change",
"call.arguments.change"
] | 1,359,215 | 1,359,214 | u379382721 | cpp |
p03686 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"call.arguments.change"
] | 1,359,216 | 1,359,217 | u239493918 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | [
"control_flow.loop.condition.change"
] | 1,359,224 | 1,359,225 | u133391510 | cpp |
p03686 | #include <bits/stdc++.h>
#include <stdio.h>
#define f(a, b, c) for (register int a = (b); a <= (c); ++a)
#define ff(a, b, c) for (register int a = (b); a >= (c); --a)
#define ll long long
char pbuf[1 << 20], *pp1 = pbuf;
inline void push(char c) {
*pp1 = c;
pp1 = (pp1 - pbuf == (1 << 20) - 1) ? (fwrite(pbuf, 1, 1 <... | #include <bits/stdc++.h>
#include <stdio.h>
#define f(a, b, c) for (register int a = (b); a <= (c); ++a)
#define ff(a, b, c) for (register int a = (b); a >= (c); --a)
#define ll long long
char pbuf[1 << 20], *pp1 = pbuf;
inline void push(char c) {
*pp1 = c;
pp1 = (pp1 - pbuf == (1 << 20) - 1) ? (fwrite(pbuf, 1, 1 <... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,359,237 | 1,359,238 | u732289701 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) \
do { \
cout << "\033[32;1m " << #x << " -> "; \
err(x)... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) \
do { \
cout << "\033[32;1m " << #x << " -> "; \
err(x)... | [
"identifier.replace.add",
"literal.replace.remove"
] | 1,359,239 | 1,359,240 | u923894160 | cpp |
p03686 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m, x, y;
vector<int> ins[N];
namespace seg {
int a[N * 4], tag[N * 4];
#define ls rt << 1
#define rs ls | 1
void build(int rt, int l, int r) {
a[rt] = l;
if (l == r)
return;
int mid = l + r >> 1;
build(ls, l, mid);
build(rs, mi... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m, x, y;
vector<int> ins[N];
namespace seg {
int a[N * 4], tag[N * 4];
#define ls rt << 1
#define rs ls | 1
void build(int rt, int l, int r) {
a[rt] = l;
if (l == r)
return;
int mid = l + r >> 1;
build(ls, l, mid);
build(rs, mi... | [
"assignment.change"
] | 1,359,241 | 1,359,242 | u349355867 | cpp |
p03686 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<LL, int> LP;
const... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<LL, int> LP;
const... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,359,246 | 1,359,247 | u464804957 | cpp |
p03687 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1000000000;
const int maxN = 1010;
const int MOD = 100003;
int **c;
int **s;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1000000000;
const int maxN = 1010;
const int MOD = 100003;
int **c;
int **s;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,359,272 | 1,359,273 | u807919574 | cpp |
p03687 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... | [
"expression.operation.binary.remove"
] | 1,359,282 | 1,359,283 | u387110752 | cpp |
p03687 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#define mem(a, b) memset(a, b, sizeof(a))
#define ll long long
#define ull unsigned long long
#define EPS 1e-8
using nam... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#define mem(a, b) memset(a, b, sizeof(a))
#define ll long long
#define ull unsigned long long
#define EPS 1e-8
using nam... | [
"expression.operation.binary.remove"
] | 1,359,284 | 1,359,285 | u301880699 | cpp |
p03687 | #include "bits/stdc++.h"
//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 100... | #include "bits/stdc++.h"
//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 100... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,359,286 | 1,359,287 | u009275459 | cpp |
p03687 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T... | [
"expression.operation.binary.remove"
] | 1,359,293 | 1,359,294 | u771306245 | cpp |
p03687 | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
int cnt = 0;
int cmax = 0;
int cmin = 101;
for (char c = 'a'; c <= 'z'; c++) {
cnt = 0;
cmax = 0;
for (int ind = 0; ind < s.length(); ind++) {
if (s[ind] != c) {
cnt++;
} else {
if (cnt > c... | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
int cnt = 0;
int cmax = 0;
int cmin = 101;
for (char c = 'a'; c <= 'z'; c++) {
cnt = 0;
cmax = 0;
for (int ind = 0; ind < s.length(); ind++) {
if (s[ind] != c) {
cnt++;
} else {
if (cnt > c... | [] | 1,359,295 | 1,359,296 | u907146198 | cpp |
p03687 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | [
"call.arguments.add"
] | 1,359,297 | 1,359,298 | u608965386 | cpp |
p03687 | #include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | #include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | [
"literal.number.change",
"call.arguments.change"
] | 1,359,299 | 1,359,300 | u983162259 | cpp |
p03687 | #include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | #include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 1,359,301 | 1,359,300 | u983162259 | cpp |
p03687 | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,359,308 | 1,359,309 | u366676780 | cpp |
p03687 | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,359,310 | 1,359,309 | u366676780 | cpp |
p03687 | #include <iostream>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
string S;
int main(void) {
cin >> S;
int ans = 100000000;
REP(i, 0, 26) {
int c = 'a' + i;
int prev = 0;
int m = 0;
REP(j, 0, S.length()) {
if (S[j] == c) {
m = max(m, j - prev ... | #include <iostream>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
string S;
int main(void) {
cin >> S;
int ans = 100000000;
REP(i, 0, 26) {
char c = 'a' + i;
int prev = -1;
int m = 0;
REP(j, 0, S.length()) {
if (S[j] == c) {
m = max(m, j - pre... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,359,313 | 1,359,314 | u981861542 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
string s;
int f(char c) {
int ret = 0;
int t = 0;
rep(i, s.size()) {
if (s[i] == c) {
ret = max(ret, i - t - ... | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
string s;
int f(char c) {
int ret = 0;
int t = -1;
rep(i, s.size()) {
if (s[i] == c) {
ret = max(ret, i - t -... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,359,315 | 1,359,316 | u988832865 | cpp |
p03687 | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using u8t = std::uint64_t;
using i8t = std::int64_t;
#define F(I, N) for (i8t I = 0, _N = N; I < _N; I++)
#define FR(I, N) for (i8... | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using u8t = std::uint64_t;
using i8t = std::int64_t;
#define F(I, N) for (i8t I = 0, _N = N; I < _N; I++)
#define FR(I, N) for (i8... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,359,317 | 1,359,318 | u417702611 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[110] = "";
scanf("%s", s + 1);
int n = strlen(s + 1), ans = 1e9;
for (char ch = 'a'; ch <= 'z'; ch++) {
int val = 0;
int last = 1;
for (int i = 1; i <= n; i++)
if (s[i] == ch) {
val = max(val, i - last);
last = i... | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[110] = "";
scanf("%s", s + 1);
int n = strlen(s + 1), ans = 1e9;
for (char ch = 'a'; ch <= 'z'; ch++) {
int val = 0;
int last = 1;
for (int i = 1; i <= n; i++)
if (s[i] == ch) {
val = max(val, i - last);
last = i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,359,319 | 1,359,320 | u719378199 | cpp |
p03687 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
char s[105];
int n, ans = 0x3f3f3f3f;
vector<int> vec;
int main() {
scanf("%s", s);
n = strl... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
char s[105];
int n, ans = 0x3f3f3f3f;
vector<int> vec;
int main() {
scanf("%s", s);
n = strl... | [
"literal.number.change",
"call.arguments.change"
] | 1,359,323 | 1,359,324 | u182373912 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,329 | 1,359,330 | u194908943 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,359,331 | 1,359,332 | u917282863 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typede... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typede... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,333 | 1,359,334 | u601256797 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int a[100005], n;
int v[100005];
int main() {
while (~scanf("%d", &n)) {
bool flag = 0;
int mi = 1e9, ma = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
mi = min(mi, a[i]);
ma = max(ma, a[i]);
v[a[i]]++;
if (i > 1 && a[i] ... | #include <bits/stdc++.h>
using namespace std;
int a[100005], n;
int v[100005];
int main() {
while (~scanf("%d", &n)) {
bool flag = 0;
int mi = 1e9, ma = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
mi = min(mi, a[i]);
ma = max(ma, a[i]);
v[a[i]]++;
if (i > 1 && a[i] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,335 | 1,359,336 | u018679195 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int a[100005], n;
int v[100005];
int main() {
while (~scanf("%d", &n)) {
bool flag = 0;
int mi = 1e9, ma = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
mi = min(mi, a[i]);
ma = max(ma, a[i]);
v[a[i]]++;
if (i > 1 && a[i] ... | #include <bits/stdc++.h>
using namespace std;
int a[100005], n;
int v[100005];
int main() {
while (~scanf("%d", &n)) {
bool flag = 0;
int mi = 1e9, ma = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
mi = min(mi, a[i]);
ma = max(ma, a[i]);
v[a[i]]++;
if (i > 1 && a[i] ... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 1,359,337 | 1,359,336 | u018679195 | cpp |
p03688 | #include <climits>
#include <iostream>
using namespace std;
int main() {
/*
min → nilai terkecil dari array
max → nilai terbesar dari array
freqMin → berapa kali min muncul
freqMax → berapa kali max muncul
kalo min == max ?
freqMin == n-1 → yes
freqMin*2 <= → yes
else → no
kalo max == min... | #include <climits>
#include <iostream>
using namespace std;
int main() {
/*
min → nilai terkecil dari array
max → nilai terbesar dari array
freqMin → berapa kali min muncul
freqMax → berapa kali max muncul
kalo min == max ?
freqMin == n-1 → yes
freqMin*2 <= → yes
else → no
kalo max == min... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,338 | 1,359,339 | u353919145 | cpp |
p03688 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define eb emplace_back
#define sz(s) (int)(s.size())
#define all(s) s.begin(), s.end()
#define ll long long
const int N = 1e6 + 9;
const int INF = 1e9 + 9;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define eb emplace_back
#define sz(s) (int)(s.size())
#define all(s) s.begin(), s.end()
#define ll long long
const int N = 1e6 + 9;
const int INF = 1e9 + 9;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,359,340 | 1,359,341 | u089230684 | cpp |
p03688 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,359,342 | 1,359,343 | u697968316 | cpp |
p03688 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"expression.operation.binary.remove"
] | 1,359,344 | 1,359,345 | u697968316 | cpp |
p03688 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"expression.operation.binary.remove"
] | 1,359,344 | 1,359,346 | u697968316 | cpp |
p03688 | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | [
"control_flow.branch.if.condition.change"
] | 1,359,351 | 1,359,352 | u115927976 | cpp |
p03688 | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | //ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i,... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,359,353 | 1,359,352 | u115927976 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int n, num, maxn, ans = 1, minn, a[100001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
minn = a[1], maxn = a[n];
if (minn < maxn - 1 || maxn >= n)
ans = 0;
if (maxn == minn) {
if (minn + 1 != n && minn * ... | #include <bits/stdc++.h>
using namespace std;
int n, num, maxn, ans = 1, minn, a[100001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
minn = a[1], maxn = a[n];
if (minn < maxn - 1 || maxn >= n)
ans = 0;
if (maxn == minn) {
if (minn + 1 != n && minn * ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,354 | 1,359,355 | u284432194 | cpp |
p03688 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> PII;
typedef long long int ll;
typedef pair<ll, ll> PLL;
typedef unsigned long long int ULL;
typedef pair<ULL, int> PUI;
#define S second
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> PII;
typedef long long int ll;
typedef pair<ll, ll> PLL;
typedef unsigned long long int ULL;
typedef pair<ULL, int> PUI;
#define S second
#defin... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,359,358 | 1,359,359 | u863370423 | cpp |
p03688 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // 引... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // 引... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,359,364 | 1,359,365 | u339419997 | cpp |
p03688 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int mini = 1e9;
int maxi = 0;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
mini = min(a[i], mini);
maxi = max(a[i], maxi);
}
if (min... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int mini = 1e9;
int maxi = 0;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
mini = min(a[i], mini);
maxi = max(a[i], maxi);
}
if (min... | [
"expression.operation.binary.remove"
] | 1,359,366 | 1,359,367 | u512749016 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.