problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02410 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
// const int MOD = 1000000007;
// const int INF = 1<<30;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m], b[m];
// 行列
rep1(i, n) {
rep1(j, m) { cin >> a[i][j]; }
}
// 列ベクトル
rep1(i, m) cin >> b[i];
// 計算と表示
rep1(i, n) {
int c = 0;
rep1(j, m) { c += a[i][j] * b[j]; }
cout << c << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
// const int MOD = 1000000007;
// const int INF = 1<<30;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n + 10][m + 10], b[m + 10];
// 行列
rep1(i, n) {
rep1(j, m) { cin >> a[i][j]; }
}
// 列ベクトル
rep1(i, m) cin >> b[i];
// 計算と表示
rep1(i, n) {
int c = 0;
rep1(j, m) { c += a[i][j] * b[j]; }
cout << c << endl;
}
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p02410 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int gyo, retu;
int sum[100] = {0};
int vec1[retu][gyo];
int vec2[gyo];
cin >> retu >> gyo;
for (int i = 0; i < retu; i++) {
for (int j = 0; j < gyo; j++) {
cin >> vec1[i][j];
}
}
for (int i = 0; i < gyo; i++) {
cin >> vec2[i];
}
for (int i = 0; i < retu; i++) {
for (int j = 0; j < gyo; j++) {
sum[i] += vec1[i][j] * vec2[j];
}
cout << sum[i] << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int gyo, retu;
int sum[100] = {0};
int vec1[100][100];
int vec2[100];
cin >> retu >> gyo;
for (int i = 0; i < retu; i++) {
for (int j = 0; j < gyo; j++) {
cin >> vec1[i][j];
}
}
for (int i = 0; i < gyo; i++) {
cin >> vec2[i];
}
for (int i = 0; i < retu; i++) {
for (int j = 0; j < gyo; j++) {
sum[i] += vec1[i][j] * vec2[j];
}
cout << sum[i] << endl;
}
} | replace | 7 | 9 | 7 | 9 | -11 | |
p02410 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(n, 0));
vector<int> b(m, 0), c(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int j = 0; j < m; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
cout << c[i] << "\n";
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m, 0));
vector<int> b(m, 0), c(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int j = 0; j < m; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
cout << c[i] << "\n";
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02410 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
int A[n][m];
int b[m];
long long ans[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans[i] = 0;
for (int j = 0; i < m; j++) {
ans[i] += A[i][j] * b[j];
}
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
int A[n][m];
int b[m];
long long ans[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans[i] = 0;
for (int j = 0; j < m; j++) {
ans[i] += A[i][j] * b[j];
}
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
return 0;
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02410 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int column, row, res;
cin >> column >> row;
int matrix[100][100], vector_a[row];
for (int i = 1; i <= column; i++) {
for (int j = 1; j <= row; j++) {
cin >> matrix[i][j];
}
}
for (int i = 1; i <= row; i++) {
cin >> vector_a[i];
}
for (int i = 1; i <= column; i++) {
res = 0;
for (int j = 1; j <= row; j++) {
res += matrix[i][j] * vector_a[j];
}
cout << res << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int column, row, res;
cin >> column >> row;
int matrix[101][101], vector_a[101];
for (int i = 1; i <= column; i++) {
for (int j = 1; j <= row; j++) {
cin >> matrix[i][j];
}
}
for (int i = 1; i <= row; i++) {
cin >> vector_a[i];
}
for (int i = 1; i <= column; i++) {
res = 0;
for (int j = 1; j <= row; j++) {
res += matrix[i][j] * vector_a[j];
}
cout << res << endl;
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02410 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int i, j;
cin >> n >> m;
vector<vector<int>> A;
A.resize(n);
for (i = 0; i < n; i++) {
A[i].resize(m);
}
vector<int> b(m), c(m);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> A[i][j];
}
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
c[i] += A[i][j] * b[j];
}
}
for (i = 0; i < n; i++) {
cout << c[i] << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int i, j;
cin >> n >> m;
vector<vector<int>> A;
A.resize(n);
for (i = 0; i < n; i++) {
A[i].resize(m);
}
vector<int> b(m), c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> A[i][j];
}
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
c[i] += A[i][j] * b[j];
}
}
for (i = 0; i < n; i++) {
cout << c[i] << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02410 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n = 0;
long m = 0;
cin >> n >> m;
vector<vector<long>> a(n);
vector<long> b(m, 0);
vector<long> c(m, 0);
for (long i = 0; i < n; i++) {
a[i].resize(m);
}
for (long i = 0; i < n; i++) {
for (long j = 0; j < m; j++) {
a[i][j] = 0;
cin >> a[i][j];
}
}
for (long i = 0; i < m; i++) {
cin >> b[i];
}
for (long i = 0; i < n; i++) {
for (long j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
}
for (long i = 0; i < n; i++) {
cout << c[i] << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n = 0;
long m = 0;
cin >> n >> m;
vector<vector<long>> a(n);
vector<long> b(m, 0);
vector<long> c(n, 0);
for (long i = 0; i < n; i++) {
a[i].resize(m);
}
for (long i = 0; i < n; i++) {
for (long j = 0; j < m; j++) {
a[i][j] = 0;
cin >> a[i][j];
}
}
for (long i = 0; i < m; i++) {
cin >> b[i];
}
for (long i = 0; i < n; i++) {
for (long j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
}
for (long i = 0; i < n; i++) {
cout << c[i] << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02410 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, start, n) for (int i = start; i < n; i++)
#define And &&
#define Or ||
#define Lb cout << endl
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
vector<int> b(m);
vector<long long> c(m);
//????????????
rep(i, 0, n) {
rep(j, 0, m) { cin >> a[i][j]; }
}
rep(i, 0, m) { cin >> b[i]; }
rep(i, 0, n) {
c[i] = 0;
rep(j, 0, m) { c[i] += a[i][j] * b[j]; }
}
rep(i, 0, n) { cout << c[i] << endl; }
return 0;
} | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, start, n) for (int i = start; i < n; i++)
#define And &&
#define Or ||
#define Lb cout << endl
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
vector<int> b(m);
vector<long long> c(n);
//????????????
rep(i, 0, n) {
rep(j, 0, m) { cin >> a[i][j]; }
}
rep(i, 0, m) { cin >> b[i]; }
rep(i, 0, n) {
c[i] = 0;
rep(j, 0, m) { c[i] += a[i][j] * b[j]; }
}
rep(i, 0, n) { cout << c[i] << endl; }
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02410 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int row, line, input, result;
cin >> row >> line;
vector<vector<int>> matrix1(4);
vector<int> matrix2;
for (int i = 0; i < row; i++) {
for (int j = 0; j < line; j++) {
cin >> input;
matrix1[i].push_back(input);
}
}
for (int i = 0; i < line; i++) {
cin >> input;
matrix2.push_back(input);
}
for (int i = 0; i < row; i++) {
result = 0;
for (int j = 0; j < line; j++) {
result += matrix1[i][j] * matrix2[j];
}
cout << result << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int row, line, input, result;
cin >> row >> line;
vector<vector<int>> matrix1(row);
vector<int> matrix2;
for (int i = 0; i < row; i++) {
for (int j = 0; j < line; j++) {
cin >> input;
matrix1[i].push_back(input);
}
}
for (int i = 0; i < line; i++) {
cin >> input;
matrix2.push_back(input);
}
for (int i = 0; i < row; i++) {
result = 0;
for (int j = 0; j < line; j++) {
result += matrix1[i][j] * matrix2[j];
}
cout << result << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02410 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int **a, *b, *c, n, m, num;
cin >> n >> m;
a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
} // a[n][m]
b = new int[m];
c = new int[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> num;
a[i][j] = num;
}
}
for (int i = 0; i < m; i++) {
cin >> num;
b[i] = num;
}
for (int i = 0; i < n; i++) {
c[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
cout << c[i] << endl;
}
delete[] b;
delete[] c;
for (int i = 0; i < m; i++) {
delete[] a[i];
}
delete[] a;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int **a, *b, *c, n, m, num;
cin >> n >> m;
a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
} // a[n][m]
b = new int[m];
c = new int[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> num;
a[i][j] = num;
}
}
for (int i = 0; i < m; i++) {
cin >> num;
b[i] = num;
}
for (int i = 0; i < n; i++) {
c[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
cout << c[i] << endl;
}
return 0;
} | delete | 38 | 45 | 38 | 38 | -11 | |
p02410 | Python | Runtime Error | n, m = map(int, input().split())
a = []
b = []
for i in range(n):
a += list(map(int, input().split()))
for i in range(m):
b.append(int(input()))
for i in range(n):
c = 0
for j in range(m):
c += a[i][j] * b[j]
print(c)
| n, m = map(int, input().split())
a = []
b = []
for i in range(n):
a.append(list(map(int, input().split())))
for i in range(m):
b.append(int(input()))
for i in range(n):
c = 0
for j in range(m):
c += a[i][j] * b[j]
print(c)
| replace | 4 | 5 | 4 | 5 | TypeError: 'int' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02410/Python/s162375212.py", line 11, in <module>
c += a[i][j] * b[j]
TypeError: 'int' object is not subscriptable
|
p02410 | Python | Runtime Error | n, m = map(int, input().split())
a = [[None] * n]
b = [None] * m
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(m):
b[i] = int(input())
for i in range(n):
c = 0
for j in range(m):
c += a[i][j] * b[j]
print(c)
| n, m = map(int, input().split())
a = [None] * n
b = [None] * m
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(m):
b[i] = int(input())
for i in range(n):
c = 0
for j in range(m):
c += a[i][j] * b[j]
print(c)
| replace | 1 | 2 | 1 | 2 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02410/Python/s486424590.py", line 5, in <module>
a[i] = list(map(int, input().split()))
IndexError: list assignment index out of range
|
p02410 | Python | Runtime Error | n, m = map(int, input().split())
List1 = [[0 for i in range(m)] for i in range(n)]
for x in range(n):
List1[x] = list(map(int, input().split()))
List2 = [int(input()) for _ in range(n)]
sum = [0 for i in range(n)]
for x in range(n):
for y in range(m):
sum[x] += List1[x][y] * List2[y]
for x in range(n):
print(sum[x])
| n, m = map(int, input().split())
List1 = [[0 for i in range(m)] for i in range(n)]
for x in range(n):
List1[x] = list(map(int, input().split()))
List2 = [int(input()) for i in range(m)]
sum = [0 for i in range(n)]
for x in range(n):
for y in range(m):
sum[x] += List1[x][y] * List2[y]
for x in range(n):
print(sum[x])
| replace | 4 | 5 | 4 | 5 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02410/Python/s586106678.py", line 9, in <module>
sum[x] += List1[x][y] * List2[y]
IndexError: list index out of range
|
p02410 | Python | Runtime Error | n, m = [int(i) for i in input().split()]
a = [[int(j) for j in input().split()] for i in range(n)]
b = [int(input()) for i in range(m)]
ans = [sum([a[j][i] * b[i] for i in range(4)]) for j in range(3)]
print(*ans, sep="\n")
| n, m = [int(i) for i in input().split()]
a = [[int(j) for j in input().split()] for i in range(n)]
b = [int(input()) for i in range(m)]
ans = [sum([a[j][i] * b[i] for i in range(m)]) for j in range(n)]
print(*ans, sep="\n")
| replace | 4 | 5 | 4 | 5 | 0 | |
p02410 | Python | Runtime Error | n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
b = [int(input()) for _ in range(m)]
for i in a:
c = 0
for j, k in i, b:
c += j * k
print(c)
| n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
b = [int(input()) for _ in range(m)]
for i in a:
c = 0
for j, k in zip(i, b):
c += j * k
print(c)
| replace | 5 | 6 | 5 | 6 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02410/Python/s783362048.py", line 6, in <module>
for j, k in i, b:
ValueError: too many values to unpack (expected 2)
|
p02410 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[100][100], b[100], i, j;
int c[100];
cin >> i >> j;
for (int m = 1; m <= i; m++) {
for (int n = 1; n <= j; n++) {
cin >> a[m][n];
c[n] = 0;
}
}
for (int o = 1; o <= j; o++) {
cin >> b[o];
}
for (int l = 1; l <= i; l++) {
for (int k = 1; k <= j; k++) {
c[l] += b[k] * a[l][k];
}
}
for (int h = 1; h <= i; h++) {
cout << c[h] << endl;
}
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[1000][1000], b[1000], i, j;
int c[1000];
cin >> i >> j;
for (int m = 1; m <= i; m++) {
for (int n = 1; n <= j; n++) {
cin >> a[m][n];
c[n] = 0;
}
}
for (int o = 1; o <= j; o++) {
cin >> b[o];
}
for (int l = 1; l <= i; l++) {
for (int k = 1; k <= j; k++) {
c[l] += b[k] * a[l][k];
}
}
for (int h = 1; h <= i; h++) {
cout << c[h] << endl;
}
return 0;
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02410 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(n);
vector<vector<int>> mx(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> mx[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
ans += mx[i][j] * v[j];
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(m);
vector<vector<int>> mx(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> mx[i][j];
}
}
for (int i = 0; i < m; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < m; j++) {
ans += mx[i][j] * v[j];
}
cout << ans << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
cin >> m >> f >> r;
while (m != -1 || f != -1 || r != -1) {
if (m == -1 || f == -1) {
cout << "F" << endl;
} else if (m + f >= 80) {
cout << "A" << endl;
} else if (m + f < 80 && m + f >= 65) {
cout << "B" << endl;
} else if (m + f < 65 && m + f >= 50) {
cout << "C" << endl;
} else if (m + f < 50 && m + f >= 30) {
if (r >= 50) {
cout << "C" << endl;
} else {
cout << "D" << endl;
}
} else {
cout << "F" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int m, f, r;
cin >> m >> f >> r;
while (m != -1 || f != -1 || r != -1) {
if (m == -1 || f == -1) {
cout << "F" << endl;
} else if (m + f >= 80) {
cout << "A" << endl;
} else if (m + f < 80 && m + f >= 65) {
cout << "B" << endl;
} else if (m + f < 65 && m + f >= 50) {
cout << "C" << endl;
} else if (m + f < 50 && m + f >= 30) {
if (r >= 50) {
cout << "C" << endl;
} else {
cout << "D" << endl;
}
} else {
cout << "F" << endl;
}
cin >> m >> f >> r;
}
return 0;
}
| insert | 26 | 26 | 26 | 27 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, sum, r;
char rank;
cin >> m >> f >> r;
while ((m & f & r) != -1) {
if (m < 0 || f < 0) {
rank = 'F';
} else {
sum = m + f;
if (sum < 30) {
rank = 'F';
} else if (sum < 50) {
rank = 'D';
if (r > 49)
rank = 'C';
} else if (sum < 65) {
rank = 'C';
} else if (sum < 80) {
rank = 'B';
} else {
rank = 'A';
}
}
cout << rank << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int m, f, sum, r;
char rank;
cin >> m >> f >> r;
while ((m & f & r) != -1) {
if (m < 0 || f < 0) {
rank = 'F';
} else {
sum = m + f;
if (sum < 30) {
rank = 'F';
} else if (sum < 50) {
rank = 'D';
if (r > 49)
rank = 'C';
} else if (sum < 65) {
rank = 'C';
} else if (sum < 80) {
rank = 'B';
} else {
rank = 'A';
}
}
cout << rank << endl;
cin >> m >> f >> r;
}
return 0;
} | insert | 29 | 29 | 29 | 30 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> r >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
cout << 'F' << endl;
} else if (m + f >= 80) {
cout << 'A' << endl;
} else if (m + f >= 65) {
cout << 'B' << endl;
} else if (m + f >= 50) {
cout << 'C' << endl;
} else if (m + f >= 30) {
if (r >= 50) {
cout << 'C' << endl;
} else {
cout << 'D' << endl;
}
} else {
cout << 'F' << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
cout << 'F' << endl;
} else if (m + f >= 80) {
cout << 'A' << endl;
} else if (m + f >= 65) {
cout << 'B' << endl;
} else if (m + f >= 50) {
cout << 'C' << endl;
} else if (m + f >= 30) {
if (r >= 50) {
cout << 'C' << endl;
} else {
cout << 'D' << endl;
}
} else {
cout << 'F' << endl;
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
int m, f, r, p;
while (1) {
scanf("%d %d %D", &m, &f, &r);
if (m == -1 && f == -1 && r == -1)
break;
p = m + f;
if (m == -1 || f == -1) {
printf("F\n");
} else if (p >= 80) {
printf("A\n");
} else if (65 <= p && p < 80) {
printf("B\n");
} else if (50 <= p && p < 65 || r >= 50) {
printf("C\n");
} else if (30 <= p && p < 50) {
printf("D\n");
} else if (p < 30) {
printf("F\n");
}
}
return 0;
} | #include <cstdio>
int main() {
int m, f, r, p;
while (1) {
scanf("%d %d %d", &m, &f, &r);
if (m == -1 && f == -1 && r == -1)
break;
p = m + f;
if (m == -1 || f == -1) {
printf("F\n");
} else if (p >= 80) {
printf("A\n");
} else if (65 <= p && p < 80) {
printf("B\n");
} else if (50 <= p && p < 65 || r >= 50) {
printf("C\n");
} else if (30 <= p && p < 50) {
printf("D\n");
} else if (p < 30) {
printf("F\n");
}
}
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m[100];
int f[100];
int r[100];
while (true) {
int i = 0;
cin >> m[i] >> f[i] >> r[i];
if (m[i] == 0 && f[i] == 0 && r[i] == 0)
break;
int sum[100];
sum[i] = m[i] + f[i];
if (m[i] == -1 || f[i] == -1 || sum[i] < 30) {
cout << "F" << endl;
} else {
if (sum[i] >= 80) {
cout << "A" << endl;
}
if (65 <= sum[i] && sum[i] < 80) {
cout << "B" << endl;
}
if (50 <= sum[i] && sum[i] < 65) {
cout << "C" << endl;
}
if (30 <= sum[i] && sum[i] < 50) {
if (r[i] >= 50) {
cout << "C" << endl;
} else {
cout << "D" << endl;
}
}
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int m[100];
int f[100];
int r[100];
while (true) {
int i = 0;
cin >> m[i] >> f[i] >> r[i];
if (m[i] == -1 && f[i] == -1 && r[i] == -1)
break;
int sum[100];
sum[i] = m[i] + f[i];
if (m[i] == -1 || f[i] == -1 || sum[i] < 30) {
cout << "F" << endl;
} else {
if (sum[i] >= 80) {
cout << "A" << endl;
}
if (65 <= sum[i] && sum[i] < 80) {
cout << "B" << endl;
}
if (50 <= sum[i] && sum[i] < 65) {
cout << "C" << endl;
}
if (30 <= sum[i] && sum[i] < 50) {
if (r[i] >= 50) {
cout << "C" << endl;
} else {
cout << "D" << endl;
}
}
}
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
char grade;
while (true) {
cin >> m >> f >> r;
if (m == 0 && f == 0) {
break;
}
if (m == -1 || f == -1) {
grade = 'F';
} else if (m + f >= 80) {
grade = 'A';
} else if (m + f >= 65) {
grade = 'B';
} else if (m + f >= 50) {
grade = 'C';
} else if (m + f >= 30) {
if (r >= 50) {
grade = 'C';
} else {
grade = 'D';
}
} else {
grade = 'F';
}
cout << grade << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int m, f, r;
char grade;
while (true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
grade = 'F';
} else if (m + f >= 80) {
grade = 'A';
} else if (m + f >= 65) {
grade = 'B';
} else if (m + f >= 50) {
grade = 'C';
} else if (m + f >= 30) {
if (r >= 50) {
grade = 'C';
} else {
grade = 'D';
}
} else {
grade = 'F';
}
cout << grade << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02411 | C++ | Runtime Error | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
int m, f, r, sum;
while (1) {
cin >> m >> f >> r;
sum = m + f;
if ((m == -1) & (f == -1) & (r == -1)) {
return -1;
} else if (m * f < 0) {
cout << "F" << endl;
} else {
if (sum >= 80)
cout << "A" << endl;
else if (sum >= 65)
cout << "B" << endl;
else if (sum >= 50)
cout << "C" << endl;
else if (sum >= 30) {
if (r >= 50)
cout << "C" << endl;
else
cout << "D" << endl;
} else
cout << "F" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
int m, f, r, sum;
while (1) {
cin >> m >> f >> r;
sum = m + f;
if ((m == -1) & (f == -1) & (r == -1)) {
return 0;
} else if (m * f < 0) {
cout << "F" << endl;
} else {
if (sum >= 80)
cout << "A" << endl;
else if (sum >= 65)
cout << "B" << endl;
else if (sum >= 50)
cout << "C" << endl;
else if (sum >= 30) {
if (r >= 50)
cout << "C" << endl;
else
cout << "D" << endl;
} else
cout << "F" << endl;
}
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | 255 | |
p02411 | C++ | Time Limit Exceeded | #include "iostream"
using namespace std;
int main() {
int m, f, r = 0;
bool flag = true;
while (flag == true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
flag == false;
else {
if (m == -1 || f == -1)
cout << "F";
else if (m + f >= 80)
cout << "A";
else if (m + f >= 65)
cout << "B";
else if (m + f >= 50)
cout << "C";
else if (m + f >= 30 && r >= 50)
cout << "C";
else if (m + f >= 30)
cout << "D";
else
cout << "F";
cout << endl;
}
}
} | #include "iostream"
using namespace std;
int main() {
int m, f, r = 0;
bool flag = true;
while (flag == true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
flag = false;
else {
if (m == -1 || f == -1)
cout << "F";
else if (m + f >= 80)
cout << "A";
else if (m + f >= 65)
cout << "B";
else if (m + f >= 50)
cout << "C";
else if (m + f >= 30 && r >= 50)
cout << "C";
else if (m + f >= 30)
cout << "D";
else
cout << "F";
cout << endl;
}
}
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (1) {
int m, f, r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 or f == -1) {
cout << "F" << endl;
} else if (m + f > 79) {
cout << "A" << endl;
} else if (m + f < 80 && m + f > 64) {
cout << "B" << endl;
} else if (m + f < 65 && m + f > 49) {
cout << "C" << endl;
} else if (m + f < 50 && m + f > 29 && r > 49) {
cout << "C" << endl;
} else if (m + f < 50 && m + f > 29) {
cout << "D" << endl;
} else {
cout << "F" << endl;
}
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (1) {
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 or f == -1) {
cout << "F" << endl;
} else if (m + f > 79) {
cout << "A" << endl;
} else if (m + f < 80 && m + f > 64) {
cout << "B" << endl;
} else if (m + f < 65 && m + f > 49) {
cout << "C" << endl;
} else if (m + f < 50 && m + f > 29 && r > 49) {
cout << "C" << endl;
} else if (m + f < 50 && m + f > 29) {
cout << "D" << endl;
} else {
cout << "F" << endl;
}
}
return 0;
}
| insert | 23 | 23 | 23 | 24 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (cin >> m >> f >> r, m != 0 || f != 0 || r != 0) {
if (m + f >= 80)
cout << 'A';
else if (m + f >= 65)
cout << 'B';
else if (m + f >= 50)
cout << 'C';
else if (m + f >= 30) {
if (r >= 50)
cout << 'C';
else
cout << 'D';
} else
cout << 'F';
cout << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (cin >> m >> f >> r, m != -1 || f != -1 || r != -1) {
if (m == -1 || f == -1)
cout << 'F';
else if (m + f >= 80)
cout << 'A';
else if (m + f >= 65)
cout << 'B';
else if (m + f >= 50)
cout << 'C';
else if (m + f >= 30) {
if (r >= 50)
cout << 'C';
else
cout << 'D';
} else
cout << 'F';
cout << endl;
}
} | replace | 6 | 8 | 6 | 10 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (true) {
cin >> m >> f >> r;
if (m == f == r == -1)
break;
if (m == -1 || f == -1)
cout << 'F' << endl;
else if (m + f >= 80)
cout << 'A' << endl;
else if (m + f >= 65)
cout << 'B' << endl;
else if (m + f >= 50)
cout << 'C' << endl;
else if (m + f >= 30) {
if (r >= 50)
cout << 'C' << endl;
else
cout << 'D' << endl;
} else
cout << 'F' << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
cout << 'F' << endl;
else if (m + f >= 80)
cout << 'A' << endl;
else if (m + f >= 65)
cout << 'B' << endl;
else if (m + f >= 50)
cout << 'C' << endl;
else if (m + f >= 30) {
if (r >= 50)
cout << 'C' << endl;
else
cout << 'D' << endl;
} else
cout << 'F' << endl;
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -2 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
cout << 'F' << endl;
else if (m + f >= 80)
cout << 'A' << endl;
else if (m + f >= 65)
cout << 'B' << endl;
else if (m + f >= 50)
cout << 'C' << endl;
else if (m + f >= 30) {
if (r >= 50)
cout << 'C' << endl;
else
cout << 'D' << endl;
} else
cout << 'F' << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
cout << 'F' << endl;
else if (m + f >= 80)
cout << 'A' << endl;
else if (m + f >= 65)
cout << 'B' << endl;
else if (m + f >= 50)
cout << 'C' << endl;
else if (m + f >= 30) {
if (r >= 50)
cout << 'C' << endl;
else
cout << 'D' << endl;
} else
cout << 'F' << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
char grade;
int m, f, r;
cin >> m >> f >> r;
if (m == 0 && f == 0 && r == 0)
break;
if (m == -1 || f == -1) {
grade = 'F';
} else if (m + f >= 80) {
grade = 'A';
} else if (m + f >= 65) {
grade = 'B';
} else if (m + f >= 50) {
grade = 'C';
} else if (m + f >= 30) {
(r >= 50) ? grade = 'C' : grade = 'D';
} else {
grade = 'F';
}
cout << grade << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
char grade;
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1) {
grade = 'F';
} else if (m + f >= 80) {
grade = 'A';
} else if (m + f >= 65) {
grade = 'B';
} else if (m + f >= 50) {
grade = 'C';
} else if (m + f >= 30) {
(r >= 50) ? grade = 'C' : grade = 'D';
} else {
grade = 'F';
}
cout << grade << endl;
}
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
while (1) {
int m, f, r;
std::cin >> m >> f >> r;
if (m == -1 || f == -1) {
std::cout << "F" << std::endl;
} else if (m + f < 30) {
std::cout << "F" << std::endl;
} else if (m + f < 50 && r >= 50) {
std::cout << "C" << std::endl;
} else if (m + f < 50) {
std::cout << "D" << std::endl;
} else if (m + f < 65) {
std::cout << "C" << std::endl;
} else if (m + f < 80) {
std::cout << "B" << std::endl;
} else {
std::cout << "A" << std::endl;
}
}
return 0;
} | #include <iostream>
int main() {
while (1) {
int m, f, r;
std::cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
std::cout << "F" << std::endl;
} else if (m + f < 30) {
std::cout << "F" << std::endl;
} else if (m + f < 50 && r >= 50) {
std::cout << "C" << std::endl;
} else if (m + f < 50) {
std::cout << "D" << std::endl;
} else if (m + f < 65) {
std::cout << "C" << std::endl;
} else if (m + f < 80) {
std::cout << "B" << std::endl;
} else {
std::cout << "A" << std::endl;
}
}
return 0;
} | insert | 9 | 9 | 9 | 12 | TLE | |
p02411 | C++ | Runtime Error | #include <stdio.h>
typedef struct GRADE {
int m; //??????????¨?????????°???
int f; //??????????¨?????????°
int r; //???????¨?????????°
char grad; //??????
};
int main() {
GRADE std[10];
int i = 0, j;
int sum, sum2;
while (1) {
scanf("%d %d %d", &std[i].m, &std[i].f, &std[i].r);
if (std[i].m == -1 && std[i].f == -1 && std[i].r == -1) {
break;
}
i++;
}
for (j = 0; j < i; j++) {
sum = std[j].m + std[j].f;
sum2 = std[j].r;
if (sum < 30 || std[j].m == -1 || std[j].f == -1) {
std[j].grad = 'F';
} else if (sum >= 80) {
std[j].grad = 'A';
} else if (sum >= 65 && sum < 80) {
std[j].grad = 'B';
} else if ((sum >= 50 && sum < 65) || sum2 >= 50) {
std[j].grad = 'C';
} else if (sum >= 30 && sum < 50) {
std[j].grad = 'D';
}
printf("%c\n", std[j].grad);
}
return 0;
} | #include <stdio.h>
typedef struct GRADE {
int m; //??????????¨?????????°???
int f; //??????????¨?????????°
int r; //???????¨?????????°
char grad; //??????
};
int main() {
GRADE std[100];
int i = 0, j;
int sum, sum2;
while (1) {
scanf("%d %d %d", &std[i].m, &std[i].f, &std[i].r);
if (std[i].m == -1 && std[i].f == -1 && std[i].r == -1) {
break;
}
i++;
}
for (j = 0; j < i; j++) {
sum = std[j].m + std[j].f;
sum2 = std[j].r;
if (sum < 30 || std[j].m == -1 || std[j].f == -1) {
std[j].grad = 'F';
} else if (sum >= 80) {
std[j].grad = 'A';
} else if (sum >= 65 && sum < 80) {
std[j].grad = 'B';
} else if ((sum >= 50 && sum < 65) || sum2 >= 50) {
std[j].grad = 'C';
} else if (sum >= 30 && sum < 50) {
std[j].grad = 'D';
}
printf("%c\n", std[j].grad);
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
int main(int argc, char const *argv[]) {
int m, f, r;
std::cin >> m >> f >> r;
while (!(m == -1 && m == f && m == r)) {
if (m == -1 || f == -1 || m + f < 30) {
std::cout << "F";
} else if (m + f >= 80) {
std::cout << "A";
} else if (m + f >= 65) {
std::cout << "B";
} else if (m + f >= 50) {
std::cout << "C";
} else {
if (r >= 50) {
std::cout << "C";
} else {
std::cout << "D";
}
}
std::cout << std::endl;
}
} | #include <iostream>
int main(int argc, char const *argv[]) {
int m, f, r;
std::cin >> m >> f >> r;
while (!(m == -1 && m == f && m == r)) {
if (m == -1 || f == -1 || m + f < 30) {
std::cout << "F";
} else if (m + f >= 80) {
std::cout << "A";
} else if (m + f >= 65) {
std::cout << "B";
} else if (m + f >= 50) {
std::cout << "C";
} else {
if (r >= 50) {
std::cout << "C";
} else {
std::cout << "D";
}
}
std::cin >> m >> f >> r;
std::cout << std::endl;
}
} | insert | 21 | 21 | 21 | 22 | TLE | |
p02411 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 || f == -1) {
cout << 'F' << endl;
} else if (m + f >= 80) {
cout << 'A' << endl;
} else if (m + f >= 65) {
cout << 'B' << endl;
} else if (m + f >= 50) {
cout << 'C' << endl;
} else if (m + f >= 30) {
if (r >= 50) {
cout << 'C' << endl;
} else {
cout << 'D' << endl;
}
} else {
cout << 'F' << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
cout << 'F' << endl;
} else if (m + f >= 80) {
cout << 'A' << endl;
} else if (m + f >= 65) {
cout << 'B' << endl;
} else if (m + f >= 50) {
cout << 'C' << endl;
} else if (m + f >= 30) {
if (r >= 50) {
cout << 'C' << endl;
} else {
cout << 'D' << endl;
}
} else {
cout << 'F' << endl;
}
}
return 0;
} | insert | 8 | 8 | 8 | 11 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#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 <vector>
using namespace std;
int arr[100 + 5];
int n, sum;
int count1;
void dfs(int i, int x, int m) {
if (x > sum)
return;
if ((i == n)) {
// for(int i=0;i<n;i++) cout<<arr[i]<<" ";
// cout<<endl;
if (sum == x && m == 3) {
count1++;
// for(int i=0;i<n;i++) cout<<arr[i]<<" ";
// cout<<endl;
}
return;
}
dfs(i + 1, x + arr[i], m + 1);
dfs(i + 1, x, m);
return;
}
int main() {
while (cin >> n >> sum && (n || sum)) {
count1 = 0;
for (int i = 0; i < n; i++)
arr[i] = i + 1;
dfs(0, 0, 0);
cout << count1 << endl;
}
// while(1);
return 0;
}
| #include <algorithm>
#include <cctype>
#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 <vector>
using namespace std;
int arr[100 + 5];
int n, sum;
int count1;
void dfs(int i, int x, int m) {
if (x > sum)
return;
if ((i == n)) {
// for(int i=0;i<n;i++) cout<<arr[i]<<" ";
// cout<<endl;
if (sum == x && m == 3) {
count1++;
// for(int i=0;i<n;i++) cout<<arr[i]<<" ";
// cout<<endl;
}
return;
}
dfs(i + 1, x + arr[i], m + 1);
dfs(i + 1, x, m);
return;
}
int main() {
while (cin >> n >> sum && (n || sum)) {
count1 = 0;
for (int i = 0; i < n; i++)
arr[i] = i + 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
if ((arr[i] + arr[j] + arr[k]) == sum)
count1++;
}
}
}
cout << count1 << endl;
}
// while(1);
return 0;
}
| replace | 44 | 45 | 44 | 52 | TLE | |
p02412 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, n, c = 0;
while (1) {
c = 0;
cin >> a >> n;
if (a == 0 && n == 0)
break;
for (int i = 1; i <= a; i++)
for (int j = i + 1; j <= a; j++)
for (int k = j + 1; k <= a; k++)
if (i + j + k == n)
c++;
cout << c << '\n';
}
return 4;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, n, c = 0;
while (1) {
c = 0;
cin >> a >> n;
if (a == 0 && n == 0)
break;
for (int i = 1; i <= a; i++)
for (int j = i + 1; j <= a; j++)
for (int k = j + 1; k <= a; k++)
if (i + j + k == n)
c++;
cout << c << '\n';
}
return 0;
} | replace | 17 | 18 | 17 | 18 | 4 | |
p02412 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x;
while (cin >> n >> x) {
if (n == 0 && x == 0)
break;
long long int cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i >= x - i - j || j >= x - i - j)
continue;
if (x - i - j <= n && x - i - j > 0)
cnt++;
if (x - i - j <= n && x - i - j > 0)
cerr << i << " " << j << " " << x - i - j << endl;
}
}
cout << cnt << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, x;
while (cin >> n >> x) {
if (n == 0 && x == 0)
break;
long long int cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i >= x - i - j || j >= x - i - j)
continue;
if (x - i - j <= n && x - i - j > 0)
cnt++;
}
}
cout << cnt << endl;
}
return 0;
} | delete | 22 | 24 | 22 | 22 | 0 | 1 3 5
2 3 4
|
p02412 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, x;
while (1) {
int cnt = 0;
cin >> n >> x;
for (int i = 1; i <= n - 2; i++) {
for (int j = i + 1; j <= n - 1; j++) {
for (int k = j + 1; k <= n; k++) {
int sum = i;
sum += k;
sum += j;
if (sum == x)
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
} | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, x;
while (1) {
int cnt = 0;
cin >> n >> x;
if (n == 0 && x == 0)
break;
for (int i = 1; i <= n - 2; i++) {
for (int j = i + 1; j <= n - 1; j++) {
for (int k = j + 1; k <= n; k++) {
int sum = i;
sum += k;
sum += j;
if (sum == x)
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
} | insert | 11 | 11 | 11 | 13 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, x;
while (true) {
int d = 0;
cin >> n >> x;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if ((i + j + k) == x)
d++;
if ((i + j + k) > x)
break;
}
}
}
cout << d << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, x;
while (true) {
int d = 0;
cin >> n >> x;
if (n == 0 && x == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if ((i + j + k) == x)
d++;
if ((i + j + k) > x)
break;
}
}
}
cout << d << endl;
}
} | insert | 8 | 8 | 8 | 10 | TLE | |
p02412 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int Ans[1000][3000];
int n[100000], x[100000];
int c = 0;
memset(Ans, 0, sizeof(Ans));
for (int i = 3; i <= 100; i++) {
for (int j = 3; j <= i; j++) {
for (int k = 2; k < j; k++) {
for (int l = 1; l < k; l++) {
Ans[i][j + k + l]++;
}
}
}
}
for (int i = 1; i <= 100000; i++) {
cin >> n[i] >> x[i];
if (x[i] == 0 && n[i] == 0) {
goto Exit;
}
c++;
}
Exit:
for (int i = 1; i <= c; i++) {
cout << Ans[n[i]][x[i]] << endl;
}
return 0;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int Ans[500][1000];
int n[100000], x[100000];
int c = 0;
memset(Ans, 0, sizeof(Ans));
for (int i = 3; i <= 100; i++) {
for (int j = 3; j <= i; j++) {
for (int k = 2; k < j; k++) {
for (int l = 1; l < k; l++) {
Ans[i][j + k + l]++;
}
}
}
}
for (int i = 1; i <= 100000; i++) {
cin >> n[i] >> x[i];
if (x[i] == 0 && n[i] == 0) {
goto Exit;
}
c++;
}
Exit:
for (int i = 1; i <= c; i++) {
cout << Ans[n[i]][x[i]] << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02412 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int count(int n, int x) {
int cnt = 0;
for (int i = 1; i <= n - 2; i++) {
for (int j = 1 + i; j = n - 1; j++) {
for (int k = j + 1; k <= n; k++) {
if (i + j + k == x)
cnt++;
}
}
}
return cnt;
}
int main() {
int n, x;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
cout << count(n, x) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int count(int n, int x) {
int cnt = 0;
for (int i = 1; i <= n - 2; i++) {
for (int j = 1 + i; j <= n - 1; j++) {
for (int k = j + 1; k <= n; k++) {
if (i + j + k == x)
cnt++;
}
}
}
return cnt;
}
int main() {
int n, x;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
cout << count(n, x) << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, n, x;
while (1) {
a = 0;
cin >> n >> x;
if (n == 0 && x == 0) {
break;
} else {
for (int h = 1; h <= n; h++) {
for (int i = h + 1; i <= n; i++) {
for (int j = i + 1; j <= n; i++) {
if (h + i + j == x) {
a += 1;
}
}
}
}
cout << a << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, n, x;
while (1) {
a = 0;
cin >> n >> x;
if (n == 0 && x == 0) {
break;
} else {
for (int h = 1; h <= n; h++) {
for (int i = h + 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (h + i + j == x) {
a += 1;
}
}
}
}
cout << a << endl;
}
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int n, x;
int loop(int cnt, int sum, int plus) {
if (cnt == 3 && sum == x) {
return 1;
}
if (plus > n) {
return 0;
}
return loop(cnt + 1, sum + plus, plus + 1) + loop(cnt, sum, plus + 1);
}
int main() {
while (cin >> n >> x && (n != 0 || x != 0)) {
cout << loop(0, 0, 1) << endl;
}
} | #include <iostream>
using namespace std;
int n, x;
int loop(int cnt, int sum, int plus) {
if (cnt == 3) {
if (sum == x) {
return 1;
} else {
return 0;
}
}
if (plus > n) {
return 0;
}
return loop(cnt + 1, sum + plus, plus + 1) + loop(cnt, sum, plus + 1);
}
int main() {
while (cin >> n >> x && (n != 0 || x != 0)) {
cout << loop(0, 0, 1) << endl;
}
} | replace | 6 | 8 | 6 | 12 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
int n, x;
cin >> n >> x;
if (n == x && x == -1) {
return 0;
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
for (int j = i + 1; j < n + 1; j++) {
for (int k = j + 1; k < n + 1; k++) {
if (i + j + k == x) {
ans++;
}
}
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
int n, x;
cin >> n >> x;
if (n == x && x == 0) {
return 0;
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
for (int j = i + 1; j < n + 1; j++) {
for (int k = j + 1; k < n + 1; k++) {
if (i + j + k == x) {
ans++;
}
}
}
}
cout << ans << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02412 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int count(int n, int x) {
int cnt = 0;
int i, j, k;
for (i = 1; i <= n - 2; i++) {
for (j = i + 1; i <= n - 1; k++) {
for (k = j + 1; i <= n; j++) {
if (i + j + k == x)
cnt++;
}
}
}
return cnt;
}
int main() {
int n, x;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
cout << count(n, x) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int count(int n, int x) {
int cnt = 0;
int i, j, k;
for (i = 1; i <= n - 2; i++) {
for (j = i + 1; j <= n - 1; j++) {
for (k = j + 1; k <= n; k++) {
if (i + j + k == x)
cnt++;
}
}
}
return cnt;
}
int main() {
int n, x;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
cout << count(n, x) << endl;
}
return 0;
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02412 | C++ | Runtime Error | #include <iostream>
#define MAXNUM 100
#define MAXSUM 300
using namespace std;
int dp2[MAXNUM][MAXSUM];
int dp3[MAXNUM][MAXSUM];
int main() {
int n, m, i, j;
while (1) {
cin >> n >> m;
if (n == 0)
break;
for (i = 2; i <= n; i++) {
for (j = 3; j <= m; j++) {
dp2[i][j] = dp2[i - 1][j];
if (j - i > 0 && i - 1 >= j - i)
dp2[i][j]++;
dp3[i][j] = dp3[i - 1][j];
if (j - i > 0)
dp3[i][j] += dp2[i - 1][j - i];
}
}
cout << dp3[n][m] << endl;
}
return 0;
} | #include <iostream>
#define MAXNUM 200
#define MAXSUM 600
using namespace std;
int dp2[MAXNUM][MAXSUM];
int dp3[MAXNUM][MAXSUM];
int main() {
int n, m, i, j;
while (1) {
cin >> n >> m;
if (n == 0)
break;
for (i = 2; i <= n; i++) {
for (j = 3; j <= m; j++) {
dp2[i][j] = dp2[i - 1][j];
if (j - i > 0 && i - 1 >= j - i)
dp2[i][j]++;
dp3[i][j] = dp3[i - 1][j];
if (j - i > 0)
dp3[i][j] += dp2[i - 1][j - i];
}
}
cout << dp3[n][m] << endl;
}
return 0;
} | replace | 1 | 3 | 1 | 3 | 0 | |
p02412 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main(void) {
int n, x;
int tx, ty, tz;
int ans = 0;
cin >> n >> x;
while (n != -1 || x != -1) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
if (i + j + k == x && (i != j && j != k && k != i))
ans++;
}
}
}
cout << ans / 6 << "\n";
ans = 0;
cin >> n >> x;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main(void) {
int n, x;
int tx, ty, tz;
int ans = 0;
cin >> n >> x;
while (n != 0 || x != 0) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
if (i + j + k == x && (i != j && j != k && k != i))
ans++;
}
}
}
cout << ans / 6 << "\n";
ans = 0;
cin >> n >> x;
}
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02412 | C++ | Runtime Error | #include <iostream>
const int N = 100;
int main(void) {
int n = 0;
int x = 0;
std::cin >> n >> x;
while (!((n == 0) && (x == 0))) {
int count = 0;
bool generated[N][N][N] = {false};
for (int i = 1; i <= n - 2; i++) {
for (int j = 1; j <= n - 1; j++) {
for (int k = 1; k <= n; k++) {
if ((i == j) || (j == k) || (i == k)) {
continue;
}
if (generated[i][j][k]) {
continue;
}
if ((i + j + k) == x) {
count++;
generated[i][j][k] = true;
generated[i][k][j] = true;
generated[j][i][k] = true;
generated[j][k][i] = true;
generated[k][i][j] = true;
generated[k][j][i] = true;
}
}
}
}
std::cout << count << std::endl;
std::cin >> n >> x;
}
return 0;
} | #include <iostream>
const int N = 100;
int main(void) {
int n = 0;
int x = 0;
std::cin >> n >> x;
while (!((n == 0) && (x == 0))) {
int count = 0;
bool generated[N + 1][N + 1][N + 1] = {false};
for (int i = 1; i <= n - 2; i++) {
for (int j = 1; j <= n - 1; j++) {
for (int k = 1; k <= n; k++) {
if ((i == j) || (j == k) || (i == k)) {
continue;
}
if (generated[i][j][k]) {
continue;
}
if ((i + j + k) == x) {
count++;
generated[i][j][k] = true;
generated[i][k][j] = true;
generated[j][i][k] = true;
generated[j][k][i] = true;
generated[k][i][j] = true;
generated[k][j][i] = true;
}
}
}
}
std::cout << count << std::endl;
std::cin >> n >> x;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02412 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, x;
int a = 0;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; j <= n; k++) {
if (i + j + k == x)
a++;
}
}
}
cout << a << endl;
a = 0;
}
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
int a = 0;
while (1) {
cin >> n >> x;
if (n == 0 && x == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if (i + j + k == x)
a++;
}
}
}
cout << a << endl;
a = 0;
}
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02413 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, Y, a[100][100] = {0};
cin >> T >> Y;
for (int i = 0; i < T; i++) {
for (int j = 0; j < Y; j++) {
cin >> a[i][j];
a[T][j] += a[i][j];
}
}
for (int i = 0; i <= T; i++) {
for (int j = 0; j < Y; j++)
a[i][Y] += a[i][j];
}
for (int i = 0; i <= T; i++) {
for (int j = 0; j < Y; j++)
cout << a[i][j] << " ";
cout << a[i][Y] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, Y, a[1000][1000] = {0};
cin >> T >> Y;
for (int i = 0; i < T; i++) {
for (int j = 0; j < Y; j++) {
cin >> a[i][j];
a[T][j] += a[i][j];
}
}
for (int i = 0; i <= T; i++) {
for (int j = 0; j < Y; j++)
a[i][Y] += a[i][j];
}
for (int i = 0; i <= T; i++) {
for (int j = 0; j < Y; j++)
cout << a[i][j] << " ";
cout << a[i][Y] << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Runtime Error | /*
* itikara.cpp
*
* Created on: 2018/05/30
* Author: J01003
*/
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int k, b, n, c, r;
cin >> r >> c;
int hyou[101][101];
hyou[101][101] = {};
for (k = 1; k <= r; k++) {
for (b = 1; b <= c; b++) {
cin >> n;
hyou[k][b] += n;
hyou[r + 1][b] += n;
hyou[k][c + 1] += n;
hyou[r + 1][c + 1] += n;
}
}
for (k = 1; k <= r + 1; k++) {
for (b = 1; b <= c + 1; b++) {
cout << hyou[k][b];
if (b > c) {
break;
}
cout << " ";
}
cout << endl;
}
return 0;
}
| /*
* itikara.cpp
*
* Created on: 2018/05/30
* Author: J01003
*/
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int k, b, n, c, r;
cin >> r >> c;
int hyou[116][116];
for (k = 1; k <= r; k++) {
for (b = 1; b <= c; b++) {
cin >> n;
hyou[k][b] += n;
hyou[r + 1][b] += n;
hyou[k][c + 1] += n;
hyou[r + 1][c + 1] += n;
}
}
for (k = 1; k <= r + 1; k++) {
for (b = 1; b <= c + 1; b++) {
cout << hyou[k][b];
if (b > c) {
break;
}
cout << " ";
}
cout << endl;
}
return 0;
}
| replace | 12 | 14 | 12 | 13 | 0 | |
p02413 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int r, c;
cin >> r >> c;
vvi A(r + 1, vi(c + 1));
for (int i = 0; i < r; i++) {
for (int k = 0; k < c; k++) {
cin >> A[i][k];
}
}
for (int i = 0; i < r; i++) {
A[i][c] = 0;
}
for (int i = 0; i < r; i++) {
A[r][i] = 0;
}
A[r][c] = 0;
for (int i = 0; i < r; i++) {
for (int k = 0; k < c; k++) {
A[i][c] += A[i][k];
}
}
for (int i = 0; i < c; i++) {
for (int k = 0; k < r; k++) {
A[r][i] += A[k][i];
}
}
for (int i = 0; i < r; i++) {
A[r][c] += A[i][c];
}
for (int i = 0; i < r + 1; i++) {
for (int k = 0; k < c + 1; k++) {
if (k == c) {
cout << A[i][k] << endl;
} else {
cout << A[i][k] << " ";
}
}
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int r, c;
cin >> r >> c;
vvi A(r + 1, vi(c + 1));
for (int i = 0; i < r; i++) {
for (int k = 0; k < c; k++) {
cin >> A[i][k];
}
}
for (int i = 0; i < r; i++) {
A[i][c] = 0;
}
for (int i = 0; i < c; i++) {
A[r][i] = 0;
}
A[r][c] = 0;
for (int i = 0; i < r; i++) {
for (int k = 0; k < c; k++) {
A[i][c] += A[i][k];
}
}
for (int i = 0; i < c; i++) {
for (int k = 0; k < r; k++) {
A[r][i] += A[k][i];
}
}
for (int i = 0; i < r; i++) {
A[r][c] += A[i][c];
}
for (int i = 0; i < r + 1; i++) {
for (int k = 0; k < c + 1; k++) {
if (k == c) {
cout << A[i][k] << endl;
} else {
cout << A[i][k] << " ";
}
}
}
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int A[100][100] = {0};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
int num;
cin >> num;
A[i][j] = num;
}
}
// 計算処理
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
A[r][c] += A[i][j];
A[i][c] += A[i][j];
A[r][j] += A[i][j];
}
}
// 最後の表示
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j == c)
cout << A[i][j];
else
cout << A[i][j] << ' ';
}
cout << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int A[110][110] = {0};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
int num;
cin >> num;
A[i][j] = num;
}
}
// 計算処理
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
A[r][c] += A[i][j];
A[i][c] += A[i][j];
A[r][j] += A[i][j];
}
}
// 最後の表示
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j == c)
cout << A[i][j];
else
cout << A[i][j] << ' ';
}
cout << endl;
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02413 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
int r, c;
int sum = 0;
int i, j;
int m[100][100] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> m[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
m[r][j] += m[i][j];
m[i][c] += m[i][j];
}
sum += m[i][c];
}
m[r][c] = sum;
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c; j++) {
cout << m[i][j] << " ";
}
cout << m[i][c] << endl;
}
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
int r, c;
int sum = 0;
int i, j;
int m[256][256] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> m[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
m[r][j] += m[i][j];
m[i][c] += m[i][j];
}
sum += m[i][c];
}
m[r][c] = sum;
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c; j++) {
cout << m[i][j] << " ";
}
cout << m[i][c] << endl;
}
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int retsu, gyou, count, count2, masu[100][100] = {0};
cin >> retsu >> gyou;
for (count = 0; count < retsu; count++) {
for (count2 = 0; count2 < gyou; count2++) {
cin >> masu[count][count2];
masu[retsu][count2] += masu[count][count2];
masu[count][gyou] += masu[count][count2];
}
}
for (count = 0; count < retsu; count++) {
masu[retsu][gyou] += masu[count][gyou];
}
for (count = 0; count <= retsu; count++) {
for (count2 = 0; count2 <= gyou; count2++) {
if (count2 != gyou) {
cout << masu[count][count2] << ' ';
} else {
cout << masu[count][count2];
}
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int retsu, gyou, count, count2, masu[101][101] = {0};
cin >> retsu >> gyou;
for (count = 0; count < retsu; count++) {
for (count2 = 0; count2 < gyou; count2++) {
cin >> masu[count][count2];
masu[retsu][count2] += masu[count][count2];
masu[count][gyou] += masu[count][count2];
}
}
for (count = 0; count < retsu; count++) {
masu[retsu][gyou] += masu[count][gyou];
}
for (count = 0; count <= retsu; count++) {
for (count2 = 0; count2 <= gyou; count2++) {
if (count2 != gyou) {
cout << masu[count][count2] << ' ';
} else {
cout << masu[count][count2];
}
}
cout << endl;
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int table[100][100] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> table[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
table[i][c] += table[i][j];
table[r][j] += table[i][j];
}
}
for (i = 0; i < r; i++) {
table[r][c] += table[i][c];
}
for (i = 0; i <= r; i++) {
for (j = 0; j < c; j++) {
cout << table[i][j] << " ";
}
cout << table[i][c] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int table[101][101] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> table[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
table[i][c] += table[i][j];
table[r][j] += table[i][j];
}
}
for (i = 0; i < r; i++) {
table[r][c] += table[i][c];
}
for (i = 0; i <= r; i++) {
for (j = 0; j < c; j++) {
cout << table[i][j] << " ";
}
cout << table[i][c] << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int **Data = new int *[r + 2]();
for (int i = 0; i < c + 2; i++) {
Data[i] = new int[c + 2]();
}
int *rowsum = new int[r + 2]();
int *colsum = new int[c + 2]();
int sum = 0;
// Input Data
for (int n = 1; n <= r; n++) {
for (int m = 1; m <= c; m++) {
cin >> Data[n][m];
}
}
// Output Data
for (int rn = 1; rn <= r; rn++) {
for (int cn = 1; cn <= c; cn++) {
cout << Data[rn][cn] << " ";
rowsum[rn] += Data[rn][cn];
colsum[cn] += Data[rn][cn];
}
cout << rowsum[rn] << endl;
}
for (int cn = 1; cn <= c; cn++) {
cout << colsum[cn] << " ";
sum += colsum[cn];
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int **Data = new int *[r + 2]();
for (int i = 0; i < r + 2; i++) {
Data[i] = new int[c + 2]();
}
int *rowsum = new int[r + 2]();
int *colsum = new int[c + 2]();
int sum = 0;
// Input Data
for (int n = 1; n <= r; n++) {
for (int m = 1; m <= c; m++) {
cin >> Data[n][m];
}
}
// Output Data
for (int rn = 1; rn <= r; rn++) {
for (int cn = 1; cn <= c; cn++) {
cout << Data[rn][cn] << " ";
rowsum[rn] += Data[rn][cn];
colsum[cn] += Data[rn][cn];
}
cout << rowsum[rn] << endl;
}
for (int cn = 1; cn <= c; cn++) {
cout << colsum[cn] << " ";
sum += colsum[cn];
}
cout << sum << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, sum, t_sum = 0;
cin >> r >> c;
int table[100][100] = {{}};
for (int i = 0; i < r; i++) {
sum = 0;
for (int j = 0; j < c; j++) {
cin >> table[i][j];
sum += table[i][j];
table[r][j] += table[i][j];
}
table[i][c] = sum;
t_sum += sum;
}
table[r][c] = t_sum;
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c; j++) {
cout << table[i][j] << " ";
}
cout << table[i][c] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c, sum, t_sum = 0;
cin >> r >> c;
int table[101][101] = {{}};
for (int i = 0; i < r; i++) {
sum = 0;
for (int j = 0; j < c; j++) {
cin >> table[i][j];
sum += table[i][j];
table[r][j] += table[i][j];
}
table[i][c] = sum;
t_sum += sum;
}
table[r][c] = t_sum;
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c; j++) {
cout << table[i][j] << " ";
}
cout << table[i][c] << endl;
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int a[100][100] = {{}};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
a[i][c] += a[i][j];
a[r][j] += a[i][j];
a[r][c] += a[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j != c)
cout << " ";
else
cout << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int a[101][101] = {{}};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
a[i][c] += a[i][j];
a[r][j] += a[i][j];
a[r][c] += a[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j != c)
cout << " ";
else
cout << endl;
}
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, i, ii, iii, g[101][101] = {};
cin >> r >> c;
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
cin >> g[i][ii];
}
}
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
g[i][c + 1] += g[i][ii];
}
}
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
g[r + 1][ii] += g[i][ii];
}
}
for (ii = 1; ii <= c; ii++) {
g[r + 1][c + 1] += g[r + 1][ii];
}
for (i = 1; i <= r + 1; i++) {
for (ii = 1; ii <= c + 1; ii++) {
cout << g[i][ii];
if (c + 1 == ii) {
cout << endl;
} else {
cout << " ";
}
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, i, ii, iii, g[200][200] = {};
cin >> r >> c;
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
cin >> g[i][ii];
}
}
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
g[i][c + 1] += g[i][ii];
}
}
for (i = 1; i <= r; i++) {
for (ii = 1; ii <= c; ii++) {
g[r + 1][ii] += g[i][ii];
}
}
for (ii = 1; ii <= c; ii++) {
g[r + 1][c + 1] += g[r + 1][ii];
}
for (i = 1; i <= r + 1; i++) {
for (ii = 1; ii <= c + 1; ii++) {
cout << g[i][ii];
if (c + 1 == ii) {
cout << endl;
} else {
cout << " ";
}
}
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int i, j, r, c;
int array[101][101];
cin >> r >> c;
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
array[i][j] = 0;
}
}
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
cin >> array[i][j];
array[i][c + 1] += array[i][j];
array[r + 1][j] += array[i][j];
array[r + 1][c + 1] += array[i][j];
}
}
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
if (j != 1)
cout << " ";
cout << array[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i, j, r, c;
int array[102][102];
cin >> r >> c;
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
array[i][j] = 0;
}
}
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
cin >> array[i][j];
array[i][c + 1] += array[i][j];
array[r + 1][j] += array[i][j];
array[r + 1][c + 1] += array[i][j];
}
}
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
if (j != 1)
cout << " ";
cout << array[i][j];
}
cout << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define M 100
int main() {
int r, c, mat[M][M];
for (int i = 0; i < M; i++)
for (int j = 0; j < M; j++)
mat[i][j] = 0;
cin >> r >> c;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> mat[i][j];
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[i][c] += mat[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[r][j] += mat[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[r][c] += mat[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (!j)
cout << mat[i][j];
else
cout << ' ' << mat[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
#define M 1000
int main() {
int r, c, mat[M][M];
for (int i = 0; i < M; i++)
for (int j = 0; j < M; j++)
mat[i][j] = 0;
cin >> r >> c;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> mat[i][j];
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[i][c] += mat[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[r][j] += mat[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
mat[r][c] += mat[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (!j)
cout << mat[i][j];
else
cout << ' ' << mat[i][j];
}
cout << endl;
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02413 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n)-1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
using LL = long long;
int main() {
int r, c;
cin >> r >> c;
int a[100][100] = {};
int sum = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
sum += a[i][j];
}
a[i][c] = sum;
sum = 0;
}
for (int i = 0; i < c + 1; i++) {
for (int j = 0; j < r; j++) {
sum += a[j][i];
}
a[r][i] = sum;
sum = 0;
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
cout << a[i][j];
if (j != c)
cout << " ";
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n)-1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
using LL = long long;
int main() {
int r, c;
cin >> r >> c;
int a[101][101] = {};
int sum = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
sum += a[i][j];
}
a[i][c] = sum;
sum = 0;
}
for (int i = 0; i < c + 1; i++) {
for (int j = 0; j < r; j++) {
sum += a[j][i];
}
a[r][i] = sum;
sum = 0;
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
cout << a[i][j];
if (j != c)
cout << " ";
}
cout << endl;
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int table[100][100] = {0};
int r, c;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> table[i][j];
table[i][c] += table[i][j];
table[r][j] += table[i][j];
}
table[r][c] += table[i][c];
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j != c) {
cout << table[i][j] << " ";
} else {
cout << table[i][j] << endl;
}
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int table[101][101] = {0};
int r, c;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> table[i][j];
table[i][c] += table[i][j];
table[r][j] += table[i][j];
}
table[r][c] += table[i][c];
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j != c) {
cout << table[i][j] << " ";
} else {
cout << table[i][j] << endl;
}
}
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <ctype.h>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int r, c;
cin >> r >> c;
int A[100][100];
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
A[i][j] = 0;
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> A[i][j];
A[i][c] += A[i][j];
}
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
A[r][j] += A[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", A[i][j]);
if (j != c) {
putchar(' ');
}
}
putchar('\n');
}
return 0;
}
| #include <ctype.h>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int r, c;
cin >> r >> c;
int A[101][101];
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
A[i][j] = 0;
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> A[i][j];
A[i][c] += A[i][j];
}
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
A[r][j] += A[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", A[i][j]);
if (j != c) {
putchar(' ');
}
}
putchar('\n');
}
return 0;
}
| replace | 8 | 11 | 8 | 11 | 0 | |
p02413 | C++ | Runtime Error | #include <cstdio>
int main() {
int r, c;
int n[100][100] = {};
int i, j;
int sum;
scanf("%d %d", &r, &c);
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
scanf("%d", &n[i][j]);
n[r][c] += n[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
n[i][c] += n[i][j];
}
}
for (j = 0; j < c; j++) {
for (i = 0; i < r; i++) {
n[r][j] += n[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j <= c; j++) {
if (j == c) {
printf("%d", n[i][j]);
} else {
printf("%d ", n[i][j]);
}
}
printf("\n");
}
return 0;
}
| #include <cstdio>
int main() {
int r, c;
int n[101][101] = {};
int i, j;
int sum;
scanf("%d %d", &r, &c);
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
scanf("%d", &n[i][j]);
n[r][c] += n[i][j];
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
n[i][c] += n[i][j];
}
}
for (j = 0; j < c; j++) {
for (i = 0; i < r; i++) {
n[r][j] += n[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j <= c; j++) {
if (j == c) {
printf("%d", n[i][j]);
} else {
printf("%d ", n[i][j]);
}
}
printf("\n");
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int a[100][100] = {};
int r_total = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
r_total += a[i][j];
}
a[i][c] = r_total;
r_total = 0;
}
int c_total = 0;
for (int j = 0; j <= c; j++) {
for (int i = 0; i <= r; i++) {
c_total += a[i][j];
}
a[r][j] = c_total;
c_total = 0;
}
int total;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d%c", a[i][j], j < c ? ' ' : '\n');
}
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int a[101][101] = {};
int r_total = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
r_total += a[i][j];
}
a[i][c] = r_total;
r_total = 0;
}
int c_total = 0;
for (int j = 0; j <= c; j++) {
for (int i = 0; i <= r; i++) {
c_total += a[i][j];
}
a[r][j] = c_total;
c_total = 0;
}
int total;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d%c", a[i][j], j < c ? ' ' : '\n');
}
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
int x[100][100];
cin >> r >> c;
for (int yoko = 0; yoko < r; yoko++) {
x[yoko][c] = 0;
for (int tate = 0; tate < c; tate++) {
cin >> x[yoko][tate];
x[yoko][c] += x[yoko][tate];
}
}
for (int tate = 0; tate <= c; tate++) {
x[r][tate] = 0;
for (int yoko = 0; yoko < r; yoko++) {
x[r][tate] += x[yoko][tate];
}
}
for (int yoko = 0; yoko <= r; yoko++) {
for (int tate = 0; tate <= c; tate++) {
if (tate < c) {
cout << x[yoko][tate] << " ";
} else {
cout << x[yoko][tate];
}
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c;
long long x[101][101];
cin >> r >> c;
for (int yoko = 0; yoko < r; yoko++) {
x[yoko][c] = 0;
for (int tate = 0; tate < c; tate++) {
cin >> x[yoko][tate];
x[yoko][c] += x[yoko][tate];
}
}
for (int tate = 0; tate <= c; tate++) {
x[r][tate] = 0;
for (int yoko = 0; yoko < r; yoko++) {
x[r][tate] += x[yoko][tate];
}
}
for (int yoko = 0; yoko <= r; yoko++) {
for (int tate = 0; tate <= c; tate++) {
if (tate < c) {
cout << x[yoko][tate] << " ";
} else {
cout << x[yoko][tate];
}
}
cout << endl;
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, a[101][101];
cin >> r >> c;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> a[i][j];
a[i][c + 1] += a[i][j];
}
}
for (int j = 1; j <= c + 1; j++) {
for (int i = 1; i <= r; i++) {
a[r + 1][j] += a[i][j];
}
}
for (int i = 1; i <= r + 1; i++) {
for (int j = 1; j <= c + 1; j++) {
if (j == 1)
cout << a[i][j];
else
cout << " " << a[i][j];
}
cout << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c, a[1000][1000];
cin >> r >> c;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> a[i][j];
a[i][c + 1] += a[i][j];
}
}
for (int j = 1; j <= c + 1; j++) {
for (int i = 1; i <= r; i++) {
a[r + 1][j] += a[i][j];
}
}
for (int i = 1; i <= r + 1; i++) {
for (int j = 1; j <= c + 1; j++) {
if (j == 1)
cout << a[i][j];
else
cout << " " << a[i][j];
}
cout << endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
#define N 100
using namespace std;
int main() {
int r, c;
int ary[N][N];
int ans_L[N] = {0}, ans_H[N] = {0};
int sum = 0;
cin >> r >> c;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> ary[i][j];
ans_L[i] += ary[i][j];
}
}
for (int j = 1; j <= r; j++) {
for (int i = 1; i <= c; i++) {
ans_H[i] += ary[j][i];
}
}
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cout << ary[i][j] << " ";
}
cout << ans_L[i] << endl;
sum += ans_L[i];
}
for (int i = 1; i <= c; i++) {
cout << ans_H[i] << " ";
}
cout << sum << endl;
return 0;
} | #include <iostream>
#define N 101
using namespace std;
int main() {
int r, c;
int ary[N][N];
int ans_L[N] = {0}, ans_H[N] = {0};
int sum = 0;
cin >> r >> c;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> ary[i][j];
ans_L[i] += ary[i][j];
}
}
for (int j = 1; j <= r; j++) {
for (int i = 1; i <= c; i++) {
ans_H[i] += ary[j][i];
}
}
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cout << ary[i][j] << " ";
}
cout << ans_L[i] << endl;
sum += ans_L[i];
}
for (int i = 1; i <= c; i++) {
cout << ans_H[i] << " ";
}
cout << sum << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02413 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
int ans[100][100] = {0};
rep(i, n) {
rep(j, m) {
int inp;
cin >> inp;
ans[i][j] = inp;
ans[i][m] += inp;
ans[n][j] += inp;
}
ans[n][m] += ans[i][m];
}
rep(i, n + 1) {
rep(j, m + 1) {
if (j)
cout << ' ';
cout << ans[i][j];
}
cout << endl;
}
}
} | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
int ans[105][105] = {0};
rep(i, n) {
rep(j, m) {
int inp;
cin >> inp;
ans[i][j] = inp;
ans[i][m] += inp;
ans[n][j] += inp;
}
ans[n][m] += ans[i][m];
}
rep(i, n + 1) {
rep(j, m + 1) {
if (j)
cout << ' ';
cout << ans[i][j];
}
cout << endl;
}
}
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02413 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int r, c;
int hyo[100][100];
int ans, final_ans;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> hyo[i][j];
}
}
for (int i = 0; i < r; i++) {
ans = 0;
for (int j = 0; j < c; j++) {
ans += hyo[i][j];
}
hyo[i][c] = ans;
}
final_ans = 0;
for (int j = 0; j < c; j++) {
ans = 0;
for (int i = 0; i < r; i++) {
ans += hyo[i][j];
}
hyo[r][j] = ans;
final_ans += ans;
}
hyo[r][c] = final_ans;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << hyo[i][j];
if (j != c)
cout << " ";
}
cout << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int r, c;
int hyo[1000][1000];
int ans, final_ans;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> hyo[i][j];
}
}
for (int i = 0; i < r; i++) {
ans = 0;
for (int j = 0; j < c; j++) {
ans += hyo[i][j];
}
hyo[i][c] = ans;
}
final_ans = 0;
for (int j = 0; j < c; j++) {
ans = 0;
for (int i = 0; i < r; i++) {
ans += hyo[i][j];
}
hyo[r][j] = ans;
final_ans += ans;
}
hyo[r][c] = final_ans;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << hyo[i][j];
if (j != c)
cout << " ";
}
cout << endl;
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
int a[100][100] = {0};
int x = 0;
int y = 0;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
x += a[i][j];
}
a[i][c] = x;
x = 0;
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
y += a[i][j];
}
a[r][j] = y;
y = 0;
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j < c)
cout << " ";
}
cout << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int r, c;
int a[101][101] = {0};
int x = 0;
int y = 0;
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
x += a[i][j];
}
a[i][c] = x;
x = 0;
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
y += a[i][j];
}
a[r][j] = y;
y = 0;
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j < c)
cout << " ";
}
cout << endl;
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <stdio.h>
using namespace std;
int main() {
int r, c;
scanf("%d%d", &r, &c);
int matrix[101][101] = {};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &matrix[i][j]);
matrix[i][c] += matrix[i][j];
matrix[r][j] += matrix[i][j];
matrix[r][c] += matrix[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
printf("%d%s", matrix[i][j]);
}
printf("\n");
}
}
| #include <stdio.h>
using namespace std;
int main() {
int r, c;
scanf("%d%d", &r, &c);
int matrix[101][101] = {};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &matrix[i][j]);
matrix[i][c] += matrix[i][j];
matrix[r][j] += matrix[i][j];
matrix[r][c] += matrix[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
if (j < c) {
printf("%d ", matrix[i][j]);
} else {
printf("%d", matrix[i][j]);
}
}
printf("\n");
}
}
| replace | 17 | 18 | 17 | 22 | -11 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, e, sum, sum2, sheet[100][100];
cin >> r >> c;
for (int i = 0; i < r; i++) {
sum = 0;
for (int j = 0; j < c; j++) {
cin >> e;
sheet[i][j] = e;
sum += e;
}
sheet[i][c] = sum;
}
sum2 = 0;
for (int i = 0; i < c; i++) {
sum = 0;
for (int j = 0; j < r; j++) {
sum += sheet[j][i];
}
sheet[r][i] = sum;
sum2 += sum;
}
sheet[r][c] = sum2;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j == c) {
cout << sheet[i][j] << endl;
} else {
cout << sheet[i][j] << " ";
}
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c, e, sum, sum2, sheet[101][101];
cin >> r >> c;
for (int i = 0; i < r; i++) {
sum = 0;
for (int j = 0; j < c; j++) {
cin >> e;
sheet[i][j] = e;
sum += e;
}
sheet[i][c] = sum;
}
sum2 = 0;
for (int i = 0; i < c; i++) {
sum = 0;
for (int j = 0; j < r; j++) {
sum += sheet[j][i];
}
sheet[r][i] = sum;
sum2 += sum;
}
sheet[r][c] = sum2;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j == c) {
cout << sheet[i][j] << endl;
} else {
cout << sheet[i][j] << " ";
}
}
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, sum;
int a[100][100] = {0};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cout << a[i][j] << " ";
a[i][c] += a[i][j];
a[r][j] += a[i][j];
}
cout << a[i][c] << endl;
}
for (int j = 0; j < c; j++) {
cout << a[r][j] << " ";
sum += a[r][j];
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, sum;
int a[101][101] = {0};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cout << a[i][j] << " ";
a[i][c] += a[i][j];
a[r][j] += a[i][j];
}
cout << a[i][c] << endl;
}
for (int j = 0; j < c; j++) {
cout << a[r][j] << " ";
sum += a[r][j];
}
cout << sum << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02413 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int r, c, graph[101][101];
cin >> r >> c;
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
graph[i][j] = 0;
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> graph[i][j];
}
for (int j = 0; j < c; j++) {
graph[i][c] += graph[i][j];
}
}
for (int j = 0; j < c + 1; j++) {
for (int i = 0; i < r; i++) {
graph[r][j] += graph[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
printf("%d", graph[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
while (1) {
}
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int r, c, graph[101][101];
cin >> r >> c;
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
graph[i][j] = 0;
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> graph[i][j];
}
for (int j = 0; j < c; j++) {
graph[i][c] += graph[i][j];
}
}
for (int j = 0; j < c + 1; j++) {
for (int i = 0; i < r; i++) {
graph[r][j] += graph[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
printf("%d", graph[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
return 0;
} | delete | 38 | 40 | 38 | 38 | TLE | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, arr[100][100] = {};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> arr[i][j];
arr[r][j] += arr[i][j];
arr[i][c] += arr[i][j];
arr[r][c] += arr[i][j];
}
}
for (int m = 0; m <= r; m++) {
for (int k = 0; k <= c; k++) {
cout << arr[m][k];
if (k == c) {
cout << endl;
} else {
cout << ' ';
}
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, arr[101][101] = {};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> arr[i][j];
arr[r][j] += arr[i][j];
arr[i][c] += arr[i][j];
arr[r][c] += arr[i][j];
}
}
for (int m = 0; m <= r; m++) {
for (int k = 0; k <= c; k++) {
cout << arr[m][k];
if (k == c) {
cout << endl;
} else {
cout << ' ';
}
}
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int r, c, i, j, k;
int a[101][101] = {};
cin >> r >> c;
for (j = 1; j <= r; j++) {
a[c + 1][j] = 0;
for (i = 1; i <= c; i++) {
cin >> a[i][j];
a[c + 1][j] = a[c + 1][j] + a[i][j];
}
}
for (i = 1; i <= c + 1; i++) {
a[i][r + 1] = 0;
for (j = 1; j <= r; j++) {
a[i][r + 1] = a[i][r + 1] + a[i][j];
}
}
for (j = 1; j <= r + 1; j++) {
for (i = 1; i <= c + 1; i++) {
cout << a[i][j];
if (i != c + 1)
cout << " ";
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int r, c, i, j, k;
int a[102][102] = {};
cin >> r >> c;
for (j = 1; j <= r; j++) {
a[c + 1][j] = 0;
for (i = 1; i <= c; i++) {
cin >> a[i][j];
a[c + 1][j] = a[c + 1][j] + a[i][j];
}
}
for (i = 1; i <= c + 1; i++) {
a[i][r + 1] = 0;
for (j = 1; j <= r; j++) {
a[i][r + 1] = a[i][r + 1] + a[i][j];
}
}
for (j = 1; j <= r + 1; j++) {
for (i = 1; i <= c + 1; i++) {
cout << a[i][j];
if (i != c + 1)
cout << " ";
}
cout << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, a[100][100] = {}, i, j, N = 0, S = 0, M = 0;
cin >> r >> c;
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
cin >> a[i][j];
}
}
for (i = 1; i <= r; i++) {
N = 0;
for (j = 1; j <= c; j++) {
cout << a[i][j] << " ";
N = N + a[i][j];
}
cout << N << endl;
}
for (j = 1; j <= c + 1; j++) {
S = 0;
for (i = 1; i <= r; i++) {
S = S + a[i][j];
}
if (j == c + 1) {
cout << M << endl;
break;
}
cout << S << " ";
M = M + S;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, a[150][150] = {}, i, j, N = 0, S = 0, M = 0;
cin >> r >> c;
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
cin >> a[i][j];
}
}
for (i = 1; i <= r; i++) {
N = 0;
for (j = 1; j <= c; j++) {
cout << a[i][j] << " ";
N = N + a[i][j];
}
cout << N << endl;
}
for (j = 1; j <= c + 1; j++) {
S = 0;
for (i = 1; i <= r; i++) {
S = S + a[i][j];
}
if (j == c + 1) {
cout << M << endl;
break;
}
cout << S << " ";
M = M + S;
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | Python | Runtime Error | # -*- coding: utf-8 -*-
r, c = list(map(int, input().split()))
a = []
line_sum = 0
for i in range(r):
a.append(list(map(int, input().split())))
for i in range(r):
for j in range(c + 1):
if j == c:
print("{0}".format(sum(a[i])))
line_sum += sum(a[i])
else:
print("{0} ".format(a[i][j]), end="")
for i in range(c + 1):
column_sum = 0
for j in range(r):
column_sum += a[j][i]
print("{0} ".format(column_sum), end="")
print(line_sum)
| # -*- coding: utf-8 -*-
r, c = list(map(int, input().split()))
a = []
line_sum = 0
for i in range(r):
a.append(list(map(int, input().split())))
for i in range(r):
for j in range(c + 1):
if j == c:
print("{0}".format(sum(a[i])))
line_sum += sum(a[i])
else:
print("{0} ".format(a[i][j]), end="")
for i in range(c):
column_sum = 0
for j in range(r):
column_sum += a[j][i]
print("{0} ".format(column_sum), end="")
print(line_sum)
| replace | 17 | 18 | 17 | 18 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02413/Python/s016729795.py", line 21, in <module>
column_sum += a[j][i]
IndexError: list index out of range
|
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int r, c;
cin >> r >> c;
int a[100][100] = {0};
int i, j, b;
for (i = 0; i < r; i++) {
for (j = 0; j < c + 1; j++) {
if (j != c) {
cin >> a[i][j];
a[i][c] = a[i][c] + a[i][j];
a[r][j] = a[r][j] + a[i][j];
cout << a[i][j] << ' ';
}
if (j == c)
cout << a[i][c];
}
cout << endl;
}
for (j = 0; j < c + 1; j++) {
if (j != c)
cout << a[r][j] << ' ';
else {
cout << a[r][j];
}
a[r][c] = a[r][c] + a[r][j];
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int r, c;
cin >> r >> c;
int a[101][101] = {0};
int i, j, b;
for (i = 0; i < r; i++) {
for (j = 0; j < c + 1; j++) {
if (j != c) {
cin >> a[i][j];
a[i][c] = a[i][c] + a[i][j];
a[r][j] = a[r][j] + a[i][j];
cout << a[i][j] << ' ';
}
if (j == c)
cout << a[i][c];
}
cout << endl;
}
for (j = 0; j < c + 1; j++) {
if (j != c)
cout << a[r][j] << ' ';
else {
cout << a[r][j];
}
a[r][c] = a[r][c] + a[r][j];
}
cout << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int A[100][100];
cin >> r >> c;
for (i = 0; i < r; i++)
A[i][c] = 0;
for (j = 0; j < c; j++)
A[r][j] = 0;
A[r][c] = 0;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> A[i][j];
A[i][c] = A[i][c] + A[i][j];
A[r][j] = A[r][j] + A[i][j];
A[r][c] = A[r][c] + A[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j < c; j++) {
cout << A[i][j] << " ";
}
cout << A[i][c] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int A[101][101];
cin >> r >> c;
for (i = 0; i < r; i++)
A[i][c] = 0;
for (j = 0; j < c; j++)
A[r][j] = 0;
A[r][c] = 0;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> A[i][j];
A[i][c] = A[i][c] + A[i][j];
A[r][j] = A[r][j] + A[i][j];
A[r][c] = A[r][c] + A[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j < c; j++) {
cout << A[i][j] << " ";
}
cout << A[i][c] << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02413 | C++ | Runtime Error | #include <cstdio>
int main() {
int r, c;
scanf("%d %d", &r, &c);
int array[100][100] = {0};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &array[i][j]);
array[i][c] += array[i][j];
array[r][j] += array[i][j];
array[r][c] += array[i][j];
}
}
/* test */
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", array[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
return 0;
}
| #include <cstdio>
int main() {
int r, c;
scanf("%d %d", &r, &c);
int array[101][101] = {0};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &array[i][j]);
array[i][c] += array[i][j];
array[r][j] += array[i][j];
array[r][c] += array[i][j];
}
}
/* test */
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", array[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02413 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, t[100][100]{0};
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> t[i][j];
t[a][j] += t[i][j];
t[i][b] += t[i][j];
t[a][b] += t[i][j];
}
}
for (int i = 0; i < a + 1; i++) {
for (int j = 0; j < b + 1; j++) {
if (j == 0)
cout << t[i][j];
else
cout << " " << t[i][j];
}
cout << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, t[101][101]{0};
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cin >> t[i][j];
t[a][j] += t[i][j];
t[i][b] += t[i][j];
t[a][b] += t[i][j];
}
}
for (int i = 0; i < a + 1; i++) {
for (int j = 0; j < b + 1; j++) {
if (j == 0)
cout << t[i][j];
else
cout << " " << t[i][j];
}
cout << endl;
}
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int hyo[100][100] = {0};
int r, c;
cin >> r;
cin >> c;
for (int i = 0; i < r; i++) {
for (int i2 = 0; i2 < c; i2++) {
cin >> hyo[i][i2];
}
}
for (int i = 0; i < r; i++) {
for (int i2 = 0; i2 < c; i2++) {
hyo[i][c] += hyo[i][i2];
}
}
for (int i = 0; i < c; i++) {
for (int i2 = 0; i2 < r; i2++) {
hyo[r][i] += hyo[i2][i];
}
}
for (int i = 0; i < r; i++) {
hyo[r][c] += hyo[i][c];
}
for (int i = 0; i < r + 1; i++) {
for (int i2 = 0; i2 < c; i2++) {
cout << hyo[i][i2] << " ";
}
cout << hyo[i][c] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int hyo[1000][1000] = {0};
int r, c;
cin >> r;
cin >> c;
for (int i = 0; i < r; i++) {
for (int i2 = 0; i2 < c; i2++) {
cin >> hyo[i][i2];
}
}
for (int i = 0; i < r; i++) {
for (int i2 = 0; i2 < c; i2++) {
hyo[i][c] += hyo[i][i2];
}
}
for (int i = 0; i < c; i++) {
for (int i2 = 0; i2 < r; i2++) {
hyo[r][i] += hyo[i2][i];
}
}
for (int i = 0; i < r; i++) {
hyo[r][c] += hyo[i][c];
}
for (int i = 0; i < r + 1; i++) {
for (int i2 = 0; i2 < c; i2++) {
cout << hyo[i][i2] << " ";
}
cout << hyo[i][c] << endl;
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int table[100][100] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> table[i][j];
table[i][c] += table[i][j];
table[r][j] += table[i][j];
table[r][c] += table[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j <= c; j++) {
cout << table[i][j];
if (j < c)
cout << " ";
else
cout << "\n";
}
}
} | #include <iostream>
using namespace std;
int main() {
int r, c, i, j;
int table[101][101] = {0};
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> table[i][j];
table[i][c] += table[i][j];
table[r][j] += table[i][j];
table[r][c] += table[i][j];
}
}
for (i = 0; i <= r; i++) {
for (j = 0; j <= c; j++) {
cout << table[i][j];
if (j < c)
cout << " ";
else
cout << "\n";
}
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02413 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int r, c, i, j;
scanf("%d%d", &r, &c);
int a[100][100] = {};
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
scanf("%d", &a[i][j]);
a[i][c] += a[i][j];
a[r][j] += a[i][j];
a[r][c] += a[i][j];
}
}
for (i = 0; i <= r; i++) {
printf("%d", a[i][0]);
for (j = 1; j <= c; j++) {
printf(" %d", a[i][j]);
}
printf("\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int r, c, i, j;
scanf("%d%d", &r, &c);
int a[101][101] = {};
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
scanf("%d", &a[i][j]);
a[i][c] += a[i][j];
a[r][j] += a[i][j];
a[r][c] += a[i][j];
}
}
for (i = 0; i <= r; i++) {
printf("%d", a[i][0]);
for (j = 1; j <= c; j++) {
printf(" %d", a[i][j]);
}
printf("\n");
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, a[100][100] = {0};
cin >> r >> c;
// DWORD start = GetTickCount();//スタート時間
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
a[i][c] += a[i][j];
a[r][j] += a[i][j];
}
a[r][c] += a[i][c];
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j < c) {
cout << ' ';
}
}
cout << endl;
}
// DWORD end = GetTickCount();//終了時間
// cout << "time = " << (double)(end - start) / 1000 << "sec.\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, a[101][101] = {0};
cin >> r >> c;
// DWORD start = GetTickCount();//スタート時間
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> a[i][j];
a[i][c] += a[i][j];
a[r][j] += a[i][j];
}
a[r][c] += a[i][c];
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
cout << a[i][j];
if (j < c) {
cout << ' ';
}
}
cout << endl;
}
// DWORD end = GetTickCount();//終了時間
// cout << "time = " << (double)(end - start) / 1000 << "sec.\n";
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int h, w, i, j, x, y, number[101][101];
cin >> h >> w;
for (i = 1; i <= h; i++) {
for (j = 1; j <= w; j++) {
cin >> number[i][j];
number[i][w + 1] += number[i][j];
number[h + 1][j] += number[i][j];
number[h + 1][w + 1] += number[i][j];
}
}
for (i = 1; i <= h; i++) {
for (j = 1; j <= w; j++) {
cout << number[i][j] << " ";
}
cout << number[i][w + 1];
cout << endl;
}
for (j = 1; j <= w; j++) {
cout << number[h + 1][j] << " ";
}
cout << number[h + 1][w + 1] << endl;
} | #include <iostream>
using namespace std;
int main() {
long long h, w, i, j, x, y, number[400][400];
cin >> h >> w;
for (i = 1; i <= h; i++) {
for (j = 1; j <= w; j++) {
cin >> number[i][j];
number[i][w + 1] += number[i][j];
number[h + 1][j] += number[i][j];
number[h + 1][w + 1] += number[i][j];
}
}
for (i = 1; i <= h; i++) {
for (j = 1; j <= w; j++) {
cout << number[i][j] << " ";
}
cout << number[i][w + 1];
cout << endl;
}
for (j = 1; j <= w; j++) {
cout << number[h + 1][j] << " ";
}
cout << number[h + 1][w + 1] << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int num[101][101] = {};
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> num[i][j];
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
num[r][c] += num[i][j];
for (int i = 0; i < r; i++) {
int sum = 0;
for (int j = 0; j < c; j++)
sum += num[i][j];
num[i][c] = sum;
}
for (int j = 0; j < c; j++) {
int sum = 0;
for (int i = 0; i < r; j++)
sum += num[i][j];
num[r][j] = sum;
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j)
cout << " ";
cout << num[i][j];
}
cout << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int num[101][101] = {};
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> num[i][j];
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
num[r][c] += num[i][j];
for (int i = 0; i < r; i++) {
int sum = 0;
for (int j = 0; j < c; j++)
sum += num[i][j];
num[i][c] = sum;
}
for (int j = 0; j < c; j++) {
int sum = 0;
for (int i = 0; i < r; i++)
sum += num[i][j];
num[r][j] = sum;
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j)
cout << " ";
cout << num[i][j];
}
cout << endl;
}
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02413 | C++ | Runtime Error | #include <stdio.h>
int main() {
int r, c;
int i, j, a[100][100] = {0};
scanf("%d %d", &r, &c);
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
scanf("%d", &a[i][j]);
a[i][c + 1] += a[i][j];
a[r + 1][j] += a[i][j];
}
}
for (j = 1; j <= c; j++) {
a[r + 1][c + 1] += a[r + 1][j];
}
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
if (j == c + 1)
printf("%d", a[i][j]);
else
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
} | #include <stdio.h>
int main() {
int r, c;
int i, j, a[110][110] = {0};
scanf("%d %d", &r, &c);
for (i = 1; i <= r; i++) {
for (j = 1; j <= c; j++) {
scanf("%d", &a[i][j]);
a[i][c + 1] += a[i][j];
a[r + 1][j] += a[i][j];
}
}
for (j = 1; j <= c; j++) {
a[r + 1][c + 1] += a[r + 1][j];
}
for (i = 1; i <= r + 1; i++) {
for (j = 1; j <= c + 1; j++) {
if (j == c + 1)
printf("%d", a[i][j]);
else
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02413 | C++ | Runtime Error | // ITP1_7_C
#include <iostream>
using namespace std;
int main() {
int r, c, i, j, k = 0;
cin >> r >> c;
int irc[100][100];
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c + 1; j++) {
irc[i][j] = 0;
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> irc[i][j];
irc[i][c] += irc[i][j];
irc[r][j] += irc[i][j];
irc[r][c] += irc[i][j];
}
}
for (i = 0; i < r + 1; i++) {
for (j = 0, k = 0; j < c + 1; j++, k++) {
if (k != 0) {
cout << " ";
}
cout << irc[i][j];
}
cout << endl;
}
return 0;
} | // ITP1_7_C
#include <iostream>
using namespace std;
int main() {
int r, c, i, j, k = 0;
cin >> r >> c;
int irc[101][101];
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c + 1; j++) {
irc[i][j] = 0;
}
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> irc[i][j];
irc[i][c] += irc[i][j];
irc[r][j] += irc[i][j];
irc[r][c] += irc[i][j];
}
}
for (i = 0; i < r + 1; i++) {
for (j = 0, k = 0; j < c + 1; j++, k++) {
if (k != 0) {
cout << " ";
}
cout << irc[i][j];
}
cout << endl;
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int mat[100][100];
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> mat[i][j];
mat[i][c] += mat[i][j];
mat[r][j] += mat[i][j];
mat[r][c] += mat[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
if (j == c)
cout << mat[i][j] << endl;
else
cout << mat[i][j] << " ";
}
}
}
| #include <iostream>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
int mat[101][101] = {};
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> mat[i][j];
mat[i][c] += mat[i][j];
mat[r][j] += mat[i][j];
mat[r][c] += mat[i][j];
}
}
for (int i = 0; i < r + 1; i++) {
for (int j = 0; j < c + 1; j++) {
if (j == c)
cout << mat[i][j] << endl;
else
cout << mat[i][j] << " ";
}
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int r, c;
int i, j;
int d[100][100];
int cc = 0;
int cr = 0;
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> d[i][j];
cc = cc + d[i][j];
if (j == c - 1)
d[i][j + 1] = cc;
}
cc = 0;
}
for (j = 0; j < c + 1; j++) {
for (i = 0; i < r; i++) {
cr = cr + d[i][j];
if (i == r - 1)
d[i + 1][j] = cr;
}
cr = 0;
}
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c + 1; j++) {
if (j == c) {
cout << d[i][j] << endl;
;
} else {
cout << d[i][j] << ' ';
}
}
}
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int r, c;
int i, j;
int d[101][101];
int cc = 0;
int cr = 0;
cin >> r >> c;
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cin >> d[i][j];
cc = cc + d[i][j];
if (j == c - 1)
d[i][j + 1] = cc;
}
cc = 0;
}
for (j = 0; j < c + 1; j++) {
for (i = 0; i < r; i++) {
cr = cr + d[i][j];
if (i == r - 1)
d[i + 1][j] = cr;
}
cr = 0;
}
for (i = 0; i < r + 1; i++) {
for (j = 0; j < c + 1; j++) {
if (j == c) {
cout << d[i][j] << endl;
;
} else {
cout << d[i][j] << ' ';
}
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02413 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a[100][100] = {0};
int r, c;
scanf("%d %d", &r, &c);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
a[i][c] = a[i][c] + a[i][j];
}
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
a[r][j] = a[r][j] + a[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", a[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
return 0;
} | #include <stdio.h>
int main() {
int a[101][101] = {0};
int r, c;
scanf("%d %d", &r, &c);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
a[i][c] = a[i][c] + a[i][j];
}
}
for (int j = 0; j <= c; j++) {
for (int i = 0; i < r; i++) {
a[r][j] = a[r][j] + a[i][j];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
printf("%d", a[i][j]);
if (j != c)
printf(" ");
}
printf("\n");
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int r, c, S[100][100] = {0};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> S[i][j];
S[i][c] += S[i][j];
}
}
for (int i = 0; i <= c; i++) {
for (int j = 0; j < r; j++) {
S[r][i] += S[j][i];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j)
cout << " ";
cout << S[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, c, S[101][101] = {0};
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> S[i][j];
S[i][c] += S[i][j];
}
}
for (int i = 0; i <= c; i++) {
for (int j = 0; j < r; j++) {
S[r][i] += S[j][i];
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= c; j++) {
if (j)
cout << " ";
cout << S[i][j];
}
cout << endl;
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02413 | C++ | Runtime Error | #include <iostream>
int main() {
int r, c, i;
std::cin >> r >> c;
int list[100][100] = {0};
for (int a = 0; a < r; a++) {
for (int b = 0; b < c; b++) {
std::cin >> i;
list[a][b] = i;
list[a][c] = list[a][c] + i;
list[r][b] = list[r][b] + i;
list[r][c] = list[r][c] + i;
}
}
for (int d = 0; d <= r; d++) {
for (int e = 0; e <= c; e++) {
if (e < c) {
std::cout << list[d][e] << " ";
} else {
std::cout << list[d][e];
}
}
std::cout << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int r, c, i;
std::cin >> r >> c;
int list[101][101] = {0};
for (int a = 0; a < r; a++) {
for (int b = 0; b < c; b++) {
std::cin >> i;
list[a][b] = i;
list[a][c] = list[a][c] + i;
list[r][b] = list[r][b] + i;
list[r][c] = list[r][c] + i;
}
}
for (int d = 0; d <= r; d++) {
for (int e = 0; e <= c; e++) {
if (e < c) {
std::cout << list[d][e] << " ";
} else {
std::cout << list[d][e];
}
}
std::cout << std::endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02414 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, m, l, num;
cin >> n >> m >> l;
int A[n][m], B[m][l];
for (int a = 0; a < 100000000000; a++) {
for (int b = 0; b < m; b++) {
cin >> num;
A[a][b] = num;
}
}
for (int a = 0; a < m; a++) {
for (int b = 0; b < l; b++) {
cin >> num;
B[a][b] = num;
}
}
long long sum = 0;
for (int a = 0; a < n; a++) {
for (int c = 0; c < l; c++) {
for (int b = 0; b < m; b++) {
sum = sum + A[a][b] * B[b][c];
}
cout << sum;
sum = 0;
if (c != l - 1)
cout << " ";
}
cout << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, m, l, num;
cin >> n >> m >> l;
int A[n][m], B[m][l];
for (int a = 0; a < n; a++) {
for (int b = 0; b < m; b++) {
cin >> num;
A[a][b] = num;
}
}
for (int a = 0; a < m; a++) {
for (int b = 0; b < l; b++) {
cin >> num;
B[a][b] = num;
}
}
long long sum = 0;
for (int a = 0; a < n; a++) {
for (int c = 0; c < l; c++) {
for (int b = 0; b < m; b++) {
sum = sum + A[a][b] * B[b][c];
}
cout << sum;
sum = 0;
if (c != l - 1)
cout << " ";
}
cout << endl;
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02414 | C++ | Memory Limit Exceeded | #include <cmath>
#include <cstdint>
#include <cstdio>
#include <vector>
using namespace std;
using intp = long long int *;
using intpp = long long int **;
intpp subtract(intpp a, intpp b, int sz);
intpp add(intpp a, intpp b, int sz);
intpp combine(intpp a, intpp b, intpp c, intpp d, int size);
void extract(intpp matrix, int sz, intpp &A, intpp &B, intpp &C, intpp &D);
void dm(intpp m, int sz);
intpp Strassen(intpp a, intpp b, int sz) {
intpp c = new intp[sz];
if (sz == 1) {
c[0] = new long long int[1];
c[0][0] = a[0][0] * b[0][0];
} else {
intpp A, B, C, D, E, F, G, H;
extract(a, sz, A, B, C, D);
extract(b, sz, E, F, G, H);
int quadSize = sz / 2;
intpp FminusH = subtract(F, H, quadSize);
intpp AplusB = add(A, B, quadSize);
intpp CplusD = add(C, D, quadSize);
intpp GminusE = subtract(G, E, quadSize);
intpp AplusD = add(A, D, quadSize);
intpp EplusH = add(E, H, quadSize);
intpp BminusD = subtract(B, D, quadSize);
intpp GplusH = add(G, H, quadSize);
intpp AminusC = subtract(A, C, quadSize);
intpp EplusF = add(E, F, quadSize);
intpp p1 = Strassen(A, FminusH, quadSize);
intpp p2 = Strassen(AplusB, H, quadSize);
intpp p3 = Strassen(CplusD, E, quadSize);
intpp p4 = Strassen(D, GminusE, quadSize);
intpp p5 = Strassen(AplusD, EplusH, quadSize);
intpp p6 = Strassen(BminusD, GplusH, quadSize);
intpp p7 = Strassen(AminusC, EplusF, quadSize);
intpp newA =
add(add(p5, p4, quadSize), subtract(p6, p2, quadSize), quadSize);
intpp newB = add(p1, p2, quadSize);
intpp newC = add(p3, p4, quadSize);
intpp newD =
subtract(add(p1, p5, quadSize), add(p3, p7, quadSize), quadSize);
c = combine(newA, newB, newC, newD, quadSize);
dm(A, quadSize);
dm(B, quadSize);
dm(C, quadSize);
dm(D, quadSize);
dm(E, quadSize);
dm(F, quadSize);
dm(G, quadSize);
dm(H, quadSize);
dm(p1, quadSize);
dm(p2, quadSize);
dm(p3, quadSize);
dm(p4, quadSize);
dm(p5, quadSize);
dm(p6, quadSize);
dm(p7, quadSize);
dm(newA, quadSize);
dm(newB, quadSize);
dm(newC, quadSize);
dm(newD, quadSize);
}
return c;
}
int main() {
uint32_t n, m, l, i, j;
scanf("%d %d %d", &n, &m, &l);
intpp a, b, c;
uint32_t sz = pow(2, ceil(log2(max(n, max(m, l)))));
a = new intp[sz];
b = new intp[sz];
for (i = 0; i < sz; ++i) {
a[i] = new long long int[sz];
b[i] = new long long int[sz];
for (j = 0; j < sz; ++j)
a[i][j] = b[i][j] = 0;
}
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
scanf("%lld", &a[i][j]);
for (i = 0; i < m; ++i)
for (j = 0; j < l; ++j)
scanf("%lld", &b[i][j]);
c = Strassen(a, b, sz);
for (i = 0; i < n; ++i) {
for (j = 0; j < l - 1; ++j)
printf("%lld ", c[i][j]);
printf("%lld\n", c[i][l - 1]);
}
// printf("\n");
}
intpp subtract(intpp a, intpp b, int sz) {
intpp sub;
sub = new intp[sz];
for (int i = 0; i < sz; ++i) {
sub[i] = new long long int[sz];
for (int j = 0; j < sz; ++j)
sub[i][j] = a[i][j] - b[i][j];
}
return sub;
}
intpp add(intpp a, intpp b, int sz) {
intpp sum;
sum = new intp[sz];
for (int i = 0; i < sz; ++i) {
sum[i] = new long long int[sz];
for (int j = 0; j < sz; ++j)
sum[i][j] = a[i][j] + b[i][j];
}
return sum;
}
void extract(intpp matrix, int sz, intpp &A, intpp &B, intpp &C, intpp &D) {
sz /= 2;
A = new intp[sz];
B = new intp[sz];
C = new intp[sz];
D = new intp[sz];
for (int i = 0; i < sz; ++i) {
A[i] = new long long int[sz];
B[i] = new long long int[sz];
C[i] = new long long int[sz];
D[i] = new long long int[sz];
for (int j = 0; j < sz; ++j) {
A[i][j] = matrix[i][j];
B[i][j] = matrix[i][j + sz];
C[i][j] = matrix[i + sz][j];
D[i][j] = matrix[i + sz][j + sz];
}
}
}
intpp combine(intpp a, intpp b, intpp c, intpp d, int size) {
intpp m = new intp[size * 2];
for (int i = 0; i < size * 2; i++)
m[i] = new long long int[size * 2];
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
m[i][j] = a[i][j];
m[i][j + size] = b[i][j];
m[i + size][j] = c[i][j];
m[i + size][j + size] = d[i][j];
}
}
return m;
}
void dm(intpp m, int sz) {
for (int i = 0; i < sz; i++)
delete[] m[i];
delete[] m;
}
| #include <cmath>
#include <cstdint>
#include <cstdio>
#include <vector>
using namespace std;
using intp = long long int *;
using intpp = long long int **;
intpp subtract(intpp a, intpp b, int sz);
intpp add(intpp a, intpp b, int sz);
intpp combine(intpp a, intpp b, intpp c, intpp d, int size);
void extract(intpp matrix, int sz, intpp &A, intpp &B, intpp &C, intpp &D);
void dm(intpp m, int sz);
intpp Strassen(intpp a, intpp b, int sz) {
intpp c = new intp[sz];
if (sz == 1) {
c[0] = new long long int[1];
c[0][0] = a[0][0] * b[0][0];
} else {
intpp A, B, C, D, E, F, G, H;
extract(a, sz, A, B, C, D);
extract(b, sz, E, F, G, H);
int quadSize = sz / 2;
intpp FminusH = subtract(F, H, quadSize);
intpp AplusB = add(A, B, quadSize);
intpp CplusD = add(C, D, quadSize);
intpp GminusE = subtract(G, E, quadSize);
intpp AplusD = add(A, D, quadSize);
intpp EplusH = add(E, H, quadSize);
intpp BminusD = subtract(B, D, quadSize);
intpp GplusH = add(G, H, quadSize);
intpp AminusC = subtract(A, C, quadSize);
intpp EplusF = add(E, F, quadSize);
intpp p1 = Strassen(A, FminusH, quadSize);
intpp p2 = Strassen(AplusB, H, quadSize);
intpp p3 = Strassen(CplusD, E, quadSize);
intpp p4 = Strassen(D, GminusE, quadSize);
intpp p5 = Strassen(AplusD, EplusH, quadSize);
intpp p6 = Strassen(BminusD, GplusH, quadSize);
intpp p7 = Strassen(AminusC, EplusF, quadSize);
intpp newA =
add(add(p5, p4, quadSize), subtract(p6, p2, quadSize), quadSize);
intpp newB = add(p1, p2, quadSize);
intpp newC = add(p3, p4, quadSize);
intpp newD =
subtract(add(p1, p5, quadSize), add(p3, p7, quadSize), quadSize);
c = combine(newA, newB, newC, newD, quadSize);
dm(A, quadSize);
dm(B, quadSize);
dm(C, quadSize);
dm(D, quadSize);
dm(E, quadSize);
dm(F, quadSize);
dm(G, quadSize);
dm(H, quadSize);
dm(p1, quadSize);
dm(p2, quadSize);
dm(p3, quadSize);
dm(p4, quadSize);
dm(p5, quadSize);
dm(p6, quadSize);
dm(p7, quadSize);
dm(newA, quadSize);
dm(newB, quadSize);
dm(newC, quadSize);
dm(newD, quadSize);
dm(FminusH, quadSize);
dm(AplusB, quadSize);
dm(CplusD, quadSize);
dm(GminusE, quadSize);
dm(AplusD, quadSize);
dm(EplusH, quadSize);
dm(BminusD, quadSize);
dm(GplusH, quadSize);
dm(AminusC, quadSize);
dm(EplusF, quadSize);
}
return c;
}
int main() {
uint32_t n, m, l, i, j;
scanf("%d %d %d", &n, &m, &l);
intpp a, b, c;
uint32_t sz = pow(2, ceil(log2(max(n, max(m, l)))));
a = new intp[sz];
b = new intp[sz];
for (i = 0; i < sz; ++i) {
a[i] = new long long int[sz];
b[i] = new long long int[sz];
for (j = 0; j < sz; ++j)
a[i][j] = b[i][j] = 0;
}
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
scanf("%lld", &a[i][j]);
for (i = 0; i < m; ++i)
for (j = 0; j < l; ++j)
scanf("%lld", &b[i][j]);
c = Strassen(a, b, sz);
for (i = 0; i < n; ++i) {
for (j = 0; j < l - 1; ++j)
printf("%lld ", c[i][j]);
printf("%lld\n", c[i][l - 1]);
}
// printf("\n");
}
intpp subtract(intpp a, intpp b, int sz) {
intpp sub;
sub = new intp[sz];
for (int i = 0; i < sz; ++i) {
sub[i] = new long long int[sz];
for (int j = 0; j < sz; ++j)
sub[i][j] = a[i][j] - b[i][j];
}
return sub;
}
intpp add(intpp a, intpp b, int sz) {
intpp sum;
sum = new intp[sz];
for (int i = 0; i < sz; ++i) {
sum[i] = new long long int[sz];
for (int j = 0; j < sz; ++j)
sum[i][j] = a[i][j] + b[i][j];
}
return sum;
}
void extract(intpp matrix, int sz, intpp &A, intpp &B, intpp &C, intpp &D) {
sz /= 2;
A = new intp[sz];
B = new intp[sz];
C = new intp[sz];
D = new intp[sz];
for (int i = 0; i < sz; ++i) {
A[i] = new long long int[sz];
B[i] = new long long int[sz];
C[i] = new long long int[sz];
D[i] = new long long int[sz];
for (int j = 0; j < sz; ++j) {
A[i][j] = matrix[i][j];
B[i][j] = matrix[i][j + sz];
C[i][j] = matrix[i + sz][j];
D[i][j] = matrix[i + sz][j + sz];
}
}
}
intpp combine(intpp a, intpp b, intpp c, intpp d, int size) {
intpp m = new intp[size * 2];
for (int i = 0; i < size * 2; i++)
m[i] = new long long int[size * 2];
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
m[i][j] = a[i][j];
m[i][j + size] = b[i][j];
m[i + size][j] = c[i][j];
m[i + size][j + size] = d[i][j];
}
}
return m;
}
void dm(intpp m, int sz) {
for (int i = 0; i < sz; i++)
delete[] m[i];
delete[] m;
}
| insert | 73 | 73 | 73 | 83 | MLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.