buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
require 'matrix'
def fib3(n)
f0, f1 = 1, 1
n.times{ f0, f1 = f1, f0 + f1 }
return f0
end
puts fib(gets.to_i) | require 'matrix'
def fib(n)
f0, f1 = 1, 1
n.times{ f0, f1 = f1, f0 + f1 }
return f0
end
puts fib(gets.to_i) | [["-", 36, 36, 36, 36, 0, 493, 0, 735, 141, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 735, 141, 22]] | 4 | 40 | 2 |
# coding: utf-8
#lines = <<'EOS'
#4
#1 2 2 4
#2 1 4
#3 0
#4 1 3
#EOS
def fib(n)
if n == 1 or n == 2
1
else
n_1 = 1
n_2 = 1
tmp = 0
for x in 3..n
tmp = n_1 + n_2
n_2 = n_1
n_1 = tmp
end
tmp
end
end
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
put... | # coding: utf-8
#lines = <<'EOS'
#4
#1 2 2 4
#2 1 4
#3 0
#4 1 3
#EOS
def fib(n)
if n == 1 or n == 2
1
else
n_1 = 1
n_2 = 1
tmp = 0
for x in 3..n
tmp = n_1 + n_2
n_2 = n_1
n_1 = tmp
end
tmp
end
end
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
put... | [["+", 3, 4, 0, 652, 3, 4, 0, 738, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 738, 12, 612]] | 4 | 81 | 2 |
def fib n
res = Array.new(n + 1, 0)
res[1] = 1
(2..n).each do |i|
res[i] = res[i - 1] + res[i - 2]
end
res
end
def main
fibs = fib 44
n = gets.chomp.to_i
puts fibs[n]
end
main | def fib n
res = Array.new(n + 1, 0)
res[0] = 1
res[1] = 1
(2..n).each do |i|
res[i] = res[i - 1] + res[i - 2]
end
res
end
def main
fibs = fib 44
n = gets.chomp.to_i
puts fibs[n]
end
main | [["+", 0, 735, 8, 736, 0, 662, 31, 742, 0, 612], ["+", 0, 735, 8, 736, 0, 662, 31, 742, 0, 73], ["+", 0, 493, 0, 735, 8, 736, 0, 662, 0, 32], ["+", 0, 493, 0, 735, 8, 736, 0, 662, 12, 612], ["+", 0, 735, 8, 736, 0, 662, 31, 742, 500, 22], ["+", 0, 735, 8, 736, 0, 662, 31, 742, 0, 70]] | 4 | 73 | 6 |
def memoize(f):
cache = {}
def helper(x):
if x not in cache:
cache[x] = f(x)
return cache[x]
return helper
@memoize
def fib(n):
if n in (0, 1):
return 1
else:
return fib(n - 1) + fib(n - 2)
pritn(fib(int(input()))) | def memoize(f):
cache = {}
def helper(x):
if x not in cache:
cache[x] = f(x)
return cache[x]
return helper
@memoize
def fib(n):
if n in (0, 1):
return 1
else:
return fib(n - 1) + fib(n - 2)
print(fib(int(input()))) | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22]] | 5 | 85 | 2 |
def fib_iter(n):
fib_n = 0
fib_n2 = 1
fib_n1 = 1
for i in range(n - 1):
fib_n = fib_n1 + fib_n2
fib_n2 = fib_n1
fib_n1 = fib_n
return fib_n
x = int(input())
print(fib_iter(x)) | def fib_iter(n):
fib_n = 1
fib_n2 = 1
fib_n1 = 1
for i in range(n - 1):
fib_n = fib_n1 + fib_n2
fib_n2 = fib_n1
fib_n1 = fib_n
return fib_n
x = int(input())
print(fib_iter(x)) | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 53 | 2 |
memo = {}
def fib_memo(n):
if n <= 1:
return n
if n in memo: # 動的計画法とも
return memo[n]
memo[n] = fib_memo(n - 1) + fib_memo(n - 2)
return memo[n]
n = int(input())
print(fib_memo(n)) | memo = {}
def fib_memo(n):
if n <= 1:
return 1
if n in memo:
return memo[n]
memo[n] = fib_memo(n - 1) + fib_memo(n - 2)
return memo[n]
x = int(input())
print(fib_memo(x)) | [["-", 8, 196, 0, 57, 64, 196, 0, 37, 0, 22], ["+", 8, 196, 0, 57, 64, 196, 0, 37, 0, 612], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 66 | 6 |
def fibo(n):
S=[1,1]
s=1
if n>1:
for i in range(2,n+1):
S.append(S[i-1]+S[i-2])
s=S[i]
return s
def main():
if __name__=="__main__":
n=input()
print(fibo(n))
main() | def fibo(n):
S=[1,1]
s=1
if n>1:
for i in range(2,n+1):
S.append(S[i-1]+S[i-2])
s=S[i]
return s
def main():
if __name__=="__main__":
n=int(input())
print(fibo(n))
main() | [["+", 64, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 86 | 3 |
def fib(n):
n1 = n2 = 1
for _ in range(n - 1):
tmp = n1 + n2
n1, n2 = n2, tmp
return tmp
print(fib(int(input()))) | def fib(n):
n1 = n2 = tmp = 1
for _ in range(n - 1):
tmp = n1 + n2
n1, n2 = n2, tmp
return tmp
print(fib(int(input()))) | [["+", 0, 1, 0, 662, 12, 662, 12, 662, 31, 22], ["+", 0, 1, 0, 662, 12, 662, 12, 662, 0, 32]] | 5 | 47 | 2 |
answer_list = [1, 1] + [None] * 43
def fib(num):
ans = answer_list[num]
if ans:
return ans
ans = fib(num - 1) + fib(num - 2)
answer_list[num] = ans
return ans
n = int(input)
print(fib(n)) | answer_list = [1, 1] + [None] * 43
def fib(num):
ans = answer_list[num]
if ans:
return ans
ans = fib(num - 1) + fib(num - 2)
answer_list[num] = ans
return ans
n = int(input())
print(fib(n)) | [["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 66 | 2 |
n = int(input())
first = 1
second = 1
for i in range(n):
second, first = first + second, second
print(val) | n = int(input())
first = 1
second = 1
for i in range(n-1):
second, first = first + second, second
print(second) | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 35 | 4 |
_fib = [None] * 44
_fib[0] = 1
_fib[1] = 1
def fib(n):
if _fib[n] is None:
_fib[n] = fib(n-1) + fib(n-2)
return _fib[n]
_n = int(input())
print((fib(_n))) | _fib = [None] * 45
_fib[0] = 1
_fib[1] = 1
def fib(n):
if _fib[n] is None:
_fib[n] = fib(n-1) + fib(n-2)
return _fib[n]
_n = int(input())
print((fib(_n))) | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 73 | 2 |
#!/usr/bin/python
n = int(input())
def fib(n):
l = list()
l.append(1)
l.append(1)
for i in range(2, n+1):
l.append(l[i-1] + l[i-2])
return l[i]
print(fib(n)) | #!/usr/bin/python
n = int(input())
def fib(n):
l = list()
l.append(1)
l.append(1)
for i in range(2, n+1):
l.append(l[i-1] + l[i-2])
return l[-1]
print(fib(n)) | [["-", 0, 14, 8, 196, 0, 37, 0, 206, 206, 22], ["+", 8, 196, 0, 37, 0, 206, 206, 664, 17, 33], ["+", 8, 196, 0, 37, 0, 206, 206, 664, 28, 612]] | 5 | 74 | 3 |
target = int(input()) + 1
fib = [0 for n in range(target + 1)]
for i in range(target):
if i == 0:
continue
elif i == 1:
fib[i] = 1
else:
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[target]) | target = int(input()) + 1
fib = [0 for n in range(target + 1)]
for i in range(target + 1):
if i == 0:
continue
elif i == 1:
fib[i] = 1
else:
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[target]) | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 76 | 2 |
n = int(input()) - 1
fib = [1, 1] + [0] * n
for i in range(2, n):
fib[i] = fib[i-1] + fib[i-2]
print(fib[n]) | n = int(input())
fib = [1, 1] + [0] * n
for i in range(2, n+1):
fib[i] = fib[i-1] + fib[i-2]
print(fib[n]) | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 33], ["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 58 | 4 |
n = int(input())
F = [1, 1] + [0 for i in range(44)]
for i in range(2, n + 1):
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[n]) | n = int(input())
fib = [1, 1] + [0 for i in range(44)]
for i in range(2, n + 1):
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[n]) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22]] | 5 | 63 | 2 |
n = int(input())
dp = [1, 1]
for i in range(50):
dp += dp[-1] + dp[-2]
print(dp[n])
| n = int(input())
dp = [1, 1]
for i in range(50):
dp += [dp[-1] + dp[-2]]
print(dp[n])
| [["+", 8, 196, 0, 1, 0, 677, 12, 634, 0, 70], ["+", 0, 677, 12, 634, 0, 657, 12, 206, 0, 73]] | 5 | 43 | 2 |
f=[1,1]
for _ in[0]*43:f+=[f(-2)+f(-1)]
print(f[int(input())])
| f=[1,1]
for _ in[0]*43:f+=[f[-2]+f[-1]]
print(f[int(input())])
| [["-", 12, 634, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 0, 677, 12, 634, 0, 657, 31, 206, 0, 70], ["-", 12, 634, 0, 657, 31, 652, 3, 4, 0, 25], ["+", 0, 677, 12, 634, 0, 657, 31, 206, 0, 73], ["-", 12, 634, 0, 657, 12, 652, 3, 4, 0, 24], ["+", 0, 677, 12, 634, 0, 657, 12, 206, 0, 70], ["-", 12, 634, 0, 657, 12, 652, 3, 4,... | 5 | 43 | 8 |
f = [-1 for i in range(45)]
f[0] = f[1] = 1
def fib(n):
global f
for i in range(2,n+1):
f[i] = f[i - 1] + f[i - 2]
#print(i,f[i])
return f[n]
if __name__ == "__main__":
n = input("input number: ")
n = int(n)
#print(type(n))
print(fib(n))
|
f = [-1 for i in range(45)]
f[0] = f[1] = 1
def fib(n):
global f
for i in range(2,n+1):
f[i] = f[i - 1] + f[i - 2]
#print(i,f[i])
return f[n]
if __name__ == "__main__":
n = input()
n = int(n)
#print(type(n))
print(fib(n))
| [["-", 0, 662, 12, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 662, 12, 652, 3, 4, 0, 557, 0, 6], ["-", 0, 662, 12, 652, 3, 4, 0, 557, 0, 655]] | 5 | 97 | 3 |
# -*- coding: utf-8 -*-
"""
Created on Fri May 4 20:13:10 2018
ALDS1_10_A
@author: maezawa
"""
fib_arr = [None for _ in range(45)]
fib_arr[1] = 1
fib_arr[2] = 1
def fib(n):
if fib_arr[n] != None:
return fib_arr[n]
fib_arr[n] = fib(n-1)+fib(n-2)
return fib_arr[n]
n = int(input())
print(fib(n)... | # -*- coding: utf-8 -*-
"""
Created on Fri May 4 20:13:10 2018
ALDS1_10_A
@author: maezawa
"""
fib_arr = [None for _ in range(45)]
fib_arr[0] = 1
fib_arr[1] = 1
def fib(n):
if fib_arr[n] != None:
return fib_arr[n]
fib_arr[n] = fib(n-1)+fib(n-2)
return fib_arr[n]
n = int(input())
print(fib(n)... | [["-", 0, 656, 0, 1, 0, 662, 31, 206, 206, 612], ["+", 0, 656, 0, 1, 0, 662, 31, 206, 206, 612]] | 5 | 85 | 4 |
#coding:utf-8
n = int(input())
F = [False for i in range(n+1)]
def fib(n):
if n == 1 or n == 2:
F[n] = 1
return 1
if F[n]:
return F[n]
F[n] = fib(n-2) + fib(n-1)
return F[n]
a = fib(n)
print(a)
| #coding:utf-8
n = int(input())
F = [False for i in range(n+1)]
def fib(n):
if n == 0 or n == 1:
F[n] = 1
return 1
if F[n]:
return F[n]
F[n] = fib(n-2) + fib(n-1)
return F[n]
a = fib(n)
print(a)
| [["-", 8, 196, 0, 57, 15, 679, 31, 666, 0, 612], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 612], ["-", 8, 196, 0, 57, 15, 679, 12, 666, 0, 612], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 0, 612]] | 5 | 90 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p[101], m[101][101];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n - l + 1; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p[101], m[101][101];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
... | [["-", 0, 7, 15, 16, 12, 16, 31, 16, 17, 33], ["-", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 236 | 4 |
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 357 | 2 |
#include <iostream>
using namespace std;
int n, a[111], b[111], dp[111][111];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= n - i; j++) {
int l = j, r = j + i; // [l, r)
dp[l][r] = 999999999;
for (int k = l + 1... | #include <iostream>
using namespace std;
int n, a[111], b[111], dp[111][111];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= n - i; j++) {
int l = j, r = j + i; // [l, r)
dp[l][r] = 999999999;
for (int k = l + 1... | [["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 199 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | [["-", 8, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 8, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 337 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int N = 100;
int p[N + 1], m[N + 1][N + 1];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l ... | #include <algorithm>
#include <iostream>
using namespace std;
static const int N = 100;
int p[N + 1], m[N + 1][N + 1];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 254 | 2 |
/**
* matrix chain multiplication
* f(n,m) = multiply Mn*M(n+1)*...*M(m-1)*M(m)
* f(n,n) = 1
* r(n)=c(n-1)
* f(n,n+1) = C(n) * R(n) * C(n+1) = c(n) * c(n-1) * c(n+1)
* f(n,k,m) = f(n,k)*f(k+1,m)*C(n)*r(n)*c(k)
* f(n,m) = min(f(n,k,m)
*/
#include <climits>
#include <cmath>
#include <iostream>
using name... | /**
* matrix chain multiplication
* f(n,m) = multiply Mn*M(n+1)*...*M(m-1)*M(m)
* f(n,n) = 1
* r(n)=c(n-1)
* f(n,n+1) = C(n) * R(n) * C(n+1) = c(n) * c(n-1) * c(n+1)
* f(n,k,m) = f(n,k)*f(k+1,m)*C(n)*r(n)*c(k)
* f(n,m) = min(f(n,k,m)
*/
#include <climits>
#include <cmath>
#include <iostream>
using name... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 8, 9, 0, 37, 0, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 37, 0, 16, 31, 16, 17, 72]] | 1 | 321 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n, p[101], m[101][101];
cin >> ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n, p[101], m[101][101];
cin >> ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 240 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int num = 105;
int p[num];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
int m[num][num];
for (int i = 1; i <=... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int num = 105;
int p[num];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
int m[num][num];
for (int i = 1; i <=... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 277 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int N = 100;
int main() {
int n, p[N + 1], m[N + 1][N + 1];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> p[i - 1] >> p[i];
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l < n; l++)
for (int i = 1; i <= n - l ... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 100;
int main() {
int n, p[N + 1], m[N + 1][N + 1];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> p[i - 1] >> p[i];
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++)
for (int i = 1; i <= n - l + 1... | [["-", 36, 36, 0, 30, 0, 43, 0, 114, 0, 115], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 238 | 3 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int mcm(vector<int> &p) {
vector<vector<int>> m(p.size() - 1, vector<int>(p.size() - 1));
for (int i = 0; i < m.size(); i++) {
m[i][i] = 0;
}
/*
* l ==... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int mcm(vector<int> &p) {
vector<vector<int>> m(p.size() - 1, vector<int>(p.size() - 1));
for (int i = 0; i < m.size(); i++) {
m[i][i] = 0;
}
/*
* l ==... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 319 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, p[101], m[101][101], i, j, k, l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 1; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j = i + l... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, p[101], m[101][101], i, j, k, l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j = i + l... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 236 | 2 |
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int MCM(int p[], int n) {
vector<vector<int>> m(n, vector<int>(n));
for (int i = 0; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] = INT_MA... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int MCM(int p[], int n) {
vector<vector<int>> m(n + 1, vector<int>(n + 1));
for (int i = 0; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] ... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 51, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 51, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 273 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (auto i = 0; i < n; i++)
#define s(c) static_cast<int>((c).size())
int main() {
int n;
cin >> n;
int i, t, A[n + 1];
cin >> A[0] >> A[1];
for (i = 2; i <= n; i++) {
cin >> t >> A[i];
}
// dp[l][r] -> min(A[l]*...*A[r])
int dp[n][n +... | #include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (auto i = 0; i < n; i++)
#define s(c) static_cast<int>((c).size())
int main() {
int n;
cin >> n;
int i, t, A[n + 1];
cin >> A[0] >> A[1];
for (i = 2; i <= n; i++) {
cin >> t >> A[i];
}
// dp[l][r] -> min(A[l]*...*A[r])
int dp[n][n +... | [["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 237 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[111][111], n, L[111], R[111];
int f(int l, int r) {
if (dp[l][r] > -1)
return dp[l][r];
int res = 1e9;
for (int i = l; i < r; i++) {
res = min(res, f(l, i) + f(i + 1, r) + L[l + 1] * R[i] * R[r]);
}
return... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[111][111], n, L[111], R[111];
int f(int l, int r) {
if (dp[l][r] > -1)
return dp[l][r];
int res = 1e9;
for (int i = l; i < r; i++) {
res = min(res, f(l, i) + f(i + 1, r) + L[l] * R[i] * R[r]);
}
return dp[... | [["-", 31, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 208 | 2 |
#include <cstdio>
#include <iostream>
#define INT_MAX 100000000
using namespace std;
int index;
int mm[1000][1000];
int mine = INT_MAX;
void solve(int p[]) {
int n = index - 1, j, q;
for (int i = 1; i <= n; i++)
mm[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
j =... | #include <cstdio>
#include <iostream>
#define INT_MAX 100000000
using namespace std;
int index;
int mm[1000][1000];
int mine = INT_MAX;
void solve(int p[]) {
int n = index - 1, j, q;
for (int i = 1; i <= n; i++)
mm[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
j =... | [["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 316 | 2 |
// http://algorithms.blog55.fc2.com/blog-entry-66.html
#include <stdio.h>
#include <string.h>
#define M 100
int N, R[M + 1], C[M][M], B[M][M];
void compute() {
int i = 0, j, k, cost;
memset(C, 99, sizeof(C));
for (; i < N; i++)
C[i][i] = 0;
for (j = 1; j < N; j++)
for (i = 0; i < N - j; i++)
f... | // http://algorithms.blog55.fc2.com/blog-entry-66.html
#include <stdio.h>
#include <string.h>
#define M 100
int N, R[M + 1], C[M][M], B[M][M];
void compute() {
int i = 0, j, k, cost;
memset(C, 99, sizeof(C));
for (; i < N; i++)
C[i][i] = 0;
for (j = 1; j < N; j++)
for (i = 0; i < N - j; i++)
f... | [["+", 8, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 376 | 1 |
def input
size = []
n = gets.chomp.to_i
(1..n).each do |i|
sz = gets.chomp.split(/\s/).collect{ |x| x.to_i}
size << { :row => sz[0], :col => sz[1]}
end
[n, size]
end
def solve(n, size)
dp = { }
0.upto(n - 1).each do |i|
i.upto(n - 1).each do |j|
dp[[i, j]] = 0x3fffffff
end
end
... | #encoding: utf-8
def input
size = []
n = gets.chomp.to_i
(1..n).each do |i|
sz = gets.chomp.split(/\s/).collect{ |x| x.to_i}
size << { :row => s... | [["-", 31, 738, 12, 742, 500, 742, 0, 738, 17, 72], ["-", 31, 738, 12, 742, 500, 742, 0, 738, 12, 612]] | 4 | 302 | 2 |
import sys
def get_min_cost(n, p):
m = [[0 for x in range(n+1)] for x in range(n+1)]
for s in range(n):
i = 1
for j in range(s+2, n):
m[i][j] = sys.maxsize
for k in range(i, j+1):
m[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
i+=1
return m[1][n]
n = int(input())
p = [0] * (n+1)
j = 0... | import sys
def get_min_cost(n, p):
m = [[0 for x in range(n+1)] for x in range(n+1)]
for s in range(n):
i = 1
for j in range(s+2, n+1):
m[i][j] = sys.maxsize
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
i+=1
return m[1][n]
n = int(input())
p = [0] * (n+1)
j = 0... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 230 | 4 |
def mcm(M):
n = len(M)
m = [[0 for i in range(n)] for j in range(n)]
for l in range(2, n):
for i in range(1, n-l+1):
j = i + l - 1
def cost(i, k ,j):
return m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1]
m[i][j] = min(cost(i, k, j) for k in range(i, j-1))
return m[0][n-1]
n =... | def mcm(M):
n = len(M)
m = [[0 for i in range(n)] for j in range(n)]
for l in range(2, n+1):
for i in range(0, n-l+1):
j = i + l - 1
def cost(i, k ,j):
return m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1]
m[i][j] = min(cost(i, k, j) for k in range(i, j))
return m[0][n-1]
n =... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 203 | 6 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int LCSLength(char x[], char y[]) {
int i, j;
int xLen, yLen;
int **c;
xLen = strlen(x);
yLen = strlen(y);
c = (int **)malloc(sizeof(int *) * (xLen + 1));
for (i = 0; i <= xLen; i++) {
c[i] = (int *)malloc(sizeof(int) * (yLen + 1));
}
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int LCSLength(char x[], char y[]) {
int i, j;
int xLen, yLen;
int **c;
xLen = strlen(x);
yLen = strlen(y);
c = (int **)malloc(sizeof(int *) * (xLen + 1));
for (i = 0; i <= xLen; i++) {
c[i] = (int *)malloc(sizeof(int) * (yLen + 1));
}
... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 407 | 4 |
#include <stdio.h>
#include <string.h>
#define N 1000
int LCS(char *c1, char *c2) {
int i, j;
int x = strlen(c1), y = strlen(c2);
int A[x + 1][y + 1];
for (i = 1; i < x; i++)
A[i][0] = 0;
for (j = 0; j <= y; j++)
A[0][j] = 0;
for (i = 1; i <= x; i++) {
for (j = 1; j <= y; j++) {
if (c1... | #include <stdio.h>
#include <string.h>
#define N 1000
int LCS(char *c1, char *c2) {
int i, j;
int x = strlen(c1), y = strlen(c2);
int A[x + 1][y + 1];
for (i = 1; i <= x; i++)
A[i][0] = 0;
for (j = 0; j <= y; j++)
A[0][j] = 0;
for (i = 1; i <= x; i++) {
for (j = 1; j <= y; j++) {
if (c... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 322 | 2 |
#include <stdio.h>
#include <string.h>
#define MAX 10000
#define max(a, b) ((a < b) ? b : a)
char s[MAX], t[MAX];
int dp[MAX][MAX], path[MAX][MAX];
int LCS() {
int n = strlen(s);
int m = strlen(t);
memset(dp, 0, sizeof dp);
int i, j, maxi = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
i... | #include <stdio.h>
#include <string.h>
#define MAX 1010
#define max(a, b) ((a < b) ? b : a)
char s[MAX], t[MAX];
int dp[MAX][MAX], path[MAX][MAX];
int LCS() {
int n = strlen(s);
int m = strlen(t);
memset(dp, 0, sizeof dp);
int i, j, maxi = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 330 | 2 |
#include <stdio.h>
#include <string.h>
#define N 10000
#define M 5000
int LCSLength(char *, char *);
int main() {
int q, i, r[M];
char X[N], Y[N];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", X);
scanf("%s", Y);
r[i] = LCSLength(X, Y);
}
for (i = 0; i < q; i++) {
printf("%d\n... | #include <stdio.h>
#include <string.h>
#define N 1001
#define M 501
int LCSLength(char *, char *);
int main() {
int q, i, r[M];
char X[N], Y[N];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", X);
scanf("%s", Y);
r[i] = LCSLength(X, Y);
}
for (i = 0; i < q; i++) {
printf("%d\n",... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 367 | 4 |
#include <stdio.h>
#include <string.h>
#define N 1000
int Max(int, int);
int lcn(void);
char X[N + 1], Y[N + 1];
int main() {
int i, j, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", lcn());
}
return 0;
}
int lcn() {
int i, j, x, y, max = 0;
int... | #include <stdio.h>
#include <string.h>
#define N 1000
int Max(int, int);
int lcn(void);
char X[N + 1], Y[N + 1];
int main() {
int i, j, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", lcn());
}
return 0;
}
int lcn() {
int i, j, x, y, max = 0;
int... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 365 | 6 |
#include <stdio.h>
#include <string.h>
char X[1000], Y[1000];
int q;
int LCSLength() {
int m, n, i, j;
int c[1001][1001];
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | #include <stdio.h>
#include <string.h>
char X[1001], Y[1001];
int q;
int LCSLength() {
int m, n, i, j;
int c[1001][1001];
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 305 | 8 |
#include <stdio.h>
#include <string.h>
int LCSLength(char *, char *);
int main() {
int q, i;
char X[1000], Y[1000];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCSLength(X, Y));
}
return 0;
}
int LCSLength(char *X, char *Y) {
int i, j, c[1000]... | #include <stdio.h>
#include <string.h>
int LCSLength(char *, char *);
int main() {
int q, i;
char X[1000], Y[1000];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCSLength(X, Y));
}
return 0;
}
int LCSLength(char *X, char *Y) {
int i, j, c[1001]... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 1... | 0 | 326 | 8 |
#include <stdio.h>
#include <string.h>
#define MAX 1001
int c[MAX][MAX];
int m, n;
void LCRLength(char *X, char *Y) {
int i, j;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | #include <stdio.h>
#include <string.h>
#define MAX 1001
int c[MAX][MAX];
int m, n;
void LCRLength(char *X, char *Y) {
int i, j;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, ... | 0 | 314 | 8 |
#include <stdio.h>
#include <string.h>
char s1[2000];
char s2[2000];
// int answer[100][100];
int LCS(int, int);
int main() {
int sumstring;
int i, j, k;
scanf("%d", &sumstring);
for (i = 0; i < sumstring; i++) {
scanf("%s", s1);
scanf("%s", s2);
// strcat(empty,s1);
// strcat(empty,s2);
... | #include <stdio.h>
#include <string.h>
char s1[2000];
char s2[2000];
// int answer[100][100];
int LCS(int, int);
int main() {
int sumstring;
int i, j, k;
scanf("%d", &sumstring);
for (i = 0; i < sumstring; i++) {
scanf("%s", s1);
scanf("%s", s2);
// strcat(empty,s1);
// strcat(empty,s2);
... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 500 | 4 |
#include <stdio.h>
#define N 1001
int strlen(char s[]) {
int w = 0;
while (1) {
if (s[w] == '\0')
break;
w++;
}
return w;
}
int max(int a, int b, int c) {
int m = a;
if (m < b)
m = b;
if (m < c)
m = c;
return m;
}
int c[N][N];
char X[N], Y[N];
int main() {
int q, xl = 0, yl =... | #include <stdio.h>
#define N 1001
int strlen(char s[]) {
int w = 0;
while (1) {
if (s[w] == '\0')
break;
w++;
}
return w;
}
int max(int a, int b, int c) {
int m = a;
if (m < b)
m = b;
if (m < c)
m = c;
return m;
}
int c[N][N];
char X[N], Y[N];
int main() {
int q, xl = 0, yl =... | [["-", 3, 4, 0, 69, 28, 69, 71, 16, 17, 33], ["-", 3, 4, 0, 69, 28, 69, 71, 16, 12, 13], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 389 | 4 |
#include <stdio.h>
#include <string.h>
int q, i, j, k, m, n, c[1001][1001], ans[151];
char x[1001], y[1001];
int main(void) {
scanf("%d", &q);
for (k = 0; k < q; k++) {
scanf("%s", x);
scanf("%s", y);
m = strlen(x);
n = strlen(y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (... | #include <stdio.h>
#include <string.h>
int q, i, j, k, m, n, c[1001][1001], ans[151];
char x[1001], y[1001];
int main(void) {
scanf("%d", &q);
for (k = 0; k < q; k++) {
scanf("%s", x);
scanf("%s", y);
m = strlen(x);
n = strlen(y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 329 | 4 |
#include <ctype.h>
#include <stdio.h>
int main() {
int q, maxl, xi, yi, i, j, ii;
char X[1002], Y[1002];
long int C[1001][1001], Z[150];
scanf("%d", &q);
for (ii = 0; ii < q; ii++) {
scanf("%s", X);
scanf("%s", Y);
/*????????°*/
xi = 1;
while (X[xi]) {
xi++;
}
yi = 1;
... | #include <ctype.h>
#include <stdio.h>
int main() {
int q, maxl, xi, yi, i, j, ii;
char X[1002], Y[1002];
long int C[1001][1001], Z[150];
scanf("%d", &q);
for (ii = 0; ii < q; ii++) {
scanf("%s", X);
scanf("%s", Y);
/*????????°*/
xi = 1;
while (X[xi]) {
xi++;
}
yi = 1;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 436 | 2 |
#include <stdio.h>
#include <string.h>
#define MAX 1001
int main(void) {
int num, m, n, i, j;
int a[MAX], b[MAX];
char x[MAX], y[MAX], xi;
scanf("%d ", &num);
while (num--) {
scanf("%s %s ", x, y);
m = strlen(x);
n = strlen(y);
for (i = 0; i < n + 1; i++) {
b[i] = a[i] = 0;
}
... | #include <stdio.h>
#include <string.h>
#define MAX 1001
int main(void) {
int num, m, n, i, j;
int a[MAX], b[MAX];
char x[MAX], y[MAX], xi;
scanf("%d ", &num);
while (num--) {
scanf("%s %s ", x, y);
m = strlen(x);
n = strlen(y);
for (i = 0; i < n + 1; i++) {
b[i] = a[i] = 0;
}
... | [["-", 0, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 0, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 0 | 275 | 2 |
#include <stdio.h>
#include <string.h>
char x[1000], y[1000];
int lcs() {
int i, j;
int m = strlen(x);
int n = strlen(y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | #include <stdio.h>
#include <string.h>
char x[1000], y[1000];
int lcs() {
int i, j;
int m = strlen(x);
int n = strlen(y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 310 | 2 |
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#define UTIL_MAX(x, y) ((x) < (y) ? (y) : (x))
#define MAX_LENGTH 1000
size_t longest_common_subsequence(char arr1[], size_t n1, char arr2[],
size_t n2) {
size_t lcs[MAX_LENGTH + 1][MAX_LENGTH + 1];
uint32_t i;
for (i... | #include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#define UTIL_MAX(x, y) ((x) < (y) ? (y) : (x))
#define MAX_LENGTH 1000
size_t longest_common_subsequence(char arr1[], size_t n1, char arr2[],
size_t n2) {
size_t lcs[MAX_LENGTH + 1][MAX_LENGTH + 1];
uint32_t i;
for (i... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 362 | 1 |
#include <stdio.h>
#include <string.h>
int c[151][151];
char X[1001], Y[1001];
int lcsLength(void) {
int m, n, i, j;
m = strlen(X);
n = strlen(Y);
for (i = 0; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | #include <stdio.h>
#include <string.h>
int c[1001][1001];
char X[1001], Y[1001];
int lcsLength(void) {
int m, n, i, j;
m = strlen(X);
n = strlen(Y);
for (i = 0; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], [... | 0 | 312 | 8 |
#include <stdio.h>
#include <string.h>
int LCSLength();
char X[1000], Y[1000];
int main() {
int i, q;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s%s", X, Y);
printf("%d\n", LCSLength());
}
return 0;
}
int LCSLength() {
int i, j, m, n, c[1000][1000];
m = strlen(X);
n = strlen(Y);
... | #include <stdio.h>
#include <string.h>
int LCSLength();
char X[1000], Y[1000];
int main() {
int i, q;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s%s", X, Y);
printf("%d\n", LCSLength());
}
return 0;
}
int LCSLength() {
int i, j, m, n, c[1001][1001];
m = strlen(X);
n = strlen(Y);
... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 1... | 0 | 298 | 8 |
#include <stdio.h>
#include <string.h>
#define N 1000
int c[N][N];
char X[N], Y[N];
int LCSLength() {
int i, j, m, n;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (X[i] =... | #include <stdio.h>
#include <string.h>
#define N 1001
int c[N][N];
char X[N], Y[N];
int LCSLength() {
int i, j, m, n;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (X[i - 1... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 318 | 6 |
#include <stdio.h>
#include <string.h>
int LCSlength(char *, char *);
int main() {
int q, i, length;
char x[1000], y[1000];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", x);
scanf("%s", y);
length = LCSlength(x, y);
printf("%d\n", length);
}
return 0;
}
int LCSlength(char ... | #include <stdio.h>
#include <string.h>
int LCSlength(char *, char *);
int main() {
int q, i, length;
char x[1000], y[1000];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", x);
scanf("%s", y);
length = LCSlength(x, y);
printf("%d\n", length);
}
return 0;
}
int LCSlength(char ... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 337 | 4 |
#include <stdio.h>
#include <string.h>
int check(void);
char a[1001], b[1001];
int c[1001][1001];
int main() {
int q, i, j;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", a);
scanf("%s", b);
printf("%d\n", check());
/* for(j=0;j<1001;j++) a[j]='\0';
for(j=0;j<1001;j++) b[j]='\0'... | #include <stdio.h>
#include <string.h>
int check(void);
char a[1001], b[1001];
int c[1001][1001];
int main() {
int q, i, j;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", a);
scanf("%s", b);
printf("%d\n", check());
/* for(j=0;j<1001;j++) a[j]='\0';
for(j=0;j<1001;j++) b[j]='\0'... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 345 | 4 |
#include <stdio.h>
#include <string.h>
int LCS(const char X[], const char Y[]) {
int LCS[1001][1001];
int i, j;
int xl, yl;
int ans;
xl = strlen(X);
yl = strlen(Y);
for (i = 0; i <= xl; ++i) {
for (j = 0; j <= yl; ++j) {
if (i == 0 || j == 0)
LCS[i][j] = 0;
else {
if (X[... | #include <stdio.h>
#include <string.h>
int LCS(const char X[], const char Y[]) {
int LCS[1001][1001];
int i, j;
int xl, yl;
int ans;
xl = strlen(X);
yl = strlen(Y);
for (i = 0; i <= xl; ++i) {
for (j = 0; j <= yl; ++j) {
if (i == 0 || j == 0)
LCS[i][j] = 0;
else {
if (X[... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 318 | 4 |
#include <stdio.h>
#include <string.h>
int lcs(char x[], char y[]) {
int i, j;
int u = strlen(x);
int v = strlen(y);
int a[u + 1][v + 1];
for (i = 0; i <= u; i++)
a[i][0] = 0;
for (i = 0; i <= v; i++)
a[0][i] = 0;
for (i = 1; i <= u; i++) {
for (j = 1; j <= v; j++) {
if (x[i - 1] == y[... | #include <stdio.h>
#include <string.h>
int lcs(char x[], char y[]) {
int i, j;
int u = strlen(x);
int v = strlen(y);
int a[u + 1][v + 1];
for (i = 0; i <= u; i++)
a[i][0] = 0;
for (i = 0; i <= v; i++)
a[0][i] = 0;
for (i = 1; i <= u; i++) {
for (j = 1; j <= v; j++) {
if (x[i - 1] == y[... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 312 | 2 |
#include <stdio.h>
#include <string.h>
#define MAX 1001
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int LCS(char X[], char Y[]) {
int i, j;
int A[strlen(X) + 1];
int B[strlen(X) + 1];
for (i = 0; i < strlen(X) + 1; i++) {
A[i] = 0;
B[i] = 0;
}
for (i = 0; i < strlen(Y); i++... | #include <stdio.h>
#include <string.h>
#define MAX 1001
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int LCS(char X[], char Y[]) {
int i, j;
int A[strlen(X) + 1];
int B[strlen(X) + 1];
for (i = 0; i < strlen(X) + 1; i++) {
A[i] = 0;
B[i] = 0;
}
for (i = 0; i < strlen(Y); i++... | [["-", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22]] | 0 | 389 | 2 |
#include <stdio.h>
#include <string.h>
#define N 1000
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
int lcs(char *, char *);
int main(void) {
int i, n;
char s1[N + 1], s2[N + 1];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%*c%s%*c%s", s1, s2);
printf("%d\n", lcs(s1, s2));
}
}
int lcs(char *s1, ch... | #include <stdio.h>
#include <string.h>
#define N 1000
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
int lcs(char *, char *);
int main(void) {
int i, n;
char s1[N + 1], s2[N + 1];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%*c%s%*c%s", s1, s2);
printf("%d\n", lcs(s1, s2));
}
}
int lcs(char *s1, ch... | [["-", 8, 9, 0, 37, 0, 69, 28, 69, 71, 22], ["+", 8, 9, 0, 37, 0, 69, 28, 69, 71, 22]] | 0 | 325 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int times, m, n, i, j, c[1001][1001];
char x[1001], y[1001];
scanf("%d", ×);
while (times--) {
scanf("%s", x);
scanf("%s", y);
m = strlen(x);
n = strlen(y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j ... | #include <stdio.h>
#include <string.h>
int main(void) {
int times, m, n, i, j, c[1001][1001];
char x[1001], y[1001];
scanf("%d", ×);
while (times--) {
scanf("%s", x);
scanf("%s", y);
m = strlen(x);
n = strlen(y);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j ... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 284 | 4 |
#include <stdio.h>
#include <string.h>
int LSC_Length(char[], char[]);
int main() {
int n, i;
char X[1001], Y[1001];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", &X[0]);
scanf("%s", Y);
LSC_Length(X, Y);
}
// printf("%s\n", X);
// printf("%s\n", Y);
return 0;
}
int LSC_Length... | #include <stdio.h>
#include <string.h>
int LSC_Length(char[], char[]);
int main() {
int n, i;
char X[1001], Y[1001];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", &X[0]);
scanf("%s", Y);
LSC_Length(X, Y);
}
// printf("%s\n", X);
// printf("%s\n", Y);
return 0;
}
int LSC_Length... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 337 | 4 |
import java.util.Scanner;
public class Main {
private static final int r = 0, c = 1, EMPTY = -1;
private static int[] p;
private static int[][] m;
public static void main(String[] args) {
// input
Scanner sc = new Scanner(System.in).useDelimiter(
System.getProperty("line.separator"));
i... | import java.util.Scanner;
public class Main {
private static final int r = 0, c = 1, EMPTY = -1;
private static int[] p;
private static int[][] m;
public static void main(String[] args) {
// input
Scanner sc = new Scanner(System.in).useDelimiter(
System.getProperty("line.separator"));
i... | [["-", 0, 195, 8, 196, 0, 7, 502, 11, 12, 499], ["+", 0, 195, 8, 196, 0, 7, 502, 11, 12, 499], ["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 12, 16, 31, 16, 12, 504, 71, 16, 17, 72], ["+", 12, 16, 31, 16, 12, 504, 71, 16, 12, 499], ["+", 12, 16, 12, 16, 12, 504, 71, 16, 17,... | 3 | 342 | 8 |
#include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | [["+", 51, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 51, 2, 3, 4, 0, 16, 31, 23, 0, 25]] | 0 | 380 | 4 |
#include <stdio.h>
static const int N = 100;
int main() {
int n, i, j, k, l, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (j = 2; j <= n; j++) {
for (i = 1; i <= n - j + 1; i++) {
k =... | #include <stdio.h>
static const int N = 100;
int main() {
int n, i, j, k, l, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (j = 2; j <= n; j++) {
for (i = 1; i <= n - j + 1; i++) {
k =... | [["-", 0, 16, 12, 16, 31, 16, 12, 69, 71, 22], ["+", 0, 16, 12, 16, 31, 16, 12, 69, 71, 22], ["-", 0, 11, 12, 16, 31, 16, 12, 69, 71, 22], ["+", 0, 11, 12, 16, 31, 16, 12, 69, 71, 22]] | 0 | 296 | 4 |
#include <stdio.h>
#define N 100
int min(int x, int y) {
if (x < y)
return x;
else if (x > y)
return y;
}
int main() {
int i, j, k, l, v, n;
int A[N + 1], B[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &A[i - 1], &A[i]);
for (i = 1; i <= n; i++)
B[i][i] = 0;
... | #include <stdio.h>
#define N 100
int min(int x, int y) {
if (x < y)
return x;
else if (x > y)
return y;
}
int main() {
int i, j, k, l, v, n;
int A[N + 1], B[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &A[i - 1], &A[i]);
for (i = 1; i <= n; i++)
B[i][i] = 0;
... | [["-", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 326 | 2 |
#include <stdio.h>
#define N 100
int a[N][N];
int d[N + 1];
void matrixChain(int n) {
int i, j, k, l, m;
for (i = 0; i <= n; i++) {
a[i][i] = 0;
}
for (j = 0; j <= n; j++) {
for (i = 1; i < n - j + 2; i++) {
l = i + j - 1;
a[i][l] = 1000000;
for (k = i; k < l; k++) {
m = a[i][... | #include <stdio.h>
#define N 100
int a[N][N];
int d[N + 1];
void matrixChain(int n) {
int i, j, k, l, m;
for (i = 0; i <= n; i++) {
a[i][i] = 0;
}
for (j = 2; j <= n + 1; j++) {
for (i = 1; i < n - j + 2; i++) {
l = i + j - 1;
a[i][l] = 1000000;
for (k = i; k < l; k++) {
m = a... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 275 | 6 |
#include <limits.h>
#include <stdio.h>
#define MAX 100
int matrix[MAX][MAX];
int A[MAX];
int len;
void MatrixOrder(void) {
int a, b, i, j, k, n;
n = len;
for (i = 1; i <= n; i++) {
matrix[i][i] = 0;
}
for (k = 2; k < n; k++) {
for (i = 1; i <= n - k + 1; i++) {
a = i + k - 1;
// matrix... | #include <limits.h>
#include <stdio.h>
#define MAX 100
int matrix[MAX][MAX];
int A[MAX];
int len;
void MatrixOrder(void) {
int a, b, i, j, k, n;
n = len;
for (i = 1; i <= n; i++) {
matrix[i][i] = 0;
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n - k + 1; i++) {
a = i + k - 1;
// matri... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 293 | 2 |
#include <stdio.h>
void Matrix(void);
int m[100][100] = {0};
int p[100];
int length;
void Matrix(void) {
int x;
int y;
int i;
int j;
int k;
int n = length;
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n - k + 1; i++) {
x = i + k - 1;
m... | #include <stdio.h>
void Matrix(void);
int m[100][100] = {0};
int p[100];
int length;
void Matrix(void) {
int x;
int y;
int i;
int j;
int k;
int n = length;
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n - k + 1; i++) {
x = i + k - 1;
m... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 304 | 4 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct CELL {
int row;
int col;
} CELL;
int dp[100][100];
int main() {
int i, j, k, n;
scanf("%d", &n);
CELL *A = (CELL *)malloc(sizeof(CELL) * (n + 1));
for (i = 0; i < n; i++) {
scanf("%d %d", &(A[i].row), &(A[... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct CELL {
int row;
int col;
} CELL;
int dp[100][100];
int main() {
int i, j, k, n;
scanf("%d", &n);
CELL *A = (CELL *)malloc(sizeof(CELL) * (n + 1));
for (i = 0; i < n; i++) {
scanf("%d %d", &(A[i].row), &(A[... | [["-", 12, 16, 31, 16, 31, 118, 28, 69, 71, 22], ["+", 12, 16, 31, 16, 31, 118, 28, 69, 71, 22]] | 0 | 364 | 2 |
#include <stdio.h>
int main() {
int i, j, k, l, n, m[100][100], p[100], a, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
if (i < n - 1)
scanf("%d%d", &p[i], &a);
else
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
m[i][j] = 0;
}
for... | #include <stdio.h>
int main() {
int i, j, k, l, n, m[100][100], p[100], a, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
if (i < n - 1)
scanf("%d%d", &p[i], &a);
else
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
m[i][j] = 0;
}
for... | [["-", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 11, 31, 69, 28, 69, 71, 22], ["+", 0, 1, 0, 11, 31, 69, 28, 69, 71, 22], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 22]] | 0 | 290 | 6 |
#include <stdio.h>
#include <stdlib.h>
#define N 100
int main(void) {
int n, p[N], m[N][N];
int i, j, k, l, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d", &p[i], &j);
p[n] = j;
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define N 100
int main(void) {
int n, p[N], m[N][N];
int i, j, k, l, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d", &p[i], &j);
p[n] = j;
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 257 | 2 |
#include <stdio.h>
int min(int, int);
#define N 100
int main() {
int n, p[N], m[N][N];
int i, l, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j =... | #include <stdio.h>
int min(int, int);
#define N 100
int main() {
int n, p[N], m[N][N];
int i, l, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j =... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 283 | 2 |
#include <stdio.h>
#define N 100
int main() {
int n, i, j, k, min, temp;
int r[N + 1], m[N][N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &r[i], &r[i + 1]);
}
for (i = 0; i < n; i++) {
m[i][i] = 0;
}
for (i = 1; i < n; i++) {
for (j = 0; j < n - i; j++) {
for (k = ... | #include <stdio.h>
#define N 100
int main() {
int n, i, j, k, min, temp;
int r[N + 1], m[N][N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &r[i], &r[i + 1]);
}
for (i = 0; i < n; i++) {
m[i][i] = 0;
}
for (i = 1; i < n; i++) {
for (j = 0; j < n - i; j++) {
for (k = ... | [["-", 12, 16, 31, 16, 12, 69, 71, 16, 12, 13], ["+", 12, 16, 31, 16, 12, 69, 71, 16, 12, 22]] | 0 | 250 | 2 |
#include <stdio.h>
int main() {
int n, i, l, j, k, ans;
int p[100];
int m[100][100];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j = i + l - 1;
... | #include <stdio.h>
int main() {
int n, i, l, j, k, ans;
int p[100];
int m[100][100];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j = i + l - 1;
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 277 | 2 |
#include <stdio.h>
#define INF 100000000
int m[100][100];
int p[100], a;
int min(int a, int b) {
if (a <= b)
return a;
return b;
}
void matrixChainOrder() {
int n = a, i, j, l, k, q;
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j... | #include <stdio.h>
#define INF 100000000
int m[100][100];
int p[100], a;
int min(int a, int b) {
if (a <= b)
return a;
return b;
}
void matrixChainOrder() {
int n = a, i, j, l, k, q;
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 296 | 4 |
#include <stdio.h>
#define INF -1
static const int N = 100;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int i, j;
int k, l;
int n;
int p[N + 1], m[N + 1][N + 1];
int q;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)... | #include <stdio.h>
#define INF 10000000
static const int N = 100;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int i, j;
int k, l;
int n;
int p[N + 1], m[N + 1][N + 1];
int q;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 291 | 2 |
#include <stdio.h>
#define N 100
#define INF (1 << 21)
int min(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int i, j, k, l, n, q, p[N + 1], M[N + 1][n + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
M[i][... | #include <stdio.h>
#define N 100
#define INF (1 << 21)
int min(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int i, j, k, l, n, q, p[N + 1], M[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++)
M[i][... | [["-", 8, 9, 0, 43, 49, 80, 81, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 31, 22]] | 0 | 285 | 2 |
#include <stdio.h>
#define N 100
#define INF 100
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
int i, l, j, k, n, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
for ... | #include <stdio.h>
#define N 100
#define INF 100000
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
int i, l, j, k, n, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
f... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72]] | 0 | 273 | 4 |
#include <stdio.h>
#define N 101
#define INF 100000000
int min(int x, int y) {
if (x > y)
return x;
return y;
}
int main() {
int i, j, k, l, n, r[N], M[N][N];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &r[i - 1], &r[i]);
for (i = 1; i <= n; i++)
M[i][i] = 0;
for (j = 2; j <= ... | #include <stdio.h>
#define N 101
#define INF 100000000
int min(int x, int y) {
if (x < y)
return x;
return y;
}
int main() {
int i, j, k, l, n, r[N], M[N][N];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &r[i - 1], &r[i]);
for (i = 1; i <= n; i++)
M[i][i] = 0;
for (j = 2; j <= ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 270 | 2 |
#include <stdio.h>
int min(int a, int b) {
if (a <= b)
return a;
if (b <= a)
return b;
}
int main() {
int i, j, l, k, n, q;
int p[101], m[101][101];
scanf("%d", &n);
for (i = 1; i < n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (l = ... | #include <stdio.h>
int min(int a, int b) {
if (a <= b)
return a;
if (b <= a)
return b;
}
int main() {
int i, j, l, k, n, q;
int p[101], m[101][101];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &p[i - 1], &p[i]);
}
for (i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (l =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 281 | 4 |
#include <stdio.h>
#define INF 1000000
#define r 100
#define c 100
void matrixChainOrder(int p[]);
int n, m[r][c], p[100];
int main() {
int i, n;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &p[i - 1], &p[i]);
matrixChainOrder(p);
printf("%d\n", m[1][n]);
return 0;
}
void matrixChainOrde... | #include <stdio.h>
#define INF 1000000
#define r 100
#define c 100
void matrixChainOrder(int p[]);
int n, m[r][c], p[100];
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &p[i - 1], &p[i]);
matrixChainOrder(p);
printf("%d\n", m[1][n]);
return 0;
}
void matrixChainOrder(i... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 0 | 287 | 2 |
#include <stdio.h>
#define inf 9999999
#define r 100
#define c 100
int n, M[r][c], a[100];
void matrixChainOrder(int a[]) {
int i, j, k, l, m;
for (i = 1; i < n; i++) {
M[i][i] = 0;
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n + 1 - k; i++) {
j = k + i - 1;
M[i][j] = inf;
for ... | #include <stdio.h>
#define inf 9999999
#define r 100
#define c 100
int n, M[r][c], a[100];
void matrixChainOrder(int a[]) {
int i, j, k, l, m;
for (i = 1; i < n; i++) {
M[i][i] = 0;
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n + 1 - k; i++) {
j = k + i - 1;
M[i][j] = inf;
for ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 282 | 2 |
#include <stdio.h>
#define INFTY 10000000
#define N 100
int main() {
int n, o[N], m[N][N];
int i, j, k, l;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &o[i - 1], &o[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j ... | #include <stdio.h>
#define INFTY 10000000
#define N 100
int main() {
int n, o[N], m[N][N];
int i, j, k, l;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d %d", &o[i - 1], &o[i]);
for (i = 1; i <= n; i++)
m[i][i] = 0;
for (l = 2; l <= n; l++) {
for (i = 1; i <= n - l + 1; i++) {
j ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 282 | 2 |
n = eval(input())
def scalar(n):
m = [[0 for i in range(len(n))] for j in range(len(n))]
for l in range(2, len(n)+1):
for i in range(0, len(n)-l+1):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print(m[0][len(n)-1])
for i in range(n... | n = eval(input())
M = []
def scalar(n):
m = [[0 for i in range(len(n))] for j in range(len(n))]
for l in range(2, len(n)+1):
for i in range(0, len(n)-l+1):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print(m[0][len(n)-1])
for i... | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 70], ["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 73]] | 5 | 188 | 4 |
def main():
n = int(input())
m = [ [0] * n for _ in range(n)]
p = [ 0 for _ in range(n+1)]
for i in range(n):
a = list(map(int, input().split()))
if i == 0:
p[0] = a[0]
p[1] = a[1]
else:
p[i+1] = a[1]
for l in range(2,n+1):
for i i... | def main():
n = int(input())
m = [ [0] * n for _ in range(n)]
p = [ 0 for _ in range(n+1)]
for i in range(n):
a = list(map(int, input().split()))
if i == 0:
p[0] = a[0]
p[1] = a[1]
else:
p[i+1] = a[1]
for l in range(2,n+1):
for i i... | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 0, 652, 3, 4, 0, 206, 51, 206, 51, 22]] | 5 | 233 | 2 |
def matrixChainMultiplication(p):
# p = [p_0, p_1, ..., p_n]
n = len(p) - 1
# n+1 x n+1 zero matrix?????????(0,...,n)
# cost(i,j): (M_i...M_j)???????°??????????
cost = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for numOfMatrices in range(2, n + 1):
for i in range(1, n - numOfMatri... | def matrixChainMultiplication(p):
# p = [p_0, p_1, ..., p_n]
n = len(p) - 1
# n+1 x n+1 zero matrix?????????(0,...,n)
# cost(i,j): (M_i...M_j)???????°??????????
cost = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for numOfMatrices in range(2, n + 1):
for i in range(1, n - numOfMatri... | [["-", 0, 652, 3, 4, 0, 206, 51, 206, 51, 22], ["+", 0, 652, 3, 4, 0, 206, 51, 206, 51, 22]] | 5 | 219 | 2 |
INF = float("inf")
n = int(input())
A = [0]
for i, a in enumerate(sys.stdin):
a = list(map, a.split())
if i == 0:
A.extend(a)
else:
A.append(a[1])
C = [[INF] * (n + 1) for _ in range(n + 1)]
for i in range(n + 1):
C[i][i] = 0
for j in range(1, n):
for i in range(1, n - j + 1):
... | import sys
INF = float("inf")
n = int(input())
A = [0]
for i, a in enumerate(sys.stdin):
a = list(map(int, a.split()))
if i == 0:
A.extend(a)
else:
A.append(a[1])
C = [[INF] * (n + 1) for _ in range(n + 1)]
for i in range(n + 1):
C[i][i] = 0
for j in range(1, n):
for i in range(1, n ... | [["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 222 | 5 |
INF = float("inf")
n = int(input())
m = [[0] * (n + 1) for _ in range(n + 1)]
li = [list(map(int, a.split())) for a in sys.stdin]
z = (li[0][0], ) + list(zip(*li))[1]
for l in range(1, n):
for i in range(1, n - l + 1):
j = i + l
m[i][j] = INF
for k in range(i, j):
m[i][j] = min(m... | import sys
INF = float("inf")
n = int(input())
m = [[0] * (n + 1) for _ in range(n + 1)]
li = [list(map(int, a.split())) for a in sys.stdin]
z = (li[0][0], ) + list(zip(*li))[1]
for l in range(1, n):
for i in range(1, n - l + 1):
j = i + l
m[i][j] = INF
for k in range(i, j):
m[i]... | [["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22]] | 5 | 196 | 2 |
n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
m = [[0] * n for i in range(n)]
for l in range(2, n + 1):
for i in range(n - k + 1):
j = i + l - 1
m[i][j] = float('inf')
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i][0] * p[k]... | n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
m = [[0] * n for i in range(n)]
for l in range(2, n + 1):
for i in range(n - l + 1):
j = i + l - 1
m[i][j] = float('inf')
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i][0] * p[k]... | [["-", 12, 652, 3, 4, 0, 657, 31, 657, 12, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 12, 22]] | 5 | 177 | 2 |
(function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
let i, j, X, Y, xlen, ylen, maxlen;
let c = Array.from(Array(1000 + 1), () => []);
while ((X = lines.shift()) && (Y = lines.shift())) {
xlen = X.length;
ylen = ... | (function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
let i, j, X, Y, xlen, ylen, maxlen;
let c = Array.from(Array(1000 + 1), () => []);
while ((X = lines.shift()) && (Y = lines.shift())) {
xlen = X.length;
ylen = ... | [["-", 8, 556, 0, 7, 10, 1, 0, 11, 31, 22], ["+", 8, 556, 0, 7, 10, 1, 0, 11, 31, 22], ["-", 8, 556, 0, 7, 15, 1, 0, 16, 31, 22], ["+", 8, 556, 0, 7, 15, 1, 0, 16, 31, 22], ["-", 8, 556, 0, 7, 15, 1, 0, 16, 12, 22], ["+", 8, 556, 0, 7, 15, 1, 0, 16, 12, 22], ["-", 0, 52, 8, 556, 0, 7, 567, 27, 28, 22], ["+", 0, 52, 8, ... | 2 | 288 | 8 |
#include <stdio.h>
#include <string.h>
int LCSLength(char *, char *);
int main() {
int i, n;
char X[1000], Y[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCSLength(X, Y));
}
return 0;
}
int LCSLength(char *X, char *Y) {
int i, j, m, n;
... | #include <stdio.h>
#include <string.h>
int LCSLength(char *, char *);
int main() {
int i, n;
char X[1000], Y[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCSLength(X, Y));
}
return 0;
}
int LCSLength(char *X, char *Y) {
int i, j, m, n;
... | [["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13]] | 0 | 333 | 4 |
#include <stdio.h>
#include <string.h>
char str1[1000], str2[1000];
int C[1001][1001];
void LongestCommonSub() {
int len1, len2, i, j, max = -1;
len1 = strlen(str1);
len2 = strlen(str2);
for (i = 0; i <= len1; i++)
C[i][0] = 0;
for (j = 0; j <= len2; j++)
C[0][j] = 0;
for (i = 1; i <= len1; i++) {... | #include <stdio.h>
#include <string.h>
char str1[1000], str2[1000];
int C[1001][1001];
void LongestCommonSub() {
int len1, len2, i, j, max = -1;
len1 = strlen(str1);
len2 = strlen(str2);
for (i = 0; i <= len1; i++)
C[i][0] = 0;
for (j = 0; j <= len2; j++)
C[0][j] = 0;
for (i = 1; i <= len1; i++) {... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 315 | 4 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SIZE 1010
char *reverseString(char *str);
int max(int a, int b);
int main(void) {
char str1[SIZE], str2[SIZE];
int str1len, str2len, i, j, k, anscount = 0;
int dp[SIZE][SIZE];
char ansstr[SIZE];
int q;
scanf("%d", &q);
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SIZE 1010
char *reverseString(char *str);
int max(int a, int b);
int main(void) {
char str1[SIZE], str2[SIZE];
int str1len, str2len, i, j, k, anscount = 0;
int dp[SIZE][SIZE];
char ansstr[SIZE];
int q;
scanf("%d\n", &q);
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 417 | 1 |
#include <stdio.h>
#include <string.h>
#define N 10001
int c[N][N];
int LCS(char X[], char Y[]) {
int m, n;
int i, j;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if ... | #include <stdio.h>
#include <string.h>
#define N 10001
int c[N][N];
int LCS(char X[], char Y[]) {
int m, n;
int i, j;
m = strlen(X);
n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if ... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 346 | 4 |
#include <stdio.h>
#include <string.h>
char x[1001], y[1001];
void LCS(char x[], char y[]) {
int i, j;
int c[100000][100000];
int m = strlen(x + 1), n = strlen(y + 1);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j =... | #include <stdio.h>
#include <string.h>
char x[1001], y[1001];
void LCS(char x[], char y[]) {
int i, j;
int c[1001][1001];
int m = strlen(x + 1), n = strlen(y + 1);
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; ... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 331 | 4 |
#include <stdio.h>
#include <string.h>
#define MAX 1000
int LCS(char *, char *, int, int);
int main(void) {
int n;
char X[MAX], Y[MAX];
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCS(X, Y, strlen(X), strlen(Y)));
}
return 0;
}
int L... | #include <stdio.h>
#include <string.h>
#define MAX 1000
int LCS(char *, char *, int, int);
int main(void) {
int n;
char X[MAX], Y[MAX];
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
printf("%d\n", LCS(X, Y, strlen(X), strlen(Y)));
}
return 0;
}
int L... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 332 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.