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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02104 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, p, ans[100005];
deque<int> q, q2[100005];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p);
q2[p - 1].push_back(i + 1);
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
while (!q2[j].empty()) {
... | #include <bits/stdc++.h>
using namespace std;
int n, p, ans[100005];
deque<int> q, q2[100005];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p);
q2[p - 1].push_back(i + 1);
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
while (!q2[j].empty()) {
... | replace | 23 | 24 | 23 | 24 | 0 | |
p02109 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 85 | 86 | 85 | 87 | MLE | |
p02115 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, a[1100], d = 0, ans1 = 0, ans2 = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = 2; i <= N; i++) {
if (a[i] > a[i - 1... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, a[1000000], d = 0, ans1 = 0, ans2 = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = 2; i <= N; i++) {
if (a[i] > a[i ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02116 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std... | replace | 54 | 55 | 54 | 55 | TLE | |
p02119 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>... | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>... | replace | 61 | 63 | 61 | 63 | 0 | |
p02119 | C++ | Runtime Error | // ?????????????????????
#include <bits/stdc++.h>
using namespace std;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> match, alive, used;
int timestamp;
Bipartite_Matching(int n) {
timestamp = 0;
graph.resize(n);
alive.assign(n, 0);
used.assign(n, 0);
match.assign(n, ... | // ?????????????????????
#include <bits/stdc++.h>
using namespace std;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> match, alive, used;
int timestamp;
Bipartite_Matching(int n) {
timestamp = 0;
graph.resize(n);
alive.assign(n, 0);
used.assign(n, 0);
match.assign(n, ... | replace | 60 | 63 | 60 | 63 | 0 | |
p02122 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < ... | replace | 25 | 27 | 25 | 26 | TLE | |
p02126 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
... | replace | 30 | 31 | 30 | 31 | 0 | |
p02127 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | replace | 49 | 50 | 49 | 54 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | insert | 57 | 57 | 57 | 62 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | replace | 87 | 88 | 87 | 88 | MLE | |
p02127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define _rep(i, n) _repl(i, 0, n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp make_pair
#define pb push_back
#define all(x) begin(x), en... | #include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define _rep(i, n) _repl(i, 0, n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp make_pair
#define pb push_back
#define all(x) begin(x), en... | delete | 84 | 85 | 84 | 84 | 0 | |
p02127 | C++ | Memory Limit Exceeded | #include <iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
string x = t;
int ans = 0;
for (int i = 0; x.size() <= s.size(); i++) {
// check
// cerr << "x: " << x << endl;
int idx = 0;
for (char ch : s) {
if (idx < x.size() and ch == x[idx]) {
idx++;
... | #include <iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
string x = t;
int ans = 0;
for (int i = 0; x.size() <= s.size(); i++) {
// check
// cerr << "x: " << x << endl;
int idx = 0;
for (char ch : s) {
if (idx < x.size() and ch == x[idx]) {
idx++;
... | insert | 24 | 24 | 24 | 28 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i, n) rep(i, (n) + 1)
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i, n) rep(i, (n) + 1)
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF... | insert | 37 | 37 | 37 | 41 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | insert | 48 | 48 | 48 | 52 | MLE | |
p02127 | C++ | Memory Limit Exceeded |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#inc... |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#inc... | insert | 54 | 54 | 54 | 58 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
string s, t;
cin >> s >> t;
int dep = 1;
string targ = t;
while (1) {
int pos = 0;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
string s, t;
cin >> s >> t;
int dep = 1;
string targ = t;
while (1) {
int pos = 0;
... | insert | 26 | 26 | 26 | 29 | MLE | |
p02127 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
using ll = long long;
int dd[] = {0, 1, 0, -1, 0}; // →↓←↑
void solve() {
string S, T;
cin >> S >> T;
string B = T;
int cnt = 0;
while (true) {
// judge
int s = 0, b = 0;
while (b < B.size()) {
if (s == S.size()) {
... | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
using ll = long long;
int dd[] = {0, 1, 0, -1, 0}; // →↓←↑
void solve() {
string S, T;
cin >> S >> T;
string B = T;
int cnt = 0;
while (true) {
// judge
int s = 0, b = 0;
while (b < B.size()) {
if (s == S.size()) {
... | replace | 32 | 36 | 32 | 36 | MLE | |
p02128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)... | insert | 53 | 53 | 53 | 57 | TLE | |
p02128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<lint, pii> plpii;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int N = 1010;
const lint inf = 1e16;
int main() {
int... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<lint, pii> plpii;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int N = 1010;
const lint inf = 1e16;
int main() {
int... | replace | 49 | 50 | 49 | 55 | TLE | |
p02131 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct SuffixArray {
vector<int> SA;
string s;
void Build_SA(const string &str) {
s = str;
SA.resize(s.size());
iota(begin(SA), end(SA), 0);
sort(begin(SA), end(SA), [&](const int &a, const int &b) {
if (s[a] == s[b])
return (a > b);
... | #include <bits/stdc++.h>
using namespace std;
struct SuffixArray {
vector<int> SA;
string s;
void Build_SA(const string &str) {
s = str;
SA.resize(s.size());
iota(begin(SA), end(SA), 0);
sort(begin(SA), end(SA), [&](const int &a, const int &b) {
if (s[a] == s[b])
return (a > b);
... | replace | 136 | 137 | 136 | 137 | 0 | |
p02132 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
/* 幾何の基本 */
#include <complex>
typedef complex<ld> Point;
const ld pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld ptod = 1. / dtop;
name... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
/* 幾何の基本 */
#include <complex>
typedef complex<ld> Point;
const ld pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld ptod = 1. / dtop;
name... | replace | 733 | 735 | 733 | 735 | TLE | |
p02133 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | replace | 26 | 28 | 26 | 28 | TLE | |
p02133 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | replace | 26 | 28 | 26 | 28 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int n;
int F[45];
int fibo(int i) {
if (F[i]) {
return F[i];
}
return fibo(i - 1) + fibo(i - 2);
}
int main() {
cin >> n;
F[0] = F[1] = 1;
cout << fibo(n) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int n;
int F[45];
int fibo(int i) {
if (F[i]) {
return F[i];
}
F[i] = fibo(i - 1) + fibo(i - 2);
return F[i];
}
int main() {
cin >> n;
F[0] = F[1] = 1;
cout << fibo(n) << endl;
return 0;
}
| replace | 9 | 10 | 9 | 11 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[50];
int fib(int n) {
if (n == 1 || n == 0)
A[n] = 1;
else
A[n] = fib(n - 1) + fib(n - 2);
return A[n];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[50];
int fib(int n) {
if (n == 1 || n == 0)
A[n] = 1;
else if (A[n])
;
else
A[n] = fib(n - 1) + fib(n - 2);
return A[n];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
| insert | 8 | 8 | 8 | 11 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int f[50];
int fibo(int n) {
if (n <= 1)
return 1;
return f[n] = fibo(n - 1) + fibo(n - 2);
}
int main() {
int n;
cin >> n;
cout << fibo(n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int f[50];
int fibo(int n) {
if (n <= 1)
return 1;
else {
if (f[n]) {
return f[n];
} else {
return f[n] = fibo(n - 1) + fibo(n - 2);
}
}
}
int main() {
int n;
cin >> n;
cout << fibo(n) << endl;
return 0;
}
| replace | 8 | 9 | 8 | 15 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <stdio.h>
#define MAX 50
int db[MAX];
int fibonacci(int n) {
if (n == 0 || n == 1)
return 1;
if (db[n] != -1)
return db[n];
return fibonacci(n - 1) + fibonacci(n - 2);
}
int main() {
int n;
for (int i = 0; i < MAX; ++i)
db[i] = -1;
scanf("%d", &n);
int result = fibonacci(n);
pr... | #include <stdio.h>
#define MAX 50
int db[MAX];
int fibonacci(int n) {
if (n == 0 || n == 1)
return 1;
if (db[n] != -1)
return db[n];
return db[n] = fibonacci(n - 1) + fibonacci(n - 2);
}
int main() {
int n;
for (int i = 0; i < MAX; ++i)
db[i] = -1;
scanf("%d", &n);
int result = fibonacci(... | replace | 11 | 12 | 11 | 12 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int fib(int n);
int memo[45];
int main() {
int n;
// 入力
cin >> n;
// 出力
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if (n == 0 || n == 1) {
return memo[n] = 1;
} else {
return memo[n] = fib(n - 1) + fib(n - 2);
}
}
| #include <iostream>
using namespace std;
int fib(int n);
int memo[45];
int main() {
int n;
// 入力
cin >> n;
// 出力
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if (n == 0 || n == 1) {
return 1;
} else if (memo[n] != 0) {
return memo[n];
} else {
return memo[n] = fib(n - 1) + fib... | replace | 19 | 20 | 19 | 22 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const int INF = 1e9;
using namespace std;
int calc[45];
int fib(int n) {
if (calc[n] != 0)
return calc[n];
return fib(n - 1) + fib(n - 2);
}
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const int INF = 1e9;
using namespace std;
int calc[45];
int fib(int n) {
if (calc[n] != 0)
return calc[n];
for (int i = 2; i <= n; i++)
calc[i] = calc[i - 2] + calc[i - 1];... | replace | 13 | 14 | 13 | 16 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 44 | 45 | 44 | 45 | TLE | |
p02233 | C++ | Time Limit Exceeded | // DP(???????¨??????? Dynamic Programing)
// ????????±???????????¢???
// ?????£??????????????°???
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_A
#include <iostream>
using namespace std;
#define MAX_N 44
struct memo {
int num;
bool flg;
} Memo[MAX_N + 1];
int n;
int fib(int);
int main() ... | // DP(???????¨??????? Dynamic Programing)
// ????????±???????????¢???
// ?????£??????????????°???
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_A
#include <iostream>
using namespace std;
#define MAX_N 44
struct memo {
int num;
bool flg;
} Memo[MAX_N + 1];
int n;
int fib(int);
int main() ... | replace | 46 | 47 | 46 | 47 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int d;
int dd[50];
int fib(int a) {
if (a == 0 || a == 1)
return dd[a] = 1;
if (dd[a] != -1)
return dd[a];
return fib(a - 1) + fib(a - 2);
}
int main() {
int c;
cin >> c;
for (int i = 0; i < 50; ++i) {
dd[i] = -1;
}
cout << fib(c) << endl;
re... | #include "bits/stdc++.h"
using namespace std;
int d;
int dd[50];
int fib(int a) {
if (a == 0 || a == 1)
return dd[a] = 1;
if (dd[a] != -1)
return dd[a];
return dd[a] = fib(a - 1) + fib(a - 2);
}
int main() {
int c;
cin >> c;
for (int i = 0; i < 50; ++i) {
dd[i] = -1;
}
cout << fib(c) << en... | replace | 9 | 10 | 9 | 10 | TLE | |
p02233 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void makeFibonacci(int fib[]) {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i <= 44; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
}
int main() {
int fib[45];
makeFibonacci(fib);
int n;
scanf("%d", &n);
printf("%d\n", fib[n]);
return -1;
}
| #include <bits/stdc++.h>
using namespace std;
void makeFibonacci(int fib[]) {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i <= 44; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
}
int main() {
int fib[45];
makeFibonacci(fib);
int n;
scanf("%d", &n);
printf("%d\n", fib[n]);
return 0;
}
| replace | 20 | 21 | 20 | 21 | 255 | |
p02233 | C++ | Time Limit Exceeded | // input: aldsalds1_10_a.in
#include <iostream>
#define MAX_N 45
#define NIL -1
using namespace std;
int dp[MAX_N];
int fib(int n) {
if (n == 0 || n == 1)
return 1;
if (dp[n] != NIL)
return dp[n];
return fib(n - 1) + fib(n - 2);
}
int main() {
for (int i = 0; i < MAX_N; i++)
dp[i] = NIL;
int... | // input: aldsalds1_10_a.in
#include <iostream>
#define MAX_N 45
#define NIL -1
using namespace std;
int dp[MAX_N];
int fib(int n) {
if (n == 0 || n == 1)
return 1;
if (dp[n] != NIL)
return dp[n];
int v = fib(n - 1) + fib(n - 2);
dp[n] = v;
return v;
}
int main() {
for (int i = 0; i < MAX_N; i... | replace | 15 | 16 | 15 | 19 | TLE | |
p02233 | C++ | Runtime Error | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
long long Fib(int n) {
vector<long long> F(n + 1);
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n + 1; i++) {
F[i] = F[i - 1] + F[i - 2];
}
return F[n];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
long long Fib(int n) {
vector<long long> F(n + 1);
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 1] + F[i - 2];
}
return F[n];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
c... | replace | 10 | 11 | 10 | 11 | 0 | |
p02233 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
int fib(int n) {
int i;
int a[25];
a[0] = a[1] = 1;
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[n];
}
int main() {
int x, n;
scanf("%d", &n);
x = fib(n);
printf("%d\n", x);
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int fib(int n) {
int i;
int a[44];
a[0] = a[1] = 1;
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[n];
}
int main() {
int x, n;
scanf("%d", &n);
x = fib(n);
printf("%d\n", x);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int solution(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
return solution(n - 1) + solution(n - 2);
}
int main() {
int n;
cin >> n;
cout << solution(n) << endl;
return 0;
} | #include <iostream>
using namespace std;
int solution(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
int one = 1, two = 1, tmp;
for (int i = 1; i < n; i++) {
tmp = two;
two = two + one;
one = tmp;
}
return two;
}
int main() {
int n;
cin >> n;
cout << solution(n) << endl;
r... | replace | 7 | 8 | 7 | 14 | TLE | |
p02233 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long int> fibonatti;
long long int dp[10000];
int calc(int n) {
if (n <= 1)
return 1;
if (dp[n] != -1)
return dp[n];
fibonatti[n] = calc(n - 1) + calc(n - 2);
return dp[n] = fibonatti[n];
}
int main(int argc, char *argv[]) {
int n;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
vector<long long int> fibonatti;
long long int dp[10000];
int calc(int n) {
if (n <= 1)
return 1;
if (dp[n] != -1)
return dp[n];
fibonatti[n] = calc(n - 1) + calc(n - 2);
return dp[n] = fibonatti[n];
}
int main(int argc, char *argv[]) {
int n;
cin >> n... | replace | 17 | 18 | 17 | 18 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02233 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int n, a[50];
int solve(int i) {
if (i == 1 || i == 0)
return 1;
return solve(i - 1) + solve(i - 2);
}
int main() {
int n;
cin >> n;
cout << solve(n) << endl;
return 0;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int n, a[50];
int solve(int i) {
if (i == 1 || i == 0)
return 1;
return solve(i - 1) + solve(i - 2);
}
int main() {
int n;
cin >> n;
int ans[50];
ans[0] = 1, ans[1] = 1;... | replace | 16 | 17 | 16 | 22 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define NIL -2000000001
#define MAX 2000
int A[MAX];
int n = 0;
int fib(int num) {
if (A[num] != NIL) {
return A[num];
} else {
return fib(num - 1) + fib(num - 2);
}
}
int main() {
int num;
for (int i = 0; i < MAX; i++... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define NIL -2000000001
#define MAX 2000
int A[MAX];
int n = 0;
int fib(int num) {
if (A[num] != NIL) {
return A[num];
} else {
A[num - 2] = fib(num - 2);
A[num - 1] = fib(num - 1);
return A[num - 2] + A[num - 1];
}... | replace | 14 | 15 | 14 | 17 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
long long int Fibo(long long int n) {
if (n == 0 || n == 1)
return 1;
return Fibo(n - 1) + Fibo(n - 2);
}
int main() {
long long int n;
std::cin >> n;
std::cout << Fibo(n) << std::endl;
return 0;
} | #include <iostream>
long long int Fibo(long long int n) {
if (n == 0 || n == 1)
return 1;
if (n == 44)
return 1134903170;
return Fibo(n - 1) + Fibo(n - 2);
}
int main() {
long long int n;
std::cin >> n;
std::cout << Fibo(n) << std::endl;
return 0;
} | insert | 5 | 5 | 5 | 7 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int f[45];
int fib(int n) {
if (n == 1 || n == 0)
return 1;
if (f[n] != 0)
return f[n];
else
return fib(n - 1) + fib(n - 2);
}
int main() {
int n... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int f[45];
int fib(int n) {
if (n == 1 || n == 0)
return 1;
if (f[n] != 0)
return f[n];
else
return f[n] = fib(n - 1) + fib(n - 2);
}
int main() {
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <cstdio>
int fibo(int n, int *dp) {
if (n == 0 || n == 1)
return 1;
if (0 < dp[n])
return dp[n];
return fibo(n - 1, dp) + fibo(n - 2, dp);
}
int main() {
int n;
int dp[50];
for (int i = 0; i < 50; i++)
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fibo(n, dp));
return 0;
} | #include <cstdio>
int fibo(int n, int *dp) {
if (n == 0 || n == 1)
return 1;
if (0 < dp[n])
return dp[n];
return dp[n] = fibo(n - 1, dp) + fibo(n - 2, dp);
}
int main() {
int n;
int dp[50];
for (int i = 0; i < 50; i++)
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fibo(n, dp));
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define MAX 50
int dp[MAX];
int fib(int n) {
if (n < 0)
return 0;
if (n == 0 || n == 1) {
dp[n] = 1;
return 1;
}
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX 50
int dp[MAX];
int fib(int n) {
if (n < 0)
return 0;
if (n == 0 || n == 1) {
dp[n] = 1;
return 1;
}
if (dp[n] != 0) {
return dp[n];
}
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
cin >> n;
cout << fib(n) << end... | insert | 14 | 14 | 14 | 17 | TLE | |
p02233 | C++ | Time Limit Exceeded | /*
* ALDS1_10_A.cpp
*
* Created on: May 5, 2018
* Author: 13743
*/
#include <iostream>
using namespace std;
int F[44];
int fib(int n) {
if (F[n] > 0)
return F[n];
return fib(n - 2) + fib(n - 1);
}
int main() {
int n;
cin >> n;
F[0] = F[1] = 1;
cout << fib(n) << endl;
}
| /*
* ALDS1_10_A.cpp
*
* Created on: May 5, 2018
* Author: 13743
*/
#include <iostream>
using namespace std;
int F[44];
int fib(int n) {
if (F[n] == 0) {
F[n] = fib(n - 2) + fib(n - 1);
}
return F[n];
}
int main() {
int n;
cin >> n;
F[0] = F[1] = 1;
cout << fib(n) << endl;
}
| replace | 14 | 17 | 14 | 18 | TLE | |
p02233 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define eol '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> list(n, 0);
list[0] = list[1] = 1;
for (int i = 2; i <= n; i++) {
list[i] = list[i - 1] + list[i - 2];
}
cout << list[n] << eol;
... | #include <iostream>
#include <vector>
#define eol '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> list(n + 1, 0);
list[0] = list[1] = 1;
for (int i = 2; i <= n; i++) {
list[i] = list[i - 1] + list[i - 2];
}
cout << list[n] << e... | replace | 12 | 13 | 12 | 13 | 0 | |
p02233 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int fib(int n);
int memo[45];
int main() {
int n;
// 入力
cin >> n;
// 出力
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if (n == 0) {
return 1;
} else if (n == 1) {
return 1;
} else if (memo[n] != 0) {
return memo[n];
} else {
re... | #include <iostream>
using namespace std;
int fib(int n);
int memo[45];
int main() {
int n;
// 入力
cin >> n;
// 出力
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if (n == 0) {
return 1;
} else if (n == 1) {
return 1;
} else if (memo[n] != 0) {
return memo[n];
} else {
re... | replace | 29 | 30 | 29 | 30 | TLE | |
p02234 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = a; i < (n); i++)
#define mod (ll)(1e9 + 7)
#define int ll
__attribute__((constructor)) void initial() {
cin.tie(0);
io... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = a; i < (n); i++)
#define mod (ll)(1e9 + 7)
#define int ll
__attribute__((constructor)) void initial() {
cin.tie(0);
io... | replace | 26 | 27 | 26 | 27 | 0 | |
p02234 | C++ | Runtime Error | #ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var) \
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#en... | #ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var) \
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#en... | insert | 15 | 15 | 15 | 18 | 0 | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
#define rep(i, n) for... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
#define rep(i, n) for... | replace | 44 | 45 | 44 | 45 | 0 | |
p02234 | C++ | Runtime Error | #include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <memory.h>
#include <sstream>
#include <string>
#include <vector>
typedef unsigned long long ull;
typedef unsigned long ul;
#define rep(i, n) for (unsigned long long i = 0; i < n; i++)
#define clear(c... | #include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <memory.h>
#include <sstream>
#include <string>
#include <vector>
typedef unsigned long long ull;
typedef unsigned long ul;
#define rep(i, n) for (unsigned long long i = 0; i < n; i++)
#define clear(c... | replace | 21 | 22 | 21 | 22 | 0 | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
const int MAX_N = 100;
const int INF = 999999999;
using namespace std;
int dp[MAX_N + 1][MAX_N + 1];
int p[MAX_N + 1];
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
dp[i][i] = 0;
}
for (int i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}... | #include <algorithm>
#include <iostream>
const int MAX_N = 100;
const int INF = 999999999;
using namespace std;
int dp[MAX_N + 1][MAX_N + 1];
int p[MAX_N + 1];
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
dp[i][i] = 0;
}
for (int i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}... | replace | 20 | 21 | 20 | 21 | 0 | |
p02234 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9 + 7
int n;
ll dp[102][102];
ll p[102];
void init() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = inf;
}
dp[i][i] = 0;
}
}
void cal(int l, int r) {
if (l >= r)
return;
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9 + 7
int n;
ll dp[102][102];
ll p[102];
void init() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = inf;
}
dp[i][i] = 0;
}
}
void cal(int l, int r) {
if (l >= r)
return;
if (dp... | insert | 21 | 21 | 21 | 23 | TLE | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
constexpr 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 <=... | #include <algorithm>
#include <iostream>
using namespace std;
constexpr 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 <=... | replace | 16 | 17 | 16 | 17 | 0 | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <limits>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define clr(a, v) memset((a), (v), sizeof(a))
const int MAX_N = 100, INF = std::numeric_limits<int>::max() >> 2;
int n;
int r[MAX_N], c[MA... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <limits>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define clr(a, v) memset((a), (v), sizeof(a))
const int MAX_N = 100, INF = std::numeric_limits<int>::max() >> 2;
int n;
int r[MAX_N], c[MA... | replace | 37 | 39 | 37 | 40 | 0 | |
p02234 | C++ | Runtime Error | #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... | #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... | replace | 16 | 17 | 16 | 17 | 0 | |
p02234 | C++ | Runtime Error | /**
* 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... | replace | 16 | 17 | 16 | 17 | 0 | |
p02234 | C++ | Time Limit Exceeded | /**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include... | /**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include... | insert | 759 | 759 | 759 | 761 | TLE | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int main() {
int n, p[101], m[101][101];
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::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 - 1; i++) {
int j = i + l - 1;
... | #include <algorithm>
#include <iostream>
int main() {
int n, p[101], m[101][101];
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::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 - ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02234 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];
int Min(int &a, int b) { return a = min(a, b); }
int main() {
int n;
cin >> n;
for (int i = 0, cnt = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (i == 0)
A[cnt++] = a;
A[cnt++] = b;
}
for (int i = 0; ... | #include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];
int Min(int &a, int b) { return a = min(a, b); }
int main() {
int n;
cin >> n;
for (int i = 0, cnt = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (i == 0)
A[cnt++] = a;
A[cnt++] = b;
}
for (int i = 0; ... | insert | 28 | 28 | 28 | 30 | 0 | |
p02234 | C++ | Runtime Error | #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] ... | replace | 6 | 7 | 6 | 7 | -11 | |
p02234 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define range(i, a, b) for (int i = (a); i <= (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repR(i, n) for (int i = (n)-1; i > -1; i--)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define range(i, a, b) for (int i = (a); i <= (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repR(i, n) for (int i = (n)-1; i > -1; i--)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n... | replace | 19 | 20 | 19 | 20 | 0 | |
p02234 | C++ | Runtime Error | #include <climits>
#include <iostream>
using namespace std;
int m[100][100];
int MCM(int p[], 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_MAX;
for (int k = i; k <= j; k++) {
... | #include <climits>
#include <iostream>
using namespace std;
int m[100][100];
int MCM(int p[], 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_MAX;
for (int k = i; k <= j - 1; k++) {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02235 | Python | Time Limit Exceeded | q = int(input())
for _ in range(q):
x = input()
y = input()
m = len(x)
n = len(y)
c = [0] * (n + 1)
for i in range(m):
tmp = x[i]
c_ = c[:]
for j in range(n):
if tmp == y[j]:
c[j + 1] = c_[j] + 1
elif c[j + 1] < c[j]:
... | def lcs(x, y):
a = len(x)
b = len(y)
c1 = [0] * (b + 1)
for i in range(a):
e1 = x[i]
c2 = c1[:]
for j in range(b):
if e1 == y[j]:
c1[j + 1] = c2[j] + 1
elif c1[j + 1] < c1[j]:
c1[j + 1] = c1[j]
return c1[-1]
n = int(in... | replace | 0 | 16 | 0 | 22 | TLE | |
p02235 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 999999999
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 999999999
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, ... | replace | 22 | 24 | 22 | 24 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using namespace std;
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 38 | 39 | 38 | 39 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <chrono> //1e+9で割る auto end= chrono::system_clock::now()-st;
// cout<<end.count()%1e+9<<endl;
using namespace std;
typedef long lon... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <chrono> //1e+9で割る auto end= chrono::system_clock::now()-st;
// cout<<end.count()%1e+9<<endl;
using namespace std;
typedef long lon... | replace | 29 | 30 | 29 | 30 | 0 | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | replace | 24 | 25 | 24 | 25 | 0 | |
p02235 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <string>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define clr(a, v) memset((a), (v), sizeof(a))
int q;
int dp[1000][1000];
std::string s, t;
int rec(int i, int j) {
int &ret = dp[i][j];
if (~ret)
return ret;
if (i... | #include <cstring>
#include <iostream>
#include <string>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define clr(a, v) memset((a), (v), sizeof(a))
int q;
int dp[1001][1001];
std::string s, t;
int rec(int i, int j) {
int &ret = dp[i][j];
if (~ret)
return ret;
if (i... | replace | 8 | 9 | 8 | 9 | 0 | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
// L[i][j] X[0]..X[i]??¨X[0]..Y[j]???LCS
int L[1000][1000] = {};
int main() {
int testnum;
cin >> testnum;
for (int t = 0; t < testnum; ++t) {
string X, Y;
cin >> X >> Y;
for (int i = 1; i <= X.length(); ++i) {
for (int j = 1; j <= Y.... | #include <iostream>
#include <string>
using namespace std;
// L[i][j] X[0]..X[i]??¨X[0]..Y[j]???LCS
int L[1001][1001] = {};
int main() {
int testnum;
cin >> testnum;
for (int t = 0; t < testnum; ++t) {
string X, Y;
cin >> X >> Y;
for (int i = 1; i <= X.length(); ++i) {
for (int j = 1; j <= Y.... | replace | 6 | 7 | 6 | 7 | 0 | |
p02235 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
using namespace std;
int main() {
int q;
scanf("%d", &q);
string x, y;
REP(i, q) {
cin >> x >> y;
int dp[x.size() + 1][y.size() + 1];
fill(dp[0], dp[y.size()], -1);
... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
using namespace std;
int main() {
int q;
scanf("%d", &q);
string x, y;
REP(i, q) {
cin >> x >> y;
int dp[x.size() + 1][y.size() + 1];
fill(dp[0], dp[x.size()], -1);
... | replace | 11 | 17 | 11 | 17 | 0 | |
p02235 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s, t;
int dp[100][100];
void solve() {
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
dp[i][j] =
(i < 1 || j < 1 ? 0 : dp[i - 1][j - 1]) + (s[i] == t[j] ? 1 : 0);
int a = (i < 1 ? 0 : dp[i - 1]... | #include <bits/stdc++.h>
using namespace std;
string s, t;
int dp[1000][1000];
void solve() {
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
dp[i][j] =
(i < 1 || j < 1 ? 0 : dp[i - 1][j - 1]) + (s[i] == t[j] ? 1 : 0);
int a = (i < 1 ? 0 : dp[i - ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string.h>
#define MAX 10000
using namespace std;
int lcs(string s1, string s2) {
int C[MAX + 1][MAX + 1];
int m = s1.size();
int n = s2.size();
for (int i = 0; i <= m; ++i) {
C[i][0] = 0;
}
for (int j = 0; j <= n; ++j) {
C[0][j] = 0;
}
for (... | #include <algorithm>
#include <iostream>
#include <string.h>
#define MAX 1000
using namespace std;
int lcs(string s1, string s2) {
int C[MAX + 1][MAX + 1];
int m = s1.size();
int n = s2.size();
for (int i = 0; i <= m; ++i) {
C[i][0] = 0;
}
for (int j = 0; j <= n; ++j) {
C[0][j] = 0;
}
for (i... | replace | 4 | 5 | 4 | 5 | -11 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int q;
cin >> q;
for (int m = 0; m < q; m++) {
string wordx, wordy;
cin >> wordx >> wordy;
int L[1000][1000] = {0};
for (int j = 0; j < wordy.size(); j++) {
for (int i = 0; i < wor... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int q;
cin >> q;
for (int m = 0; m < q; m++) {
string wordx, wordy;
cin >> wordx >> wordy;
int L[1010][1010] = {0};
for (int j = 0; j < wordy.size(); j++) {
for (int i = 0; i < wor... | replace | 12 | 13 | 12 | 13 | 0 | |
p02235 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int p[1001][1001] = {0};
int main() {
int i, j, q, e, l, z, m, u, n;
char s[2001], c[2001];
cin >> q;
for (e = 0; e < q; e++) {
scanf("%s %s", s, c);
l = strlen(s);
z = strlen(c);
for (i = 0; i ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int p[1001][1001] = {0};
int main() {
int i, j, q, e, l, z, m, u, n;
char s[2001], c[2001];
cin >> q;
for (e = 0; e < q; e++) {
scanf("%s %s", s, c);
l = strlen(s);
z = strlen(c);
for (i = 0; i ... | replace | 22 | 42 | 22 | 26 | TLE | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | replace | 24 | 25 | 24 | 25 | 0 | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {
int nMaxSiz;
cin >> nMaxSiz;
rvsStrX.resize(nMaxSiz);
rvsStrY.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; ++i) {
cin >> rvsStrX[i] >> rvsStrY[i];
rvsStrX[i] = ' ' + rvsStrX[i... | replace | 24 | 25 | 24 | 25 | 0 | |
p02235 | C++ | Runtime Error | // ALDS1_10C
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
vector<vector<int>> c(N, vector<int>(N));
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X;
Y = ' ' + Y;
for (int i = 1; i ... | // ALDS1_10C
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int N = 1001;
int lcs(string X, string Y) {
vector<vector<int>> c(N, vector<int>(N));
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X;
Y = ' ' + Y;
for (int i = 1; i ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02235 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
int **c = (int **)malloc(sizeof(int *) * 1001);
for (int i = 0; i < 1001; i++) {
c[i] = (int *)malloc(sizeof(int) * 1001);
}
int m = X.size();
int n ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
int **c = (int **)malloc(sizeof(int *) * 1001);
for (int i = 0; i < 1001; i++) {
c[i] = (int *)malloc(sizeof(int) * 1001);
}
int m = X.size();
int n ... | insert | 33 | 33 | 33 | 37 | MLE | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int setN;
cin >> setN;
string A, B;
for (int i = 0; i < setN; i++) {
cin >> A;
cin >> B;
int L[1000][1000] = {};
for (int j = 1; j < A.length() + 1; j++) {
for (int l = 1; l < B.length() + 1; l++) {
if (A[j ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int setN;
cin >> setN;
string A, B;
for (int i = 0; i < setN; i++) {
cin >> A;
cin >> B;
int L[2000][2000] = {};
for (int j = 1; j < A.length() + 1; j++) {
for (int l = 1; l < B.length() + 1; l++) {
if (A[j ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02235 | C++ | Runtime Error | #include <iostream>
#include <string>
#define int long long
// #define _DEBUG
using namespace std;
string sa, sb;
int T[1000][1000];
int solve() {
int sal = sa.length(), sbl = sb.length();
for (int a = 0; a <= sal; a++) {
for (int b = 0; b <= sbl; b++) {
if (a == 0 || b == 0) {
T[a][b] = 0;
... | #include <iostream>
#include <string>
#define int long long
// #define _DEBUG
using namespace std;
string sa, sb;
int T[1009][1009];
int solve() {
int sal = sa.length(), sbl = sb.length();
for (int a = 0; a <= sal; a++) {
for (int b = 0; b <= sbl; b++) {
if (a == 0 || b == 0) {
T[a][b] = 0;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <stack>
#include <stdio.h>
#include <string>
#define MAX 101
using namespace std;
int main() {
int n;
cin >> n;
string x, y;
int data[MAX][MAX] = {0, 0};
for (int d = 0; d < n; d++) {
cin >> x >> y;
for (int i = 0; i ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <stack>
#include <stdio.h>
#include <string>
#define MAX 1001
using namespace std;
int main() {
int n;
cin >> n;
string x, y;
int data[MAX][MAX] = {0, 0};
for (int d = 0; d < n; d++) {
cin >> x >> y;
for (int i = 0; i... | replace | 7 | 8 | 7 | 8 | 0 | |
p02235 | C++ | Runtime Error | #include <stdio.h>
int hantei(char x[], char y[]) {
int xn = 0, yn = 0, flag = 0, i, j, max = 0;
int c[101][101];
while (flag == 0) {
if (x[xn] != '\0') {
xn++;
} else {
flag = 1;
}
}
flag = 0;
while (flag == 0) {
if (y[yn] != '\0') {
yn++;
} else {
flag = 1;
... | #include <stdio.h>
int hantei(char x[], char y[]) {
int xn = 0, yn = 0, flag = 0, i, j, max = 0;
int c[1001][1001];
while (flag == 0) {
if (x[xn] != '\0') {
xn++;
} else {
flag = 1;
}
}
flag = 0;
while (flag == 0) {
if (y[yn] != '\0') {
yn++;
} else {
flag = 1... | replace | 4 | 5 | 4 | 5 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1000000001
#define min... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1000000001
#define min... | replace | 24 | 25 | 24 | 25 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX 1000
int c[MAX][MAX];
int lcs(string A, string B) {
int a = A.length();
int b = B.length();
int maxl = 0;
A = ' ' + A;
B = ' ' + B;
// 配列を作る
for (int i = 0; i < a; i++) {
c[i][0] = 0;
}
for (int j = 0; ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX 1000
int c[MAX + 1][MAX + 1];
int lcs(string A, string B) {
int a = A.length();
int b = B.length();
int maxl = 0;
A = ' ' + A;
B = ' ' + B;
// 配列を作る
for (int i = 0; i < a; i++) {
c[i][0] = 0;
}
for (int... | replace | 7 | 8 | 7 | 8 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int k = 0; k < n; k++) {
string x, y;
cin >> x >> y;
int p = x.size();
int q = y.size();
int l[1000][1000] = {};
for (int i = 1; i < p + 1; i++) {
for (int j = 1; j < q... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int k = 0; k < n; k++) {
string x, y;
cin >> x >> y;
int p = x.size();
int q = y.size();
int l[1001][1001] = {};
for (int i = 1; i < p + 1; i++) {
for (int j = 1; j < q... | replace | 13 | 14 | 13 | 14 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
constexpr int MAX_XY = 1000;
int lx, ly, q, dp[MAX_XY][MAX_XY];
std::string sx, sy;
void fill_dp() {
for (int i = 1; i <= lx; ++i) {
for (int j = 1; j <= ly; ++j) {
if (sx[i - 1] == sy[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
... | #include <algorithm>
#include <iostream>
#include <string>
constexpr int MAX_XY = 1010;
int lx, ly, q, dp[MAX_XY][MAX_XY];
std::string sx, sy;
void fill_dp() {
for (int i = 1; i <= lx; ++i) {
for (int j = 1; j <= ly; ++j) {
if (sx[i - 1] == sy[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02235 | C++ | Runtime Error | // #define FILE_INPUT_DEFINE
#ifdef FILE_INPUT_DEFINE
#include <fstream>
#endif // FILE_INPUT_DEFINE
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX 1000
#define ind(x) ((x)-1)
int C[MAX][MAX];
int LCS(string &X, string &Y) {
int Xlen = X.length();
int Ylen = Y.leng... | // #define FILE_INPUT_DEFINE
#ifdef FILE_INPUT_DEFINE
#include <fstream>
#endif // FILE_INPUT_DEFINE
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX 1000
#define ind(x) ((x)-1)
int C[MAX + 1][MAX + 1];
int LCS(string &X, string &Y) {
int Xlen = X.length();
int Ylen ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#define MAX_N 1000
int solve(std::string s, std::string t) {
int dp[MAX_N][MAX_N] = {0};
int n, m;
n = s.size();
m = t.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i] == t[j])
dp[i + 1... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#define MAX_N 1001
int solve(std::string s, std::string t) {
int dp[MAX_N][MAX_N] = {0};
int n, m;
n = s.size();
m = t.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i] == t[j])
dp[i + 1... | replace | 4 | 5 | 4 | 5 | 0 | |
p02235 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int Max(int &a, int b) { return a = max(a, b); }
int LCS(string &a, string &b) {
int n = a.size();
int m = b.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 0; i <= n; i++)
for (int j = 0; j <= m; j++) {
if (i < n && j < m && a[i... | #include <bits/stdc++.h>
using namespace std;
int Max(int &a, int b) { return a = max(a, b); }
int LCS(string &a, string &b) {
int n = a.size();
int m = b.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 0; i <= n; i++)
for (int j = 0; j <= m; j++) {
if (i < n && j < m && a[i... | replace | 14 | 16 | 14 | 18 | -11 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int LCS(string p, string q) {
vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));
int t;
for (int i = 1; i <= p.size(); i++) {
for (int j = 1; j <= q.size(); j++) {
if (p[i - 1] == q[j - 1])... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int LCS(string p, string q) {
vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));
int t;
for (int i = 1; i <= p.size(); i++) {
for (int j = 1; j <= q.size(); j++) {
if (p[i - 1] == q[j - 1])... | replace | 24 | 25 | 24 | 25 | 0 | |
p02235 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF 99999999
#define MAX_S 200
#define MAX_T 200
template <typename T> int lcs(T s, T t) {
int lens = ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF 99999999
#define MAX_S 2000
#define MAX_T 2000
template <typename T> int lcs(T s, T t) {
int lens ... | replace | 9 | 11 | 9 | 11 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
#define MAX 100000
static const int N = 100;
int lcs(string X, string Y) {
int c[N + 1][N + 1];
int m = X.size();
int n = Y.size();
int ans = 0;
X = ' ' + X;
Y = ' ' + Y;
for (int i; i <= m; i++... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
#define MAX 100000
static const int N = 1000;
int lcs(string X, string Y) {
int c[N + 1][N + 1];
int m = X.size();
int n = Y.size();
int ans = 0;
X = ' ' + X;
Y = ' ' + Y;
for (int i; i <= m; i+... | replace | 8 | 9 | 8 | 9 | 0 | |
p02235 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string st1, st2;
int q, val[151][151];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> st1;
cin >> st2;
for (int j = 0; j <= st1.length(); j++) {
for (int k = 0; k <= st2.length(); k++) {
i... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string st1, st2;
int q, val[1001][1001];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> st1;
cin >> st2;
for (int j = 0; j <= st1.length(); j++) {
for (int k = 0; k <= st2.length(); k++) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02235 | C++ | Runtime Error | ///
// File: alds1_10_c.cpp
// Author: ymiyamoto
//
// Created on Tue Oct 17 01:36:16 2017
//
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
static uint32_t dp[1000][1000];
static void init_dp(uint32_t len1, uint32_t len2) {
for (uint32_t i = 0; i < len1; i++) {
dp[i][0] = 0;
... | ///
// File: alds1_10_c.cpp
// Author: ymiyamoto
//
// Created on Tue Oct 17 01:36:16 2017
//
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
static uint32_t dp[1001][1001];
static void init_dp(uint32_t len1, uint32_t len2) {
for (uint32_t i = 0; i < len1; i++) {
dp[i][0] = 0;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02235 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | replace | 29 | 30 | 29 | 30 | TLE | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <ccomplex>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void solve() {
string x, y;
cin >> x >> y;
int xlen = x.length();
int ylen = y.len... | #include <algorithm>
#include <ccomplex>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void solve() {
string x, y;
cin >> x >> y;
int xlen = x.length();
int ylen = y.len... | replace | 18 | 19 | 18 | 19 | 0 | |
p02235 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, q;
string a, b; // two sequences
int M[1001][1001] = {{0}}; // Memory matrix
cin >> q;
for (int l = 0; l < q; l++) {
cin >> a >> b;
n = a.length();
m = b.length()... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, q;
string a, b; // two sequences
int M[1010][1010] = {{0}}; // Memory matrix
cin >> q;
for (int l = 0; l < q; l++) {
cin >> a >> b;
n = a.length();
m = b.length()... | replace | 9 | 10 | 9 | 10 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.