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 |
|---|---|---|---|---|---|---|---|
p03238 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y) { return y ? GCD(y, x % y) : x; }
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello world" << endl;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y) { return y ? GCD(y, x % y) : x; }
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,715 | 1,023,716 | u810067372 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 1)
cout << "Hello world" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 1)
cout << "Hello World" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,720 | 1,023,721 | u449303900 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
if (n % 2 == 0)
cout << a + b << endl;
else
cout << "Hello"
<< " "
<< "World" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
if (n % 2 == 0)
cout << a + b << endl;
else
cout << "Hello"
<< " "
<< "World" << endl;
}
| [
"variable_declaration.type.change"
] | 1,023,726 | 1,023,727 | u889173297 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
if (X = 1) {
cout << "Hello"
<< " "
<< "World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello"
<< " "
<< "World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 1,023,745 | 1,023,746 | u237390401 | cpp |
p03238 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [
"literal.string.change",
"io.output.change"
] | 1,023,749 | 1,023,750 | u704625420 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else if (n == 1) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,023,751 | 1,023,752 | u864785784 | cpp |
p03238 | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | [
"literal.string.change",
"io.output.change"
] | 1,023,759 | 1,023,760 | u477516105 | cpp |
p03238 | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | [
"literal.string.change",
"io.output.change"
] | 1,023,761 | 1,023,760 | u477516105 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,023,764 | 1,023,765 | u709275480 | cpp |
p03238 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,774 | 1,023,775 | u491256431 | cpp |
p03238 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | [
"literal.string.change",
"io.output.change"
] | 1,023,776 | 1,023,775 | u491256431 | cpp |
p03238 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,777 | 1,023,778 | u096616343 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | [
"literal.string.change",
"io.output.change"
] | 1,023,779 | 1,023,780 | u809967037 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, A, B;
cin >> X;
if (X == 1)
cout << "Hello world";
else {
cin >> A >> B;
cout << A + B;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, A, B;
cin >> X;
if (X == 1)
cout << "Hello World";
else {
cin >> A >> B;
cout << A + B;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,785 | 1,023,786 | u109191542 | cpp |
p03238 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello world" << endl;
else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,791 | 1,023,792 | u155881803 | cpp |
p03238 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <queue>
#include <random>
#include <string>
#include <vector>
#define lint long long int
#define FOR(x, to) for (int x = 0; x < (int)(to); x++) // for簡略表記
#define DUMP(ar) ... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <queue>
#include <random>
#include <string>
#include <vector>
#define lint long long int
#define FOR(x, to) for (int x = 0; x < (int)(to); x++) // for簡略表記
#define DUMP(ar) ... | [
"literal.string.change",
"io.output.change"
] | 1,023,797 | 1,023,798 | u852839243 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const ll INF = 1<<21;
// static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.f... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const ll INF = 1<<21;
// static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.f... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,801 | 1,023,802 | u616090453 | cpp |
p03238 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n, a, b;
if (n == 1) {
cout << "Hello World" << endl;
} else {
cin >> a ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
... | [] | 1,023,807 | 1,023,808 | u261538386 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "hello World" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,813 | 1,023,814 | u328811800 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World!" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,023,817 | 1,023,818 | u176218583 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int a;
cin >> a;
if (a == 1) {
cout << "Hello Wordld" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int a;
cin >> a;
if (a == 1) {
cout << "Hello World" << endl;
} else {... | [
"literal.string.change",
"io.output.change"
] | 1,023,819 | 1,023,820 | u124659583 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int a;
if (a == 1) {
cout << "Hello Wordld" << endl;
} else {
int A,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int a;
cin >> a;
if (a == 1) {
cout << "Hello World" << endl;
} else {... | [
"literal.string.change",
"io.output.change"
] | 1,023,821 | 1,023,820 | u124659583 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello,World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,023,822 | 1,023,823 | u201928947 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello world";
else {
cin >> A;
cin >> B;
cout << A + B;
}
} | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello World";
} else {
cin >> A;
cin >> B;
cout << A + B;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,826 | 1,023,827 | u420245204 | cpp |
p03238 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | [
"literal.string.change",
"io.output.change"
] | 1,023,830 | 1,023,831 | u425758699 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main() {
int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main() {
int... | [
"literal.string.change",
"io.output.change"
] | 1,023,836 | 1,023,837 | u809687368 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main() {
int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main() {
int... | [
"literal.string.change",
"io.output.change"
] | 1,023,838 | 1,023,837 | u809687368 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | [] | 1,023,845 | 1,023,846 | u688825490 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n == 1)
cout << "Hello, World" << endl;
else
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n == 1)
cout << "Hello World" << endl;
else
cout << a + b << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 1,023,847 | 1,023,848 | u647621269 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
switch (N) {
case 1:
cout << "Hello World" << endl;
break;
case 2:
int A, B;
cin >> A >> B;
cout << A + B << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
switch (N) {
case 1:
cout << "Hello World" << endl;
break;
case 2:
int A, B;
cin >> A >> B;
cout << A + B << endl;
break;
}
} | [] | 1,023,863 | 1,023,864 | u735016696 | cpp |
p03238 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"literal.string.change",
"io.output.change"
] | 1,023,865 | 1,023,866 | u516525290 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a;
if (a == 1)
return cout << "Hello world" << endl, 0;
else
return cin >> b >> c, cout << b + c << endl, 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a;
if (a == 1)
return cout << "Hello World" << endl, 0;
else
return cin >> b >> c, cout << b + c << endl, 0;
} | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,023,871 | 1,023,872 | u501873689 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
return cout << "Hello world" << endl, 0;
else
return cin >> b >> c, cout << b + c << endl, 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a;
if (a == 1)
return cout << "Hello World" << endl, 0;
else
return cin >> b >> c, cout << b + c << endl, 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,023,873 | 1,023,872 | u501873689 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
if (n == 1) {
cout << "Hello World\n";
return 0; //直接结束程序
}
//注意：此处可以不加else
cin >> a >> b;
cout << a + b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World\n";
return 0; //直接结束程序
}
//注意：此处可以不加else
cin >> a >> b;
cout << a + b << endl;
return 0;
}
| [] | 1,023,874 | 1,023,875 | u723721005 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A, B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [] | 1,023,880 | 1,023,881 | u430302940 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3], i = 0;
while (cin >> a[i++])
;
if (i == 1)
cout << "Hello World";
else
cout << a[1] + a[2];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3], i = 0;
while (cin >> a[i++])
;
if (a[0] == 1)
cout << "Hello World";
else
cout << a[1] + a[2];
}
| [
"control_flow.branch.if.condition.change"
] | 1,023,885 | 1,023,886 | u505466816 | cpp |
p03238 | #include <bits/stdc++.h>
#define ns "-1"
#define fs(i, x, y, z) for (ll i = x; i <= y; i += z)
#define ft(i, x, y, z) for (ll i = x; i >= y; i += z)
#define ll long long
#define ull unsigned long long
#define db double
#define ms(a, b) memset(a, b, sizeof(a))
#define sz(a) sizeof(a)
using namespace std;
const int rw[] ... | #include <bits/stdc++.h>
#define ns "-1"
#define fs(i, x, y, z) for (ll i = x; i <= y; i += z)
#define ft(i, x, y, z) for (ll i = x; i >= y; i += z)
#define ll long long
#define ull unsigned long long
#define db double
#define ms(a, b) memset(a, b, sizeof(a))
#define sz(a) sizeof(a)
using namespace std;
const int rw[] ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,887 | 1,023,888 | u894627179 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
int a, b;
cin >> n;
if (n == 1)
cout << "Hello Wordl";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
int a, b;
cin >> n;
if (n == 1)
cout << "Hello World";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,023,897 | 1,023,898 | u226023982 | cpp |
p03238 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1)
cout << "Hello world" << endl;
else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1)
cout << "Hello World" << endl;
else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,901 | 1,023,902 | u138273120 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,907 | 1,023,908 | u545364250 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template ... | [] | 1,023,913 | 1,023,914 | u608258653 | cpp |
p03238 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
cin >> a;
if (a... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
cin >> a;
if (a... | [] | 1,023,915 | 1,023,916 | u465760322 | cpp |
p03238 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
cin >> a;
if (a... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
cin >> a;
if (a... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,023,918 | 1,023,916 | u465760322 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define MOD 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define MOD 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | [
"literal.string.change",
"io.output.change"
] | 1,023,919 | 1,023,920 | u430681166 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello World" << endl;
if (N == 2) {
cout << A + B << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello World" << endl;
} else if (N == 2) {
cout << A + B << endl;
}
} | [
"control_flow.branch.else.add"
] | 1,023,927 | 1,023,928 | u704293891 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello world" << endl;
if (N == 2) {
cout << A + B << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello World" << endl;
} else if (N == 2) {
cout << A + B << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.else.add"
] | 1,023,929 | 1,023,928 | u704293891 | cpp |
p03238 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"literal.string.change",
"call.arguments.change"
] | 1,023,941 | 1,023,942 | u284124505 | cpp |
p03238 | #import <iostream>
using namespace std;
main() {
int n, a, b;
cin >> a >> b;
if (a == 1)
cout << "Hello World";
else
cout << a + b;
} | #import <iostream>
using namespace std;
main() {
int n, a, b;
cin >> n >> a >> b;
if (n == 1)
cout << "Hello World";
else
cout << a + b;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,023,946 | 1,023,947 | u551813187 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello World\n";
else
cin >> A >> B;
cout << A + B << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello World\n";
} else {
cin >> A >> B;
cout << A + B << "\n";
}
return 0;
} | [] | 1,023,958 | 1,023,959 | u123265243 | cpp |
p03238 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,965 | 1,023,966 | u552122040 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n = 1) {
puts("Hello World");
} else if (n = 2) {
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n == 1) {
puts("Hello World");
} else if (n == 2) {
cout << a + b << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,023,973 | 1,023,974 | u767995501 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << "Hello World!" << endl;
} else {
ll a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
ll a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,023,982 | 1,023,983 | u255172538 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World!" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,023,988 | 1,023,989 | u066455063 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World!" << endl;
} else {
int A, B;
cin >> A;
cin >> B;
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,023,990 | 1,023,989 | u066455063 | cpp |
p03238 |
#include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n;
if (n == 1) {
cout << "Helllo World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,023,991 | 1,023,992 | u863370423 | cpp |
p03238 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
if (n == 2) {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,023,993 | 1,023,994 | u902803949 | cpp |
p03238 | #include <stdio.h>
int main(void) {
int a;
scanf("%d", &a);
if (a / 2 == 1) {
printf("Hello World");
} else {
int A, B;
scanf("%d", &A);
scanf("%d", &B);
printf("%d", A + B);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a;
scanf("%d", &a);
if (a == 1) {
printf("Hello World");
} else {
int A, B;
scanf("%d", &A);
scanf("%d", &B);
printf("%d", A + B);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 1,024,001 | 1,024,002 | u331047280 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
typ... | [
"literal.string.change",
"io.output.change"
] | 1,024,003 | 1,024,004 | u145483532 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World!";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,009 | 1,024,010 | u383828019 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"literal.string.change",
"io.output.change"
] | 1,024,020 | 1,024,021 | u371702445 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"literal.string.change",
"io.output.change"
] | 1,024,022 | 1,024,021 | u371702445 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello, world" << endl;
if (n == 2) {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
if (n == 2) {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,023 | 1,024,024 | u445457059 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
cout << (a + b) / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"expression.operation.binary.remove"
] | 1,024,027 | 1,024,028 | u882039496 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << 1 << endl;
} else {
int A, B;
cin >> A >> B;
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B... | [
"io.output.change"
] | 1,024,040 | 1,024,041 | u976045502 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
if (N == 1)
cout << "Hello,World" << endl;
else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
if (N == 1)
cout << "Hello World" << endl;
else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,050 | 1,024,051 | u281840563 | cpp |
p03238 | // ABC112A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello Woerld" << endl;
return 0;
} else {
... | // ABC112A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
... | [
"literal.string.change",
"io.output.change"
] | 1,024,052 | 1,024,053 | u733391043 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,024,068 | 1,024,069 | u075520262 | cpp |
p03238 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
//桁
int kt(int a) {
double b = a;
b = log10(b);
int c ... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
//桁
int kt(int a) {
double b = a;
b = log10(b);
int c ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,072 | 1,024,073 | u341447450 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello,World" << endl;
} else {
int a;
int b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a;
int b;
cin >> a >> b;
cout << a + b << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,024,074 | 1,024,075 | u553461888 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
if (n == 1) {
cout << "Hello,World" << endl;
} else {
int a;
int b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a;
int b;
cin >> a >> b;
cout << a + b << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,024,076 | 1,024,075 | u553461888 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello Wolrd" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,024,079 | 1,024,080 | u332153950 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << 'Hello World' << endl;
} else {
int a, b;
cin >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
... | [
"io.output.change",
"literal.string.change"
] | 1,024,081 | 1,024,082 | u272496669 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
} | [] | 1,024,083 | 1,024,084 | u351265848 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
puts("HelloWor... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n;
if (n == 1)
puts("Hello Wo... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,024,093 | 1,024,094 | u319093540 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
if (N == 1) {
cout << "Hello world" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,100 | 1,024,101 | u971089878 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello world" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,102 | 1,024,103 | u416521732 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello world" << endl;
else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,116 | 1,024,117 | u843292252 | cpp |
p03238 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
if (a == 1) {
cout << "Hello World" << endl;
}
if (a == 2) {
int b, c;
cin >> b >> c;
cout << a + b << endl;
}
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
if (a == 1) {
cout << "Hello World" << endl;
}
if (a == 2) {
int b, c;
cin >> b >> c;
cout << c + b << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 1,024,125 | 1,024,126 | u540741303 | cpp |
p03238 | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | [] | 1,024,131 | 1,024,132 | u300866293 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,135 | 1,024,136 | u527058497 | cpp |
p03238 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | [] | 1,024,139 | 1,024,140 | u319945100 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "HelloWorld" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,143 | 1,024,144 | u633728454 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "HelloWorld" << endl;
}
if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,024,149 | 1,024,150 | u263715385 | cpp |
p03238 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <math.h>
usin... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <math.h>
usin... | [] | 1,024,161 | 1,024,162 | u851205244 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello,World" << endl;
}
if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,024,166 | 1,024,167 | u037276799 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int age;
cin >> age;
if (age == 1) {
cout << "Hello World!" << endl;
return 0;
}
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int age;
cin >> age;
if (age == 1) {
cout << "Hello World" << endl;
return 0;
}
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,172 | 1,024,173 | u676654593 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pob pop.back()
#define forn for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int a, b;
if (n == 1)
cout << "Hello world";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pob pop.back()
#define forn for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int a, b;
if (n == 1)
cout << "Hello World";
else {
cin >> a >> b;
cout << a + b;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,177 | 1,024,178 | u972416449 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b;
cin >> N >> a >> b;
if (N == 1) {
cout << "Hello World!" << endl;
}
if (N == 2) {
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b;
cin >> N >> a >> b;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
cout << a + b << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,024,188 | 1,024,189 | u244626757 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello Wolrd" << endl;
} else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else if (n == 2) {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,024,192 | 1,024,193 | u800100718 | cpp |
p03238 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n;
if (n == 1) {
cout <<... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n;
cin >> n;
if (n == 1) {... | [] | 1,024,196 | 1,024,197 | u373164102 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P;
cin >> P;
if (P == 1)
cout << "Hello,World" << endl;
if (P == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P;
cin >> P;
if (P == 1)
cout << "Hello World" << endl;
if (P == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,024,201 | 1,024,202 | u393754572 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello World" << endl;
else if (N == 2)
cin >> A >> B;
cout << A + B << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello World" << endl;
else if (N == 2) {
cin >> A >> B;
cout << A + B << endl;
}
} | [] | 1,024,205 | 1,024,206 | u532401120 | cpp |
p03238 | /* *
*
* Author: Hamkor
*
* */
#include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
typedef long long ll;
const int oo = 1e9;
const ll mod = 100000000;
typedef complex<ll> P;
#define X real()
#define Y imag()
/* * * * * * * * * * */
int main() {
ios_base::sync_with_stdio(0), cin.tie(... | /* *
*
* Author: Hamkor
*
* */
#include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
typedef long long ll;
const int oo = 1e9;
const ll mod = 100000000;
typedef complex<ll> P;
#define X real()
#define Y imag()
/* * * * * * * * * * */
int main() {
ios_base::sync_with_stdio(0), cin.tie... | [
"literal.string.change",
"io.output.change",
"io.output.newline.add"
] | 1,024,209 | 1,024,210 | u261263275 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N, A, B;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
cout << A + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
cout << A + B << endl;
}
}
| [] | 1,024,211 | 1,024,212 | u928317689 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
if (N = 1) {
cout << "Hello World";
}
if (N = 2) {
cout << A + B;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
if (N == 1) {
cout << "Hello World";
}
if (N == 2) {
cout << A + B;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,024,213 | 1,024,214 | u389766217 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
if (N = 1) {
cout << "hello world";
}
if (N = 2) {
cout << A + B;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
if (N == 1) {
cout << "Hello World";
}
if (N == 2) {
cout << A + B;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,215 | 1,024,214 | u389766217 | cpp |
p03238 | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | [
"literal.string.change",
"io.output.change"
] | 1,024,216 | 1,024,217 | u024867716 | cpp |
p03238 | #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
if (n == 1)
printf("Hello world\n");
else {
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
}
return 0;
}
| #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
if (n == 1)
printf("Hello World\n");
else {
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,024,218 | 1,024,219 | u000120715 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
if (n == 2)
cin >> a;
cin >> b;
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
if (n == 2) {
cin >> a;
cin >> b;
cout << a + b << endl;
}
} | [] | 1,024,220 | 1,024,221 | u079470909 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
if (N = 1) {
cout << "Hello World" << endl;
}
if (N = 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
}
if (N == 2) {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,024,230 | 1,024,231 | u096717230 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.