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 |
|---|---|---|---|---|---|---|---|
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
int ans = 0;
bool shower;
do {
shower = false;
for (int i = 0; i < N; i++) {
if (H[i] == 0)
continue;
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
int ans = 0;
bool shower;
do {
shower = false;
for (int i = 0; i < N; i++) {
if (H[i] == 0)
continue;
... | [
"control_flow.break.add"
] | 945,696 | 945,697 | u922974720 | cpp |
p03147 | #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;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
while (*max_element(h.begin(), h.end()) > 0) {
ans++;
bool first = false, end = false;
for (i... | #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;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
while (*max_element(h.begin(), h.end()) > 0) {
ans++;
bool first = false, end = false;
for (i... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 945,698 | 945,699 | u835561357 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
std::vector<int> h(N);
std::for_each(h.begin(), h.end(), [](auto &x) { cin >> x; });
const auto max_height_it = std::max_element(h.crbegin(), h.crend());
ll ans = 0;
auto l = h.begin();
while (*max_h... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
std::vector<int> h(N);
std::for_each(h.begin(), h.end(), [](auto &x) { cin >> x; });
const auto max_height_it = std::max_element(h.crbegin(), h.crend());
ll ans = 0;
auto l = h.begin();
while (*max_h... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,700 | 945,701 | u279109548 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int &hi : h)
cin >> hi;
int ans = h.front();
for (int i = 0; i + 1 < n; i++) {
int diff = h[i] - h[i + 1];
if (diff > 0)
ans += diff;
}
cout << ans << e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int &hi : h)
cin >> hi;
int ans = h.front();
for (int i = 0; i + 1 < n; i++) {
int diff = h[i + 1] - h[i];
if (diff > 0)
ans += diff;
}
cout << ans << e... | [
"expression.operation.binary.remove"
] | 945,706 | 945,707 | u624475441 | cpp |
p03147 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int h;
int max_h = 0;
vector<int> hs;
int ans;
cin >> N;
hs.push_back(0);
for (int ni = 0; ni < N; ni++) {
cin >... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int h;
int max_h = 0;
vector<int> hs;
int ans;
cin >> N;
hs.push_back(0);
for (int ni = 0; ni < N; ni++) {
cin ... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 945,708 | 945,709 | u388763757 | cpp |
p03147 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
double pai = 3.1415926535;
string atc = "atcoder";
typedef... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
double pai = 3.1415926535;
string atc = "atcoder";
typedef... | [
"misc.opposites",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"call.function.change"
] | 945,741 | 945,742 | u196798307 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int h[N + 2];
h[0] = 0;
h[N + 1] = 0;
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int result = 0;
for (int i = 0; i < N; i++) {
if (h[i] < h[i + 1] and h[i + 1] >= ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int h[N + 2];
h[0] = 0;
h[N + 1] = 0;
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int result = 0;
for (int i = 0; i < N; i++) {
if (h[i] < h[i + 1] and h[i + 1] >= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,751 | 945,752 | u680707192 | cpp |
p03147 | #include <stdio.h>
int main(void) {
int n;
int i;
int h[100];
int x = 0, y = 0;
int ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
while (true) {
if (x == n)
break;
if (h[x] == 0)
x++;
if (h[x] > 0) {
y = x;
while (h[y] > 0 && y < ... | #include <stdio.h>
int main(void) {
int n;
int i;
int h[100];
int x = 0, y = 0;
int ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
while (true) {
if (x == n)
break;
if (h[x] == 0) {
x++;
continue;
}
if (h[x] > 0) {
y = x;
... | [] | 945,753 | 945,754 | u932138415 | cpp |
p03147 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[105], n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int k = 0;
for (int i = 1;; i++) {
for (int j = 0; j < n; j++) {
if (a[j] != 0) {
k = 1;
}
if (k =... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[105], n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int k = 0;
for (int i = 0;; i++) {
for (int j = 0; j < n; j++) {
if (k == 0 && a[j] != 0) {
k = 1;
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 945,761 | 945,762 | u379288456 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1e9
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int,... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1e9
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,763 | 945,764 | u342051078 | cpp |
p03147 | #include <iostream>
#include <vector>
using namespace std;
int main() {
//入力
int n;
cin >> n;
vector<int> flower(n);
int smallest;
for (int i = 0; i < n; i++) {
cin >> flower[i];
if (i == 0) {
smallest = flower[i];
} else if (smallest > flower[i]) {
smallest = flower[i];
}
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
//入力
int n;
cin >> n;
vector<int> flower(n);
int smallest;
for (int i = 0; i < n; i++) {
cin >> flower[i];
if (i == 0) {
smallest = flower[i];
} else if (smallest > flower[i]) {
smallest = flower[i];
}
}
... | [] | 945,765 | 945,766 | u775507068 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
if (a[i] > a[i - 1]) {
ans += a[i] - a[i - 1];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > a[i - 1]) {
ans += a[i] - a[i - 1];
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 945,767 | 945,768 | u401900157 | cpp |
p03147 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int temp = 0;
int ans = 0;
while (n--) {
int x;
cin >> x;
if (x - temp > 0)
ans += (x - temp);
x = temp;
}
cout << ans;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int temp = 0;
int ans = 0;
while (n--) {
int x;
cin >> x;
if (x - temp > 0)
ans += (x - temp);
temp = x;
}
cout << ans;
// your code goes here
return 0;
} | [
"assignment.change"
] | 945,778 | 945,779 | u629333789 | cpp |
p03147 | /*
#問題：
#分析：
#オブジェクト：
#条件：
#要求：
#解法：
*/
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#includ... | /*
#問題：
#分析：
#オブジェクト：
#条件：
#要求：
#解法：
*/
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#includ... | [
"assignment.change"
] | 945,782 | 945,783 | u185249212 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int h[105];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> h[i];
int cnt = 0;
int indexS, indexE;
// int count = 3;
bool isZero = true;
for... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int h[105];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> h[i];
int cnt = 0;
int indexS, indexE;
// int count = 3;
bool isZero = true;
for... | [] | 945,784 | 945,785 | u806800460 | cpp |
p03147 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
int h[n];
for (int i = 0; i < n; ++i) {
std::cin >> h[i];
}
int sum = 0;
for (int i = 1; i < n; ++i) {
if (h[i - 1] - h[i] > 0) {
sum += h[i - 1] - h[i];
}
}
sum += h[n];
std::cout << sum << std::endl;
retu... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int sum = 0;
for (int i = 1; i < n; i++) {
if (h[i - 1] - h[i] > 0) {
sum += h[i - 1] - h[i];
}
}
sum += h[n - 1];
std::cout << sum << std::endl;
... | [
"assignment.change"
] | 945,790 | 945,791 | u540971283 | cpp |
p03147 | #include <algorithm>
#include <iostream>
using namespace std;
#define ENDL "\n"
int N, h, hh;
int ans = 0;
void f() {
if (h > hh) {
ans += hh - h;
}
h = hh;
}
int main() {
cin >> N;
h = 0;
for (int i = 0; i < N; i++) {
cin >> hh;
f();
}
hh = 0;
f();
cout << ans << ENDL;
//
return ... | #include <algorithm>
#include <iostream>
using namespace std;
#define ENDL "\n"
int N, h, hh;
int ans = 0;
void f() {
if (h > hh) {
ans += h - hh;
}
h = hh;
}
int main() {
cin >> N;
h = 0;
for (int i = 0; i < N; i++) {
cin >> hh;
f();
}
hh = 0;
f();
cout << ans << ENDL;
//
return ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 945,798 | 945,799 | u402629484 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
bool check(vector<int> &h) {
int i;
REP(i, h.size()) if (h[i] != 0) return true;
return false;
}
int main() {
int i, N;
vector<int> h;
cin >> N;
REP(i, N) {
int x;
cin >> x;
h.emplace_back... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
bool check(vector<int> &h) {
int i;
REP(i, h.size()) if (h[i] != 0) return true;
return false;
}
int main() {
int i, N;
vector<int> h;
cin >> N;
REP(i, N) {
int x;
cin >> x;
h.emplace_back... | [
"control_flow.break.add"
] | 945,802 | 945,803 | u968790411 | cpp |
p03147 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, flag;
int hmax = 0;
int hsum = 0;
int rdc = 0;
vector<int> h;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
hsum += h[i];
if (hmax < h[i])
hmax = h[i];
}
for (int i = 0; i < hm... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, flag;
int hmax = 0;
int hsum = 0;
int rdc = 0;
vector<int> h;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
hsum += h[i];
if (hmax < h[i])
hmax = h[i];
}
//
// cout<< hsum <<... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 945,809 | 945,810 | u672995180 | cpp |
p03147 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, l;
int i = 0;
cin >> n;
vector<int> table(n + 1);
for (int i = 0; i < n; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, l;
int i = 0;
cin >> n;
int table[n + 1];
for (int i = 0; i < n; i++) {
... | [
"call.arguments.change"
] | 945,811 | 945,812 | u419307948 | cpp |
p03147 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N;
int h[120] = {};
int flag = 0, ans = 0;
int fzero, lzero;
cin >> N;
for (int i = 0; i < N; i++) {
cin >>... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N;
int h[120] = {};
int flag = 0, ans = 0;
int fzero, lzero;
cin >> N;
for (int i = 0; i < N; i++) {
cin >>... | [
"assignment.add"
] | 945,813 | 945,814 | u371535422 | cpp |
p03147 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"control_flow.break.add"
] | 945,819 | 945,820 | u057611820 | cpp |
p03147 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"control_flow.break.add"
] | 945,821 | 945,820 | u057611820 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int cnt = 0;
while (true) {
for (int i = 0; i < N; ++i) {
if (h[i] > 0) {
int m = h[i];
int j = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int cnt = 0;
while (true) {
for (int i = 0; i < N; ++i) {
if (h[i] > 0) {
int m = h[i];
int j = i + 1;
... | [
"assignment.add"
] | 945,851 | 945,852 | u432456012 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"variable_declaration.type.change"
] | 945,857 | 945,858 | u190907730 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
while (true) {
bool flag = true;
for (int i = 0; i < N; i++) {
if (h[i] == 0)
continue;
flag = false;
int minh = 1000;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
while (true) {
bool flag = true;
for (int i = 0; i < N; i++) {
if (h[i] == 0)
continue;
flag = false;
int minh = 1000;
... | [
"control_flow.break.add"
] | 945,885 | 945,886 | u636387751 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
vector<int> v;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 0; i < n; i++) {
while (v[i] > 0) {
for (int j = i; j < n; j++) {
if (v[j] > 0)
v[j]--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
vector<int> v;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 0; i < n; i++) {
while (v[i] > 0) {
for (int j = i; j < n; j++) {
if (v[j] > 0)
v[j]--;
... | [] | 945,895 | 945,896 | u673058289 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
vector<int> v;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 0; i < n; i++) {
while (v[i] != 0) {
for (int j = i; j < n; j++) {
if (v[i] > 0)
v[i]--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
vector<int> v;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 0; i < n; i++) {
while (v[i] > 0) {
for (int j = i; j < n; j++) {
if (v[j] > 0)
v[j]--;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 945,897 | 945,896 | u673058289 | cpp |
p03147 | #include <iostream>
using namespace std;
int main() {
int N, count = 0, flag, end, m;
cin >> N;
int i = 0, h[N];
while (i < N) {
cin >> h[i];
i++;
}
while (true) {
flag = 0;
end = 0;
for (i = 0; i < N; i++) {
if (h[i] > 0) {
end = 1;
h[i]--;
if (flag == 0)... | #include <iostream>
using namespace std;
int main() {
int N, count = 0, flag, end, m;
cin >> N;
int i = 0, h[N];
while (i < N) {
cin >> h[i];
i++;
}
while (true) {
flag = 0;
end = 0;
for (i = 0; i < N; i++) {
if (h[i] > 0) {
end = 1;
h[i]--;
if (flag == 0)... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 945,900 | 945,901 | u889812821 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> hs;
int n;
int main() {
cin >> n;
hs.resize(n, 0);
for (int i = 0; i < n; i++)
cin >> hs[i];
if (n == 1) {
cout << hs[0] << endl;
return 0;
}
if (n == 2) {
cout << max(hs[0], hs[1]) << endl;
ret... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> hs;
int n;
int main() {
cin >> n;
hs.resize(n, 0);
for (int i = 0; i < n; i++)
cin >> hs[i];
if (n == 1) {
cout << hs[0] << endl;
return 0;
}
if (n == 2) {
cout << max(hs[0], hs[1]) << endl;
ret... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,902 | 945,903 | u656732735 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> hs;
int n;
int main() {
cin >> n;
hs.resize(n, 0);
for (int i = 0; i < n; i++)
cin >> hs[i];
if (n == 1) {
cout << hs[0] << endl;
return 0;
}
if (n == 2) {
cout << max(hs[0], hs[1]) << endl;
}
v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> hs;
int n;
int main() {
cin >> n;
hs.resize(n, 0);
for (int i = 0; i < n; i++)
cin >> hs[i];
if (n == 1) {
cout << hs[0] << endl;
return 0;
}
if (n == 2) {
cout << max(hs[0], hs[1]) << endl;
ret... | [
"control_flow.return.add",
"control_flow.return.0.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,904 | 945,903 | u656732735 | cpp |
p03147 | // 解説記事を読んで書いたもの
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N + 1];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
// i : h[i]>0となる最小の添字
for (int i = 0; i < N; i++) {
while (h[i] > 0) {
// h[i] から h[j] までが一回の操作で同時に高さを減らせるかたまり
for (int ... | // 解説記事を読んで書いたもの
// 参考: http://kazune-lab.net/contest/2019/01/20/abc116/
// 参考: https://atcoder.jp/contests/abc116/submissions/4053275
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N + 1];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
// i : h[i]>0となる最小の添... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 945,905 | 945,906 | u341347211 | cpp |
p03147 | #include <iostream>
using namespace std;
int main() {
int n;
int h[105];
int ans = 0;
cin >> n;
h[0] = 0;
for (int i = 1; i < n; i++) {
cin >> h[i];
if (h[i] > h[i - 1]) {
ans += h[i] - h[i - 1];
}
}
cout << ans << endl;
return (0);
}
| #include <iostream>
using namespace std;
int main() {
int n;
int h[105];
int ans = 0;
cin >> n;
h[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
if (h[i] > h[i - 1]) {
ans += h[i] - h[i - 1];
}
}
cout << ans << endl;
return (0);
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 945,911 | 945,912 | u074924050 | cpp |
p03147 | #include <iostream>
#define fori(x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, op = 0;
cin >> N;
int arr[107];
fori(0, N) cin >> arr[i];
bool iswatering = 1;
while (iswatering) {
int m = 1000, numzero... | #include <iostream>
#define fori(x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, op = 0;
cin >> N;
int arr[107];
fori(0, N) cin >> arr[i];
bool iswatering = 1;
while (iswatering) {
int m = 1000, numzero... | [
"assignment.add"
] | 945,915 | 945,916 | u229349441 | cpp |
p03147 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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; i >= 0; i--)
#define FOREACH(x, ... | [
"control_flow.break.add"
] | 945,917 | 945,918 | u102602414 | cpp |
p03147 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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; i >= 0; i--)
#define FOREACH(x, ... | [
"identifier.change"
] | 945,919 | 945,918 | u102602414 | cpp |
p03147 | /**
* File : c.cpp
* Author : recurze
* Date : 00:17 21.01.2019
* Last Modified Date: 00:22 21.01.2019
*/
#include <algorithm>
#include <cstdio>
void readInput();
void solve();
void printAns();
int main() {
int t = 1;
//(void)scanf("%d", &t);
for (int tc = 1; tc <= t;... | /**
* File : c.cpp
* Author : recurze
* Date : 00:17 21.01.2019
* Last Modified Date: 00:23 21.01.2019
*/
#include <algorithm>
#include <cstdio>
void readInput();
void solve();
void printAns();
int main() {
int t = 1;
//(void)scanf("%d", &t);
for (int tc = 1; tc <= t;... | [
"call.remove"
] | 945,931 | 945,932 | u811925505 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mizu(vector<ll> &h, ll l, ll r, ll n) {
if (l == r)
return h[l] - n;
ll mizuyari;
ll min = *min_element(h.begin() + l, h.begin() + r);
mizuyari = min - n;
ll beg = -1;
while (1) {
if (l > r)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mizu(vector<ll> &h, ll l, ll r, ll n) {
// cout<<l<<"-"<<r<<endl;
if (l == r)
return h[l] - n;
ll mizuyari;
ll min = *min_element(h.begin() + l, h.begin() + r + 1);
mizuyari = min - n;
ll beg = -1;
... | [
"assignment.change"
] | 945,935 | 945,936 | u373586461 | cpp |
p03147 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | [
"control_flow.break.add"
] | 945,946 | 945,947 | u320267258 | cpp |
p03147 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) fo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) fo... | [
"variable_declaration.value.change"
] | 945,948 | 945,949 | u123896133 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, K, i, j, a;
cin >> N;
int h[N];
for (i = 0; i < N; i++) {
cin >> h[i];
}
a = h[0];
for (i = 0; i < N - 1; i++) {
if (h[i + 1] > h[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, K, i, j, a;
cin >> N;
int h[N];
for (i = 0; i < N; i++) {
cin >> h[i];
}
a = h[0];
for (i = 0; i < N - 1; i++) {
if (h[i + 1] > h[... | [
"assignment.value.change"
] | 945,957 | 945,958 | u809278162 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, result, flag;
vector<int> data;
cin >> s;
data.push_back(s);
flag = 0;
int i = 0;
while (flag == 0) {
if (data[i] % 2 == 0) {
data.push_back(data[i] / 2);
} else {
data.push_back(data[i] * 3 + 1);
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, result, flag;
vector<int> data;
cin >> s;
data.push_back(s);
flag = 0;
int i = 0;
while (flag == 0) {
if (data[i] % 2 == 0) {
data.push_back(data[i] / 2);
} else {
data.push_back(data[i] * 3 + 1);
}
... | [
"identifier.change",
"io.output.change"
] | 945,988 | 945,989 | u842388336 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, result, flag;
vector<int> data;
cin >> s;
data.push_back(8);
flag = 0;
int i = 0;
while (flag == 0) {
if (data[i] % 2 == 0) {
data.push_back(data[i] / 2);
} else {
data.push_back(data[i] * 3 + 1);
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, result, flag;
vector<int> data;
cin >> s;
data.push_back(s);
flag = 0;
int i = 0;
while (flag == 0) {
if (data[i] % 2 == 0) {
data.push_back(data[i] / 2);
} else {
data.push_back(data[i] * 3 + 1);
}
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 945,990 | 945,989 | u842388336 | cpp |
p03146 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int x = 1;
int a[500000] = {0};
a[n] = 1;
while (a[n] != 2) {
x++;
if (n % 2 == 0) {
n = n / 2;
a[n]++;
} else {
n = n * 3 + 1;
a[n]++;
}
cout << n;
}
cout << x;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int x = 1;
int a[500000] = {0};
a[n] = 1;
while (a[n] != 2) {
x++;
if (n % 2 == 0) {
n = n / 2;
a[n]++;
} else {
n = n * 3 + 1;
a[n]++;
}
// cout<<n;
}
cout << x;
} | [] | 945,997 | 945,998 | u191117799 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 1) {
cout << 4 << endl;
} else {
int count4 = 0, count = 0;
while (count4 != 2) {
if (s == 4) {
count4++;
}
if (s % 2 == 0) {
s ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 1 || s == 2) {
cout << 4 << endl;
} else {
int count4 = 0, count = 0;
while (count4 != 2) {
if (s == 4) {
count4++;
}
if (s % 2 == 0) {
... | [
"control_flow.branch.if.condition.change"
] | 946,003 | 946,004 | u999803454 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) fo... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 946,007 | 946,008 | u148555958 | cpp |
p03146 | #include <iostream>
int main() {
int s;
std::cin >> s;
int list[1000000];
int index = 0;
int a_i;
int a_pre = s;
list[0] = s;
index = index + 1;
bool search_flag = false;
while (true) {
if (a_pre % 2 == 0) {
a_i = a_pre / 2;
} else {
a_i = 3 * a_pre + 1;
}
list[index] = ... | #include <iostream>
int main() {
int s;
std::cin >> s;
int list[1000000];
int index = 0;
int a_i;
int a_pre = s;
list[0] = s;
index = index + 1;
bool search_flag = false;
while (true) {
if (a_pre % 2 == 0) {
a_i = a_pre / 2;
} else {
a_i = 3 * a_pre + 1;
}
list[index] = ... | [
"misc.opposites",
"assignment.value.change"
] | 946,009 | 946,010 | u976439457 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int c(int n) {
int x = 1;
while (n != 1) {
if (n & 1)
n = 3 * n + 1;
else
n = n / 2;
x++;
}
return x;
}
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 5 << endl;
return 0;
} else if (n == 2) {
cout << 6 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int c(int n) {
int x = 1;
while (n != 1) {
if (n & 1)
n = 3 * n + 1;
else
n = n / 2;
x++;
}
return x;
}
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 4 << endl;
return 0;
} else if (n == 2) {
cout << 4 << endl;
... | [
"literal.number.change",
"io.output.change"
] | 946,013 | 946,014 | u673058289 | cpp |
p03146 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"expression.operation.binary.add"
] | 946,016 | 946,017 | u905715926 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int s, cnt = 2;
cin >> s;
if (s == 1)
cnt = 4;
else {
while (s != 1) {
if (s % 2)
s = 3 * s + 1;
else
s /= 2;
cnt++;
}
}
cout << cnt << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int s, cnt = 2;
cin >> s;
if (s == 1 || s == 2)
cnt = 4;
else {
while (s != 1) {
if (s % 2)
s = 3 * s + 1;
else
s /= 2;
cnt++;
}
}
cout << cnt << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 946,031 | 946,032 | u053360288 | cpp |
p03146 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 1e5 + 200;
int main() {
ll n;
cin >> n;
ll i = 0;
if (n == 1) {
cout << 4 << endl;
return 0;
}
while (n > 1) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
i++;... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 1e5 + 200;
int main() {
ll n;
cin >> n;
ll i = 0;
if (n <= 2) {
cout << 4 << endl;
return 0;
}
while (n > 1) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
i++;... | [] | 946,042 | 946,043 | u624688258 | cpp |
p03146 | //テンプレ
#include <bits/stdc++.h>
//#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
// constexpr int MOD = 10e9+7;
// constexpr int INF = 1LL << 60;
template <class T> inline bool chmin(... | //テンプレ
#include <bits/stdc++.h>
//#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
// constexpr int MOD = 10e9+7;
// constexpr int INF = 1LL << 60;
template <class T> inline bool chmin(... | [
"variable_declaration.remove",
"literal.number.change",
"io.output.change"
] | 946,044 | 946,045 | u904833081 | cpp |
p03146 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int main(void) {
int s;
int m = 0;
scanf("%d", &s);
vecto... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int main(void) {
int s;
int m = 0;
scanf("%d", &s);
vecto... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 946,056 | 946,057 | u113497060 | cpp |
p03146 | #include <bits/stdc++.h>
#define inf 10000000
using namespace std;
typedef long long int ll;
int main() {
int s, i, j, ans = 0;
cin >> s;
int a[inf];
a[0] = s;
for (i = 1; ans == 0; i++) {
if (s % 2 == 0) {
a[i] = s / 2;
s = a[i];
} else {
a[i] = 3 * s + 1;
s = a[i];
}... | #include <bits/stdc++.h>
#define inf 10000000
using namespace std;
typedef long long int ll;
int main() {
int s, i, j, ans = 0;
cin >> s;
int a[1000000];
a[0] = s;
for (i = 1; ans == 0; i++) {
if (s % 2 == 0) {
a[i] = s / 2;
s = a[i];
} else {
a[i] = 3 * s + 1;
s = a[i];
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 946,058 | 946,059 | u654998183 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int s, m, i, j, k;
cin >> s;
int a[1000000];
a[0] = s;
m = 0;
for (i = 1; i < 1000000; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int s, m, i, j, k;
cin >> s;
int a[1000000];
a[0] = s;
m = 0;
for (i = 1; i < 1000000; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;... | [
"expression.operation.binary.remove"
] | 946,062 | 946,063 | u809278162 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int s, m, i, j, k;
cin >> s;
int a[1000000];
a[0] = s;
m = 0;
for (i = 1; i < 1000000; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int s, m, i, j, k;
cin >> s;
int a[1000000];
a[0] = s;
m = 0;
for (i = 1; i < 1000000; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;... | [
"expression.operation.binary.add"
] | 946,064 | 946,063 | u809278162 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v;
v.push_back(n);
long long cnt = 1;
while (1) {
if (n & 1) {
if (find(v.begin(), v.end(), 3 * n + 1) != v.end())
break;
cnt++;
v.push_back(3 * n + 1);
n = 3 * n + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v;
v.push_back(n);
long long cnt = 1;
while (1) {
if (n & 1) {
if (find(v.begin(), v.end(), 3 * n + 1) != v.end())
break;
cnt++;
v.push_back(3 * n + 1);
n = 3 * n + 1;
... | [
"expression.operation.binary.add"
] | 946,065 | 946,066 | u324004208 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<pll> dt(n);
for (int i = 0; i < n; i++) {
cin >> dt[i].second >> dt[i].first;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<pll> dt(n);
for (int i = 0; i < n; i++) {
cin >> dt[i].second >> dt[i].first;
}
... | [
"expression.unary.arithmetic.add"
] | 946,080 | 946,081 | u777468981 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K, t, d;
vector<pair<ll, int>> v;
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> t >> d;
v.push_back({d, t});
}
map<int, ll> m;
sort(v.begin(), v.end());
ll a... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K, t, d;
vector<pair<ll, int>> v;
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> t >> d;
v.push_back({d, t});
}
map<int, ll> m;
sort(v.begin(), v.end());
ll a... | [
"expression.unary.arithmetic.add"
] | 946,114 | 946,115 | u623954643 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
struct food {
int t;
int d;
bool operator<(const food b) const { return d > b.d; }
} a[100000 + 5];
int n, k;
queue<int> q;
set<int> s;
long long sum = 0, sum1;
int main(int argc, char *argv[]) {
cin >> n >> k;
for (... | #include <algorithm>
#include <iostream>
#include <set>
#include <stack>
using namespace std;
struct food {
int t;
int d;
bool operator<(const food b) const { return d > b.d; }
} a[100000 + 5];
int n, k;
stack<int> q;
set<int> s;
long long sum = 0, sum1;
int main(int argc, char *argv[]) {
cin >> n >> k;
for (... | [
"import.add",
"variable_declaration.type.change",
"assignment.value.change",
"call.function.change",
"expression.operation.binary.change"
] | 946,124 | 946,125 | u601344838 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
pair<ll, int> a[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i].second >> a[i].first;
}
sort(a, a + n);
reverse(a, a + n);
p... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
pair<ll, int> a[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i].second >> a[i].first;
}
sort(a, a + n);
reverse(a, a + n);
p... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 946,150 | 946,151 | u411418267 | cpp |
p03148 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll f[100001];
int main() {
int n, K;
cin >> n >> K;
vector<pii> v(n);
for (int i = 0; i < n; ++i) {
ll t, d;
cin >> t >> d;
v[i] = {d, t};
}
sort(v.begin(), v.end(), greater<pii>());
ll kind = 0;... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll f[100001];
int main() {
int n, K;
cin >> n >> K;
vector<pii> v(n);
for (int i = 0; i < n; ++i) {
ll t, d;
cin >> t >> d;
v[i] = {d, t};
}
sort(v.begin(), v.end(), greater<pii>());
ll kind = 0;... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 946,160 | 946,159 | u402472923 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int K, N;
int t[100005];
long long int d[100005];
int C[100005];
vector<pair<long long int, int>> V;
multiset<pair<long long int, int>> S;
int main(void) {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> t[... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int K, N;
int t[100005];
long long int d[100005];
int C[100005];
vector<pair<long long int, int>> V;
multiset<pair<long long int, int>> S;
int main(void) {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> t[... | [
"call.function.change",
"expression.unary.arithmetic.remove"
] | 946,166 | 946,167 | u835297884 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all... | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all... | [
"expression.unary.arithmetic.add"
] | 946,170 | 946,171 | u693027786 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K, std::vector<long long> t,
std::vector<long long> d) {
vector<pair<long long, long long>> vs;
for (int i = 0; i < K; i++) {
vs.push_back({d[i], t[i]});
}
sort(vs.rbegin(), vs.rend());
for (int i = 0; i < vs.size... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K, std::vector<long long> t,
std::vector<long long> d) {
vector<pair<long long, long long>> vs;
for (int i = 0; i < N; i++) {
vs.push_back({d[i], t[i]});
}
sort(vs.rbegin(), vs.rend());
for (int i = 0; i < vs.size... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 946,172 | 946,173 | u372633838 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(10);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(10);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | [
"literal.number.change",
"call.arguments.change"
] | 946,184 | 946,185 | u205561862 | cpp |
p03148 | #include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | #include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | [
"control_flow.branch.if.add"
] | 946,188 | 946,189 | u451610133 | cpp |
p03148 | // https://atcoder.jp/contests/abc116/tasks/abc116_d
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
... | // https://atcoder.jp/contests/abc116/tasks/abc116_d
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
... | [
"assignment.value.change",
"identifier.change"
] | 946,213 | 946,214 | u613658617 | cpp |
p03148 | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, k;
map<int, vector<int>> m;
vector<vector<int> *> v;
priority_queue<int> p;
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int t, d;
scanf("%d %d", &t, &d);
m[t].pus... | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, k;
map<int, vector<int>> m;
vector<vector<int> *> v;
priority_queue<int> p;
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int t, d;
scanf("%d %d", &t, &d);
m[t].pus... | [
"control_flow.branch.if.condition.change"
] | 946,253 | 946,254 | u675757825 | cpp |
p03148 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 946,257 | 946,258 | u614063956 | cpp |
p03148 | #include <bits/stdc++.h>
#define ll long long
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define bitrep(X, N) for (ll X = 0; X < (1 << (N)); X++)
#define PI (acos(-1.0))
#define sorta(V) sort(V.begin(), V.end())
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).... | #include <bits/stdc++.h>
#define ll long long
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define bitrep(X, N) for (ll X = 0; X < (1 << (N)); X++)
#define PI (acos(-1.0))
#define sorta(V) sort(V.begin(), V.end())
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).... | [
"assignment.change"
] | 946,266 | 946,267 | u145078501 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<pair<ll, ll>> sushi(N);
map<ll, ll> type;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
sushi[i] = {d, t};
}
sort(sushi.begin(), sushi.end(), greater<pair<ll, ll>>());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<pair<ll, ll>> sushi(N);
map<ll, ll> type;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
sushi[i] = {d, t};
}
sort(sushi.begin(), sushi.end(), greater<pair<ll, ll>>());
... | [
"expression.unary.arithmetic.add"
] | 946,268 | 946,269 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | [
"expression.unary.arithmetic.add"
] | 946,270 | 946,271 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | [
"expression.unary.arithmetic.add"
] | 946,272 | 946,271 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int main() {
... | [
"expression.unary.arithmetic.add"
] | 946,272 | 946,273 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
pair<ll, int> A[N];
for (int i = 0; i < N; i++) {
ll t, d;
cin >> t >> d;
A[i] = {d, t};
}
sort(A, A + N);
reverse(A, A + N);
ll ans = 0, sum = 0;
map<int, ll> mp; // map<寿司の種類番号、... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
pair<ll, int> A[N];
for (int i = 0; i < N; i++) {
ll t, d;
cin >> t >> d;
A[i] = {d, t};
}
sort(A, A + N);
reverse(A, A + N);
ll ans = 0, sum = 0;
map<int, ll> mp; // map<寿司の種類番号、... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 946,276 | 946,275 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
pair<ll, int> A[N];
for (int i = 0; i < N; i++) {
ll t, d;
cin >> t >> d;
A[i] = {d, t};
}
sort(A, A + N);
reverse(A, A + N);
ll ans = 0, sum = 0;
map<int, int> mp; // map<寿司の種類番号... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
pair<ll, int> A[N];
for (int i = 0; i < N; i++) {
ll t, d;
cin >> t >> d;
A[i] = {d, t};
}
sort(A, A + N);
reverse(A, A + N);
ll ans = 0, sum = 0;
map<int, ll> mp; // map<寿司の種類番号、... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 946,277 | 946,275 | u052332717 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
priority_queue<pair<ll, int>> que;
for (int i = 0; i < N; i++) {
int t;
ll d;
cin >> t >> d;
t--;
que.push(make_pair(d, t));
}
map<int, int> mp;
int types = 0;
vector<pair<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
cin >> N >> K;
priority_queue<pair<ll, int>> que;
for (int i = 0; i < N; i++) {
int t;
ll d;
cin >> t >> d;
t--;
que.push(make_pair(d, t));
}
map<int, int> mp;
ll types = 0;
vector<pair<ll... | [
"variable_declaration.type.change"
] | 946,290 | 946,291 | u998251394 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, M;
cin >> N >> M;
int tmpt;
long long tmpd;
priority_queue<pair<long long, int>> que;
vector<pair<long long, int>> vec;
for (int cnt0 = 0; cnt0 < M; cnt0++) {
cin >> tmpt >> tmpd;
que.push(make_pair(tmpd, tmpt)... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, M;
cin >> N >> M;
int tmpt;
long long tmpd;
priority_queue<pair<long long, int>> que;
vector<pair<long long, int>> vec;
for (int cnt0 = 0; cnt0 < N; cnt0++) {
cin >> tmpt >> tmpd;
que.push(make_pair(tmpd, tmpt)... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 946,295 | 946,293 | u998251394 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
priority_queue<pair<long long, int>> menu;
int tmp1;
long long tmp2;
for (int cnt0 = 0; cnt0 < N; cnt0++) {
cin >> tmp1 >> tmp2;
menu.push(make_pair(tmp2, tmp1));
}
// cout << "1" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
priority_queue<pair<long long, int>> menu;
int tmp1;
long long tmp2;
for (int cnt0 = 0; cnt0 < N; cnt0++) {
cin >> tmp1 >> tmp2;
menu.push(make_pair(tmp2, tmp1));
}
// cout << "1" << endl;... | [
"control_flow.break.add"
] | 946,296 | 946,297 | u998251394 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
priority_queue<pair<long long, int>> menu;
int tmp1;
long long tmp2;
for (int cnt0 = 0; cnt0 < N; cnt0++) {
cin >> tmp1 >> tmp2;
menu.push(make_pair(tmp2, tmp1));
}
// cout << "1" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
priority_queue<pair<long long, int>> menu;
int tmp1;
long long tmp2;
for (int cnt0 = 0; cnt0 < N; cnt0++) {
cin >> tmp1 >> tmp2;
menu.push(make_pair(tmp2, tmp1));
}
// cout << "1" << endl;... | [
"control_flow.break.add"
] | 946,298 | 946,297 | u998251394 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
priority_queue<ll> MinusPQ;
priority_queue<pair<ll, ll>> PlusPQ;
set<int> S;
int n, k, t, d;
vector<pair<ll, ll>> sushi;
cin >> n >> k;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> t >> d;
sushi.push_back(make_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
priority_queue<ll> MinusPQ;
priority_queue<pair<ll, ll>> PlusPQ;
set<int> S;
int n, k, t, d;
vector<pair<ll, ll>> sushi;
cin >> n >> k;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> t >> d;
sushi.push_back(make_... | [] | 946,299 | 946,300 | u709304134 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
const long long INF = 1e18;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
const long long INF = 1e18;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
... | [
"call.add"
] | 946,328 | 946,329 | u276568758 | cpp |
p03148 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [] | 946,340 | 946,341 | u186294233 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
typedef pair<ll, ll> P;
vector<P> vec;
vector<P> v;
bool f[100009], g[100009];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int t, d;
cin >> t >> d;
vec.push_back(P(d, t));
}... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
typedef pair<ll, ll> P;
vector<P> vec;
vector<P> v;
bool f[100009], g[100009];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
vec.push_back(P(d, t));
}
... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 946,368 | 946,369 | u912752743 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | [] | 946,370 | 946,371 | u313427116 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pll pair<long long, long long>
#define ll long long
#define mp make_pair
ll n, k, a, b, ans, res;
long long sz;
priority_queue<pll> q;
ll num[100003];
vector<pll> v;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pll pair<long long, long long>
#define ll long long
#define mp make_pair
ll n, k, a, b, ans, res;
long long sz;
priority_queue<pll> q;
ll num[100003];
vector<pll> v;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin... | [
"control_flow.break.add"
] | 946,372 | 946,373 | u515315348 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pll pair<long long, long long>
#define ll long long
#define mp make_pair
ll n, k, a, b, ans, res;
long long sz;
priority_queue<pll> q;
ll num[100003];
vector<pll> v;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pll pair<long long, long long>
#define ll long long
#define mp make_pair
ll n, k, a, b, ans, res;
long long sz;
priority_queue<pll> q;
ll num[100003];
vector<pll> v;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin... | [
"control_flow.break.add"
] | 946,374 | 946,373 | u515315348 | cpp |
p03148 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"control_flow.branch.if.condition.change"
] | 946,395 | 946,396 | u898651494 | cpp |
p03148 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a)... | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a)... | [
"expression.unary.arithmetic.add"
] | 946,401 | 946,402 | u209713918 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
int n, k, t, d;
priority_queue<pair<int, int>> pq;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%d %d", &t, &d);
pq.push(make_pair(d, t));
}
priority_queue<pair<int, int>> eat;
int neta[100001] = {0};... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
int n, k, t, d;
priority_queue<pair<int, int>> pq;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%d %d", &t, &d);
pq.push(make_pair(d, t));
}
priority_queue<pair<int, int>> eat;
int neta[100001] = {0};... | [
"call.remove"
] | 946,405 | 946,406 | u905270643 | cpp |
p03148 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b... | [
"variable_declaration.value.change"
] | 946,415 | 946,416 | u548624367 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define mp make_pair
#define fi first
#define se second
ll f[200000], n, k, var, idx;
priority_queue<pair<ll, ll>> q;
ll sum, mx;
vector<pair<ll, ll>> v;
void shift() {
if (f[v[idx].se] > 1) {
} else {
while (f[v[idx].se] <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define mp make_pair
#define fi first
#define se second
ll f[200000], n, k, var, idx;
priority_queue<pair<ll, ll>> q;
ll sum, mx;
vector<pair<ll, ll>> v;
void shift() {
if (f[v[idx].se] > 1) {
} else {
while (f[v[idx].se] <=... | [
"call.add"
] | 946,419 | 946,420 | u337775536 | cpp |
p03148 | #include <bits/stdc++.h>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#define R... | #include <bits/stdc++.h>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#define R... | [
"identifier.change",
"call.function.change"
] | 946,423 | 946,424 | u960524878 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long> vl;
ll solve(int N, int K, vi &t, vi &d) {
map<int, vi> sushi_list;
for (int i = 0; i < N; i++) {
sushi_list[t[i]].push_back(d[i]);
}
vi winner, looser;
for (auto p : sushi_list) {
vi q ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long> vl;
ll solve(int N, int K, vi &t, vi &d) {
map<int, vi> sushi_list;
for (int i = 0; i < N; i++) {
sushi_list[t[i]].push_back(d[i]);
}
vi winner, looser;
for (auto p : sushi_list) {
vi q ... | [
"identifier.change",
"expression.operation.binary.change"
] | 946,431 | 946,432 | u826487371 | cpp |
p03148 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | [
"variable_declaration.type.change"
] | 946,435 | 946,436 | u394919721 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | [
"call.add"
] | 946,454 | 946,455 | u093219895 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
// --
#define HOGE \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
template <typename T> void CIN_VAR(T &t) { cin >> t; }
template <type... | #include <bits/stdc++.h>
using namespace std;
// --
#define HOGE \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
template <typename T> void CIN_VAR(T &t) { cin >> t; }
template <type... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 946,456 | 946,457 | u685774550 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
// --
#define HOGE \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
template <typename T> void CIN_VAR(T &t) { cin >> t; }
template <type... | #include <bits/stdc++.h>
using namespace std;
// --
#define HOGE \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
template <typename T> void CIN_VAR(T &t) { cin >> t; }
template <type... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 946,458 | 946,457 | u685774550 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, K;
cin >> N >> K;
vector<pair<ll, int>> p;
in... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> p;
ll t;... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 946,459 | 946,460 | u563710899 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.