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 |
|---|---|---|---|---|---|---|---|
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 a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | #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 a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,942 | 908,943 | u222643545 | 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 a[n][m];
int s[m], t = c;
for (int i = 0; i < n; i++) {
s[i] = 0;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | #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 a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,944 | 908,943 | u222643545 | 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 a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = 0;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | #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 a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] *... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,945 | 908,943 | u222643545 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] >... | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] +... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,946 | 908,947 | u407213771 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[10000][10000], y[10000], z[10000] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
... | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] +... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,948 | 908,947 | u407213771 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | [] | 908,963 | 908,964 | u688789047 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | [
"identifier.change",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,965 | 908,964 | u688789047 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[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[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
... | [] | 908,975 | 908,976 | u176218583 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, m) cin >> b[i];
int ans = 0;
rep(i, n) {
int sum = 0;
rep(j, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
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 sum = 0;
rep(j, ... | [] | 908,987 | 908,988 | u068713120 | cpp |
p03102 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
int e, f = 0, g;
int d[b];
rep(i, b) cin >> d[i];
rep(i, a) {
e = 0;
rep(o, b) {
cin >> g;
e += g * d[o];
}
e = e - c... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
int e, f = 0, g;
int d[b];
rep(i, b) cin >> d[i];
rep(i, a) {
e = 0;
rep(o, b) {
cin >> g;
e += g * d[o];
}
e = e + c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,989 | 908,990 | u683078179 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> vec(n, vector<int>(m));
rep(i, n) {
rep(j, m) { cin >> vec.at(i).at(j); }
}
int sum = 0;
for (int i = 1; i < n; i++) {
int a = 0;
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> vec(n + 1, vector<int>(m));
rep(i, n + 1) {
rep(j, m) { cin >> vec.at(i).at(j); }
}
int sum = 0;
for (int i = 1; i < n + 1; i++) {
int a =... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 908,993 | 908,994 | u120459216 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
//-std=c++11
#define print(x) printf("%.12f", x);
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
//-std=c++11
#define print(x) printf("%.12f", x);
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
... | [
"expression.operation.unary.arithmetic.remove"
] | 908,995 | 908,996 | u002627851 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"control_flow.branch.if.condition.change"
] | 908,998 | 908,999 | u917049698 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#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[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#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[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,007 | 909,008 | u323542775 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#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[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#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[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.add"
] | 909,009 | 909,008 | u323542775 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,014 | 909,015 | u533566373 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,016 | 909,015 | u533566373 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | [] | 909,021 | 909,022 | u499381410 | cpp |
p03102 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<int> b(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<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 < ... | [] | 909,023 | 909,024 | u614128939 | cpp |
p03102 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, c, a[25][25], ans = 0, sum;
array<int, 25> b;
cin >> n >> m >> c;
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, c, a[25][25], ans = 0, sum;
array<int, 25> b;
cin >> n >> m >> c;
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,025 | 909,026 | u937747602 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, sum = 0, s, an;
cin >> n >> m >> c;
vector<int> b(m);
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
s = 0;
for (int l = 0; l < m; l++) {
cin >> a.at(i);
s +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, sum = 0, s, an;
cin >> n >> m >> c;
vector<int> b(m);
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
s = 0;
for (int l = 0; l < m; l++) {
cin >> a.at(l);
s +=... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 909,029 | 909,030 | u442754977 | cpp |
p03102 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,031 | 909,032 | u770383589 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][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;
int ans = c;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][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;
int ans = c;
for (int i = 0; i < n; i++) {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,033 | 909,034 | u679159704 | 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 count = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
vector<int> a(m);
for (int j = 0; j < m; j++) {
cin >> a[i];
su... | #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 count = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
vector<int> a(m);
for (int j = 0; j < m; j++) {
cin >> a[j];
su... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,035 | 909,036 | u882039496 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,043 | 909,044 | u456658814 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.add"
] | 909,045 | 909,044 | u456658814 | cpp |
p03102 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
... | [] | 909,049 | 909,050 | u829260400 | cpp |
p03102 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
... | [
"variable_declaration.type.change"
] | 909,051 | 909,050 | u829260400 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
temp... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 909,052 | 909,053 | u639732129 | cpp |
p03102 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
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) {
... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
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",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,054 | 909,055 | u904995051 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"identifier.change",
"expression.operation.binary.change"
] | 909,056 | 909,057 | u696290869 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
int goukei = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
int goukei = ... | [] | 909,060 | 909,061 | u441823651 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; 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);
}
}... | #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);
}
}... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,066 | 909,067 | u196629968 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
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 < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j... | [] | 909,078 | 909,079 | u684863590 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (... | [
"control_flow.branch.if.condition.change"
] | 909,080 | 909,081 | u373958718 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, m) {
ans = c;
rep(i, n) {
int x;
cin >> x;
ans += x * b[i];
}
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (... | [
"control_flow.branch.if.condition.change"
] | 909,082 | 909,081 | u373958718 | cpp |
p03102 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y... | [] | 909,083 | 909,084 | u776056110 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int B[M], A[M];
int judge;
for (int i = 0; i < M; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
judge = 0;
for (int j = 0; j < N; ++j) {
cin >> A[j];
judge += B[j] * A[j];
}... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int B[M], A[M];
int judge;
for (int i = 0; i < M; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
judge = 0;
for (int j = 0; j < M; ++j) {
cin >> A[j];
judge += B[j] * A[j];
}... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,085 | 909,086 | u364916333 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < M; i++) {
std::cin >> B[i];
}
std::vector<std::vector<int>> A(N, std::vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
std::cin >>... | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < M; i++) {
std::cin >> B[i];
}
std::vector<std::vector<int>> A(N, std::vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
std::cin >>... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 909,087 | 909,088 | u922974720 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [] | 909,091 | 909,092 | u926242698 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
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 count = 0;
fo... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 909,112 | 909,113 | u066855390 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
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 count = 0;
fo... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 909,114 | 909,113 | u066855390 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
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 count = 0;
fo... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"io.output.newline.add"
] | 909,115 | 909,113 | u066855390 | cpp |
p03102 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; 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);
}
}
in... | using namespace std;
#include <bits/stdc++.h>
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);
}
}
in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,127 | 909,128 | u615258936 | cpp |
p03102 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
in... | using namespace std;
#include <bits/stdc++.h>
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);
}
}
in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,129 | 909,128 | u615258936 | cpp |
p03102 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_D... | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_D... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,136 | 909,137 | u433195318 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m, ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,146 | 909,147 | u703214333 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, ans = 0;
;
cin >> N >> M >> C;
vector<int> bbb(M);
vector<vector<int>> vec(N, vector<int>(M));
for (int a = 0; a < M; a++) {
cin >> bbb.at(a);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> vec.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, ans = 0;
;
cin >> N >> M >> C;
vector<int> bbb(M);
vector<vector<int>> vec(N, vector<int>(M));
for (int a = 0; a < M; a++) {
cin >> bbb.at(a);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> vec.at... | [] | 909,150 | 909,151 | u962609087 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[n];
int **a = new int *[n];
for (int i = 0; i < m; i++) {
a[i] = new int[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,154 | 909,153 | u835629653 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int s = c, t = 0;
vector<int> b(m), v(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 >> v[i];
s += v[i] * b[i];
}
if (s > 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int s = c, t = 0;
vector<int> b(m), v(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 >> v[j];
s += v[j] * b[j];
}
if (s > 0)
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,157 | 909,158 | u930561195 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[i];
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[j];
}... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,159 | 909,160 | u679366464 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a;
}
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[j];
}... | [
"assignment.change"
] | 909,161 | 909,160 | u679366464 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c, x = 0, s = 0;
int a[20][20], b[20];
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];
}
for (int i = 0; i < n; i++) {
for (int j ... | #include <iostream>
using namespace std;
int main() {
int n, m, c, x = 0, s = 0;
int a[20][20], b[20];
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];
}
for (int i = 0; i < n; i++) {
x = 0;
... | [
"assignment.add"
] | 909,164 | 909,165 | u000113982 | cpp |
p03102 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, m, c, i, j, a[20], b[20], x, cnt;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; j < m; j++) {
cin >> a[j];
x = x + a[j] * b[... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, m, c, i, j, a[20], b[20], x, cnt;
cnt = 0;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; j < m; j++) {
cin >> a[j];
x = x ... | [
"assignment.add"
] | 909,166 | 909,167 | u520011376 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | [] | 909,174 | 909,175 | u711340028 | 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 < M; i++) {
cin >> B.at(i);
}
vector<int> A(M);
int D = C;
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A.at(i);
D +... | #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.at(i);
}
vector<int> A(M);
int D = C;
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A.at(i);
D +... | [] | 909,176 | 909,177 | u037276799 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[n];
int **a = new int *[n];
for (int i = 0; i < m; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 909,187 | 909,186 | u637220270 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<int> a(M);
rep(i, M) { cin >> b[i]; }
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<int> a(M);
rep(i, M) { cin >> b[i]; }
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,188 | 909,189 | u264405855 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int sum = 0;
int resum = 0;
vector<int> vec(m);
for (int i = 0; i < m; i++) {
cin >> vec[i];
}
for (int j = 0; j < n; j++) {
for (int k = 0; k < m; k++) {
int a;
cin >> a;
sum += a * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int sum = 0;
int resum = 0;
vector<int> vec(m);
for (int i = 0; i < m; i++) {
cin >> vec[i];
}
for (int j = 0; j < n; j++) {
for (int k = 0; k < m; k++) {
int a;
cin >> a;
sum += a * ... | [
"assignment.add"
] | 909,192 | 909,193 | u835924161 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
int count = 0;
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
int count = 0;
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
... | [
"assignment.add"
] | 909,201 | 909,202 | u532401120 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio... | [
"assignment.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 909,205 | 909,206 | u843739531 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, k, c = 0;
cin >> n >> m >> k;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < m; j++) {
int k;
cin >> k;
s += k * b[j];
}
if (s + c > 0)
... | #include <iostream>
using namespace std;
int main() {
int n, m, k, c = 0;
cin >> n >> m >> k;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < m; j++) {
int k;
cin >> k;
s += k * b[j];
}
if (s + k > 0)
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,209 | 909,210 | u169639579 | cpp |
p03102 | #include <iostream>
#include <string>
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 A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int k = 0;
int ans = 0;
... | #include <iostream>
#include <string>
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 A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int k = 0;
int ans = 0;
... | [
"assignment.add"
] | 909,211 | 909,212 | u646921304 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
... | [] | 909,217 | 909,218 | u593555034 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[i];
bab += A[i] * B[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,219 | 909,218 | u593555034 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c, ans, sum;
cin >> n >> m >> c;
int b[m], a[n][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];
for (int i = 0; i < n; i++) {
sum = c;
for (int j = 0; j ... | #include <iostream>
using namespace std;
int main() {
int n, m, c, ans = 0, sum;
cin >> n >> m >> c;
int b[m], a[n][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];
for (int i = 0; i < n; i++) {
sum = c;
for (int j = 0... | [
"variable_declaration.value.change"
] | 909,224 | 909,225 | u340494803 | 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;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, M) { cin >> B[i]; }
rep(i, N) {
rep(j, M) { cin >> A[i][j]; }
}
int sum = 0;
int ans ... | #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;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, M) { cin >> B[i]; }
rep(i, N) {
rep(j, M) { cin >> A[i][j]; }
}
int sum = 0;
int ans ... | [
"assignment.add"
] | 909,231 | 909,232 | u747087681 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S;
for (int i = 0; i < M; i++) {
cin ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S(M);
for (int i = 0; i < M; i++) {
c... | [] | 909,239 | 909,240 | u096717230 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S;
for (int i = 0; i < M; i++) {
cin >> S... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S(M);
for (int i = 0; i < M; i++) {
c... | [
"variable_declaration.value.change"
] | 909,241 | 909,240 | u096717230 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
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 < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a.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);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(j);
}
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 909,244 | 909,245 | u370447425 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(N));
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;
int 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++) {
cin >> A[i][j];
... | [] | 909,250 | 909,249 | u544437817 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (... | #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,251 | 909,252 | u218759384 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (... | #include <bits/stdc++.h>
using namespace std;
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;
}
/* define const */
const long long INF = (... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,253 | 909,252 | u218759384 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, total, count;
cin >> N >> M >> C;
int b[M] = {};
int a[N][M] = {};
count = 0;
total = 0;
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> a[j][i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, total, count;
cin >> N >> M >> C;
int b[M] = {};
int a[N][M] = {};
count = 0;
total = 0;
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> a[j][i];
... | [
"assignment.add"
] | 909,272 | 909,273 | u609576113 | cpp |
p03102 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], 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 correct = 0, code;
for (int i = 0; i < N; i++) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], 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 correct = 0, code;
for (int i = 0; i < N; i++) {
... | [
"assignment.add"
] | 909,286 | 909,287 | u668443884 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int i, j;
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
int count[n];
int hantei = 0;
for (i = 0; i < m; i++)
cin >> b[i];
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[n][m];
for (i = 0; i < n; i++) {
coun... | #include <iostream>
using namespace std;
int main() {
int i, j;
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
int count[n];
int hantei = 0;
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++) {
coun... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,294 | 909,295 | u754909749 | cpp |
p03102 | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(20);
vector<vector<int>> A(20, vector<int>(20));
int data = 0;
int counter = 0;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0... | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(20);
vector<vector<int>> A(20, vector<int>(20));
int data = 0;
int counter = 0;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0... | [
"identifier.change",
"io.output.change"
] | 909,298 | 909,299 | u774910314 | cpp |
p03102 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint16_t N, M;
int16_t C, *A, *B;
cin >> N >> M >> C;
A = new int16_t[M];
B = new int16_t[M];
for (uint16_t i = 0; i < M; i++)
cin >> B[i];
uint16_t res = 0;
int32_t ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint16_t N, M;
int16_t C, *A, *B;
cin >> N >> M >> C;
A = new int16_t[M];
B = new int16_t[M];
for (uint16_t i = 0; i < M; i++)
cin >> B[i];
uint16_t res = 0;
int32_t ... | [
"assignment.add"
] | 909,300 | 909,301 | u846796522 | cpp |
p03102 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,318 | 909,317 | u043443359 | cpp |
p03102 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define LL long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#define VI vector<int>
#define PII pair<... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define LL long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#define VI vector<int>
#define PII pair<... | [] | 909,322 | 909,323 | u423831742 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum = 0, ans = 0;
cin >> N >> M >> C;
int B[M], A;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A;
sum += A * B[i];
}
sum += C;
if (sum > 0)
... | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum = 0, ans = 0;
cin >> N >> M >> C;
int B[M], A;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
sum = 0;
for (int i = 0; i < M; i++) {
cin >> A;
sum += A * B[i];
}
sum += C;
... | [
"assignment.add"
] | 909,324 | 909,325 | u839397805 | cpp |
p03102 | #include <iostream>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int count = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int a;
std::cin >> a;
sum += a * b[j];
}
if (sum... | #include <iostream>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int count = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
int a;
std::cin >> a;
sum += a * b[j];
... | [
"assignment.add"
] | 909,329 | 909,330 | u775347320 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int S = 0, count = 0;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int S = 0, count = 0;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> ... | [
"assignment.add"
] | 909,337 | 909,338 | u255412750 | cpp |
p03102 | #include <stdio.h>
int main(void) {
int N, M, C;
int A[20][20], B[20];
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &C);
for (int j = 0; j < M; j++) {
scanf("%d", &B[j]);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%d", &A[i][j]);
}
}
int sum = 0;
int ... | #include <stdio.h>
int main(void) {
int N, M, C;
int A[20][20], B[20];
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &C);
for (int j = 0; j < M; j++) {
scanf("%d", &B[j]);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%d", &A[i][j]);
}
}
int sum = 0;
int ... | [
"assignment.add"
] | 909,347 | 909,348 | u956941456 | cpp |
p03102 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | [] | 909,349 | 909,350 | u572138437 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] ... | [
"assignment.add"
] | 909,359 | 909,360 | u317177661 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"assignment.add"
] | 909,361 | 909,360 | u317177661 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
using IntV = std::vector<int>;
IntV B(M);
for (auto &b : B)
std::cin >> b;
IntV A(N * M);
for (auto &a : A)
std::cin >> a;
auto itr_a = A.begin();
int cnt = 0;
for (int i = 0; i < N; i++) {
auto itr... | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
using IntV = std::vector<int>;
IntV B(M);
for (auto &b : B)
std::cin >> b;
IntV A(N * M);
for (auto &a : A)
std::cin >> a;
auto itr_a = A.begin();
int cnt = 0;
for (int i = 0; i < N; i++) {
auto itr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,377 | 909,378 | u896932701 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int sum = C;
for (int jj = 0; jj < M; jj++) {
int a;
cin >> a;
sum += a * B[jj];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int sum = C;
for (int jj = 0; jj < M; jj++) {
int a;
cin >> a;
sum += a * B[jj];
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,379 | 909,380 | u471342385 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define Si size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define Em empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#defi... | #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define Si size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define Em empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#defi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,384 | 909,385 | u380762346 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m... | [
"assignment.add"
] | 909,388 | 909,389 | u373164102 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m... | [
"expression.operator.change",
"assignment.add"
] | 909,390 | 909,389 | u373164102 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != ve... | [
"control_flow.loop.for.condition.change"
] | 909,393 | 909,394 | u085117197 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n, m, c;
... | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n, m, c;
... | [
"variable_declaration.value.change"
] | 909,397 | 909,398 | u061383139 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,408 | 909,409 | u124992729 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], 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 sum = 0;
int ans = 0;
for (int i = 0; i < N; ... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], 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 sum = 0;
int ans = 0;
for (int i = 0; i < N; ... | [
"assignment.add"
] | 909,412 | 909,413 | u845882023 | 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 ans... | #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 ans... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,414 | 909,415 | u552201227 | 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 < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int ans... | #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 ans... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 909,417 | 909,415 | u552201227 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
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 < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.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);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
... | [
"assignment.add"
] | 909,418 | 909,419 | u548596361 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int M, N, C, success = 0, s = 0, i, j;
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++) {
for ... | #include <iostream>
using namespace std;
int main() {
int M, N, C, success = 0, s = 0, i, j;
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++) {
for ... | [
"assignment.add"
] | 909,424 | 909,425 | u491789916 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.