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 <cmath>
#include <iostream>
#include <string>
using namespace std;
int N, M, C;
const int MAX_NM = 20;
int B[MAX_NM], A[MAX_NM][MAX_NM];
int main() {
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];
... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int N, M, C;
const int MAX_NM = 20;
int B[MAX_NM], A[MAX_NM][MAX_NM];
int main() {
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];
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,428 | 909,429 | u488352661 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, f;
cin >> a >> b >> c;
vector<int> d(b + 1), e(b + 1);
d[0] = 0;
e[0] = 0;
f = 0;
for (int i = 0; i < b; i++) {
cin >> d[i + 1];
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> e[j + 1];
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, f;
cin >> a >> b >> c;
vector<int> d(b + 1), e(b + 1);
d[0] = 0;
e[0] = 0;
f = 0;
for (int i = 0; i < b; i++) {
cin >> d[i + 1];
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> e[j + 1];
e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,442 | 909,443 | u902787159 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m, c;
vector<int> a, b;
int i, j, k = 0;
int ans = 0, sum = 0;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
a.push_back(0);
}
for (i = 0; i < m; i++) {
cin >> j;
b.push_back(j);
}
for (i = 0; i < n; i+... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m, c;
vector<int> a, b;
int i, j, k = 0;
int ans = 0, sum = 0;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
a.push_back(0);
}
for (i = 0; i < m; i++) {
cin >> j;
b.push_back(j);
}
for (i = 0; i < n; i+... | [
"assignment.add"
] | 909,444 | 909,445 | u060467857 | cpp |
p03102 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
int main() {
int n, m, c, ans;
cin >> n >> m >> c;
vector<int> b(m), a(m);
for (int j = 0; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m), a(m);
for (int j =... | [
"variable_declaration.value.change"
] | 909,446 | 909,447 | u217556271 | cpp |
p03102 | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
void solve(long long N, long long M, long long C, std::vector<long long> B,
std::vector<std::vector<long long>> A) {
int cnt = 0;
f... | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
void solve(long long N, long long M, long long C, std::vector<long long> B,
std::vector<std::vector<long long>> A) {
int cnt = 0;
f... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 909,448 | 909,449 | u183530284 | cpp |
p03102 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int m, n, c;
int count = 0;
cin >> m >> ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> ... | [
"variable_declaration.remove",
"variable_declaration.add",
"expression.operation.binary.remove"
] | 909,455 | 909,456 | u940342887 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], B[M], ans = 0;
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, res = 0; i < N; i++) {
fo... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], B[M], ans = 0;
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, res = 0; i < N; i++, res = 0)... | [
"control_flow.loop.for.update.change"
] | 909,457 | 909,458 | u113589326 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
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];
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
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];
... | [] | 909,464 | 909,465 | u299137831 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M, C;
cin >> 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 <iostream>
#include <vector>
using namespace std;
int main(void) {
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];
... | [
"expression.operation.binary.add"
] | 909,466 | 909,465 | u299137831 | cpp |
p03102 | #include <stdio.h>
#define maxm 100
#define maxn 100
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int ... | #include <stdio.h>
#define maxm 100
#define maxn 100
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,467 | 909,468 | u570486288 | cpp |
p03102 | #include <stdio.h>
#define maxm 20
#define maxn 20
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int nu... | #include <stdio.h>
#define maxm 100
#define maxn 100
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
int ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.narrow.change"
] | 909,469 | 909,468 | u570486288 | cpp |
p03102 | #include <stdio.h>
#define maxm 20
#define maxn 20
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int nu... | #include <stdio.h>
#define maxm 100
#define maxn 100
int main() {
int n, m, c;
int b[maxm];
int a[maxn][maxm];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
int ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,471 | 909,468 | u570486288 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[X][X];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[100][100];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j]... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 909,473 | 909,474 | u954734017 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int count = 0;
int sum = 0;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> data(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++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int count = 0;
int sum = 0;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> data(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++) {
... | [] | 909,481 | 909,482 | u728628785 | cpp |
p03102 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"expression.operation.unary.arithmetic.remove"
] | 909,489 | 909,490 | u010004797 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, a[20], b[20], ans = 0;
long long int sum;
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
cin >> a[j];
sum += a[j] * b[j];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, a[20], b[20], ans = 0;
long long int sum;
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
cin >> a[j];
sum += a[j] * b[j];
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 909,493 | 909,494 | u759417460 | cpp |
p03102 | #include <iostream>
#include <numeric>
#define repd(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
using namespace std;
int main() {
int n, m, c;
... | #include <iostream>
#include <numeric>
#define repd(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
using namespace std;
int main() {
int n, m, c;
... | [
"assignment.add"
] | 909,495 | 909,496 | u478997153 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, count = 0;
cin >> N >> M >> C;
vector<int> A(M + 1);
vector<int> B(M + 1);
int cal;
for (int i = 1; i <= M; i++) {
cin >> B.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
cin >> A.at(j);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, count = 0;
cin >> N >> M >> C;
vector<int> A(M + 1);
vector<int> B(M + 1);
int cal;
for (int i = 1; i <= M; i++) {
cin >> B.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
cin >> A.at(j);
}
... | [
"assignment.variable.change",
"identifier.change"
] | 909,498 | 909,499 | u544165468 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, count = 0;
cin >> N >> M >> C;
vector<int> A(M + 1);
vector<int> B(M + 1);
int cal;
for (int i = 1; i <= M; i++) {
cin >> B.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
cin >> A.at(j);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, count = 0;
cin >> N >> M >> C;
vector<int> A(M + 1);
vector<int> B(M + 1);
int cal;
for (int i = 1; i <= M; i++) {
cin >> B.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
cin >> A.at(j);
}
... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,500 | 909,499 | u544165468 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < B.size(); i++) {
std::cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (size_t i = 0; i < A.size(); i++) {
for (size_t j = 0; j < A.f... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < B.size(); i++) {
std::cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (size_t i = 0; i < A.size(); i++) {
for (size_t j = 0; j < A.f... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,511 | 909,512 | u824337972 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
int i = 0;
for (i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (int k = 0; k < N; k++) {
for (int l = 0; l < M; l++) {
cin >> A[k][l];
}
}
int kosu = 0;
int source = 0;
for ... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
int i = 0;
for (i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (int k = 0; k < N; k++) {
for (int l = 0; l < M; l++) {
cin >> A[k][l];
}
}
int kosu = 0;
int source = 0;
for ... | [
"assignment.change"
] | 909,513 | 909,514 | u596496804 | cpp |
p03102 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 909,517 | 909,518 | u129134470 | cpp |
p03102 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 909,519 | 909,518 | u129134470 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[21];
int A[21];
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0, ans = 0;
for (int j = 0; j < N; ++j) {
for (int i = 0; i < M; ++i) {
cin >> A[i];
ans += A[i] * B[i];
}
ans += C;... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[21];
int A[21];
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0, ans = 0;
for (int j = 0; j < N; ++j) {
for (int i = 0; i < M; ++i) {
cin >> A[i];
ans += A[i] * B[i];
}
ans += C;... | [
"assignment.add"
] | 909,524 | 909,525 | u684556267 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int pre[105][105];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &pre[i][j]);
}
}
int cnt = 0;
for (int i = 1; i < n; i++) {
int ans = 0;
for (int j = 0; j < ... | #include <bits/stdc++.h>
using namespace std;
int pre[105][105];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
n++;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &pre[i][j]);
}
}
int cnt = 0;
for (int i = 1; i < n; i++) {
int ans = 0;
for (int j = ... | [
"expression.unary.arithmetic.add"
] | 909,528 | 909,529 | u587292349 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, tmp, count = 0, tmp_score = 0;
vector<int> B;
vector<vector<int>> A;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> tmp;
B.push_back(tmp);
}
for (int i = 0; i < N; i++) {
A.emplace_back();
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, tmp, count = 0, tmp_score = 0;
vector<int> B;
vector<vector<int>> A;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> tmp;
B.push_back(tmp);
}
for (int i = 0; i < N; i++) {
A.emplace_back();
for (int j = 0; j... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,537 | 909,538 | u570417673 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int a[20][20];
int 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];
}
}
int ans = 0;
int sum = 0;
for (int i = 0... | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int a[20][20];
int 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];
}
}
int ans = 0;
int sum = 0;
for (int i = 0... | [
"assignment.add"
] | 909,542 | 909,543 | u859125915 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
int M = 0;
int C = 0;
std::cin >> N >> M >> C;
std::vector<int> B(M, 0);
for (int i = 0; i < B.size(); i++) {
int a = 0;
std::cin >> a;
B[i] = a;
}
std::vector<int> A_i_row(N, 0);
std::vector<std::vector<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
int M = 0;
int C = 0;
std::cin >> N >> M >> C;
std::vector<int> B(M, 0);
for (int i = 0; i < B.size(); i++) {
int a = 0;
std::cin >> a;
B[i] = a;
}
std::vector<int> A_i_row(M, 0);
std::vector<std::vector<... | [
"identifier.change",
"call.arguments.change"
] | 909,565 | 909,566 | u829632412 | cpp |
p03102 | #include <iostream>
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 count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
int a;
cin >> a;
sum += b[i] * a;
}
... | #include <iostream>
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 count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
int a;
cin >> a;
sum += b[j] * a;
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,571 | 909,572 | u465669072 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,576 | 909,577 | u190907730 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 909,578 | 909,577 | u190907730 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 909,579 | 909,577 | u190907730 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
using ull = unsigned long long;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
using ull = unsigned long long;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,580 | 909,581 | u244806387 | cpp |
p03102 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define LL long long
using namespace std;
int n, m, k, ans, tmp;
int a[22][22];
int b[22], c;
int main() {
// freopen("new.txt","r",stdin);
scanf("%d %d %d", &n, &m, &c);
for (int i = 1; i <= m; i++)
scanf("%d", b + i);
for (int i = 1; i <= n; i++) ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define LL long long
using namespace std;
int n, m, k, ans, tmp;
int a[22][22];
int b[22], c;
int main() {
// freopen("new.txt","r",stdin);
scanf("%d %d %d", &n, &m, &c);
for (int i = 1; i <= m; i++)
scanf("%d", b + i);
for (int i = 1; i <= n; i++) ... | [
"control_flow.break.remove"
] | 909,588 | 909,589 | u069164832 | cpp |
p03102 | //
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m, c;
cin >> n >> m >> c;
// vector<vector<int>> mat;
vector<int> b;
int tmp;
for (int i = 0; i < m; ++i) {
cin >> tmp;
b.push_back(tmp);
}
int sum = 0;
int res = 0;
for (int i = 0;... | //
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m, c;
cin >> n >> m >> c;
// vector<vector<int>> mat;
vector<int> b;
int tmp;
for (int i = 0; i < m; ++i) {
cin >> tmp;
b.push_back(tmp);
}
int sum = 0;
int res = 0;
for (int i = 0;... | [
"assignment.add"
] | 909,590 | 909,591 | u169711213 | cpp |
p03102 | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | [
"control_flow.branch.if.condition.change"
] | 909,592 | 909,593 | u226861390 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1 << 29;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
int N, M, C;
ci... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1 << 29;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
int N, M, C;
ci... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,598 | 909,597 | u038027079 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
int a[20][20], b[20];
scanf("%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", b + i);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
scanf("%d", &a[i][j]);
int ans = 0;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
int a[20][20], b[20];
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", b + i);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
scanf("%d", &a[i][j]);
int ans = 0;
for (int i = 0; i < n; ... | [
"literal.string.change",
"call.arguments.change"
] | 909,601 | 909,602 | u355780225 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, A[25] = {}, B[25] = {}, C, i, j, Ccheck = 0, count = 0;
cin >> N >> M >> C;
for (i = 0; i < M; i++) {
cin >> B[i];
}
for (j = 0; j < N; j++) {
for (i = 0; i < M; i++) {
cin >> A[i];
Ccheck += A[i] * B[i];
}
if (Ccheck ... | #include <iostream>
using namespace std;
int main() {
int N, M, A[25] = {}, B[25] = {}, C, i, j, Ccheck = 0, count = 0;
cin >> N >> M >> C;
for (i = 0; i < M; i++) {
cin >> B[i];
}
for (j = 0; j < N; j++) {
for (i = 0; i < M; i++) {
cin >> A[i];
Ccheck += A[i] * B[i];
}
if (Ccheck ... | [
"assignment.add"
] | 909,603 | 909,604 | u451625046 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, A[25] = {}, B[25] = {}, C, i, j, Ccheck = 0, count = 0;
cin >> N >> M >> C;
for (i = 0; i < M; i++) {
cin >> B[i];
}
for (j = 0; j < N; j++) {
for (i = 0; i < M; i++) {
cin >> A[i];
Ccheck += A[i] * B[i];
}
if (Ccheck ... | #include <iostream>
using namespace std;
int main() {
int N, M, A[25] = {}, B[25] = {}, C, i, j, Ccheck = 0, count = 0;
cin >> N >> M >> C;
for (i = 0; i < M; i++) {
cin >> B[i];
}
for (j = 0; j < N; j++) {
for (i = 0; i < M; i++) {
cin >> A[i];
Ccheck += A[i] * B[i];
}
if (Ccheck ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 909,605 | 909,604 | u451625046 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
int main() {
ll n, m, c;
cin >> n >> m >> c;
ll b[m], a, count = 0, pro;
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
for (ll i = 0; i < n; i++) {
pro = 0;
for (ll j = 0; j < m; j++) {
cin >> a;
pro += a *... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, m, c;
cin >> n >> m >> c;
ll b[m], a, count = 0, pro;
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
for (ll i = 0; i < n; i++) {
pro = 0;
for (ll j = 0; j < m; j++) {
cin >> a;
pro += a * b[j];
... | [] | 909,608 | 909,609 | u555125997 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
int main() {
ll n, m, c;
cin >> n >> m >> c;
ll b[m], a, count = 0, pro;
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
for (ll i = 0; i < n; i++) {
pro = 0;
for (ll i = 0; i < m; i++) {
cin >> a;
pro += a *... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, m, c;
cin >> n >> m >> c;
ll b[m], a, count = 0, pro;
for (ll i = 0; i < m; i++) {
cin >> b[i];
}
for (ll i = 0; i < n; i++) {
pro = 0;
for (ll j = 0; j < m; j++) {
cin >> a;
pro += a * b[j];
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 909,610 | 909,609 | u555125997 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const ll INF = 1ll << 60;
int n, m, c;
int b[25];
int a[25][25];
int ans;
int main() {
cin >> n >> m >> c;
for (int i = 1; i <= m; i++)
cin >> b[i];
for (int i = 1; i <= n; i++)
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const ll INF = 1ll << 60;
int n, m, c;
int b[25];
int a[25][25];
int ans;
int main() {
cin >> n >> m >> c;
for (int i = 1; i <= m; i++)
cin >> b[i];
for (int i = 1; i <= n; i++)
for (int... | [
"assignment.add"
] | 909,621 | 909,622 | u817240026 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N], 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 x = 0;
for (int i = 0; i < N; i++) {
int y = ... | #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 x = 0;
for (int i = 0; i < N; i++) {
int y = ... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 909,623 | 909,624 | u646148705 | cpp |
p03102 | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,631 | 909,632 | u533101919 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, m, c, i, j;
cin >> n >> m >> c;
int b[m], a[n][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];
}
}
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, m, c, i, j;
cin >> n >> m >> c;
int b[m], a[n][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];
}
}
... | [
"identifier.change",
"io.output.change"
] | 909,636 | 909,637 | u863104798 | cpp |
p03102 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, c, b[30];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, c, b[30];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,642 | 909,643 | u398025421 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[M];
int A[N][M];
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 <... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[110];
int A[110][110];
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 909,644 | 909,645 | u644070128 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T ... | [
"control_flow.branch.if.condition.change"
] | 909,652 | 909,653 | u617380180 | cpp |
p03102 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unord... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unord... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,654 | 909,655 | u422592877 | cpp |
p03102 | // ABC121B
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
cin >> N >> M >> C;
int B[20];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int A[20][20];
int sum[20];
for (int i = 0; i < N; i++) {
sum[i] += C;
for (int j = 0; j < M; j++) {
cin >> A[i][j];
... | // ABC121B
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
cin >> N >> M >> C;
int B[20];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int A[20][20];
int sum[20];
for (int i = 0; i < N; i++) {
sum[i] = C;
for (int j = 0; j < M; j++) {
cin >> A[i][j];
s... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,658 | 909,659 | u426397594 | cpp |
p03102 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,660 | 909,661 | u130196064 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
... | [] | 909,662 | 909,663 | u661892391 | cpp |
p03102 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define int long long
signed main() {
int N, M, C;
cin >> N >> M >> C;
int ans = 0;
std::vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B[i];
for (... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define int long long
signed main() {
int N, M, C;
cin >> N >> M >> C;
int ans = 0;
std::vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B[i];
for (... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,666 | 909,667 | u942774736 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | [] | 909,668 | 909,669 | u816800341 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
int b[20], a, sm, cnt = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
sm = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sm += a * b[j];
}
if (sm > 0)
cnt+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
int b[20], a, sm, cnt = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
sm = c;
for (int j = 0; j < m; j++) {
cin >> a;
sm += a * b[j];
}
if (sm > 0)
cnt+... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,672 | 909,673 | u798086274 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int sum;
int *a = new int[M];
int *b = new int[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
sum = C;
for (int j = 0; j < M; j++) {
cin >> a[i];
... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int sum;
int *a = new int[M];
int *b = new int[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
sum = C;
for (int j = 0; j < M; j++) {
cin >> a[j];
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,674 | 909,675 | u243100867 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int sum;
int *a = new int[M];
int *b = new int[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
sum = C;
for (int j = 0; j < M; j++) {
cin >> a[i];
... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int sum;
int *a = new int[M];
int *b = new int[M];
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
sum = C;
for (int j = 0; j < M; j++) {
cin >> a[j];
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 909,676 | 909,675 | u243100867 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
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];
}
if... | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
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];
}
if... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 909,677 | 909,678 | u467763786 | cpp |
p03102 | #include <cstdio>
#include <iostream>
using namespace std;
const int MAX_Bi = 100;
int main() {
int N, M, C;
int cnt = 0;
cin >> N >> M >> C;
int B[MAX_Bi];
int A[23][23];
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];
... | #include <cstdio>
#include <iostream>
using namespace std;
const int MAX_Bi = 100;
int main() {
int N, M, C;
int cnt = 0;
cin >> N >> M >> C;
int B[MAX_Bi];
int A[23][23];
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];
... | [] | 909,683 | 909,684 | u794707792 | 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];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
sum = 0;
int temp;
for (int z = 0; z < m; z++) {
cin >> temp;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
sum = 0;
int temp;
for (int z = 0; z < m; z++) {
cin >> temp;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,688 | 909,689 | u869566267 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C, A[20][20], B[20], res = 0;
cin >> N >> M >> C;
for (int i = 0; i < N; ++i)
cin >> B[i];
for (int i = 0; i < M; ++i)
for (int j = 0; j < N; ++j)
cin >> A[i][j];
for (int i = 0; i < N; ++i) {
long long sum = 0;
for (int j... | #include <iostream>
using namespace std;
int main() {
int N, M, C, A[20][20], B[20], res = 0;
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) {
long long sum = 0;
for (int j... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,690 | 909,691 | u992218377 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"assignment.add"
] | 909,694 | 909,695 | u155416173 | cpp |
p03102 | #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[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 <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[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];
}... | [
"assignment.value.change"
] | 909,700 | 909,701 | u032189172 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int d = 0;
int f = 0;
int bb[20];
cin >> a >> b >> c;
for (int j = 0; j < b; j++) {
cin >> bb[j];
}
int am[20][20];
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> am[i][j];
d += am[i][j] * bb[j];... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int d = 0;
int f = 0;
int bb[20];
cin >> a >> b >> c;
for (int j = 0; j < b; j++) {
cin >> bb[j];
}
int am[20][20];
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> am[i][j];
d += am[i][j] * bb[j];... | [
"assignment.variable.change",
"assignment.add"
] | 909,702 | 909,703 | u429756316 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(n);
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int a, sum = 0;
for (int j = 0; j < m; j++)
cin >> a, sum += a * b[j];
ans += (... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int a, sum = 0;
for (int j = 0; j < m; j++)
cin >> a, sum += a * b[j];
ans += (... | [] | 909,704 | 909,705 | u188020698 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
fo... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 909,706 | 909,707 | u873627575 | cpp |
p03102 | #include <iostream>
#define endl '\n'
using namespace std;
int main() {
int N, M, C, i, j, total = 0, e, sum = 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>
#define endl '\n'
using namespace std;
int main() {
int N, M, C, i, j, total = 0, e, sum = 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"
] | 909,714 | 909,715 | u517786923 | cpp |
p03102 | #include <iostream>
#define endl '\n'
using namespace std;
int main() {
int N, M, C, i, j, total = 0, e, sum = 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>
#define endl '\n'
using namespace std;
int main() {
int N, M, C, i, j, total = 0, e, sum = 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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 909,716 | 909,715 | u517786923 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [] | 909,725 | 909,726 | u318785595 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [] | 909,727 | 909,726 | u318785595 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"variable_declaration.type.change"
] | 909,725 | 909,728 | u318785595 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"variable_declaration.type.change"
] | 909,727 | 909,728 | u318785595 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
temp... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 909,725 | 909,729 | u318785595 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
temp... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 909,727 | 909,729 | u318785595 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int N;
int M;
int C;
std::vector<int> s;
std::cin >> N >> M >> C;
int B;
for (int k = 0; k < M; k++) {
std::cin >> B;
s.push_back(B);
}
int A;
int count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++... | #include <iostream>
#include <vector>
int main() {
int N;
int M;
int C;
std::vector<int> s;
std::cin >> N >> M >> C;
int B;
for (int k = 0; k < M; k++) {
std::cin >> B;
s.push_back(B);
}
int A;
int count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 909,730 | 909,731 | u240226076 | cpp |
p03102 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, b[25] = {};
int cnt = 0, d = 0, ans = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
while (1) {
if (d > n)
break;
ans = 0;
int a[25] = {};
for (int i = 0; i < m; i++... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, b[25] = {};
int cnt = 0, d = 0, ans = 0;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
while (1) {
if (d >= n)
break;
ans = 0;
int a[25] = {};
for (int i = 0; i < m; i+... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,732 | 909,733 | u187393896 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int s = 0;
int B[M];
for (int k = 0; k < M; k++) {
cin >> B[k];
}
int A[M];
for (int i = 0; i < N; i++) {
int S = C;
for (int j = 1; j < M; j++) {
cin >> A[j];
S += A[j] * B[j];
}
i... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int s = 0;
int B[M];
for (int k = 0; k < M; k++) {
cin >> B[k];
}
int A[M];
for (int i = 0; i < N; i++) {
int S = C;
for (int j = 0; j < M; j++) {
cin >> A[j];
S += A[j] * B[j];
}
i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 909,734 | 909,735 | u057617112 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int s = 0;
int B[M];
for (int k = 0; k < M; k++) {
cin >> B[k];
}
int A[M];
int i = 0;
while (i < N) {
int S = C;
for (int j = 1; j < M; j++) {
cin >> A[j];
S += A[j] * B[j];
}
if... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int s = 0;
int B[M];
for (int k = 0; k < M; k++) {
cin >> B[k];
}
int A[M];
int i = 0;
while (i < N) {
int S = C;
for (int j = 0; j < M; j++) {
cin >> A[j];
S += A[j] * B[j];
}
if... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 909,736 | 909,737 | u057617112 | cpp |
p03102 | #include <iostream>
using namespace std;
main() {
int N, M, C, times = 0, result = 0;
cin >> N >> M >> C;
int B[M];
int A[N][M];
for (int i = 0; i < M; i++) {
int BM;
cin >> BM;
B[i] = BM;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
int AM;
cin >> AM;
... | #include <iostream>
using namespace std;
int main() {
int N, M, C, times = 0, result = 0;
cin >> N >> M >> C;
int B[M];
int A[N][M];
for (int i = 0; i < M; i++) {
int BM;
cin >> BM;
B[i] = BM;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
int AM;
cin >> AM;
... | [
"assignment.add"
] | 909,738 | 909,739 | u788063708 | cpp |
p03102 | #include <iostream>
using namespace std;
main() {
int N, M, C, times = 0, result = 0;
cin >> N >> M >> C;
int B[M];
int A[N][M];
for (int i = 0; i < M; i++) {
int BM;
cin >> BM;
B[i] = BM;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
int AM;
cin >> AM;
... | #include <iostream>
using namespace std;
int main() {
int N, M, C, times = 0, result = 0;
cin >> N >> M >> C;
int B[M];
int A[N][M];
for (int i = 0; i < M; i++) {
int BM;
cin >> BM;
B[i] = BM;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
int AM;
cin >> AM;
... | [
"assignment.add"
] | 909,740 | 909,739 | u788063708 | cpp |
p03102 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, M, C, AB = 0, Ans = 0;
vector<vector<int>> A(20, vector<int>(20));
vector<int> B(20);
cin >> N >> M >> C;
for (int j = 0; j < M; j++) {
cin >> B.at(j);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, M, C, AB = 0, Ans = 0;
vector<vector<int>> A(20, vector<int>(20));
vector<int> B(20);
cin >> N >> M >> C;
for (int j = 0; j < M; j++) {
cin >> B.at(j);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"call.add"
] | 909,741 | 909,742 | u088174896 | cpp |
p03102 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, M, C, AB = 0, Ans = 0;
vector<vector<int>> A(20, vector<int>(20));
vector<int> B(20);
cin >> N, M, C;
for (int j = 0; j < M; j++) {
cin >> B.at(j);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int N, M, C, AB = 0, Ans = 0;
vector<vector<int>> A(20, vector<int>(20));
vector<int> B(20);
cin >> N >> M >> C;
for (int j = 0; j < M; j++) {
cin >> B.at(j);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {... | [] | 909,743 | 909,742 | u088174896 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int B[20] = {};
const int MAX = 256;
int A[MAX][20] = {};
int sum = 0;
int num = 0;
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 >> ... | #include <iostream>
using namespace std;
int main() {
int n, m, c;
int B[20] = {};
const int MAX = 256;
int A[MAX][20] = {};
int sum = 0;
int num = 0;
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 >>... | [
"assignment.add"
] | 909,753 | 909,754 | u745852541 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, A[20][20], B[20], C, SUM[20], counter;
counter = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
cin >> A[n][i];
}
}
for (int n = 0; n < N; ... | #include <iostream>
using namespace std;
int main() {
int N, M, A[20][20], B[20], C, SUM[20] = {0}, counter;
counter = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
cin >> A[n][i];
}
}
/////////////////... | [
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 909,777 | 909,778 | u573083749 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, A[20][20], B[20], C, SUM[20], counter;
counter = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
cin >> A[n][i];
}
}
for (int n = 0; n < N; ... | #include <iostream>
using namespace std;
int main() {
int N, M, A[20][20], B[20], C, SUM[20] = {0}, counter;
counter = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
cin >> A[n][i];
}
}
/////////////////... | [
"variable_declaration.value.change",
"assignment.value.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 909,779 | 909,778 | u573083749 | 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];
}
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 ... | #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 ... | [] | 909,780 | 909,781 | u365956698 | 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];
}
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 ... | #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 ... | [] | 909,782 | 909,781 | u365956698 | cpp |
p03102 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, fans;
int x, h[1000];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> x;
ans += h[j] * x;
}... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, fans = 0;
int x, h[1000];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> x;
ans += h[j] * x;
... | [
"variable_declaration.value.change"
] | 909,784 | 909,785 | u373291210 | cpp |
p03102 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, fans;
int x, h[1000];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> x;
ans += h[j] * x;
}... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m, c, fans = 0;
int x, h[1000];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> x;
ans += h[j] * x;
... | [
"variable_declaration.value.change"
] | 909,786 | 909,785 | u373291210 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
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];
}
}
for (... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 909,790 | 909,791 | u662665711 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
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];
}
}
for (... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 909,792 | 909,791 | u662665711 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int A[100], B[100];
int main() {
int n, k, x, cnt = 0;
cin >> n >> k >> x;
for (int i = 0; i <= n; i++) {
int ans = 0;
for (int j = 0; j < k; j++) {
if (i == 0)
cin >> A[j];
else {
cin >> B[j];
ans += A[j] * B[j];
}
... | #include <bits/stdc++.h>
using namespace std;
int A[100], B[100];
int main() {
int n, k, x, cnt = 0;
cin >> n >> k >> x;
for (int i = 0; i <= n; i++) {
int ans = 0;
for (int j = 0; j < k; j++) {
if (i == 0)
cin >> A[j];
else {
cin >> B[j];
ans += A[j] * B[j];
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 909,794 | 909,795 | u418568023 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
struct pairs {
int price;
int num;
};
int main(int argc, char *argv[]) {
/*
cin>>x;
cout<<x<<endl;
int i,j,n,m,a,b=0,c;
double a... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
struct pairs {
int price;
int num;
};
int main(int argc, char *argv[]) {
/*
cin>>x;
cout<<x<<endl;
int i,j,n,m,a,b=0,c;
double a... | [] | 909,799 | 909,800 | u785689316 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m, c;
cin >> m >> c;
int t = 0;
int a[m], b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int d = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i];
d += a[i] * b[i];
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m, c;
cin >> m >> c;
int t = 0;
int a[m], b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int d = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
d += a[j] * b[j];
}
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.loop.for.condition.change"
] | 909,801 | 909,802 | u612745975 | cpp |
p03102 | #include <iostream>
#include <vector>
using namespace std;
using Int = long long;
int main() {
Int N, M, C, ans, count = 0;
cin >> N >> M >> C;
vector<Int> B(M);
for (Int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(M);
for (Int i = 0; i < N; i++) {
A[i].resize(M);
}
for (Int i... | #include <iostream>
#include <vector>
using namespace std;
using Int = long long;
int main() {
Int N, M, C, ans, count = 0;
cin >> N >> M >> C;
vector<Int> B(M);
for (Int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N);
for (Int i = 0; i < N; i++) {
A[i].resize(M);
}
for (Int i... | [] | 909,806 | 909,807 | u127348287 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
int B[21];
int A[20001][21];
int sum = 0;
int succeed = 0;
int i, j;
scanf("%d %d %d", &N, &M, &C);
for (i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
scanf("... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
int B[21];
int A[15001][21];
int sum = 0;
int succeed = 0;
int i, j;
scanf("%d %d %d", &N, &M, &C);
for (i = 1; i <= M; i++) {
scanf("%d", &B[i]);
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
scanf("... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,809 | 909,810 | u767875987 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
int B[21];
int A[10001][21];
int sum = 0;
int succeed = 0;
int i, j;
scanf("%d %d %d", &N, &M, &C);
for (i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
scanf("... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, C;
int B[21];
int A[15001][21];
int sum = 0;
int succeed = 0;
int i, j;
scanf("%d %d %d", &N, &M, &C);
for (i = 1; i <= M; i++) {
scanf("%d", &B[i]);
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
scanf("... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,811 | 909,810 | u767875987 | cpp |
p03102 | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i] * B[i];
}
return sum;
}
int main(int argc, char const *argv[]) {
int N, M, C, ret = 0;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i =... | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i] * B[i];
}
return sum;
}
int main(int argc, char const *argv[]) {
int N, M, C, ret = 0;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 909,812 | 909,813 | u481487723 | cpp |
p03102 | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
// cout << "A*B: " << A[i] * B[i] << endl;
sum += A[i] * B[i];
}
// cout << "sum: " << sum << endl;
return sum;
}
int main(int argc, char const *argv[]) {
... | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i] * B[i];
}
return sum;
}
int main(int argc, char const *argv[]) {
int N, M, C, ret = 0;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i =... | [
"variable_declaration.type.narrow.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 909,814 | 909,813 | u481487723 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.