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 |
|---|---|---|---|---|---|---|---|
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h;
cin >> W, H;
cin >> w, h;
cout << (W - w) * (H - h);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h;
cin >> W >> H;
cin >> w >> h;
cout << (W - w) * (H - h);
return 0;
}
| [] | 908,466 | 908,467 | u700307250 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
int S;
cin >> H >> W >> h >> w;
S = H * W - (H * w + W * h) - h * w;
cout << S << endl;
}
| #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
int S;
cin >> H >> W >> h >> w;
S = H * W - (H * w + W * h) + h * w;
cout << S << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,481 | 908,482 | u223504018 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h, r, c;
cin >> r >> c;
cin >> h >> w;
int ans = (r * c) - ((h * r) + (w * c) - (h * w));
if (r == h || c == w)
ans = 0;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h, r, c;
cin >> r >> c;
cin >> h >> w;
int ans = (r * c) - ((h * c) + (w * r) - (h * w));
if (r == h || c == w)
ans = 0;
cout << ans << '\n';
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 908,483 | 908,484 | u343045496 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (h * W + w * H - h * w);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W - (h * W + w * H - h * w));
return 0;
} | [] | 908,494 | 908,495 | u018687385 | cpp |
p03101 | #include <iostream>
using namespace std;
int h, w;
int main() {
cin >> h >> w;
int a, b;
cin >> a >> b;
cout << h * w - h * a - w * b + a * b << "\n";
} | #include <iostream>
using namespace std;
int h, w;
int main() {
cin >> h >> w;
int a, b;
cin >> a >> b;
cout << h * w - w * a - h * b + a * b << "\n";
} | [
"identifier.change",
"io.output.change"
] | 908,501 | 908,502 | u572456887 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | [
"identifier.change",
"io.output.change"
] | 908,512 | 908,513 | u373958718 | cpp |
p03101 | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W;
std::cin >> h >> w;
std::cout << H * W - (h * W + H * w);
} | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W;
std::cin >> h >> w;
std::cout << H * W + h * w - (h * W + H * w);
} | [
"expression.operation.binary.add"
] | 908,519 | 908,520 | u604262137 | cpp |
p03101 | #include "bits/stdc++.h"
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << H * W - A * H - B * W + A + B << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << H * W - A * W - B * H + A * B << endl;
} | [
"identifier.change",
"io.output.change",
"expression.operator.arithmetic.change"
] | 908,521 | 908,522 | u365956698 | cpp |
p03101 | #include "bits/stdc++.h"
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << H * W - A * H - B * W + A * B << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << H * W - A * W - B * H + A * B << endl;
} | [
"identifier.change",
"io.output.change"
] | 908,523 | 908,522 | u365956698 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - W) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - w) << "\n";
}
| [
"identifier.change",
"io.output.change"
] | 908,528 | 908,529 | u839511400 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR1(i, n) for (int(i) = 1; (i) < (n); (i)++)
#define eFOR(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define eFOR1(i, n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR1(i, n) for (int(i) = 1; (i) < (n); (i)++)
#define eFOR(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define eFOR1(i, n... | [] | 908,530 | 908,531 | u863044225 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ld err = 0.000000001;
#define N 2000005
#define ESP 1e-9
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define pp pop_back
int ar[1000];
int main() {
ios_base::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ld err = 0.000000001;
#define N 2000005
#define ESP 1e-9
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define pp pop_back
int ar[1000];
int main() {
ios_base::sync_with_stdio(fal... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 908,532 | 908,533 | u111496108 | cpp |
p03101 | #include <iostream>
using namespace std;
main() {
int H;
int W;
int h;
int w;
cin >> H;
cin >> W;
cin >> h;
cin >> w;
cout << H * W - h * H - w * W + h * w;
return 0;
}
| #include <iostream>
using namespace std;
main() {
int H;
int W;
int h;
int w;
cin >> H;
cin >> W;
cin >> h;
cin >> w;
cout << H * W - h * W - w * H + h * w;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 908,550 | 908,551 | u550043044 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int H, W;
int h, w;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W >> h >> w;
cout << H * W - (H * h + W * w - h * w) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int H, W;
int h, w;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W >> h >> w;
cout << H * W - (H * w + W * h - h * w) << endl;
} | [
"identifier.change",
"io.output.change"
] | 908,556 | 908,557 | u325820449 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - b) * (c - d) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 908,569 | 908,570 | u340127670 | cpp |
p03101 | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | [
"assignment.variable.change",
"identifier.change"
] | 908,571 | 908,572 | u840958781 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, space;
cin >> H >> W;
cin >> h >> W;
space = H * W - (h * W + w * H) + h * w;
cout << space << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, space;
cin >> H >> W;
cin >> h >> w;
space = H * W - (h * W + w * H) + h * w;
cout << space << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 908,575 | 908,576 | u120826790 | cpp |
p03101 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
typedef vector<LL> VEC;
typedef vector<VEC> VVEC;
const LL INF = 1 << 3... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
typedef vector<LL> VEC;
typedef vector<VEC> VVEC;
const LL INF = 1 << 3... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 908,581 | 908,582 | u999803454 | cpp |
p03101 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 908,583 | 908,584 | u918357423 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int h, w;
cin >> h >> w;
int a, b;
cin >> a >> b;
cout << a * w + b * h - a * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int h, w;
cin >> h >> w;
int a, b;
cin >> a >> b;
cout << h * w - (a * w + b * h - a * b) << endl;
} | [
"expression.operation.binary.add"
] | 908,585 | 908,586 | u402472923 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
int a, b, c, d;
signed main() {
cin >> a >> b >> c >> d;
int x = a - b;
int y = c - d;
cout << x * y << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
int a, b, c, d;
signed main() {
cin >> a >> b >> c >> d;
int x = a - c;
int y = b - d;
cout << x * y << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 908,587 | 908,588 | u988961969 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - b) * (c - d);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d);
return 0;
} | [
"identifier.change",
"io.output.change"
] | 908,592 | 908,593 | u035574325 | cpp |
p03101 | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) pri... | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) pri... | [
"call.remove",
"call.arguments.change"
] | 908,594 | 908,595 | u769965655 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b - c - d + c * d << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b - c * b - d * a + c * d << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 908,596 | 908,597 | u863104798 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b - c - d - c * d << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * b - c * b - d * a + c * d << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 908,598 | 908,597 | u863104798 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int ans;
cin >> a >> b >> c >> d;
ans = (a * b) - (c + d - (c * d));
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int ans;
cin >> a >> b >> c >> d;
ans = (a * b) - (c * b + d * a - (c * d));
cout << ans << endl;
} | [
"assignment.change"
] | 908,604 | 908,605 | u332510214 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (h * w + (w * (H - h))) << endl;
} | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (h * W + w * (H - h)) << endl;
} | [
"identifier.change",
"io.output.change"
] | 908,612 | 908,613 | u170650966 | cpp |
p03101 | #include <bits/stdc++.h>
#define inf 1000000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (W * h) - (w * w) << endl;
}
| #include <bits/stdc++.h>
#define inf 1000000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (W * h) - (w * (H - h)) << endl;
}
| [
"io.output.change"
] | 908,614 | 908,615 | u654998183 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = H * W - (h * H) - (W - h) * w;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> w >> h;
int ans = H * W - (h * H) - (W - h) * w;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 908,622 | 908,623 | u845620905 | cpp |
p03102 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, M, C;
scanf("%d %d %d", &N, &M, &C);
int B[20];
int A[20];
for (int i = 0; i < M; i++) {
scanf("%d", &B[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int val = 0;
for (int j = 0; j < M; j++) {
scan... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, M, C;
scanf("%d %d %d", &N, &M, &C);
int B[20];
int A[20];
for (int i = 0; i < M; i++) {
scanf("%d", &B[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int val = 0;
for (int j = 0; j < M; j++) {
scan... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,666 | 908,667 | u684448032 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
rep(i, m) cin >> b[i];
rep(i, n) {
int tmp = c;
rep(j, m) {
cin >> a[i];
tmp += a[i] * b[i];
}
if (tmp > ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
rep(i, m) cin >> b[i];
rep(i, n) {
int tmp = c;
rep(j, m) {
cin >> a[j];
tmp += a[j] * b[j];
}
if (tmp > ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 908,668 | 908,669 | u933962236 | cpp |
p03102 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
inline int in() {
int x;
scanf("%lld", &... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,674 | 908,675 | u875407613 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n;... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,681 | 908,682 | u369633456 | cpp |
p03102 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ci... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ci... | [
"identifier.change"
] | 908,683 | 908,684 | u260502755 | cpp |
p03102 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 908,691 | 908,692 | u838276016 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,693 | 908,694 | u624830211 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,695 | 908,694 | u624830211 | cpp |
p03102 | #include <bits/stdc++.h>
#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++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#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++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | [] | 908,635 | 908,636 | u297738015 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define per(i, s, n) for (int i = n - 1; i >= s; i--)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define per(i, s, n) for (int i = n - 1; i >= s; i--)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 908,637 | 908,638 | u564204618 | cpp |
p03102 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 908,639 | 908,640 | u694422786 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [] | 908,641 | 908,642 | u958873500 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
int ans = 0;
int A[M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[j];
}
int sum = 0;
for (int j = 0; j < M; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
int ans = 0;
int A[M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[j];
}
int sum = 0;
for (int j = 0; j < M; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,648 | 908,649 | u538808095 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
int ans = 0;
int A[M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i];
}
int sum = 0;
for (int j = 0; j < M; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
int ans = 0;
int A[M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[j];
}
int sum = 0;
for (int j = 0; j < M; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 908,650 | 908,649 | u538808095 | cpp |
p03102 | #include <bits/stdc++.h>
// Useful constants
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
// for input-output
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(N... | #include <bits/stdc++.h>
// Useful constants
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
// for input-output
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(N... | [
"assignment.add"
] | 908,660 | 908,661 | u196507615 | cpp |
p03102 | #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, M;
int C;
cin >> N >> M >> C;
vector<int> B(N);
rep(i, M) cin >> B[i];
int ans = 0;
rep(i, N) {
ll S = 0;
rep(j, M) {
int A;
cin >> A;
S += A *... | #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, M;
int C;
cin >> N >> M >> C;
vector<int> B(M);
rep(i, M) cin >> B[i];
int ans = 0;
rep(i, N) {
ll S = 0;
rep(j, M) {
int A;
cin >> A;
S += A *... | [] | 908,662 | 908,663 | u107464079 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> sorce(n, vector<int>(m));
vector<int> b(m);
vector<int> seki(n, 0);
rep(i, m) cin >> b.at(i);
rep(i, n) rep(j, m) { cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> sorce(n, vector<int>(m));
vector<int> b(m);
vector<int> seki(n, 0);
rep(i, m) cin >> b.at(i);
rep(i, n) rep(j, m) { cin... | [
"control_flow.branch.if.condition.change"
] | 908,697 | 908,698 | u436660228 | cpp |
p03102 | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> ... | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> ... | [] | 908,699 | 908,700 | u543489264 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A, B;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
sum +=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
... | [] | 908,701 | 908,702 | u410888565 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,703 | 908,704 | u688862905 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C, B[21], A[21][21];
cin >> N >> M >> C;
for (int i = 0; i < M; ++i) {
cin >> B[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> A[i][j];
}
}
int correct_code = 0;
for (int i = 0; i < N; +... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C, B[21], A[21][21];
cin >> N >> M >> C;
for (int i = 0; i < M; ++i) {
cin >> B[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> A[i][j];
}
}
int correct_code = 0;
for (int i = 0; i < N; +... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,711 | 908,712 | u791883159 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, k = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, k = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 908,716 | 908,717 | u834753207 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (in... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,724 | 908,725 | u249466958 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (in... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 908,726 | 908,725 | u249466958 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int n, m, c;
int main() {
int res = 0;
cin >> n >> m >> c;
vector<int> b(m + 1);
for (auto &x : b) {
cin >> x;
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
sum += b[j - 1] * x;
... | #include <bits/stdc++.h>
using namespace std;
int n, m, c;
int main() {
int res = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (auto &x : b) {
cin >> x;
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
sum += b[j - 1] * x;
}
... | [
"expression.operation.binary.remove"
] | 908,729 | 908,730 | u424091517 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; i++)
#define swap(a, b, type) \
do { \
type temp; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; i++)
#define swap(a, b, type) \
do { \
type temp; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,731 | 908,732 | u717762991 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, C;
cin >> a >> b >> C;
vector<ll> vec(a);
for (ll i = 0; i < a; i++) {
cin >> vec.at(i);
}
ll c = 0;
for (ll i = 0; i < b; i++) {
ll d = C;
for (ll j = 0; j < a; j++) {
ll e;
cin >> e;
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, C;
cin >> a >> b >> C;
vector<ll> vec(b);
for (ll i = 0; i < b; i++) {
cin >> vec.at(i);
}
ll c = 0;
for (ll i = 0; i < a; i++) {
ll d = C;
for (ll j = 0; j < b; j++) {
ll e;
cin >> e;
d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,739 | 908,740 | u883297128 | cpp |
p03102 | /* 競プロ用のテンプレ
* SKMT
* 作成日 2020年09月06日 15:46
* ファイル名 ABC121_b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(int argc, char const *argv[]) {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<vector<int>> a(N, vector<int>(M));
rep(... | /* 競プロ用のテンプレ
* SKMT
* 作成日 2020年09月06日 15:46
* ファイル名 ABC121_b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(int argc, char const *argv[]) {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<vector<int>> a(N, vector<int>(M));
rep(... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 908,745 | 908,746 | u601218364 | cpp |
p03102 | /* 競プロ用のテンプレ
* SKMT
* 作成日 2020年09月06日 15:46
* ファイル名 ABC121_b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(int argc, char const *argv[]) {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<vector<int>> a(N, vector<int>(M));
rep(... | /* 競プロ用のテンプレ
* SKMT
* 作成日 2020年09月06日 15:46
* ファイル名 ABC121_b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(int argc, char const *argv[]) {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<vector<int>> a(N, vector<int>(M));
rep(... | [
"assignment.add"
] | 908,747 | 908,746 | u601218364 | cpp |
p03102 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 908,756 | 908,757 | u156778176 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
vector<vector<int>> data(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> data.at(i).at(j);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
vector<vector<int>> data(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> data.at(i).at(j);
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 908,769 | 908,770 | u926006934 | cpp |
p03102 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add"
] | 908,771 | 908,772 | u179778090 | cpp |
p03102 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"expression.operation.unary.add"
] | 908,773 | 908,772 | u179778090 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,774 | 908,775 | u093973314 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int... | [] | 908,776 | 908,777 | u507349898 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 908,778 | 908,777 | u507349898 | cpp |
p03102 | /*
author : nishi5451
created : 14.08.2020 23:56:55
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[m];
int ans = 0;
rep(i, n) {
int now ... | /*
author : nishi5451
created : 14.08.2020 23:56:55
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int ans = 0;
rep(i, n) {
int now ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,779 | 908,780 | u033937898 | cpp |
p03102 | /*
author : nishi5451
created : 14.08.2020 23:56:55
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[m];
int ans = 0;
rep(i, n) {
int now ... | /*
author : nishi5451
created : 14.08.2020 23:56:55
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int ans = 0;
rep(i, n) {
int now ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 908,781 | 908,780 | u033937898 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
int ans = 0;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum +... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,784 | 908,785 | u225777148 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
int ans = 0;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum +... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 908,786 | 908,785 | u225777148 | cpp |
p03102 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, m, c, i = 0, j = 0, ans, anss = 0;
cin >> n >> m >> c;
vector<... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, m, c, i = 0, j = 0, ans = 0, anss = 0;
cin >> n >> m >> c;
vec... | [
"variable_declaration.value.change"
] | 908,787 | 908,788 | u965667196 | cpp |
p03102 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | [
"identifier.change",
"call.arguments.change"
] | 908,789 | 908,790 | u889915625 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N;
int M;
int C;
cin >> N >> M >> C;
int i;
int B[M];
for (i = 0; i <= M - 1; i++) {
cin >> B[i];
}
int j;
int A[N][M];
for (i = 0; i <= N - 1; i++) {
for (j = 0; j <= M - 1; j++) {
cin >> A[i][j];
}
}
int CHECK;
int... | #include <iostream>
using namespace std;
int main() {
int N;
int M;
int C;
cin >> N >> M >> C;
int i;
int B[M];
for (i = 0; i <= M - 1; i++) {
cin >> B[i];
}
int j;
int A[N][M];
for (i = 0; i <= N - 1; i++) {
for (j = 0; j <= M - 1; j++) {
cin >> A[i][j];
}
}
int CHECK;
int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 908,791 | 908,792 | u328530240 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int f = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int f = 0;
fo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,799 | 908,800 | u210234656 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | [
"variable_declaration.value.change"
] | 908,801 | 908,802 | u692550512 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 908,804 | 908,802 | u692550512 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 908,805 | 908,802 | u692550512 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
int b;
cin >> b;
B.at(i) = b;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M;... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,806 | 908,802 | u692550512 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(n, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std:... | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(m, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std:... | [
"identifier.change",
"call.arguments.change"
] | 908,807 | 908,808 | u730447703 | cpp |
p03102 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m, c, cnt = 0;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
int a, t = 0;
rep(j, m) {
cin >> a;
t += a * b[j];
... | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m, c, cnt = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
int a, t = 0;
rep(j, m) {
cin >> a;
t += a * b[j];
... | [] | 908,817 | 908,818 | u503170128 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int a[n][m];
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int co = 0;
int x = 0;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int a[n][m];
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int co = 0;
int x = 0;
for (int i = 0; i < n... | [
"assignment.add"
] | 908,823 | 908,824 | u681869152 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int i, j, n, m, k, l, b[20], a, c;
int main() {
for (cin >> n >> m >> c; i < m; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
for (k = 0, j = 0; j < m; j++)
cin >> a;
k += (a * b[j]);
if (k > -1 * c)
l++;
}
cout << l;
} | #include <bits/stdc++.h>
using namespace std;
int i, j, n, m, k, l, b[20], a, c;
int main() {
for (cin >> n >> m >> c; i < m; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
for (k = 0, j = 0; j < m; j++) {
cin >> a;
k += (a * b[j]);
}
if (k > -1 * c)
l++;
}
cout << l;
} | [] | 908,826 | 908,827 | u303621502 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, C, T;
cin >> N >> M >> C;
T = 0;
vector<long long> b(M);
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
vector<long long> a(M);
for (int j = 0; j < M; j++) {
cin >> a[j];
}
lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, C, T;
cin >> N >> M >> C;
T = 0;
vector<long long> b(M);
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
vector<long long> a(M);
for (int j = 0; j < M; j++) {
cin >> a[j];
}
lon... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,846 | 908,847 | u261947526 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, c, i, j, ans = 0, s = 0;
cin >> n >> m >> c;
int a[n][m], b[m];
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, c, i, j, ans = 0, s = 0;
cin >> n >> m >> c;
int a[n][m], b[m];
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
... | [
"assignment.add"
] | 908,850 | 908,851 | u056912761 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
cin >> A.at(i).at(j);
}
int sum = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
cin >> A.at(i).at(j);
}
int sum = 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 908,852 | 908,853 | u101018317 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
cin >> A.at(i).at(j);
}
int sum = C;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
cin >> A.at(i).at(j);
}
int sum = 0;... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 908,854 | 908,853 | u101018317 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | [
"expression.operation.binary.remove"
] | 908,857 | 908,858 | u545364250 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
//長さMの配列を作る。要素を０で初期化する。
vector<int> B(M, 0);
for (int i = 0; i < N; i++)
cin >> B[i];
// N*Mの配列を作る。
// Aは、vector<int>の長さNの配列
//これを、vector<int>(M)で初期化
vector<vector<int>> A(N, vector<int>(M));
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
//長さMの配列を作る。要素を０で初期化する。
vector<int> B(M, 0);
for (int i = 0; i < M; i++)
cin >> B[i];
// N*Mの配列を作る。
// Aは、vector<int>の長さNの配列
//これを、vector<int>(M)で初期化
vector<vector<int>> A(N, vector<int>(M));
for (int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,873 | 908,874 | u348398921 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, C;
cin >> N >> M >> C;
int b[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
int res = 0;
for (int i = 0; i < M; i++) {
int sum = C;
for (int j = 0; j < N; j++) {
int a;
cin >> a;
sum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, C;
cin >> N >> M >> C;
int b[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
int res = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
int a;
cin >> a;
sum... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 908,875 | 908,876 | u559578080 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 908,877 | 908,878 | u457790148 | cpp |
p03102 | #define _USE_MATH_DEFINES // M_PI
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define all(x) (x).begin(), (x).end()
#define... | #define _USE_MATH_DEFINES // M_PI
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define all(x) (x).begin(), (x).end()
#define... | [
"identifier.change",
"call.arguments.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,879 | 908,880 | u813559924 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m, c, b[20], ans = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
cnt ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m, c, b[20], ans = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
cnt ... | [] | 908,881 | 908,882 | u401900157 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int an... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,883 | 908,884 | u401900157 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"assignment.add"
] | 908,890 | 908,891 | u790461875 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,911 | 908,912 | u330661451 | cpp |
p03102 | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 908,918 | 908,919 | u735008991 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int i, n, m, c, j, solve = 0, num;
cin >> n >> m >> c;
int b[m];
for (i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
num = c;
fo... | #include <iostream>
using namespace std;
int main() {
int i, n, m, c, j, solve = 0, num;
cin >> n >> m >> c;
int b[m];
for (i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
num = c;
fo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,926 | 908,927 | u476054945 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int i, n, m, c, j, solve = 0, num;
cin >> n >> m >> c;
int b[m];
for (i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
num = 0;
fo... | #include <iostream>
using namespace std;
int main() {
int i, n, m, c, j, solve = 0, num;
cin >> n >> m >> c;
int b[m];
for (i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
num = c;
fo... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change"
] | 908,928 | 908,927 | u476054945 | cpp |
p03102 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> v(m);
for (int i = 0; i < m; i++)
cin >> v[i];
int res = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
su... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> v(m);
for (int i = 0; i < m; i++)
cin >> v[i];
int res = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
su... | [
"expression.operation.binary.remove"
] | 908,931 | 908,932 | u494904817 | cpp |
p03102 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> v(n);
for (int i = 0; i < m; i++)
cin >> v[i];
int res = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
su... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> v(m);
for (int i = 0; i < m; i++)
cin >> v[i];
int res = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
int a;
cin >> a;
su... | [] | 908,933 | 908,932 | u494904817 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> base(m);
for (int i = 0; i < m; i++) {
cin >> base.at(i);
}
vector<vector<int>> code(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> code.at(i).at(j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> base(m);
for (int i = 0; i < m; i++) {
cin >> base.at(i);
}
vector<vector<int>> code(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> code.at(i).at(j... | [
"assignment.add"
] | 908,934 | 908,935 | u319783732 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.