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 9
values |
|---|---|---|---|---|---|---|---|
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 180) * N;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180;
}
| [
"literal.number.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 835,104 | 835,105 | u618604643 | cpp |
p03023 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"literal.number.change",
"io.output.change"
] | 835,106 | 835,107 | u348670055 | cpp |
p03023 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | [
"literal.number.change",
"io.output.change"
] | 835,108 | 835,107 | u348670055 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
int main() {
ll n;
cin >> n;
cout << (n - 1) * 180 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
int main() {
ll n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 835,120 | 835,121 | u136725765 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 90 * (N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 835,124 | 835,125 | u609576113 | cpp |
p03023 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(),... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(),... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 835,126 | 835,127 | u190234543 | cpp |
p03023 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * 180;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180;
} | [] | 835,128 | 835,129 | u768204022 | cpp |
p03023 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 - (N - 2);
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2);
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 835,130 | 835,131 | u710135612 | cpp |
p03023 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | [
"literal.number.change",
"io.output.change"
] | 835,145 | 835,146 | u890465662 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * 180 - 360) / n << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * 180 - 360) << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 835,151 | 835,152 | u882821419 | cpp |
p03023 | #include <cmath>
#include <iostream>
int main() {
int N;
std::cin >> N;
int ans = 180 * 2 * N - 360 * 2;
std::cout << ans << std::endl;
return 0;
}
| #include <cmath>
#include <iostream>
int main() {
int N;
std::cin >> N;
int ans = 180 * N - 360;
std::cout << ans << std::endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 835,153 | 835,154 | u936600428 | cpp |
p03023 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) / 180 << endl;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 835,159 | 835,160 | u203033720 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | [
"literal.number.change",
"io.output.change"
] | 835,169 | 835,170 | u344425917 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << 180 * N - 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
return 0;
}
| [] | 835,178 | 835,179 | u500092662 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << (180 * (a - 2) / a) * a << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << 180 * (a - 2) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 835,180 | 835,181 | u092312410 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << a * 60 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << 180 * (a - 2) << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 835,182 | 835,181 | u092312410 | cpp |
p03022 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int, pair<int, int>>
const int MAX = 510000;
const int MOD = 998244353;
const int INV2 = (MOD + 1) / 2;
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int, pair<int, int>>
const int MAX = 510000;
const int MOD = 998244353;
const int INV2 = (MOD + 1) / 2;
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
... | [
"assignment.change"
] | 835,197 | 835,198 | u651317892 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 * n - 2;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d;
cout << 180 * (n - 2);
return 0;
}
| [
"variable_declaration.add"
] | 835,207 | 835,208 | u848862823 | cpp |
p03023 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
int x = n - 2;
cout << 360 * x;
} | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int x = n - 2;
cout << 180 * x;
} | [
"literal.number.change",
"io.output.change"
] | 835,211 | 835,212 | u083006500 | cpp |
p03023 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * 180 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 835,215 | 835,216 | u312172322 | cpp |
p03023 | #include <iostream>
int main() {
using namespace std;
int N;
cin >> N;
cout << 60 * N << endl;
return 0;
} | #include <iostream>
int main() {
using namespace std;
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 835,228 | 835,229 | u364278719 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * 60 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 835,230 | 835,231 | u652609504 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * 180 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
return 0;
} | [] | 835,232 | 835,231 | u652609504 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N - 2 * 180;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180;
}
| [] | 835,235 | 835,236 | u208073493 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (180 * (N - 2)) / N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
} | [
"expression.operation.binary.remove"
] | 835,242 | 835,243 | u926575240 | cpp |
p03023 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
n = (n - 2) * 180;
printf("%d¥n", n);
return 0;
}
| #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
n = (n - 2) * 180;
printf("%d", n);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 835,246 | 835,247 | u180133008 | cpp |
p03023 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
n = (n - 2) * 180;
printf("%d¥n", n);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
n = (n - 2) * 180;
printf("%d", n);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 835,248 | 835,247 | u180133008 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
cout << ((180 * (n - 2)) / n) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
cout << ((180 * (n - 2))) << endl;
} | [
"expression.operation.binary.remove"
] | 835,251 | 835,252 | u783217740 | cpp |
p03023 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | [
"literal.number.change",
"io.output.change"
] | 835,259 | 835,260 | u040251933 | cpp |
p03023 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 + (N - 3) * 90 << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 835,262 | 835,263 | u684863590 | cpp |
p03023 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * 90 << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 835,264 | 835,263 | u684863590 | cpp |
p03023 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << (180 + N * 180);
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << (180 + (N - 3) * 180);
return 0;
} | [] | 835,267 | 835,266 | u894950682 | cpp |
p03023 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * 90 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 835,270 | 835,271 | u953268227 | cpp |
p03023 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [] | 835,274 | 835,275 | u222293734 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 3) * 180 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 835,278 | 835,279 | u200855589 | cpp |
p03023 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [] | 835,284 | 835,285 | u074445770 | cpp |
p03023 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [] | 835,286 | 835,287 | u381714561 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define str string
#define sec .second
ll MOD = 1000000007, INFL = 1ll << 60, INF = 1 << 30;
ll A[100][100] = {};
ll X[1000000] = {};
ll rui[100002] = {}, ruin[100002] = {};
int dy[] = {0, 0, 1, -1}, dx[] = {1, -1, 0, 0};
vector<ll> v;
ll a = 0, b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define str string
#define sec .second
ll MOD = 1000000007, INFL = 1ll << 60, INF = 1 << 30;
ll A[100][100] = {};
ll X[1000000] = {};
ll rui[100002] = {}, ruin[100002] = {};
int dy[] = {0, 0, 1, -1}, dx[] = {1, -1, 0, 0};
vector<ll> v;
ll a = 0, b... | [] | 835,292 | 835,293 | u109792330 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * 180 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 835,304 | 835,305 | u637284188 | cpp |
p03023 | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 835,312 | 835,313 | u799443198 | cpp |
p03023 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H;
cin >> H;
int ans = 180 * (3 - 2);
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H;
cin >> H;
int ans = 180 * (H - 2);
cout << ans << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 835,316 | 835,317 | u430797067 | cpp |
p03023 | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Senky_Bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD ... | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Senky_Bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD ... | [
"literal.number.change",
"io.output.change"
] | 835,320 | 835,321 | u942813425 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define sz(a) ll((a).size())
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c).begin()) i = (c).begi... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define sz(a) ll((a).size())
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c).begin()) i = (c).begi... | [
"literal.number.change",
"io.output.change"
] | 835,323 | 835,324 | u670919462 | cpp |
p03023 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"expression.operation.binary.remove",
"literal.number.change",
"expression.operation.binary.change"
] | 835,325 | 835,326 | u837951457 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * 180 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 835,331 | 835,332 | u096717230 | cpp |
p03023 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * 90;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180;
} | [
"literal.number.change",
"io.output.change"
] | 835,333 | 835,334 | u659075447 | cpp |
p03023 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
//マクロ定義
#define vvint(vec, n, m, l) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
//マクロ定義
#define vvint(vec, n, m, l) ... | [
"expression.operation.binary.add"
] | 835,342 | 835,343 | u776194115 | cpp |
p03023 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
n = (n - 3) * 180;
cout << n;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
n = (n - 2) * 180;
cout << n;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 835,344 | 835,345 | u664272778 | cpp |
p03023 | #include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) / N << endl;
}
| #include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
}
| [
"expression.operation.binary.remove"
] | 835,348 | 835,349 | u695857481 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cout << (N - 2) * 180 << endl;
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
};
| [] | 835,357 | 835,358 | u987594251 | cpp |
p03023 | #include <stdio.h>
int main(void) {
int n, m;
char str[1000];
int i, j;
int ans = 0;
scanf("%d", &n);
if (n == 3) {
ans = 180;
} else {
ans = 180 * (n - 3);
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int n, m;
char str[1000];
int i, j;
int ans = 0;
scanf("%d", &n);
if (n == 3) {
ans = 180;
} else {
ans = 180 + 180 * (n - 3);
}
printf("%d\n", ans);
return 0;
} | [
"assignment.change"
] | 835,359 | 835,360 | u015875086 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 835,361 | 835,362 | u545411641 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int lose = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose >= 7)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int lose = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose > 7)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,406 | 835,410 | u528258842 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
rep(i, k) {
if (s.at(i) == 'o')
cnt++;
}
if (8 - cnt >= 15 - k)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
rep(i, k) {
if (s.at(i) == 'o')
cnt++;
}
if (8 - cnt <= 15 - k)
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,412 | 835,414 | u166218280 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const intll INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int now = 0;
rep(i, s.size()) {
if (s.at(i) == 'x')
now++... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const intll INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int now = 0;
rep(i, s.size()) {
if (s.at(i) == 'x')
now++... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,416 | 835,418 | u260907804 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o')
count++;
}
if (15 - s.size() + count >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o')
count++;
}
if (15 - s.size() + count >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,433 | 835,434 | u516876944 | cpp |
p03024 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"control_flow.branch.if.condition.change"
] | 835,435 | 835,437 | u882039496 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
const long long INF = 1152921504606846976;
const long double PI = 3.1415926535897932;
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<long long, lo... | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
const long long INF = 1152921504606846976;
const long double PI = 3.1415926535897932;
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<long long, lo... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,468 | 835,473 | u190580703 | cpp |
p03024 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool ... | [
"control_flow.branch.if.condition.change"
] | 835,496 | 835,497 | u593934357 | cpp |
p03024 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"call.remove"
] | 835,502 | 835,504 | u195132800 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "YES" << endl;
else
cout << "NO" << en... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,523 | 835,525 | u191484928 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "Yes" << endl;
else
cout << "No" << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "YES" << endl;
else
cout << "NO" << en... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,531 | 835,525 | u191484928 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "Yes" << endl;
else
cout << "No" << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
int k = s.size();
int cnt = 0;
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
cnt++;
}
if (15 - k + cnt >= 8)
cout << "YES" << endl;
else
cout << "NO" << en... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,531 | 835,533 | u191484928 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long t, i, p = 0;
string s;
cin >> s;
t = s.size();
for (i = 0; i < t; i++) {
if (s[i] == 'o')
p++;
}
p = p + 15 - t;
if (p >= 7)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long t, i, p = 0;
string s;
cin >> s;
t = s.size();
for (i = 0; i < t; i++) {
if (s[i] == 'o')
p++;
}
p = p + 15 - t;
if (p >= 8)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,535 | 835,537 | u662180008 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main() {
string s;
cin >> s;
int k = s.size();
int l = 0;
rep(i, k) if (s[i] == 'x') l++;
if (l <= 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main() {
string s;
cin >> s;
int k = s.size();
int l = 0;
rep(i, k) if (s[i] == 'x') l++;
if (l <= 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,539 | 835,541 | u389007679 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,543 | 835,545 | u449123607 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
count++;
}
}
if (count + 15 - S.size() >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
count++;
}
}
if (count + 15 - S.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,555 | 835,557 | u209457657 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'x')
cnt++;
}
if (cnt >= 8)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'x')
cnt++;
}
if (cnt >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,580 | 835,582 | u533566373 | cpp |
p03024 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 835,588 | 835,590 | u614128939 | cpp |
p03024 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes c... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 835,596 | 835,598 | u424602097 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
string s;
int n, win, lose, match;
int main() {
cin >> s;
n = s.length();
for (int i = 1; i <= n; i++) {
if (s[i] == 'o') {
win++;
} else {
lose++;
}
match++;
}
if ((8 - win) <= (15 - match)) {
cout << "YES" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
string s;
int n, win, lose, match;
int main() {
cin >> s;
n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == 'o') {
win++;
} else {
lose++;
}
match++;
}
if ((8 - win) <= (15 - match)) {
cout << "YES" << endl;
} else {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 835,600 | 835,602 | u851275071 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
string S;
cin >> S;
int win = 0;
int lose = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
win++;
} else {
lose++;
}
}
if (win >= 7 || lose < 8) {
cout << "... | #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
string S;
cin >> S;
int win = 0;
int lose = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
win++;
} else {
lose++;
}
}
if (win >= 7 || lose < 8) {
cout << "... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,604 | 835,606 | u629548179 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o') {
count++;
}
}
if (count + 15 - s.size() >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o') {
count++;
}
}
if (count + 15 - s.size() >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,374 | 835,375 | u955282280 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x, cnt = 0;
cin >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'o') {
++cnt;
}
}
x = 15 - s.size();
if (cnt + x >= 8) {
cout << "YES\n";
} else
cout << "NO\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x, cnt = 0;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'o') {
++cnt;
}
}
x = 15 - s.size();
if (cnt + x >= 8) {
cout << "YES\n";
} else
cout << "NO\n";
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 835,376 | 835,377 | u600244905 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
string s, t = "ooooooooooooooooooo";
cin >> n >> s;
s += t;
ll cnt = 0;
for (int i = 0; i < 15; i++)
if (s[i] == 'o')
cnt++;
cout << (cnt >= 8 ? "YES" : "NO");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t = "ooooooooooooooooooo";
cin >> s;
s += t;
ll cnt = 0;
for (int i = 0; i < 15; i++)
if (s[i] == 'o')
cnt++;
cout << (cnt >= 8 ? "YES" : "NO");
return 0;
}
| [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 835,378 | 835,379 | u774202056 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,380 | 835,381 | u393754572 | cpp |
p03024 | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o')
cnt++;
}
if (cnt >= 8)
puts("YES\n");
else
puts("NO\n");
return 0;
} | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
cnt++;
}
if (cnt <= 7)
puts("YES\n");
else
puts("NO\n");
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,382 | 835,383 | u440588451 | cpp |
p03024 | #include <bits/stdc++.h>
#include <iomanip>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string S;
int ans = 0;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
ans++;
}
}
if (ans + (S.size() - 15) >= 8) {
cout << "YES" << endl;
} else {
co... | #include <bits/stdc++.h>
#include <iomanip>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string S;
int ans = 0;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
ans++;
}
}
if (ans + (15 - S.size()) >= 8) {
cout << "YES" << endl;
} else {
co... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 835,386 | 835,387 | u353748264 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
string s;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
string s;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,395 | 835,396 | u828388155 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 835,403 | 835,404 | u893330446 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = count(s.begin(), s.end(), 'o');
if (cnt >= 8)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = count(s.begin(), s.end(), 'x');
if (cnt >= 8)
cout << "NO";
else
cout << "YES";
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 835,409 | 835,411 | u472645805 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'x')
c++;
}
cout << ((c >= 7) ? "NO" : "YES") << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'x')
c++;
}
cout << ((c > 7) ? "NO" : "YES") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 835,413 | 835,415 | u356754940 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o')
c++;
}
cout << ((c >= 7) ? "Yes" : "No") << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'x')
c++;
}
cout << ((c > 7) ? "NO" : "YES") << endl;
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 835,419 | 835,415 | u356754940 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | [
"identifier.change",
"call.function.change"
] | 835,432 | 835,436 | u592686932 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
count++;
}
if (count <= 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
count++;
}
if (count < 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,439 | 835,441 | u902803949 | cpp |
p03024 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,451 | 835,453 | u693386219 | cpp |
p03024 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort(all(a))
#define rSORT(a, i) sort(all(a), (i))
using ll = long long;
constexpr ll INF = 10000000000;
constexpr ll MOD = 1000000007;
constexpr int MAX = 2000200;
using namespace std;
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort(all(a))
#define rSORT(a, i) sort(all(a), (i))
using ll = long long;
constexpr ll INF = 10000000000;
constexpr ll MOD = 1000000007;
constexpr int MAX = 2000200;
using namespace std;
int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,455 | 835,457 | u955534952 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,458 | 835,463 | u518883877 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define uint unsigned long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end());
#d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define uint unsigned long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end());
#d... | [] | 835,469 | 835,470 | u450832845 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
int win = 0;
for (char ch : s) {
if (ch == 'o') {
win++;
}
}
for (int i = 0; i < 15 - s.length(); i++) {
win++;
}
if (win >= 8) {
std::cout << "... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
int win = 0;
for (char ch : s) {
if (ch == 'o') {
win++;
}
}
for (int i = 0; i < 15 - s.length(); i++) {
win++;
}
if (win >= 8) {
std::cout << "... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 835,471 | 835,472 | u430479790 | cpp |
p03024 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,474 | 835,475 | u852449189 | cpp |
p03024 | // 2_m-solutions2019_b
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <local... | // 2_m-solutions2019_b
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <local... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,510 | 835,512 | u811561461 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 835,514 | 835,516 | u263715385 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | [
"identifier.change"
] | 835,518 | 835,519 | u458798873 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a <... | #include <bits/stdc++.h>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a <... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,521 | 835,522 | u840105874 | cpp |
p03024 | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define dlog(str) cout << "====" << str << endl;
#define INF 999999999
#define REP(i, n) for (int i = 0, i##_l = (n)... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,524 | 835,526 | u840105874 | cpp |
p03024 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 835,528 | 835,530 | u372550522 | cpp |
p03024 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i<n; i++)
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'x')
a++;
}
cout << (a >= 8 ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i<n; i++)
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'x')
a++;
}
cout << (a >= 8 ? "NO" : "YES") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,559 | 835,561 | u534417782 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'x')
l++;
}
if (l >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'x')
l++;
}
if (l >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"variable_declaration.value.change"
] | 835,595 | 835,597 | u013203292 | cpp |
p03024 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int num = s.size();
int count = 0;
// cout << num << endl;
for (int i = 0; i < num; i++) {
if (s[i] == 'x') {
count++;
}
}
if (count >= 8) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
retu... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int num = s.size();
int count = 0;
// cout << num << endl;
for (int i = 0; i < num; i++) {
if (s[i] == 'x') {
count++;
}
}
if (count >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
retu... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,611 | 835,613 | u689134705 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.