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 <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[i];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[j];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,942 | 908,943 | u222643545 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = c;
for (int i = 0; i < n; i++) {
s[i] = 0;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[i];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[j];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,944 | 908,943 | u222643545 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = 0;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[i];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int a[n][m];
int s[m], t = 0;
for (int i = 0; i < n; i++) {
s[i] = c;
for (int j = 0; j < m; j++) {
cin >> a[i][j];
s[i] += a[i][j] * b[j];
}
if (s[i] > 0) {
t++;
}
}
cout << t;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,945 | 908,943 | u222643545 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] > 0)
p++;
}
cout << p << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] + c > 0)
p++;
}
cout << p << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,946 | 908,947 | u407213771 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[10000][10000], y[10000], z[10000] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] > 0)
p++;
}
cout << p << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, x[20][20], y[20], z[20] = {0}, p = 0;
cin >> a >> b >> c;
for (int i = 0; i < b; i++) {
cin >> y[i];
}
for (int j = 0; j < a; j++) {
for (int i = 0; i < b; i++) {
cin >> x[j][i];
z[j] += x[j][i] * y[i];
}
if (z[j] + c > 0)
p++;
}
cout << p << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 908,948 | 908,947 | u407213771 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(j, 0, m) {
int a;
cin >> a;
sum_val += a * b[j];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(j, 0, m) {
int a;
cin >> a;
sum_val += a * b[j];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| [] | 908,963 | 908,964 | u688789047 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(i, 0, m) {
int a;
cin >> a;
sum_val += a * b[i];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(j, 0, m) {
int a;
cin >> a;
sum_val += a * b[j];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| [
"identifier.change",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 908,965 | 908,964 | u688789047 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
}
if (sum + c > 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];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
}
if (sum + c > 0) {
ans++;
}
}
cout << ans << endl;
} | [] | 908,975 | 908,976 | u176218583 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, m) cin >> b[i];
int ans = 0;
rep(i, n) {
int sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
if (sum > -c)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int ans = 0;
rep(i, n) {
int sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
if (sum > -c)
ans++;
}
cout << ans << endl;
} | [] | 908,987 | 908,988 | u068713120 | cpp |
p03102 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
int e, f = 0, g;
int d[b];
rep(i, b) cin >> d[i];
rep(i, a) {
e = 0;
rep(o, b) {
cin >> g;
e += g * d[o];
}
e = e - c;
if (e > 0)
f++;
}
cout << f;
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
int e, f = 0, g;
int d[b];
rep(i, b) cin >> d[i];
rep(i, a) {
e = 0;
rep(o, b) {
cin >> g;
e += g * d[o];
}
e = e + c;
if (e > 0) {
f++;
}
}
cout << f;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,989 | 908,990 | u683078179 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> vec(n, vector<int>(m));
rep(i, n) {
rep(j, m) { cin >> vec.at(i).at(j); }
}
int sum = 0;
for (int i = 1; i < n; i++) {
int a = 0;
rep(j, m) { a += vec.at(0).at(j) * vec.at(i).at(j); }
if (a + c > 0) {
sum++;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<vector<int>> vec(n + 1, vector<int>(m));
rep(i, n + 1) {
rep(j, m) { cin >> vec.at(i).at(j); }
}
int sum = 0;
for (int i = 1; i < n + 1; i++) {
int a = 0;
rep(j, m) { a += vec.at(0).at(j) * vec.at(i).at(j); }
if (a + c > 0) {
sum++;
}
}
cout << sum << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 908,993 | 908,994 | u120459216 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
//-std=c++11
#define print(x) printf("%.12f", x);
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define Repr(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define iter ::iterator
#define forit(a) for (it = a.begin(); it != a.end(); it++)
typedef vector<int> vi;
typedef long long ll;
const int inf = int(1e9);
const int mod = 998244353;
const int N = (int)2e5 + 5;
void solve() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
rep(i, m) { cin >> b[i]; }
int cnt = 0;
while (n--) {
int a[m];
int sum = -c;
rep(i, m) {
cin >> a[i];
sum += a[i] * b[i];
}
if (sum > 0)
cnt++;
}
cout << cnt << endl;
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
//-std=c++11
#define print(x) printf("%.12f", x);
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define Repr(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define iter ::iterator
#define forit(a) for (it = a.begin(); it != a.end(); it++)
typedef vector<int> vi;
typedef long long ll;
const int inf = int(1e9);
const int mod = 998244353;
const int N = (int)2e5 + 5;
void solve() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
rep(i, m) { cin >> b[i]; }
int cnt = 0;
while (n--) {
int a[m];
int sum = c;
rep(i, m) {
cin >> a[i];
sum += a[i] * b[i];
}
if (sum > 0)
cnt++;
}
cout << cnt << endl;
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | [
"expression.operation.unary.arithmetic.remove"
] | 908,995 | 908,996 | u002627851 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, m, c, a, b;
in3(n, m, c);
a = 0;
vector<ll> s(m);
rep(i, m) in(s[i]);
vector<vector<ll>> t(n, vector<ll>(m));
rep(i, n) { rep(j, m) in(t[i][j]); }
rep(i, n) {
b = 0;
rep(j, m) b += s[j] * t[i][j];
if (b > c)
a++;
}
out(a);
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, m, c, a, b;
in3(n, m, c);
a = 0;
vector<ll> s(m);
rep(i, m) in(s[i]);
vector<vector<ll>> t(n, vector<ll>(m));
rep(i, n) { rep(j, m) in(t[i][j]); }
rep(i, n) {
b = 0;
rep(j, m) b += s[j] * t[i][j];
if (b > c * (-1))
a++;
}
out(a);
memi;
} | [
"control_flow.branch.if.condition.change"
] | 908,998 | 908,999 | u917049698 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
int A;
cin >> A;
sum += A * B[i];
}
sum += C;
if (sum > 0)
++count;
}
cout << count << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
int A;
cin >> A;
sum += A * B[j];
}
sum += C;
if (sum > 0)
++count;
}
cout << count << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,007 | 909,008 | u323542775 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
int A;
cin >> A;
sum += A * B[i];
}
if (sum > 0)
++count;
}
cout << count << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; ++i)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; ++i) {
int sum = 0;
for (int j = 0; j < M; ++j) {
int A;
cin >> A;
sum += A * B[j];
}
sum += C;
if (sum > 0)
++count;
}
cout << count << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.add"
] | 909,009 | 909,008 | u323542775 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int score = 0;
for (int j = 0; j < M; j++) {
score += A.at(j) * B.at(i).at(j);
}
if (score - C > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int score = 0;
for (int j = 0; j < M; j++) {
score += A.at(j) * B.at(i).at(j);
}
if (score + C > 0)
ans++;
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,014 | 909,015 | u533566373 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int score = 0;
for (int j = 0; j < M; j++) {
score += A.at(j) * B.at(i).at(j);
}
if (score - C > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> A(M);
for (int i = 0; i < M; i++)
cin >> A.at(i);
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int score = 0;
for (int j = 0; j < M; j++) {
score += A.at(j) * B.at(i).at(j);
}
if (score + C > 0)
ans++;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,016 | 909,015 | u533566373 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
int n, m, c, ans = 0;
R n >> m >> c;
int B[m];
rep(i, m) R B[i];
rep(i, n) {
int ret = c;
rep(j, m) {
int a;
R a;
ret += a * (j + 1);
}
if (ret > 0)
ans += 1;
}
co(ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
int n, m, c, ans = 0;
R n >> m >> c;
int B[m];
rep(i, m) R B[i];
rep(i, n) {
int ret = c;
rep(j, m) {
int a;
R a;
ret += B[j] * a;
}
if (ret > 0)
ans += 1;
}
co(ans);
}
| [] | 909,021 | 909,022 | u499381410 | cpp |
p03102 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<int> b(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
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++;
}
cout << count << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
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++;
}
cout << count << endl;
}
| [] | 909,023 | 909,024 | u614128939 | cpp |
p03102 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, c, a[25][25], ans = 0, sum;
array<int, 25> b;
cin >> n >> m >> c;
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= m; i++) {
sum = c;
for (int j = 1; j <= n; j++) {
sum += a[i][j] * b[j];
}
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, c, a[25][25], ans = 0, sum;
array<int, 25> b;
cin >> n >> m >> c;
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
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++) {
sum = c;
for (int j = 1; j <= m; j++) {
sum += a[i][j] * b[j];
}
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,025 | 909,026 | u937747602 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, sum = 0, s, an;
cin >> n >> m >> c;
vector<int> b(m);
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
s = 0;
for (int l = 0; l < m; l++) {
cin >> a.at(i);
s += a.at(l) * b.at(l);
}
an = s + c;
if (an > 0) {
sum++;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, sum = 0, s, an;
cin >> n >> m >> c;
vector<int> b(m);
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
s = 0;
for (int l = 0; l < m; l++) {
cin >> a.at(l);
s += a.at(l) * b.at(l);
}
an = s + c;
if (an > 0) {
sum++;
}
}
cout << sum << endl;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 909,029 | 909,030 | u442754977 | cpp |
p03102 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, m, c;
cin >> n >> m >> c;
vl b(m);
FOR(i, 0, m) cin >> b[i];
ll ans = 0;
FOR(i, 0, n) {
ll can = c;
FOR(j, 0, m) {
ll x;
cin >> x;
can += x * b[i];
}
ans += (can > 0);
}
cout << ans << '\n';
return 0;
}
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, m, c;
cin >> n >> m >> c;
vl b(m);
FOR(i, 0, m) cin >> b[i];
ll ans = 0;
FOR(i, 0, n) {
ll can = c;
FOR(j, 0, m) {
ll x;
cin >> x;
can += x * b[j];
}
ans += (can > 0);
}
cout << ans << '\n';
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,031 | 909,032 | u770383589 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> a[i][j];
int count = 0;
int ans = c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans += a[i][j] * b[j];
}
if (ans > 0) {
count++;
}
ans = 0;
}
cout << count << endl;
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][m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> a[i][j];
int count = 0;
int ans = c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans += a[i][j] * b[j];
}
if (ans > 0) {
count++;
}
ans = c;
}
cout << count << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,033 | 909,034 | u679159704 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
vector<int> a(m);
for (int j = 0; j < m; j++) {
cin >> a[i];
sum += b[i] * a[i];
}
if (sum + c > 0) {
count++;
}
}
cout << count << 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];
}
int count = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
vector<int> a(m);
for (int j = 0; j < m; j++) {
cin >> a[j];
sum += b[j] * a[j];
}
if (sum + c > 0) {
count++;
}
}
cout << count << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,035 | 909,036 | u882039496 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, 0, M) cin >> B[i];
rep(i, 0, N) {
rep(I, 0, M) { cin >> A[i][I]; }
}
rep(i, 0, N) {
rep(I, 0, M) { an += A[i][I] * B[i]; }
if (0 < an + C)
ans++;
an = 0;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, 0, M) cin >> B[i];
rep(i, 0, N) {
rep(I, 0, M) { cin >> A[i][I]; }
}
rep(i, 0, N) {
rep(I, 0, M) { an += A[i][I] * B[I]; }
if (0 < an + C)
ans++;
an = 0;
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,043 | 909,044 | u456658814 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, 0, M) cin >> B[i];
rep(i, 0, N) {
rep(I, 0, M) { cin >> A[i][I]; }
}
rep(i, 0, N) {
rep(I, 0, M) { an += A[i][I] * B[i]; }
if (0 < an + C)
ans++;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int N, M, C, ans(0), an(0);
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, 0, M) cin >> B[i];
rep(i, 0, N) {
rep(I, 0, M) { cin >> A[i][I]; }
}
rep(i, 0, N) {
rep(I, 0, M) { an += A[i][I] * B[I]; }
if (0 < an + C)
ans++;
an = 0;
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.add"
] | 909,045 | 909,044 | u456658814 | cpp |
p03102 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
int main() {
int ans = 0;
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
ll sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
int main() {
int ans = 0;
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
ll sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [] | 909,049 | 909,050 | u829260400 | cpp |
p03102 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
int main() {
int ans = 0;
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
int sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <tuple>
#include <vector>
#define PI 3.14159265359
#define INF 100100100100100100
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
int main() {
int ans = 0;
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) { cin >> b[i]; }
rep(i, n) {
ll sum = 0;
rep(j, m) {
int a;
cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 909,051 | 909,050 | u829260400 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
rep(i, n) rep(j, m) cin >> a[i][j];
int tmp = 0, ans = 0;
rep(i, n) {
rep(j, m) tmp += a[i][j] + b[j];
if (tmp > -1 * c)
ans++;
tmp = 0;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
rep(i, n) rep(j, m) cin >> a[i][j];
int tmp = 0, ans = 0;
rep(i, n) {
rep(j, m) tmp += a[i][j] * b[j];
if (tmp > -1 * c)
ans++;
tmp = 0;
}
cout << ans;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 909,052 | 909,053 | u639732129 | cpp |
p03102 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> A[n][m];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += A[i][j] * B[j];
}
if ((cnt + c) > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += A[i][j] * B[j];
}
if ((cnt + c) > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,054 | 909,055 | u904995051 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c, i, j, k, ct, s;
cin >> n >> m >> c;
vector<int> b(m), a(m);
for (i = 0; i < m; i++)
cin >> b[i];
ct = 0;
while (n--) {
s = c;
for (i = 0; i < m; i++) {
cin >> b[i];
s += b[i] * a[i];
}
if (s > 0)
ct++;
}
cout << ct << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c, i, j, k, ct, s;
cin >> n >> m >> c;
vector<int> b(m), a(m);
for (i = 0; i < m; i++)
cin >> b[i];
ct = 0;
while (n--) {
s = c;
for (i = 0; i < m; i++) {
cin >> a[i];
s += b[i] * a[i];
}
if (s > 0)
ct++;
}
cout << ct << "\n";
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 909,056 | 909,057 | u696290869 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
int goukei = 0;
rep(i, m) cin >> b[i];
rep(j, n) {
rep(i, m) {
cin >> a[i];
goukei += a[i] * b[i];
if (i == m - 1) {
if ((goukei + c) > 0) {
ans++;
goukei = 0;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m], a[m];
int ans = 0;
int goukei = 0;
rep(i, m) cin >> b[i];
rep(j, n) {
rep(i, m) {
cin >> a[i];
goukei += a[i] * b[i];
if (i == m - 1) {
if ((goukei + c) > 0) {
ans++;
}
goukei = 0;
}
}
}
cout << ans << endl;
return 0;
} | [] | 909,060 | 909,061 | u441823651 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int Count = 0;
for (int i = 0; i < N; i++) {
int Sum = C;
for (int j = 0; j < M; j++) {
Sum += A.at(i).at(j) * B.at(j);
}
if (Sum > 0) {
Count++;
}
}
cout << Count << 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.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int Count = 0;
for (int i = 0; i < N; i++) {
int Sum = C;
for (int j = 0; j < M; j++) {
Sum += A.at(i).at(j) * B.at(j);
}
if (Sum > 0) {
Count++;
}
}
cout << Count << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,066 | 909,067 | u196629968 | cpp |
p03102 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0, ans = 0;
for (int i = 0; i < N; i++, sum = 0) {
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0, ans = 0;
for (int i = 0; i < N; i++, sum = 0) {
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [] | 909,078 | 909,079 | u684863590 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (ans)
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (ans > 0)
cnt++;
}
cout << cnt << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 909,080 | 909,081 | u373958718 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, m) {
ans = c;
rep(i, n) {
int x;
cin >> x;
ans += x * b[i];
}
if (ans)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) cin >> b[i];
int cnt = 0;
rep(j, n) {
ans = c;
rep(i, m) {
int x;
cin >> x;
ans += x * b[i];
}
if (ans > 0)
cnt++;
}
cout << cnt << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 909,082 | 909,081 | u373958718 | cpp |
p03102 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
int n, m, c;
cin >> n, m, c;
int b[m];
int a[n][m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int ans = 0;
int wa = c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
if (wa > 0) {
ans++;
}
wa = c;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
int main() {
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int ans = 0;
int wa = c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
if (wa > 0) {
ans++;
}
wa = c;
}
cout << ans << endl;
} | [] | 909,083 | 909,084 | u776056110 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int B[M], A[M];
int judge;
for (int i = 0; i < M; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
judge = 0;
for (int j = 0; j < N; ++j) {
cin >> A[j];
judge += B[j] * A[j];
}
judge += C;
if (judge > 0)
count += 1;
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int count = 0;
int B[M], A[M];
int judge;
for (int i = 0; i < M; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
judge = 0;
for (int j = 0; j < M; ++j) {
cin >> A[j];
judge += B[j] * A[j];
}
judge += C;
if (judge > 0)
count += 1;
}
cout << count << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,085 | 909,086 | u364916333 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < M; i++) {
std::cin >> B[i];
}
std::vector<std::vector<int>> A(N, std::vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
std::cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int a = 0;
for (int j = 0; j < M; j++) {
a += B[j] * A[i][j];
}
if (a > C)
ans++;
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
std::vector<int> B(M);
for (int i = 0; i < M; i++) {
std::cin >> B[i];
}
std::vector<std::vector<int>> A(N, std::vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
std::cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int a = 0;
for (int j = 0; j < M; j++) {
a += B[j] * A[i][j];
}
if (a > -C)
ans++;
}
std::cout << ans << std::endl;
return 0;
} | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 909,087 | 909,088 | u922974720 | cpp |
p03102 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int n, m, c;
int b[20];
int a[20][20];
int main() {
cin >> n >> m >> c;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
rep(j, m) { cin >> a[i][j]; }
}
int ret = 0;
rep(i, n) {
int ans = c;
rep(j, m) { ans += a[i][j] * b[j]; }
if (ans > 0)
ret++;
}
cout << ret << endl;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int n, m, c;
int b[20];
int a[20][20];
int main() {
cin >> n >> m >> c;
rep(i, m) { cin >> b[i]; }
rep(i, n) {
rep(j, m) { cin >> a[i][j]; }
}
int ret = 0;
rep(i, n) {
int ans = c;
rep(j, m) { ans += a[i][j] * b[j]; }
if (ans > 0)
ret++;
}
cout << ret << endl;
}
| [] | 909,091 | 909,092 | u926242698 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
int B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
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) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 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) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 909,112 | 909,113 | u066855390 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
int B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
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) {
count++;
}
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 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) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 909,114 | 909,113 | u066855390 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[M][N];
int B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
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) {
count++;
}
}
cout << count;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M];
int B[M];
// vector < vector <int >> A (N , vector <int >( M ));
// vector <int > B ( M );
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 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) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change",
"io.output.newline.add"
] | 909,115 | 909,113 | u066855390 | cpp |
p03102 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int Code = C;
for (int j = 0; j < M; j++) {
Code += (A.at(i).at(j) * B.at(j));
}
if (Code > 0)
cnt++;
}
cout << cnt << endl;
} | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int Code = C;
for (int j = 0; j < M; j++) {
Code += A.at(i).at(j) * B.at(j);
}
if (Code > 0)
cnt++;
}
cout << cnt << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,127 | 909,128 | u615258936 | cpp |
p03102 | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int Code = C;
for (int j = 0; j < M; j++) {
Code += (A.at(i).at(j) * B.at(j));
}
if (Code > 0)
cnt++;
}
cout << cnt << endl;
} | using namespace std;
#include <bits/stdc++.h>
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int Code = C;
for (int j = 0; j < M; j++) {
Code += A.at(i).at(j) * B.at(j);
}
if (Code > 0)
cnt++;
}
cout << cnt << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,129 | 909,128 | u615258936 | cpp |
p03102 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
int main() {
int N, M, C;
scanf("%d%d%d", &N, &M, &C);
int B[30];
int A[30][30];
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 < M; i++) {
int sum = 0;
for (int j = 0; j < N; j++)
sum += A[i][j] * B[j];
if (sum + C > 0)
ans++;
}
printf("%d", ans);
}
/* 提出前の確認事項
・デバッグ用の関数は＜＜コメント化＞＞しているか？
・すべての＜＜入力例＞＞は試したか？
・＜＜限界値分析＞＞はしたか？
・＜＜出力の改行＞＞の有無は確認したか？
・文字列の＜＜スペル＞＞は確認したか？
↓
＜＜提出先＞＞に注意して提出！！
*/ | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
int main() {
int N, M, C;
scanf("%d%d%d", &N, &M, &C);
int B[30];
int A[30][30];
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 sum = 0;
for (int j = 0; j < M; j++)
sum += A[i][j] * B[j];
if (sum + C > 0)
ans++;
}
printf("%d", ans);
}
/* 提出前の確認事項
・デバッグ用の関数は＜＜コメント化＞＞しているか？
・すべての＜＜入力例＞＞は試したか？
・＜＜限界値分析＞＞はしたか？
・＜＜出力の改行＞＞の有無は確認したか？
・文字列の＜＜スペル＞＞は確認したか？
↓
＜＜提出先＞＞に注意して提出！！
*/ | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,136 | 909,137 | u433195318 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m, c;
cin >> n >> m >> c;
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 > 0)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m, c;
cin >> n >> m >> c;
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 = c;
for (int j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,146 | 909,147 | u703214333 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, ans = 0;
;
cin >> N >> M >> C;
vector<int> bbb(M);
vector<vector<int>> vec(N, vector<int>(M));
for (int a = 0; a < M; a++) {
cin >> bbb.at(a);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> vec.at(i).at(j);
}
for (int i = 0; i < N; i++) {
int equ = 0;
for (int j = 0; j < M; j++) {
equ += vec.at(i).at(j) * bbb.at(j);
}
if (equ + C > 0) {
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, ans = 0;
;
cin >> N >> M >> C;
vector<int> bbb(M);
vector<vector<int>> vec(N, vector<int>(M));
for (int a = 0; a < M; a++) {
cin >> bbb.at(a);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> vec.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
int equ = 0;
for (int j = 0; j < M; j++) {
equ += vec.at(i).at(j) * bbb.at(j);
}
if (equ + C > 0) {
ans++;
}
}
cout << ans << endl;
} | [] | 909,150 | 909,151 | u962609087 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[n];
int **a = new int *[n];
for (int i = 0; i < m; i++) {
a[i] = new int[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < m; i++) {
delete[] a[i];
}
delete[] a;
}
| #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < n; i++) {
delete[] a[i];
}
delete[] a;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,154 | 909,153 | u835629653 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int s = c, t = 0;
vector<int> b(m), v(m);
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> v[i];
s += v[i] * b[i];
}
if (s > 0)
t++;
s = c;
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int s = c, t = 0;
vector<int> b(m), v(m);
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> v[j];
s += v[j] * b[j];
}
if (s > 0)
t++;
s = c;
}
cout << t << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,157 | 909,158 | u930561195 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[i];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,159 | 909,160 | u679366464 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a;
}
if (sum > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int ans = 0;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
int sum = c;
for (int j = 0; j < m; ++j) {
int a;
cin >> a;
sum += a * b[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
} | [
"assignment.change"
] | 909,161 | 909,160 | u679366464 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c, x = 0, s = 0;
int a[20][20], b[20];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
x += a[i][j] * b[j];
}
if (x + c > 0)
s++;
}
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, m, c, x = 0, s = 0;
int a[20][20], b[20];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
x = 0;
for (int j = 0; j < m; j++) {
x += a[i][j] * b[j];
}
if (x + c > 0)
s++;
}
cout << s << endl;
} | [
"assignment.add"
] | 909,164 | 909,165 | u000113982 | cpp |
p03102 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, m, c, i, j, a[20], b[20], x, cnt;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; j < m; j++) {
cin >> a[j];
x = x + a[j] * b[j];
}
x = x + c;
// cout<<x<<endl;
if (x > 0) {
cnt = cnt + 1;
}
}
cout << cnt << endl;
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, m, c, i, j, a[20], b[20], x, cnt;
cnt = 0;
cin >> n >> m >> c;
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; j < m; j++) {
cin >> a[j];
x = x + a[j] * b[j];
}
x = x + c;
// cout<<x<<endl;
if (x > 0) {
cnt = cnt + 1;
}
}
cout << cnt << endl;
return 0;
}
| [
"assignment.add"
] | 909,166 | 909,167 | u520011376 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
// cout << fixed << setprecision(10);
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<ll> B(N);
for (int i = 0; i < M; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll sum = C;
for (int j = 0; j < M; j++) {
ll tmp;
cin >> tmp;
sum += tmp * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
// cout << fixed << setprecision(10);
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<ll> B(M);
for (int i = 0; i < M; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll sum = C;
for (int j = 0; j < M; j++) {
ll tmp;
cin >> tmp;
sum += tmp * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [] | 909,174 | 909,175 | u711340028 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<int> A(M);
int D = C;
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A.at(i);
D += A.at(i) * B.at(i);
}
if (D > 0) {
ans++;
D = C;
}
for (int i = 0; i < M; i++) {
A.at(i) = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<int> A(M);
int D = C;
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A.at(i);
D += A.at(i) * B.at(i);
}
if (D > 0) {
ans++;
}
D = C;
for (int i = 0; i < M; i++) {
A.at(i) = 0;
}
}
cout << ans << endl;
}
| [] | 909,176 | 909,177 | u037276799 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[n];
int **a = new int *[n];
for (int i = 0; i < m; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < m; i++) {
delete[] a[i];
}
delete[] a;
}
| #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < n; i++) {
delete[] a[i];
}
delete[] a;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 909,187 | 909,186 | u637220270 | cpp |
p03102 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<int> a(M);
rep(i, M) { cin >> b[i]; }
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
int k;
cin >> k;
a[j] = k;
sum += a[j] * b[i];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> b(M);
vector<int> a(M);
rep(i, M) { cin >> b[i]; }
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
int k;
cin >> k;
a[j] = k;
sum += a[j] * b[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,188 | 909,189 | u264405855 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int sum = 0;
int resum = 0;
vector<int> vec(m);
for (int i = 0; i < m; i++) {
cin >> vec[i];
}
for (int j = 0; j < n; j++) {
for (int k = 0; k < m; k++) {
int a;
cin >> a;
sum += a * vec[k];
}
if (-c < sum)
resum += 1;
}
cout << resum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int sum = 0;
int resum = 0;
vector<int> vec(m);
for (int i = 0; i < m; i++) {
cin >> vec[i];
}
for (int j = 0; j < n; j++) {
for (int k = 0; k < m; k++) {
int a;
cin >> a;
sum += a * vec[k];
}
if (-c < sum) {
resum += 1;
}
sum = 0;
}
cout << resum << endl;
} | [
"assignment.add"
] | 909,192 | 909,193 | u835924161 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
int count = 0;
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(j);
ans += a.at(i).at(j) * b.at(j);
}
if (ans > 0) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
int count = 0;
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(j);
ans += a.at(i).at(j) * b.at(j);
}
ans += c;
if (ans > 0) {
count++;
}
}
cout << count << endl;
} | [
"assignment.add"
] | 909,201 | 909,202 | u532401120 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n, m;
cin >> n >> m;
int c;
cin >> c;
int b[m];
forn(i, m) cin >> b[i];
int cnt = 0;
int a[m];
forn(i, n) {
int s = 0;
for (int j = 0; j < m; j++) {
cin >> a[j];
s += a[j] * b[j];
}
if (s > c)
cnt++;
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n, m;
cin >> n >> m;
int c;
cin >> c;
int b[m];
forn(i, m) cin >> b[i];
int cnt = 0;
int a[m];
forn(i, n) {
int s = 0;
for (int j = 0; j < m; j++) {
cin >> a[j];
s += a[j] * b[j];
}
s += c;
if (s > 0)
cnt++;
}
cout << cnt;
} | [
"assignment.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 909,205 | 909,206 | u843739531 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, k, c = 0;
cin >> n >> m >> k;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < m; j++) {
int k;
cin >> k;
s += k * b[j];
}
if (s + c > 0)
c++;
}
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, m, k, c = 0;
cin >> n >> m >> k;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < m; j++) {
int k;
cin >> k;
s += k * b[j];
}
if (s + k > 0)
c++;
}
cout << c << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,209 | 909,210 | u169639579 | cpp |
p03102 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M] = {};
for (int i = 0; i < M; i++)
cin >> B[i];
int A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int k = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
k += A[i][j] * B[j];
}
if (k + C > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M] = {};
for (int i = 0; i < M; i++)
cin >> B[i];
int A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int k = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
k += A[i][j] * B[j];
}
if (k + C > 0)
ans++;
k = 0;
}
cout << ans << endl;
return 0;
} | [
"assignment.add"
] | 909,211 | 909,212 | u646921304 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
bab += C;
cout << bab;
if (bab > 0)
sum += 1;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
bab += C;
if (bab > 0)
sum += 1;
}
cout << sum << endl;
} | [] | 909,217 | 909,218 | u593555034 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[i];
bab += A[i] * B[i];
}
bab += C;
if (bab > 0)
sum += 1;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int sum = 0;
int B[M], A[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int bab = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
bab += A[j] * B[j];
}
bab += C;
if (bab > 0)
sum += 1;
}
cout << sum << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,219 | 909,218 | u593555034 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c, ans, sum;
cin >> n >> m >> c;
int b[m], a[n][m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> a[i][j];
for (int i = 0; i < n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
if (sum > 0)
ans++;
}
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, m, c, ans = 0, sum;
cin >> n >> m >> c;
int b[m], a[n][m];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> a[i][j];
for (int i = 0; i < n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
if (sum > 0)
ans++;
}
cout << ans;
return 0;
}
| [
"variable_declaration.value.change"
] | 909,224 | 909,225 | u340494803 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, M) { cin >> B[i]; }
rep(i, N) {
rep(j, M) { cin >> A[i][j]; }
}
int sum = 0;
int ans = 0;
rep(i, N) {
rep(j, M) { sum += A[i][j] * B[j]; }
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
rep(i, M) { cin >> B[i]; }
rep(i, N) {
rep(j, M) { cin >> A[i][j]; }
}
int sum = 0;
int ans = 0;
rep(i, N) {
sum = 0;
rep(j, M) { sum += A[i][j] * B[j]; }
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"assignment.add"
] | 909,231 | 909,232 | u747087681 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S;
for (int i = 0; i < M; i++) {
cin >> S.at(i);
sum += S.at(i) * B.at(i);
if (i == M - 1 && sum + C > 0) {
x++;
}
}
}
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S(M);
for (int i = 0; i < M; i++) {
cin >> S.at(i);
sum += S.at(i) * B.at(i);
if (i == M - 1 && sum + C > 0) {
x++;
}
}
}
cout << x << endl;
}
| [] | 909,239 | 909,240 | u096717230 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S;
for (int i = 0; i < M; i++) {
cin >> S.at(i);
sum += S.at(i) * B.at(i);
if (i == M - 1 && sum + C > 0) {
x++;
}
}
}
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int sum = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
int x = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
vector<int> S(M);
for (int i = 0; i < M; i++) {
cin >> S.at(i);
sum += S.at(i) * B.at(i);
if (i == M - 1 && sum + C > 0) {
x++;
}
}
}
cout << x << endl;
}
| [
"variable_declaration.value.change"
] | 909,241 | 909,240 | u096717230 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(j);
}
}
int sum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
sum += a.at(i).at(j) + b.at(j);
}
if (sum + c > 0) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a.at(i).at(j);
}
}
int sum = 0;
int count = 0;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
sum += a.at(i).at(j) * b.at(j);
}
if (sum + c > 0) {
count++;
}
}
cout << count << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 909,244 | 909,245 | u370447425 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
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 <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
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;
} | [] | 909,250 | 909,249 | u544437817 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
int n, m, c;
int b[20], a[400];
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 * n + j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j < m; j++) {
tmp += (a[i * m + j] * b[j]);
}
tmp += c;
if (tmp > 0)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
int n, m, c;
int b[20], a[400];
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 * m + j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j < m; j++) {
tmp += (a[i * m + j] * b[j]);
}
tmp += c;
if (tmp > 0)
count++;
}
cout << count << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,251 | 909,252 | u218759384 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
int n, m, c;
int b[20], a[400];
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 * n + j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j < m; j++) {
tmp += (a[i * n + j] * b[j]);
}
tmp += c;
if (tmp > 0)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* define const */
const long long INF = (1LL << 60);
/* end defineing */
int main() {
int n, m, c;
int b[20], a[400];
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 * m + j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j < m; j++) {
tmp += (a[i * m + j] * b[j]);
}
tmp += c;
if (tmp > 0)
count++;
}
cout << count << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,253 | 909,252 | u218759384 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, total, count;
cin >> N >> M >> C;
int b[M] = {};
int a[N][M] = {};
count = 0;
total = 0;
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> a[j][i];
// cout << a[j][i];
}
// cout << "" <<endl;
}
for (int k = 0; k < N; k++) {
for (int h = 0; h < M; h++) {
total += a[k][h] * b[h];
}
if (total + C > 0)
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C, total, count;
cin >> N >> M >> C;
int b[M] = {};
int a[N][M] = {};
count = 0;
total = 0;
for (int i = 0; i < M; i++) {
cin >> b[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> a[j][i];
// cout << a[j][i];;
}
// cout << "" << endl;
}
for (int k = 0; k < N; k++) {
total = 0;
for (int h = 0; h < M; h++) {
total += a[k][h] * b[h];
// cout << total ;
}
// cout << ""<<endl;
if (total + C > 0)
count++;
}
cout << count << endl;
} | [
"assignment.add"
] | 909,272 | 909,273 | u609576113 | cpp |
p03102 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
cin >> A[i][j];
int correct = 0, code;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
code += A[i][j] * B[j];
}
code += C;
if (code > 0)
correct++;
}
cout << correct << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], B[M];
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
cin >> A[i][j];
int correct = 0, code;
for (int i = 0; i < N; i++) {
code = 0;
for (int j = 0; j < M; j++) {
code += A[i][j] * B[j];
}
code += C;
if (code > 0)
correct++;
}
cout << correct << endl;
return 0;
} | [
"assignment.add"
] | 909,286 | 909,287 | u668443884 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int i, j;
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
int count[n];
int hantei = 0;
for (i = 0; i < m; i++)
cin >> b[i];
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[n][m];
for (i = 0; i < n; i++) {
count[i] = c;
for (j = 0; j < m; j++)
count[i] += a[i][j] * b[j];
if (count[i] > 0)
hantei++;
}
cout << hantei << endl;
return (0);
} | #include <iostream>
using namespace std;
int main() {
int i, j;
int n, m, c;
cin >> n >> m >> c;
int b[m];
int a[n][m];
int count[n];
int hantei = 0;
for (i = 0; i < m; i++)
cin >> b[i];
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j];
for (i = 0; i < n; i++) {
count[i] = c;
for (j = 0; j < m; j++)
count[i] += a[i][j] * b[j];
if (count[i] > 0)
hantei++;
}
cout << hantei << endl;
return (0);
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,294 | 909,295 | u754909749 | cpp |
p03102 | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(20);
vector<vector<int>> A(20, vector<int>(20));
int data = 0;
int counter = 0;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; 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++) {
data += A[i][j] * B[j];
}
data += C;
if (data > 0)
counter++;
data = 0;
}
cout << data << endl;
} | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(20);
vector<vector<int>> A(20, vector<int>(20));
int data = 0;
int counter = 0;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; 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++) {
data += A[i][j] * B[j];
}
data += C;
if (data > 0)
counter++;
data = 0;
}
cout << counter << endl;
} | [
"identifier.change",
"io.output.change"
] | 909,298 | 909,299 | u774910314 | cpp |
p03102 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint16_t N, M;
int16_t C, *A, *B;
cin >> N >> M >> C;
A = new int16_t[M];
B = new int16_t[M];
for (uint16_t i = 0; i < M; i++)
cin >> B[i];
uint16_t res = 0;
int32_t tmp = 0;
for (uint16_t j = 0; j < N; j++) {
for (uint16_t i = 0; i < M; i++) {
cin >> A[i];
tmp += A[i] * B[i];
}
tmp += C;
if (tmp > 0)
++res;
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
uint16_t N, M;
int16_t C, *A, *B;
cin >> N >> M >> C;
A = new int16_t[M];
B = new int16_t[M];
for (uint16_t i = 0; i < M; i++)
cin >> B[i];
uint16_t res = 0;
int32_t tmp = 0;
for (uint16_t j = 0; j < N; j++) {
tmp = 0;
for (uint16_t i = 0; i < M; i++) {
cin >> A[i];
tmp += A[i] * B[i];
}
tmp += C;
if (tmp > 0)
++res;
}
cout << res << endl;
return 0;
} | [
"assignment.add"
] | 909,300 | 909,301 | u846796522 | cpp |
p03102 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAX 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll N, M, C;
cin >> N >> M >> C;
ll B[N];
ll A[N][M];
ll ans = 0;
FOR(i, 0, M - 1) { cin >> B[i]; }
FOR(i, 0, N - 1) {
FOR(j, 0, M - 1) { cin >> A[i][j]; }
}
FOR(i, 0, N - 1) {
ll tmp = 0;
FOR(j, 0, M - 1) {
tmp = tmp + A[i][j] * B[j];
// cout<< A[i][j]<<" "<<B[j]<<" q"<<tmp<<endl;
// cout<< A[i][j]*B[j]<<" "<<tmp<<endl;
}
if (tmp - C > 0) {
ans++;
}
// cout<<tmp<<" "<<C<<endl;
}
cout << ans << endl;
}
| //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAX 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll N, M, C;
cin >> N >> M >> C;
ll B[M];
ll A[N][M];
ll ans = 0;
FOR(i, 0, M - 1) { cin >> B[i]; }
FOR(i, 0, N - 1) {
FOR(j, 0, M - 1) { cin >> A[i][j]; }
}
FOR(i, 0, N - 1) {
ll tmp = 0;
FOR(j, 0, M - 1) {
tmp = tmp + A[i][j] * B[j];
// cout<< A[i][j]<<" "<<B[j]<<" q"<<tmp<<endl;
// cout<< A[i][j]*B[j]<<" "<<tmp<<endl;
}
if (tmp + C > 0) {
ans++;
}
// cout<<tmp<<" "<<C<<endl;
}
cout << ans << endl;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 909,318 | 909,317 | u043443359 | cpp |
p03102 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define LL long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#define VI vector<int>
#define PII pair<int, int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
typedef long long ll;
bool file = 0, rt = 1;
clock_t tStart;
void FAST_IO();
////////////////////////
int b[21], a[21];
int main() {
// FAST_IO();
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout << setprecision(5);
cout << fixed;
int n, m, c;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int j = 0;
ll sum = 0;
int ans = 0;
while (j < n) {
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sum = 0;
for (int i = 0; i < m; i++) {
sum += b[i] * a[i];
}
sum += c;
if (sum > 0) {
ans = j;
}
j++;
}
cout << ans << endl;
return 0;
}
void FAST_IO() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// cout.tie(NULL);
// cout.setf(ios::fixed);
// cout.precision(2);
if (rt && file) {
tStart = clock();
}
if (file) {
#ifndef _offline
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define LL long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RE(i, n) FOR(i, 1, n)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define R(i, n) REP(i, n)
#define VI vector<int>
#define PII pair<int, int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
typedef long long ll;
bool file = 0, rt = 1;
clock_t tStart;
void FAST_IO();
////////////////////////
int b[21], a[21];
int main() {
// FAST_IO();
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout << setprecision(5);
cout << fixed;
int n, m, c;
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int j = 0;
ll sum = 0;
int ans = 0;
while (j < n) {
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sum = 0;
for (int i = 0; i < m; i++) {
sum += b[i] * a[i];
}
sum += c;
if (sum > 0) {
ans++;
}
j++;
}
cout << ans << endl;
return 0;
}
void FAST_IO() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// cout.tie(NULL);
// cout.setf(ios::fixed);
// cout.precision(2);
if (rt && file) {
tStart = clock();
}
if (file) {
#ifndef _offline
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
}
| [] | 909,322 | 909,323 | u423831742 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum = 0, ans = 0;
cin >> N >> M >> C;
int B[M], A;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < M; i++) {
cin >> A;
sum += A * B[i];
}
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum = 0, ans = 0;
cin >> N >> M >> C;
int B[M], A;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
sum = 0;
for (int i = 0; i < M; i++) {
cin >> A;
sum += A * B[i];
}
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"assignment.add"
] | 909,324 | 909,325 | u839397805 | cpp |
p03102 | #include <iostream>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int count = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int a;
std::cin >> a;
sum += a * b[j];
}
if (sum + c > 0) {
count++;
}
}
std::cout << count << std::endl;
} | #include <iostream>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int count = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
int a;
std::cin >> a;
sum += a * b[j];
}
if (sum + c > 0) {
count++;
}
}
std::cout << count << std::endl;
} | [
"assignment.add"
] | 909,329 | 909,330 | u775347320 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int S = 0, count = 0;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
S += A.at(i).at(j) * B.at(j);
}
if (S + C > 0) {
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int S = 0, count = 0;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
S += A.at(i).at(j) * B.at(j);
}
if (S + C > 0) {
count++;
}
S = 0;
}
cout << count << endl;
return 0;
} | [
"assignment.add"
] | 909,337 | 909,338 | u255412750 | cpp |
p03102 | #include <stdio.h>
int main(void) {
int N, M, C;
int A[20][20], B[20];
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &C);
for (int j = 0; j < M; j++) {
scanf("%d", &B[j]);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%d", &A[i][j]);
}
}
int sum = 0;
int count = 0;
/*int W[20][20];
for (int i = 0; i < N; i++); {
for (int j = 0; j < M; j++) {
W[i][j] = A[i][j] * B[i];
}
}*/
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
}
if (sum + C > 0)
count++;
}
printf("%d", count);
return 0;
} | #include <stdio.h>
int main(void) {
int N, M, C;
int A[20][20], B[20];
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &C);
for (int j = 0; j < M; j++) {
scanf("%d", &B[j]);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%d", &A[i][j]);
}
}
int sum = 0;
int count = 0;
for (int i = 0; i < N; i++) {
sum = 0;
for (int j = 0; j < M; j++) {
sum = sum + A[i][j] * B[j];
// printf("sum=%d ", sum);
}
if (sum + C > 0)
count++;
}
printf("%d", count);
return 0;
} | [
"assignment.add"
] | 909,347 | 909,348 | u956941456 | cpp |
p03102 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define endl "\n"
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
cout << endl;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9 + 7;
void solve() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
for (auto &it : b)
cin >> it;
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 val = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += a[i][j] * b[j];
}
if (cnt > -c)
val++;
}
cout << val << endl;
}
int32_t main() {
IOS;
solve();
// debug();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define endl "\n"
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
cout << endl;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9 + 7;
void solve() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (auto &it : b)
cin >> it;
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 val = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += a[i][j] * b[j];
}
if (cnt > -c)
val++;
}
cout << val << endl;
}
int32_t main() {
IOS;
solve();
// debug();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
} | [] | 909,349 | 909,350 | u572138437 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] * B[k];
}
if (sum + C > 0)
cnt++;
}
cout << cnt << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] * B[k];
}
if (sum + C > 0)
cnt++;
sum = 0;
}
cout << cnt << endl;
} | [
"assignment.add"
] | 909,359 | 909,360 | u317177661 | cpp |
p03102 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] * B[i];
}
if (sum + C > 0)
cnt++;
}
cout << cnt << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, C, B[20], A[20], sum = 0, cnt = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int k = 0; k < M; k++) {
cin >> A[k];
sum += A[k] * B[k];
}
if (sum + C > 0)
cnt++;
sum = 0;
}
cout << cnt << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"assignment.add"
] | 909,361 | 909,360 | u317177661 | cpp |
p03102 | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
using IntV = std::vector<int>;
IntV B(M);
for (auto &b : B)
std::cin >> b;
IntV A(N * M);
for (auto &a : A)
std::cin >> a;
auto itr_a = A.begin();
int cnt = 0;
for (int i = 0; i < N; i++) {
auto itr_b = B.begin();
int sum = 0;
for (int j = 0; j < M; j++)
sum += *itr_a++ * *itr_b++;
if (cnt > -C)
cnt++;
}
std::cout << cnt << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int N, M, C;
std::cin >> N >> M >> C;
using IntV = std::vector<int>;
IntV B(M);
for (auto &b : B)
std::cin >> b;
IntV A(N * M);
for (auto &a : A)
std::cin >> a;
auto itr_a = A.begin();
int cnt = 0;
for (int i = 0; i < N; i++) {
auto itr_b = B.begin();
int sum = 0;
for (int j = 0; j < M; j++)
sum += *itr_a++ * *itr_b++;
if (sum > -C)
cnt++;
}
std::cout << cnt << std::endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,377 | 909,378 | u896932701 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int sum = C;
for (int jj = 0; jj < M; jj++) {
int a;
cin >> a;
sum += a * B[jj];
}
if (sum == 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 (auto &b : B) {
cin >> b;
}
int ans = 0;
for (int ii = 0; ii < N; ii++) {
int sum = C;
for (int jj = 0; jj < M; jj++) {
int a;
cin >> a;
sum += a * B[jj];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,379 | 909,380 | u471342385 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define Si size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define Em empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#define Fi first
#define Se second
#define Pi acos(-1)
#define PS push
#define PP pop()
#define PSF push_front
#define PSB push_back
#define PPF pop_front()
#define PPB pop_back()
#define MP make_pair
#define LL long long int
#define ULL unsigned long long int
#define PII pair<int, int>
#define PSI pair<string, int>
#define PIS pair<int, string>
#define PLI pair<long long int, int>
#define PLL pair<long long int, long long int>
#define MII map<int, int>
#define MSI map<string, int>
#define MIS map<int, string>
#define MLI map<long long int, int>
#define FAST() ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
LL big_mod(LL val, LL pow, LL mod);
LL mod_inverse(LL val, LL mod);
int b[22], a;
int main() {
// FAST();
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int i, j, m, n, c, ans = 0;
S("%d %d %d", &n, &m, &c);
for (i = 1; i <= m; i++) {
S("%d", &b[i]);
}
int cnt;
for (i = 1; i <= n; i++) {
cnt = 0;
for (j = 1; j <= m; j++) {
S("%d", &a);
cnt += (a * b[j]);
}
if (cnt > 0) {
ans++;
}
}
P("%d", ans);
return 0;
}
LL big_mod(LL val, LL pow, LL mod) {
LL res = 1;
val = val % mod;
while (pow > 0) {
if (pow & 1) {
res = (res * val) % mod;
}
pow = pow >> 1;
val = (val * val) % mod;
}
return res;
}
LL mod_inverse(LL val, LL mod) {
LL mod1 = mod;
if (mod == 1) {
return 0;
}
LL y = 0;
LL x = 1;
LL quotient, temp;
while (val > 1) {
quotient = val / mod;
temp = mod;
mod = val % mod;
val = temp;
temp = y;
y = x - quotient * y;
x = temp;
}
if (x < 0) {
x += mod1;
}
return x;
}
| #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define Si size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define Em empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#define Fi first
#define Se second
#define Pi acos(-1)
#define PS push
#define PP pop()
#define PSF push_front
#define PSB push_back
#define PPF pop_front()
#define PPB pop_back()
#define MP make_pair
#define LL long long int
#define ULL unsigned long long int
#define PII pair<int, int>
#define PSI pair<string, int>
#define PIS pair<int, string>
#define PLI pair<long long int, int>
#define PLL pair<long long int, long long int>
#define MII map<int, int>
#define MSI map<string, int>
#define MIS map<int, string>
#define MLI map<long long int, int>
#define FAST() ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
LL big_mod(LL val, LL pow, LL mod);
LL mod_inverse(LL val, LL mod);
int b[22], a;
int main() {
// FAST();
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int i, j, m, n, c, ans = 0;
S("%d %d %d", &n, &m, &c);
for (i = 1; i <= m; i++) {
S("%d", &b[i]);
}
int cnt;
for (i = 1; i <= n; i++) {
cnt = c;
for (j = 1; j <= m; j++) {
S("%d", &a);
cnt += (a * b[j]);
}
if (cnt > 0) {
ans++;
}
}
P("%d", ans);
return 0;
}
LL big_mod(LL val, LL pow, LL mod) {
LL res = 1;
val = val % mod;
while (pow > 0) {
if (pow & 1) {
res = (res * val) % mod;
}
pow = pow >> 1;
val = (val * val) % mod;
}
return res;
}
LL mod_inverse(LL val, LL mod) {
LL mod1 = mod;
if (mod == 1) {
return 0;
}
LL y = 0;
LL x = 1;
LL quotient, temp;
while (val > 1) {
quotient = val / mod;
temp = mod;
mod = val % mod;
val = temp;
temp = y;
y = x - quotient * y;
x = temp;
}
if (x < 0) {
x += mod1;
}
return x;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 909,384 | 909,385 | u380762346 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
for (int j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans += c;
if (ans > 0) {
cnt++;
}
}
cout << cnt << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
for (int j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans += c;
if (ans > 0) {
cnt++;
}
ans = 0;
}
cout << cnt << endl;
} | [
"assignment.add"
] | 909,388 | 909,389 | u373164102 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
for (int j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans -= c;
if (ans > 0) {
cnt++;
}
}
cout << cnt << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m, c, ans = 0, cnt = 0;
int a[25], b[25];
cin >> n >> m >> c;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
}
for (int j = 0; j < m; j++) {
ans += a[j] * b[j];
}
ans += c;
if (ans > 0) {
cnt++;
}
ans = 0;
}
cout << cnt << endl;
} | [
"expression.operator.change",
"assignment.add"
] | 909,390 | 909,389 | u373164102 | cpp |
p03102 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return 1;
} else {
return 0;
}
}
int main() {
int n, m, c;
int ans = 0;
std::cin >> n >> m >> c;
int b[21];
for (int i = 0; i < m; ++i) {
std::cin >> b[i];
}
int vec[21][21];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
std::cin >> vec[i][j];
}
}
for (int i = 0; i < n; ++i) {
int hoge = 0;
for (int j = 0; j < m; ++j) {
hoge += vec[i][j] * b[j];
}
if (hoge - 10 > 0) {
ans++;
}
}
std::cout << ans << std::endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long LL;
int int_vector_find(std::vector<int> vec, int num) {
auto itr = std::find(vec.begin(), vec.end(), num);
int index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return 1;
} else {
return 0;
}
}
int main() {
int n, m, c;
int ans = 0;
std::cin >> n >> m >> c;
int b[21];
for (int i = 0; i < m; ++i) {
std::cin >> b[i];
}
int vec[21][21];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
std::cin >> vec[i][j];
}
}
for (int i = 0; i < n; ++i) {
int hoge = 0;
for (int j = 0; j < m; ++j) {
hoge += vec[i][j] * b[j];
}
if (hoge + c > 0) {
ans++;
}
}
std::cout << ans << std::endl;
} | [
"control_flow.loop.for.condition.change"
] | 909,393 | 909,394 | u085117197 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
forn(i, m) { cin >> b[i]; }
vector<vector<int>> a(n, vector<int>(m));
forn(i, n) {
forn(j, m) { cin >> a[i][j]; }
}
int cont = 0;
forn(i, n) {
int calc;
forn(j, m) { calc += (a[i][j] * b[j]); }
if (calc + c > 0)
cont++;
}
cout << cont << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
forn(i, m) { cin >> b[i]; }
vector<vector<int>> a(n, vector<int>(m));
forn(i, n) {
forn(j, m) { cin >> a[i][j]; }
}
int cont = 0;
forn(i, n) {
int calc = 0;
forn(j, m) { calc += (a[i][j] * b[j]); }
if (calc + c > 0)
cont++;
}
cout << cont << endl;
}
| [
"variable_declaration.value.change"
] | 909,397 | 909,398 | u061383139 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, c;
cin >> n >> m >> c;
int a[n][m];
int b[m];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < m; j++) {
x += (a[i][j] * b[j]);
}
x += c;
if (x > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, c;
cin >> n >> m >> c;
int a[n][m];
int b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < m; j++) {
x += (a[i][j] * b[j]);
}
x += c;
if (x > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,408 | 909,409 | u124992729 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A[N][M], B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 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];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
//ここで初期化しとかないと前のやつも足されていってしまう
sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0) {
ans++;
}
}
cout << ans << endl;
} | [
"assignment.add"
] | 909,412 | 909,413 | u845882023 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 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 (ans + C > 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 sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0) {
ans++;
}
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 909,414 | 909,415 | u552201227 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int ans = 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 (ans + C > 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 sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0) {
ans++;
}
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 909,417 | 909,415 | u552201227 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int ans = 0;
int check = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
check = check + B.at(j) * A.at(i).at(j);
}
if (check + C > 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);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int ans = 0;
int check = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
check = check + B.at(j) * A.at(i).at(j);
}
if (check + C > 0) {
ans++;
}
check = 0;
}
cout << ans << endl;
}
| [
"assignment.add"
] | 909,418 | 909,419 | u548596361 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int M, N, C, success = 0, s = 0, i, j;
cin >> N >> M >> C;
int B[M];
for (i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
s += A[i][j] * B[j];
}
if (s + C > 0) {
success++;
}
}
cout << success << endl;
} | #include <iostream>
using namespace std;
int main() {
int M, N, C, success = 0, s = 0, i, j;
cin >> N >> M >> C;
int B[M];
for (i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
s += A[i][j] * B[j];
}
if (s + C > 0) {
success++;
}
s = 0;
}
cout << success << endl;
} | [
"assignment.add"
] | 909,424 | 909,425 | u491789916 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.