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 9
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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int isCollect = 0;
for (int j = 0; j < M; j++) {
isCollect += A[i][j] * B[j];
}
if (isCollect > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int isCollect = C;
for (int j = 0; j < M; j++) {
isCollect += A[i][j] * B[j];
}
if (isCollect > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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[j + 1] = e[j + 1] * d[j + 1] + e[j];
}
if (e[b] + c >= 0) {
f++;
}
}
cout << f << endl;
}
| #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[j + 1] = e[j + 1] * d[j + 1] + e[j];
}
if (e[b] + c > 0) {
f++;
}
}
cout << f << endl;
}
| [
"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++) {
for (j = 0; j < m; j++) {
cin >> k;
a[j] = k;
}
for (j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans += c;
if (ans > 0)
sum++;
}
cout << sum << endl;
return 0;
} | #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++) {
ans = 0;
for (j = 0; j < m; j++) {
cin >> k;
a[j] = k;
}
for (j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans += c;
if (ans > 0)
sum++;
}
cout << sum << endl;
return 0;
} | [
"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; j < m; j++) {
cin >> b[j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
if (inner_product(a.begin(), a.end(), b.begin(), 0) + c > 0) {
ans++;
}
}
cout << ans << endl;
return 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 = 0; j < m; j++) {
cin >> b[j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
if (inner_product(a.begin(), a.end(), b.begin(), 0) + c > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
sum += A[i][j] * B[j];
}
if (sum > 0)
++cnt;
}
cout << cnt << endl;
}
signed main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
long long C;
scanf("%lld", &C);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &B[i]);
}
std::vector<std::vector<long long>> A(N, std::vector<long long>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%lld", &A[i][j]);
}
}
solve(N, M, C, std::move(B), std::move(A));
return 0;
} | #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;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
++cnt;
}
cout << cnt << endl;
}
signed main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
long long C;
scanf("%lld", &C);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &B[i]);
}
std::vector<std::vector<long long>> A(N, std::vector<long long>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%lld", &A[i][j]);
}
}
solve(N, M, C, std::move(B), std::move(A));
return 0;
} | [
"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 >> n >> c;
int b[m];
int a[n][m];
REP(i, m) cin >> b[i];
REP(i, n) { REP(j, m) cin >> a[i][j]; }
REP(i, n) {
int tmp = 0;
REP(j, m) tmp += a[i][j] * b[j];
if (tmp + c > 0)
count += 1;
}
cout << count << "\n";
} | #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 >> m >> c;
int b[m];
int a[n][m];
REP(i, m) cin >> b[i];
REP(i, n) { REP(j, m) cin >> a[i][j]; }
REP(i, n) {
int tmp = 0;
REP(j, m) tmp += a[i][j] * b[j];
if (tmp + c > 0)
count += 1;
}
cout << count << "\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++) {
for (int j = 0; j < M; j++) {
res += A[i][j] * B[j];
}
res += C;
if (res > 0) {
ans++;
}
}
cout << ans << endl;
} | #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) {
for (int j = 0; j < M; j++) {
res += A[i][j] * B[j];
}
res += C;
if (res > 0) {
ans++;
}
}
cout << ans << endl;
} | [
"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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
if (sum + C > 0)
ans++;
}
}
cout << ans << endl;
} | #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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
} | [] | 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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
if (sum + C > 0)
ans++;
}
}
cout << ans << endl;
} | #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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
} | [
"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 num, total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| #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 num, total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| [
"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 num;
long total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| #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 num, total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| [
"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 num, total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| #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 num, total;
for (int i = 0; i < n; i++) {
total = 0;
for (int j = 0; j < m; j++) {
total += a[i][j] * b[j];
}
total += c;
if (total > 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
| [
"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];
for (int i = 1; i <= N; i++) {
int t = 0;
for (int j = 1; j <= M; j++)
t += A[i][j] * B[j];
t += C;
if (t > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #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];
for (int i = 1; i <= N; i++) {
int t = 0;
for (int j = 1; j <= M; j++)
t += A[i][j] * B[j];
t += C;
if (t > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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++) {
cin >> data.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
sum = 0;
for (int j = 0; j < M; j++) {
//毎回計算する
//ここにsum入れるとi=0,j=1のsumとi=0,j=2のsumが分かれちゃうよ
sum += B.at(j) * data.at(i).at(j);
//ここにsum +=
//C;おくと毎ループ足されてM*C足されてしまうので1回だけ行う判定で
if (sum + C > 0) {
count++;
}
}
}
cout << count << endl;
}
| #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++) {
cin >> data.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
sum = 0;
for (int j = 0; j < M; j++) {
//毎回計算する
//ここにsum入れるとi=0,j=1のsumとi=0,j=2のsumが分かれちゃうよ
sum += B.at(j) * data.at(i).at(j);
//ここにsum +=
//C;おくと毎ループ足されてM*C足されてしまうので1回だけ行う判定で
//ここにif入れると1個目の要素かけるだけで判断しちゃうよ
}
//各項足してからc足す
if (sum + C > 0) {
count++;
}
}
cout << count << endl;
}
| [] | 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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
puts(""); \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};//RDLU
#define yes puts("YES")
#define no puts("NO")
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vvi in(n + 1, vi(m));
rep(i, n + 1) rep(j, m) cin >> in[i][j];
int co = 0;
rep(i, n) {
int s = -c;
rep(j, m) s += in[0][j] * in[i + 1][j];
if (s > 0)
co++;
}
cout << co << endl;
}
| // 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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
puts(""); \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};//RDLU
#define yes puts("YES")
#define no puts("NO")
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vvi in(n + 1, vi(m));
rep(i, n + 1) rep(j, m) cin >> in[i][j];
int co = 0;
rep(i, n) {
int s = c;
rep(j, m) s += in[0][j] * in[i + 1][j];
if (s > 0)
co++;
}
cout << co << endl;
}
| [
"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];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #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];
}
if (sum + c > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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;
cin >> n >> m >> c;
int b[m];
rep(i, m) { cin >> b[i]; }
int ans = 0;
int sum = 0;
int a[n][m];
rep(j, n) {
rep(k, m) { cin >> a[j][k]; }
}
rep(p, n) {
rep(l, m) { sum += a[p][l] * b[l]; }
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans;
return 0;
} | #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;
cin >> n >> m >> c;
int b[m];
rep(i, m) { cin >> b[i]; }
int ans = 0;
int sum = 0;
int a[n][m];
rep(j, n) {
rep(k, m) { cin >> a[j][k]; }
}
rep(p, n) {
sum = 0;
rep(l, m) { sum += a[p][l] * b[l]; }
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans;
return 0;
} | [
"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);
}
cal = C;
for (int j = 1; j <= M; j++) {
C += A.at(j) * B.at(j);
}
if (cal > 0) {
count++;
}
}
cout << count << endl;
} | #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);
}
cal = C;
for (int j = 1; j <= M; j++) {
cal += A.at(j) * B.at(j);
}
if (cal > 0) {
count++;
}
}
cout << count << endl;
} | [
"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);
}
cal = C;
for (int j = 1; j <= M; j++) {
C += A.at(j) * B.at(j);
}
if (C > 0) {
count++;
}
}
cout << count << endl;
} | #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);
}
cal = C;
for (int j = 1; j <= M; j++) {
cal += A.at(j) * B.at(j);
}
if (cal > 0) {
count++;
}
}
cout << count << endl;
} | [
"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.front().size(); j++) {
cin >> A[i][j];
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][0] * B[j];
}
sum += C;
if (sum > 0) {
count += 1;
}
}
cout << count;
} | #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.front().size(); j++) {
cin >> A[i][j];
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
sum += C;
if (sum > 0) {
count += 1;
}
}
cout << count;
} | [
"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 (int j = 0; j < N; j++) {
int wa = 0;
for (int m = 0; m < M; m++) {
wa += A[j][m];
}
wa += C;
if (wa > 0) {
kosu += 1;
}
}
cout << kosu;
return 0;
}
| #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 (int j = 0; j < N; j++) {
int wa = 0;
for (int m = 0; m < M; m++) {
wa += A[j][m] * B[m];
}
wa += C;
if (wa > 0) {
kosu += 1;
}
}
cout << kosu;
return 0;
}
| [
"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) {
if (!b)
return a;
return gcd(b, a % b);
}
signed main() {
ll n, m, c, a, cnt = 0, memo = 0;
cin >> n >> m >> c;
ll b[n] = {0};
rep(i, 0, m) cin >> b[i];
rep(i, 0, n) {
memo = 0;
rep(j, 0, m) {
cin >> a;
memo += a * b[j];
}
if (memo + c > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | #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) {
if (!b)
return a;
return gcd(b, a % b);
}
signed main() {
ll n, m, c, a, cnt = 0, memo = 0;
cin >> n >> m >> c;
ll b[m] = {0};
rep(i, 0, m) cin >> b[i];
rep(i, 0, n) {
memo = 0;
rep(j, 0, m) {
cin >> a;
memo += a * b[j];
}
if (memo + c > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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) {
if (!b)
return a;
return gcd(b, a % b);
}
signed main() {
ll n, m, c, a, cnt = 0, memo = 0;
cin >> n >> m >> c;
ll b[n] = {0};
rep(i, 0, m) cin >> b[i];
rep(i, 0, n) {
memo = 0;
rep(j, 0, m) {
cin >> a;
memo += a * b[j];
}
if (memo > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | #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) {
if (!b)
return a;
return gcd(b, a % b);
}
signed main() {
ll n, m, c, a, cnt = 0, memo = 0;
cin >> n >> m >> c;
ll b[m] = {0};
rep(i, 0, m) cin >> b[i];
rep(i, 0, n) {
memo = 0;
rep(j, 0, m) {
cin >> a;
memo += a * b[j];
}
if (memo + c > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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;
if (ans > 0)
++count;
}
cout << count << endl;
return 0;
} | #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;
if (ans > 0)
++count;
ans = 0;
}
cout << count << endl;
return 0;
} | [
"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 < m; j++) {
ans += pre[0][j] * pre[i][j];
}
if (ans + k > 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #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 = 0; j < m; j++) {
ans += pre[0][j] * pre[i][j];
}
if (ans + k > 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"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 < M; j++) {
cin >> tmp;
A[i].push_back(tmp);
}
}
for (int i = 0; i < N; i++) {
tmp_score = 0;
for (int j = 0; j < N; j++) {
tmp_score += B[j] * A[i][j];
}
tmp_score += C;
if (tmp_score > 0)
count++;
}
cout << count;
} | #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 < M; j++) {
cin >> tmp;
A[i].push_back(tmp);
}
}
for (int i = 0; i < N; i++) {
tmp_score = 0;
for (int j = 0; j < M; j++) {
tmp_score += B[j] * A[i][j];
}
tmp_score += C;
if (tmp_score > 0)
count++;
}
cout << count;
} | [
"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; i < n; i++) {
for (int j = 0; j < m; j++) {
sum += b[j] * a[i][j];
}
sum += c;
if (sum > 0)
ans++;
}
cout << ans << endl;
return 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; i < n; i++) {
for (int j = 0; j < m; j++) {
sum += b[j] * a[i][j];
}
sum += c;
if (sum > 0)
ans++;
sum = 0;
}
cout << ans << endl;
return 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<int>> A(M, A_i_row);
int counter = 0;
for (int i = 0; i < A.size(); i++) {
int judge = C;
for (int j = 0; j < A[i].size(); j++) {
int a = 0;
std::cin >> a;
A[i][j] = a;
judge += a * B[j];
}
if (judge > 0) {
counter += 1;
}
}
std::cout << counter << std::endl;
return 0;
} | #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<int>> A(N, A_i_row);
int counter = 0;
for (int i = 0; i < A.size(); i++) {
int judge = C;
for (int j = 0; j < A[i].size(); j++) {
int a = 0;
std::cin >> a;
A[i][j] = a;
judge += a * B[j];
}
if (judge > 0) {
counter += 1;
}
}
std::cout << counter << std::endl;
return 0;
} | [
"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;
}
if (sum + C > 0) {
count++;
}
}
cout << count << endl;
}
| #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;
}
if (sum + C > 0) {
count++;
}
}
cout << count << endl;
}
| [
"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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans = 0, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(j, M) {
cin >> A;
temp += A * B[i];
}
temp += C;
if (temp > 0)
ans++;
}
out(ans);
}
| #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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans = 0, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(j, M) {
cin >> A;
temp += A * B[j];
}
temp += C;
if (temp > 0)
ans++;
}
out(ans);
}
| [
"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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans = 0, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(j, M) {
cin >> A;
temp += A * B[i];
}
temp += C;
if (temp)
ans++;
}
out(ans);
}
| #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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans = 0, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(j, M) {
cin >> A;
temp += A * B[j];
}
temp += C;
if (temp > 0)
ans++;
}
out(ans);
}
| [
"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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(i, M) {
cin >> A;
temp += A * B[i];
}
temp += C;
if (temp)
ans++;
}
out(ans);
}
| #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 (int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl
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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, M, C, ans = 0, temp, A;
int main() {
cin >> N >> M >> C;
int B[M];
rep(i, M) { cin >> B[i]; }
rep(i, N) {
temp = 0;
rep(j, M) {
cin >> A;
temp += A * B[j];
}
temp += C;
if (temp > 0)
ans++;
}
out(ans);
}
| [
"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;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
int main() {
int n, m, c;
vector<int> b;
vector<vector<int>> a;
cin >> n >> m >> c;
each(i, m) {
int tmp;
cin >> tmp;
b.push(tmp);
}
auto result = 0;
each(i, n) {
vector<int> ttt;
auto r = 0;
each(j, m) {
int tmp;
cin >> tmp;
r += tmp * b[j];
}
if ((r - c) <= 0) {
} else {
result++;
}
}
cout << result << endl;
return 0;
} | #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;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
int main() {
int n, m, c;
vector<int> b;
vector<vector<int>> a;
cin >> n >> m >> c;
each(i, m) {
int tmp;
cin >> tmp;
b.push(tmp);
}
auto result = 0;
each(i, n) {
vector<int> ttt;
auto r = 0;
each(j, m) {
int tmp;
cin >> tmp;
r += tmp * b[j];
}
if ((r + c) <= 0) {
} else {
result++;
}
}
cout << result << endl;
return 0;
}
| [
"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++) {
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
}
ans = 0;
for (int i = 1; i <= n; i++) {
tmp = 0;
for (int j = 1; j <= m; j++)
tmp += b[j] * a[i][j]; // printf("b[%d] = %d,a[%d][%d] = %d,tmp =
// %d\n",j,b[j],i,j,a[i][j],tmp);
tmp += c;
if (tmp > 0) {
// printf("tmp= %d\n",tmp);
ans = i;
break;
}
}
printf("%d\n", ans);
return 0;
}
| #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++) {
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
}
ans = 0;
for (int i = 1; i <= n; i++) {
tmp = 0;
for (int j = 1; j <= m; j++)
tmp += b[j] * a[i][j]; // printf("b[%d] = %d,a[%d][%d] = %d,tmp =
// %d\n",j,b[j],i,j,a[i][j],tmp);
tmp += c;
if (tmp > 0) {
// printf("tmp= %d\n",tmp);
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| [
"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; i < n; ++i) {
// mat.push_back(new vector<int>);
for (int j = 0; j < m; ++j) {
cin >> tmp;
sum += tmp * b[j];
}
sum += c;
if (sum > 0)
res++;
}
cout << res << endl;
return 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; i < n; ++i) {
// mat.push_back(new vector<int>);
for (int j = 0; j < m; ++j) {
cin >> tmp;
sum += tmp * b[j];
}
sum += c;
if (sum > 0)
res++;
sum = 0;
}
cout << res << endl;
return 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 <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
//------------------------------------------
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
//------------------------------------------
// comparison
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
#define C_ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
//------------------------------------------
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, arr) \
for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define B_SEARCH(arr, v) binary_search((arr).begin(), (arr).end(), v)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) \
rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c) \
rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define SUMS(arr) accumulate((arr).begin(), (arr).end(), string())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define OF_ALL(arr, func) all_of((arr).begin(), (arr).end(), (func))
#define OF_NONE(arr, func) none_of((arr).begin(), (arr).end(), (func))
#define OF_ANY(arr, func) any_of((arr).begin(), (arr).end(), (func))
#define PB push_back
#define MP make_pair
//------------------------------------------
// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data) \
std::cout << std::fixed << std::setprecision(n) << (data) << "\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) \
{ \
std::cerr << #v << "\t:"; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOW_MAP(v) \
{ \
std::cerr << #v << endl; \
for (const auto &xxx : v) { \
std::cerr << xxx.first << " " << xxx.second << "\n"; \
} \
}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
//------------------------------------------
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))
#define FORITER(x, arr) for (auto(x) = (arr).begin(); (x) != (arr).end(); ++(x))
//**************************************
//最大公約数
//**************************************
template <class T> inline T GCD(const T x, const T y) {
if (x < 0)
return GCD(-x, y);
if (y < 0)
return GCD(x, -y);
return (!y) ? x : GCD(y, x % y);
}
//**************************************
// nの約数
//**************************************
template <typename T> vector<T> DIVISOR(T n) {
vector<T> v;
for (LL i = 1; i * i <= n; ++i) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//------------------------------------------
// global
//------------------------------------------
// int A = 0;
VI A[20];
// int B = 0;
VI B;
int C = 0;
int N = 0;
int M = 0;
int K = 0;
int H = 0;
int W = 0;
int h = 0;
int w = 0;
// char S[10000];
string S;
int num[30] = {0};
VD x;
VS u;
VI ret;
VPII Pair;
LL i, j, k = 0;
LL ans, ans1, ans2 = 0;
/*
std::string str[3];
int h[100] = {0};
int h_size = 0;
int MinCount = 0;
LL i,j,k = 0;
LL ans1,ans2 = 0;
VLL A;
LL K;
LL K_pow = 0;
LL K_num = 1;
LL tmp = 0;
*/
//------------------------------------------
// read
//------------------------------------------
void read(void) {
cin >> N >> M >> C;
B.resize(M);
REP(i, M) { cin >> B[i]; }
REP(i, N) {
A[i].resize(M);
REP(j, M) { cin >> A[i][j]; }
}
}
int main() {
int sum = 0;
int ret = 0;
// 初期化
INIT();
// 読込み
read();
REP(i, N) {
REP(j, M) { sum += A[i][j] * B[j]; }
if (sum + C > 0) {
ret++;
sum = 0;
}
}
printf("%d\n", ret);
return 0;
} | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
//------------------------------------------
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
//------------------------------------------
// comparison
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
#define C_ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
//------------------------------------------
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, arr) \
for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define B_SEARCH(arr, v) binary_search((arr).begin(), (arr).end(), v)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) \
rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c) \
rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define SUMS(arr) accumulate((arr).begin(), (arr).end(), string())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define OF_ALL(arr, func) all_of((arr).begin(), (arr).end(), (func))
#define OF_NONE(arr, func) none_of((arr).begin(), (arr).end(), (func))
#define OF_ANY(arr, func) any_of((arr).begin(), (arr).end(), (func))
#define PB push_back
#define MP make_pair
//------------------------------------------
// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data) \
std::cout << std::fixed << std::setprecision(n) << (data) << "\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) \
{ \
std::cerr << #v << "\t:"; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOW_MAP(v) \
{ \
std::cerr << #v << endl; \
for (const auto &xxx : v) { \
std::cerr << xxx.first << " " << xxx.second << "\n"; \
} \
}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
//------------------------------------------
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))
#define FORITER(x, arr) for (auto(x) = (arr).begin(); (x) != (arr).end(); ++(x))
//**************************************
//最大公約数
//**************************************
template <class T> inline T GCD(const T x, const T y) {
if (x < 0)
return GCD(-x, y);
if (y < 0)
return GCD(x, -y);
return (!y) ? x : GCD(y, x % y);
}
//**************************************
// nの約数
//**************************************
template <typename T> vector<T> DIVISOR(T n) {
vector<T> v;
for (LL i = 1; i * i <= n; ++i) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//------------------------------------------
// global
//------------------------------------------
// int A = 0;
VI A[20];
// int B = 0;
VI B;
int C = 0;
int N = 0;
int M = 0;
int K = 0;
int H = 0;
int W = 0;
int h = 0;
int w = 0;
// char S[10000];
string S;
int num[30] = {0};
VD x;
VS u;
VI ret;
VPII Pair;
LL i, j, k = 0;
LL ans, ans1, ans2 = 0;
/*
std::string str[3];
int h[100] = {0};
int h_size = 0;
int MinCount = 0;
LL i,j,k = 0;
LL ans1,ans2 = 0;
VLL A;
LL K;
LL K_pow = 0;
LL K_num = 1;
LL tmp = 0;
*/
//------------------------------------------
// read
//------------------------------------------
void read(void) {
cin >> N >> M >> C;
B.resize(M);
REP(i, M) { cin >> B[i]; }
REP(i, N) {
A[i].resize(M);
REP(j, M) { cin >> A[i][j]; }
}
}
int main() {
int sum = 0;
int ret = 0;
// 初期化
INIT();
// 読込み
read();
REP(i, N) {
REP(j, M) { sum += (A[i][j] * B[j]); }
if ((sum + C) > 0) {
ret++;
}
sum = 0;
}
printf("%d\n", ret);
return 0;
}
| [
"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;
cin >> N >> M >> C;
int B[N];
int A[N][M];
rep(i, M) cin >> B[i];
rep(i, N) rep(j, M) cin >> A[i][j];
int ans = 0;
rep(i, N) {
int sum = 0;
rep(j, M) { sum += A[i][j] * B[i]; }
if (sum + C > 0)
ans++;
}
cout << ans << endl;
} | #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;
cin >> N >> M >> C;
int B[M];
int A[N][M];
rep(i, M) cin >> B[i];
rep(i, N) rep(j, M) cin >> A[i][j];
int ans = 0;
rep(i, N) {
int sum = 0;
rep(j, M) { sum += A[i][j] * B[j]; }
if (sum + C > 0)
ans++;
}
cout << ans << endl;
} | [
"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++) {
int res = 0;
for (int j = 0; j < m; j++)
res += a[i][j] * b[j];
if (res + c > 0)
ans++;
}
printf("%d\n", ans);
}
| #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; i++) {
int res = 0;
for (int j = 0; j < m; j++)
res += a[i][j] * b[j];
if (res + c > 0)
ans++;
}
printf("%d\n", ans);
}
| [
"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 + C > 0) {
count++;
}
}
cout << count << endl;
} | #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 + C > 0) {
count++;
}
Ccheck = 0;
}
cout << count << endl;
} | [
"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 + C == 0) {
count++;
}
}
cout << count << endl;
} | #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 + C > 0) {
count++;
}
Ccheck = 0;
}
cout << count << endl;
} | [
"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 * b[j];
}
if (pro + c > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| #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];
}
if (pro + c > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| [] | 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 * b[i];
}
if (pro + c > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| #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];
}
if (pro + c > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"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 j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= m; j++)
sum += b[j] * a[i][j];
if (sum > 0)
ans++;
}
cout << ans << endl;
} | #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 j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= m; j++)
sum += b[j] * a[i][j];
sum += c;
if (sum > 0)
ans++;
}
cout << ans << endl;
} | [
"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 = 0;
for (int j = 0; j < M; j++) {
y += A[i][j] * B[j];
}
if (y + C > 0) {
x++;
}
}
cout << x << endl;
} | #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 = 0;
for (int j = 0; j < M; j++) {
y += A[i][j] * B[j];
}
if (y + C > 0) {
x++;
}
}
cout << x << endl;
} | [
"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 \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define fast2 \
freopen("myfile.in", "r", stdin); \
freopen("myfile.out", "w", stdout);
#define mod 1000000007
#define fs(x, y) \
for (int i = 1; i <= y; i++) \
cin >> x[i];
#define fo(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
ll n, m, ar[25][25], b[25], sum, top, c;
int main() {
fast;
cin >> n >> m >> c;
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
top = 0;
int tmp;
for (int j = 1; j <= m; j++)
cin >> tmp, top += b[j] * tmp;
if (top + c > 0)
sum++;
}
cout << sum;
} | #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 \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define fast2 \
freopen("myfile.in", "r", stdin); \
freopen("myfile.out", "w", stdout);
#define mod 1000000007
#define fs(x, y) \
for (int i = 1; i <= y; i++) \
cin >> x[i];
#define fo(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
ll n, m, ar[25][25], b[25], sum, top, c;
int main() {
fast;
cin >> n >> m >> c;
for (int i = 1; i <= m; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
top = 0;
int tmp;
for (int j = 1; j <= m; j++)
cin >> tmp, top += b[j] * tmp;
if (top + c > 0)
sum++;
}
cout << sum;
} | [
"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];
}
}
int sum = 0, count = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
if (sum + c > 0)
count++;
sum = 0;
}
cout << sum;
return 0;
}
| #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];
}
}
int sum = 0, count = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
if (sum + c > 0)
count++;
sum = 0;
}
cout << count;
return 0;
}
| [
"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++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = 0, cur;
for (int j = 0; j < m; j++) {
cin >> cur;
tmp += b[i] * cur;
}
tmp += c;
if (tmp > 0)
ans++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | #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++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = 0, cur;
for (int j = 0; j < m; j++) {
cin >> cur;
tmp += b[j] * cur;
}
tmp += c;
if (tmp > 0)
ans++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | [
"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 < M; j++) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
sum += (A[i][j] * B[j]);
}
if (sum > 0)
ans++;
}
cout << ans << endl;
}
| #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 = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
sum += (A[i][j] * B[j]);
}
if (sum > 0)
ans++;
}
cout << ans << endl;
}
| [
"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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
int main(void) {
int n, m, c, b[20], a[20][20];
int k = 0;
cin >> n >> m >> c;
rep(i, m) cin >> b[i];
rep(i, n) {
int ans = 0;
rep(j, m) {
cin >> a[i][j];
ans += a[i][j] * b[j];
}
if (ans > 0)
k++;
}
cout << k << endl;
return 0;
}
| #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 &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
int main(void) {
int n, m, c, b[20], a[20][20];
int k = 0;
cin >> n >> m >> c;
rep(i, m) cin >> b[i];
rep(i, n) {
int ans = 0;
rep(j, m) {
cin >> a[i][j];
ans += a[i][j] * b[j];
}
if (ans + c > 0)
k++;
}
cout << k << endl;
return 0;
}
| [
"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 <unordered_map>
#include <vector>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define POWER9 1000000000
#define MOD POWER9 + 7
#define PI 3.14159265359
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
int N, M, C;
cin >> N >> M >> C;
int B[20];
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[i];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
}
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/ | #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 <unordered_map>
#include <vector>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define POWER9 1000000000
#define MOD POWER9 + 7
#define PI 3.14159265359
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
int N, M, C;
cin >> N >> M >> C;
int B[20];
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 (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
}
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/ | [
"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];
sum[i] += A[i][j] * B[i];
}
}
int count = 0;
for (int k = 0; k < N; k++) {
if (sum[k] > 0)
count++;
}
cout << count << endl;
return 0;
} | // 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];
sum[i] += A[i][j] * B[j];
}
}
int count = 0;
for (int k = 0; k < N; k++) {
if (sum[k] > 0)
count++;
}
cout << count << endl;
return 0;
} | [
"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_back
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define mp make_pair
#define rev reverse
#define dans dump(ans)
#define MOD 1000000007
#define amp(v, n) (v).count(n) ? v[n]++ : v[n] = 1
#define sysp system("pause")
#define PI acos(-1)
#define pf push_front
#define ins insert
//{
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class... A> inline void dump() { cout << endl; }
template <class... A> inline void dump_rest() { cout << endl; }
template <class T, class... A>
inline void dump_rest(const T &first, const A &...rest) {
cout << dump_interval << first;
dump_rest(rest...);
}
template <class T, class... A>
inline void dump(const T &first, const A &...rest) {
cout << first;
dump_rest(rest...);
}
template <class... A> inline void debug() { cerr << endl; }
template <class... A> inline void debug_rest() { cerr << endl; }
template <class T, class... A>
inline void debug_rest(const T &first, const A &...rest) {
cerr << debug_interval << first;
debug_rest(rest...);
}
template <class T, class... A>
inline void debug(const T &first, const A &...rest) {
if (debug_toggle)
cerr << first, debug_rest(rest...);
}
unsigned XorShift(void) {
static unsigned x = 123456789;
static unsigned y = 362436069;
static unsigned z = 521288629;
static unsigned w = 88675123;
unsigned t;
t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
//}
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <int m> class mint {
private:
int i;
public:
mint() : i(0) {}
mint(int i) : i((i % m + m) % m) {}
mint operator+(const mint &o) { return o.i + i; }
mint operator*(const mint &o) { return o.i * i; }
mint operator-() { return -i; }
operator int() { return i; }
};
//}
int n, m, c, ans;
main() {
cin >> n >> m >> c;
int b[m], a[n][m];
rep(i, m) cin >> b[i];
rep(i, n) rep(j, m) cin >> a[i][j];
rep(i, n) {
int t = 0;
rep(j, m) { t += a[i][j] * b[i]; }
t += c;
if (t > 0)
ans++;
}
dans;
} | #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_back
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define mp make_pair
#define rev reverse
#define dans dump(ans)
#define MOD 1000000007
#define amp(v, n) (v).count(n) ? v[n]++ : v[n] = 1
#define sysp system("pause")
#define PI acos(-1)
#define pf push_front
#define ins insert
//{
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class... A> inline void dump() { cout << endl; }
template <class... A> inline void dump_rest() { cout << endl; }
template <class T, class... A>
inline void dump_rest(const T &first, const A &...rest) {
cout << dump_interval << first;
dump_rest(rest...);
}
template <class T, class... A>
inline void dump(const T &first, const A &...rest) {
cout << first;
dump_rest(rest...);
}
template <class... A> inline void debug() { cerr << endl; }
template <class... A> inline void debug_rest() { cerr << endl; }
template <class T, class... A>
inline void debug_rest(const T &first, const A &...rest) {
cerr << debug_interval << first;
debug_rest(rest...);
}
template <class T, class... A>
inline void debug(const T &first, const A &...rest) {
if (debug_toggle)
cerr << first, debug_rest(rest...);
}
unsigned XorShift(void) {
static unsigned x = 123456789;
static unsigned y = 362436069;
static unsigned z = 521288629;
static unsigned w = 88675123;
unsigned t;
t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
//}
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <int m> class mint {
private:
int i;
public:
mint() : i(0) {}
mint(int i) : i((i % m + m) % m) {}
mint operator+(const mint &o) { return o.i + i; }
mint operator*(const mint &o) { return o.i * i; }
mint operator-() { return -i; }
operator int() { return i; }
};
//}
int n, m, c, ans;
main() {
cin >> n >> m >> c;
int b[m], a[n][m];
rep(i, m) cin >> b[i];
rep(i, n) rep(j, m) cin >> a[i][j];
rep(i, n) {
int t = 0;
rep(j, m) { t += a[i][j] * b[j]; }
t += c;
if (t > 0)
ans++;
}
dans;
} | [
"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++) {
cin >> a;
sum += a * B[j];
}
if (sum > 0)
res++;
}
cout << res << endl;
return 0;
} | #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++) {
cin >> a;
sum += a * B[j];
}
if (sum > 0)
res++;
}
cout << res << endl;
return 0;
} | [] | 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 (int i = 0; i < N; i++) {
std::vector<int> A(M);
for (int j = 0; j < N; j++)
cin >> A[j];
int k = 0;
for (int j = 0; j < N; j++)
k += A[j] * B[j];
if (k + C > 0)
ans++;
}
cout << ans << endl;
}
| #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 (int i = 0; i < N; i++) {
std::vector<int> A(M);
for (int j = 0; j < M; j++)
cin >> A[j];
int k = 0;
for (int j = 0; j < M; j++)
k += A[j] * B[j];
if (k + C > 0)
ans++;
}
cout << ans << endl;
}
| [
"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 sout;
sout << x;
return sout.str();
}
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x : (c))
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(c) (c).begin(), (c).end()
#define REVERSE(c) reverse(ALL(c))
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define STABLE_SORT(c) stable_sort(ALL(c))
#define STABLE_RSORT(c) stable_sort((c).rbegin(), (c).rend())
#define UNIQUE(c) \
SORT(c); \
(c).erase(unique(ALL(c)), (c).end());
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double INF = 1e7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define dump(x) cerr << #x << " = " << (x) << endl;
int main() {
LL N, M, C;
cin >> N >> M >> C;
VI B(M);
REP(i, M) { cin >> B[i]; }
VVI A(N);
REP(i, M) { A[i].resize(M); }
REP(i, N) {
REP(j, M) { cin >> A[i][j]; }
}
LL count = 0;
REP(i, N) {
LL sum = C;
REP(j, M) { sum += A[i][j] * B[j]; }
if (sum > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| #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 sout;
sout << x;
return sout.str();
}
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x : (c))
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(c) (c).begin(), (c).end()
#define REVERSE(c) reverse(ALL(c))
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define STABLE_SORT(c) stable_sort(ALL(c))
#define STABLE_RSORT(c) stable_sort((c).rbegin(), (c).rend())
#define UNIQUE(c) \
SORT(c); \
(c).erase(unique(ALL(c)), (c).end());
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double INF = 1e7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define dump(x) cerr << #x << " = " << (x) << endl;
int main() {
LL N, M, C;
cin >> N >> M >> C;
VI B(M);
REP(i, M) { cin >> B[i]; }
VVI A(N);
REP(i, N) { A[i].resize(M); }
REP(i, N) {
REP(j, M) { cin >> A[i][j]; }
}
LL count = 0;
REP(i, N) {
LL sum = C;
REP(j, M) { sum += A[i][j] * B[j]; }
if (sum > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| [] | 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++;
}
cout << cnt << endl;
} | #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++;
}
cout << cnt << endl;
} | [
"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];
sum += a[i] * b[i];
}
if (sum > 0)
count++;
}
delete a;
delete b;
cout << count;
return 0;
} | #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];
sum += a[j] * b[j];
}
if (sum > 0)
count++;
}
delete a;
delete b;
cout << count;
return 0;
} | [
"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];
sum += a[i] * b[i];
}
if (sum >= 0)
count++;
}
delete a;
delete b;
cout << sum;
return 0;
} | #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];
sum += a[j] * b[j];
}
if (sum > 0)
count++;
}
delete a;
delete b;
cout << count;
return 0;
} | [
"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 (sum)
ans++;
}
cout << ans << endl;
return 0;
} | #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 (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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];
}
}
for (int i = 0; i < N; i++) {
int tmp = 0;
for (int j = 0; j < M; j++) {
tmp += A[i][j] * B[j];
// printf("%d\n", tmp);
if (tmp + C > 0)
cnt++;
}
}
// printf("%d\n", s);
cout << cnt << endl;
return 0;
} | #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];
}
}
for (int i = 0; i < N; i++) {
int tmp = 0;
for (int j = 0; j < M; j++) {
tmp += A[i][j] * B[j];
// printf("%d\n", tmp);
}
if (tmp + C > 0)
cnt++;
}
// printf("%d\n", s);
cout << cnt << endl;
return 0;
} | [] | 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;
sum += temp * b[z];
}
sum += c;
if (sum >= 0) {
ans += 1;
}
}
cout << ans;
return 0;
} | #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;
sum += temp * b[z];
}
sum += c;
if (sum > 0) {
ans += 1;
}
}
cout << ans;
return 0;
} | [
"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 = 0; j < M; ++j)
sum += A[i][j] * B[j];
if (sum > -C)
++res;
}
cout << res;
return 0;
} | #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 = 0; j < M; ++j)
sum += A[i][j] * B[j];
if (sum > -C)
++res;
}
cout << res;
return 0;
} | [
"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 <vector>
using namespace std;
const int MAX_N = 100;
const int MAX_M = 100;
int N;
int M;
int C;
int A[MAX_N][MAX_M];
int B[MAX_M];
void solve() {
int res = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
sum += B[j] * A[i][j];
}
if (sum > -C)
res++;
}
cout << res << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
cin >> M;
cin >> 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];
}
}
solve();
} | #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 <vector>
using namespace std;
const int MAX_N = 100;
const int MAX_M = 100;
int N;
int M;
int C;
int A[MAX_N][MAX_M];
int B[MAX_M];
void solve() {
int res = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
sum += B[j] * A[i][j];
}
if (sum > -C)
res++;
sum = 0;
}
cout << res << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
cin >> M;
cin >> 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];
}
}
solve();
} | [
"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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum = A[i][j] * B[j];
}
sum += C;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
}
| #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];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
sum += C;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
}
| [
"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];
if (d + c > 0) {
f += 1;
}
}
}
cout << f << endl;
return 0;
} | #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];
}
if (d + c > 0) {
f += 1;
}
d = 0;
}
cout << f << endl;
return 0;
} | [
"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 += (sum + c > 0);
}
cout << ans << endl;
} | #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 += (sum + c > 0);
}
cout << ans << endl;
}
| [] | 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;
for (int j = 0; j < M; j++) {
cin >> A;
sum += A * B.at(i);
}
if (sum > 0) {
cnt++;
}
}
cout << cnt;
}
| #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;
for (int j = 0; j < M; j++) {
cin >> A;
sum += A * B.at(j);
}
if (sum > 0) {
cnt++;
}
}
cout << cnt;
}
| [
"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++) {
for (j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
}
if (sum + C > 0) {
total += 1;
}
}
cout << total;
return 0;
} | #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++) {
for (j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
}
if (sum + C > 0) {
total += 1;
}
sum = 0;
}
cout << total;
return 0;
} | [
"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++) {
for (j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
}
if (sum + C <= 0) {
total += 1;
}
}
cout << total;
return 0;
} | #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++) {
for (j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
}
if (sum + C > 0) {
total += 1;
}
sum = 0;
}
cout << total;
return 0;
} | [
"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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += (a * b[j]);
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [] | 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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [] | 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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += (a * b[j]);
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [
"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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [
"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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += (a * b[j]);
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [
"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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(n);
rep(i, 0, m) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | #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;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n, m, c;
cin >> n >> m >> c;
vector<ll> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int tmp = c;
rep(j, 0, m) {
ll a;
cin >> a;
tmp += a * b[j];
}
if (tmp > 0)
ans++;
}
cout << ans << endl;
} | [
"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++) {
std::cin >> A;
sum += A * s[j] + C;
}
if (sum > 0) {
count = count + 1;
}
}
std::cout << count << std::endl;
return 0;
} | #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++) {
std::cin >> A;
sum += A * s[j];
}
if (sum + C > 0) {
count = count + 1;
}
}
std::cout << count << std::endl;
return 0;
} | [
"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++) {
cin >> a[i];
ans += a[i] * b[i];
// cout<<a[i]<<" "<<b[i]<<endl;
}
ans += c;
if (ans > 0)
cnt++;
// cout<<ans<<endl;
d++;
}
cout << cnt << endl;
return 0;
}
| #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++) {
cin >> a[i];
ans += a[i] * b[i];
// cout<<a[i]<<" "<<b[i]<<endl;
}
ans += c;
if (ans > 0)
cnt++;
// cout<<ans<<endl;
d++;
}
cout << cnt << endl;
return 0;
} | [
"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];
}
if (S > 0)
s = s + 1;
}
cout << s;
return 0;
} | #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];
}
if (S > 0)
s = s + 1;
}
cout << s;
return 0;
}
| [
"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 (S > 0)
s = s + 1;
i++;
}
cout << s;
return 0;
}
| #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 (S > 0)
s = s + 1;
i++;
}
cout << s;
return 0;
}
| [
"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;
A[i][j] = AM;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
result += A[i][j] * B[j];
}
if (result + C > 0) {
times += 1;
}
}
cout << times << endl;
}
| #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;
A[i][j] = AM;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
result += A[i][j] * B[j];
}
if (result + C > 0) {
times += 1;
}
result = 0;
}
cout << times << endl;
}
| [
"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;
A[i][j] = AM;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
result += A[i][j] * B[j];
}
if (result + C > 0) {
times += 1;
}
}
cout << times << endl;
} | #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;
A[i][j] = AM;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
result += A[i][j] * B[j];
}
if (result + C > 0) {
times += 1;
}
result = 0;
}
cout << times << endl;
}
| [
"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++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
AB = 0;
for (int j = 0; j < M; j++) {
AB += A.at(i).at(j) * 10;
}
if (AB + C > 0) {
Ans += 1;
}
}
cout << Ans << endl;
} | #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++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
AB = 0;
for (int j = 0; j < M; j++) {
AB += A.at(i).at(j) * B.at(j);
}
if (AB + C > 0) {
Ans += 1;
}
}
cout << Ans << endl;
} | [
"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++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
AB = 0;
for (int j = 0; j < M; j++) {
AB += A.at(i).at(j) * B.at(j);
}
if (AB + C > 0) {
Ans += 1;
}
}
cout << Ans << endl;
} | #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++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
AB = 0;
for (int j = 0; j < M; j++) {
AB += A.at(i).at(j) * B.at(j);
}
if (AB + C > 0) {
Ans += 1;
}
}
cout << Ans << endl;
} | [] | 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 >> A[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sum += A[i][j] * B[j];
}
sum += c;
if (sum > 0)
num++;
}
cout << num << endl;
} | #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 >> A[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sum += A[i][j] * B[j];
}
sum += c;
if (sum > 0)
num++;
sum = 0;
}
cout << num << endl;
} | [
"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; n++) {
for (int i = 0; i < M; i++) {
SUM[n] += A[n][i] * SUM[i];
}
}
for (int n = 0; n < N; n++) {
if (SUM[n] + C > 0)
counter++;
}
cout << counter;
return 0;
}
| #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];
}
}
///////////////////////////////////////////////////////
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
SUM[n] += A[n][i] * B[i];
}
}
for (int n = 0; n < N; n++) {
if (SUM[n] + C > 0)
counter++;
}
cout << counter;
return 0;
}
| [
"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; n++) {
for (int i = 0; i < M; i++) {
SUM[n] = A[n][i] + B[i];
}
}
for (int n = 0; n < N; n++) {
if (SUM[n] + C > 0)
counter++;
}
cout << counter;
return 0;
}
| #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];
}
}
///////////////////////////////////////////////////////
for (int n = 0; n < N; n++) {
for (int i = 0; i < M; i++) {
SUM[n] += A[n][i] * B[i];
}
}
for (int n = 0; n < N; n++) {
if (SUM[n] + C > 0)
counter++;
}
cout << counter;
return 0;
}
| [
"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 ans = 0;
for (int i = 0; i < N; i++) {
int cnt = C;
for (int j = 0; j < M; j++) {
cnt += A[i][j] * B[j];
}
if (cnt > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[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 = 0;
for (int i = 0; i < N; i++) {
int cnt = C;
for (int j = 0; j < M; j++) {
cnt += A[i][j] * B[j];
}
if (cnt > 0) {
ans++;
}
}
cout << ans << endl;
} | [] | 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 ans = 0;
for (int i = 0; i < N; i++) {
int cnt = C;
for (int j = 0; j < M; j++) {
cnt += A[i][j] * B[j];
}
if (cnt > 0) {
ans++;
}
}
cout << ans << endl;
} | #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 = 0;
for (int i = 0; i < N; i++) {
int cnt = C;
for (int j = 0; j < M; j++) {
cnt += A[i][j] * B[j];
}
if (cnt > 0) {
ans++;
}
}
cout << ans << endl;
} | [] | 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;
}
// cout <<"ans"<< ans;
if (ans + c > 0) {
fans++;
}
}
cout << fans << endl;
}
| #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;
}
// cout <<"ans"<< ans;
if (ans + c > 0) {
fans++;
}
}
cout << fans << endl;
}
| [
"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;
}
// cout <<"ans"<< ans;
if (ans + c > 0) {
fans++;
}
}
cout << fans << endl;
}
| #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;
}
// cout <<"ans"<< ans;
if (ans + c > 0) {
fans++;
}
}
cout << fans << endl;
}
| [
"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 (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans;
}
| #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 (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans;
}
| [
"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 (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans << endl;
}
| #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 (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans;
}
| [
"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];
}
}
if (i != 0 && ans > x)
cnt++;
}
cout << cnt << endl;
return 0;
} | #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];
}
}
if (i != 0 && ans + x > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"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 ans=0,tmp;
cin>>n>>m;
vector<struct pairs> A(n);
for(i=0;i<n;i++){
cin>>A[i].price;
cin>>A[i].num;
}
sort(A.begin(),A.end(),[](const pairs& x, const pairs& y) { return x.price <
y.price;}); for(i=0;i<n;i++){ if(A[i].num<=m){
tmp=double(A[i].price)*A[i].num;
ans=ans+tmp;
m-=A[i].num;
}else{
tmp=double(A[i].price)*m;
ans=ans+tmp;
m=0;
}
if(m==0)
break;
}
cout<<ans<<endl;
*/
int i, j, n, m, a, b, c, ans = 0, tmp;
cin >> n >> m >> c;
vector<int> B(m);
for (i = 0; i < m; i++)
cin >> B[i];
for (i = 0; i < n; i++) {
a = 0;
for (j = 0; j < m; j++)
cin >> tmp;
a += (tmp * B[j]);
a += c;
if (a > 0)
ans++;
}
cout << ans << endl;
}
| #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 ans=0,tmp;
cin>>n>>m;
vector<struct pairs> A(n);
for(i=0;i<n;i++){
cin>>A[i].price>>A[i].num;
}
sort(A.begin(),A.end(),[](const pairs& x, const pairs& y) { return x.price <
y.price;}); for(i=0;i<n;i++){ if(A[i].num<=m){
tmp=double(A[i].price)*A[i].num;
ans=ans+tmp;
m-=A[i].num;
}else{
tmp=double(A[i].price)*m;
ans=ans+tmp;
m=0;
}
if(m==0)
break;
}
cout<<ans<<endl;
*/
int i, j, n, m, a, b, c, ans = 0, tmp;
cin >> n >> m >> c;
vector<int> B(m);
for (i = 0; i < m; i++)
cin >> B[i];
for (i = 0; i < n; i++) {
a = 0;
for (j = 0; j < m; j++) {
cin >> tmp;
a += (tmp * B[j]);
}
a += c;
if (a > 0)
ans++;
}
cout << ans << endl;
}
| [] | 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];
}
if (d + c >= 1) {
t++;
}
d = 0;
}
cout << t << endl;
return 0;
}
| #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];
}
if (d + c > 0) {
t++;
}
d = 0;
}
cout << t << endl;
return 0;
} | [
"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 = 0; i < N; i++) {
for (Int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
ans = 0;
for (Int i = 0; i < N; i++) {
for (Int j = 0; j < M; j++) {
ans += A[i][j] * B[j];
}
if (ans + C > 0)
count++;
ans = 0;
}
cout << count << endl;
return 0;
}
| #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 = 0; i < N; i++) {
for (Int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
ans = 0;
for (Int i = 0; i < N; i++) {
for (Int j = 0; j < M; j++) {
ans += A[i][j] * B[j];
}
if (ans + C > 0)
count++;
ans = 0;
}
cout << count << endl;
return 0;
}
| [] | 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("%d", &A[i][j]);
}
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
succeed++;
sum = 0;
}
printf("%d", succeed);
return 0;
} | #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("%d", &A[i][j]);
}
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
succeed++;
sum = 0;
}
printf("%d", succeed);
return 0;
} | [
"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("%d", &A[i][j]);
}
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
succeed++;
sum = 0;
}
printf("%d", succeed);
return 0;
} | #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("%d", &A[i][j]);
}
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
succeed++;
sum = 0;
}
printf("%d", succeed);
return 0;
} | [
"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 = 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 < M; i++) {
long long tmp = calc(A[i], B, N) + C;
if (tmp > 0) {
ret++;
}
}
cout << ret;
return 0;
} | #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 = 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 tmp = calc(A[i], B, M) + C;
if (tmp > 0) {
ret++;
}
}
cout << ret;
return 0;
} | [
"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[]) {
unsigned int N, M, C, ret = 0;
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 < M; i++) {
long long tmp = calc(A[i], B, N) + C;
if (tmp > 0) {
ret++;
}
}
cout << ret;
return 0;
} | #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 = 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 tmp = calc(A[i], B, M) + C;
if (tmp > 0) {
ret++;
}
}
cout << ret;
return 0;
} | [
"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.