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 |
|---|---|---|---|---|---|
a,b,c,d=gets.split.map &:to_i
puts a*b%2>0&&c+d%2>0 ? :No : :Yes
| a,b,c,d=gets.split.map &:to_i
puts a*b%2>0&&(c+d)%2>0 ? :No : :Yes
| [["+", 15, 738, 12, 738, 31, 738, 31, 739, 0, 24], ["+", 15, 738, 12, 738, 31, 738, 31, 739, 0, 25]] | 4 | 35 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int c[1001], b[1001];
int main() {
int n;
cin >> n;
rep(i, n) cin >> c[i];
int q, ti, xi, di;
cin >> q;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int c[1001], b[1001];
int main() {
int n;
cin >> n;
rep(i, n) cin >> c[i];
int q, ti, xi, di;
cin >> q;
... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 201 | 2 |
// AOJ 2868 Hierarchical Calculator
// 2018.3.29 bal4u
#include <stdio.h>
int a[63];
int c[5]; // a = -2, -1, 0, 1, 2;
int main() {
int N, i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", a + i);
c[2 + a[i]]++;
}
c[2] = c[3] = 0;
if (!(c[0] & 1))
c[1] = 0;
else if (c[1])
c[1]... | // AOJ 2868 Hierarchical Calculator
// 2018.3.29 bal4u
#include <stdio.h>
int a[63];
int c[5]; // a = -2, -1, 0, 1, 2;
int main() {
int N, i;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d", a + i);
c[2 + a[i]]++;
}
c[2] = c[3] = 0;
if (!(c[0] & 1))
c[1] = 0;
else if (c[1])
c[1]... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 72], ["+", 0, 57, 15, 23, 0, 69, 71, 16, 31, 13], ["+", 0, 57, 15, 23, 0, 69, 71, 16, 17, 72]] | 0 | 202 | 4 |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[61];
int cnt[10];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
cnt[a[i] + 2]++;
}
if (cnt[0] % 2 == 0) {
printf("%d\n", cnt[4] ... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int a[61];
int cnt[10];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
cnt[a[i] + 2]++;
}
if (cnt[0] % 2 == 0) {
printf("%d\n", cnt[4] ... | [["-", 0, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 70], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 73], ["+", 12, 23, 0, 16, 12, 16, 31, 23, 0, 24], ["+", 12, 23, 0, 16, 12, 16, 31, 23, 0, 25]] | 1 | 393 | 5 |
// {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 398 | 4 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
bool prime[1000009];
void era() {
prime[0] = 1;
prime[1] = 1;
for (int i = 2; i < 1000009; i++) {
if (!prime[i]) {
for (int j = i + i; j < 1000009; j += i)
prime[j] = 1;
}
}
}
int dp[100009][2];
signed main() {
era()... | #include <bits/stdc++.h>
#define int long long
using namespace std;
bool prime[1000009];
void era() {
prime[0] = 1;
prime[1] = 1;
for (int i = 2; i < 1000009; i++) {
if (!prime[i]) {
for (int j = i + i; j < 1000009; j += i)
prime[j] = 1;
}
}
}
int dp[100009][2];
signed main() {
era()... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 467 | 2 |
#include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, NAME, ...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__)
#define pr1(a) (#a) << "=" << (a)
#define pr2(a, b) pr1(a) << ", " << pr1(b)
#define pr3(a, b, c) pr2(a, b) << ", " << pr1(c)
#define pr4(a, b, c, d) pr3(a, b, c) <... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, NAME, ...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__)
#define pr1(a) (#a) << "=" << (a)
#define pr2(a, b) pr1(a) << ", " << pr1(b)
#define pr3(a, b, c) pr2(a, b) << ", " << pr1(c)
#define pr4(a, b, c, d) pr3(a, b, c) <... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 123, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 22]] | 1 | 1,875 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int c = 0;
for (int i = 0; i < a; i++) {
string b;
cin >> b[i];
if (b[i] % 2 == 0) {
c++;
}
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int c = 0;
for (int i = 0; i < a; i++) {
int b[100];
cin >> b[i];
if (b[i] % 2 == 0) {
c++;
}
}
cout << c << endl;
}
| [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 0, 73]] | 1 | 72 | 5 |
n = int(input())
a = list(map(int, input().split()))
r = 0
for j in a:
if a % 2 == 0:
r += 1
print(r)
| n = int(input())
a = list(map(int, input().split()))
r = 0
for j in a:
if j % 2 == 0:
r += 1
print(r)
| [["-", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22]] | 5 | 47 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a - (b + c - 1) << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a - (b + c - d) << endl;
}
| [["-", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 22]] | 1 | 51 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define fi first
#define se second
signed main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
int s = c + (a - c) + (b - c);
cout << s << endl;
}
| #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define fi first
#define se second
signed main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
int s = c + (a - c) + (b - c);
cout << n - s << endl;
}
| [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 80 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long ni(long long ta, vector<long long> &v) {}
long long rui(long long n, long long k, long long p) {
if (k == 0) {
return 1;
} else {
long long a = rui(n, k / 2, p);
if (k % 2 == 0) {
return (a ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long ni(long long ta, vector<long long> &v) {}
long long rui(long long n, long long k, long long p) {
if (k == 0) {
return 1;
} else {
long long a = rui(n, k / 2, p);
if (k % 2 == 0) {
return (a ... | [["+", 0, 16, 31, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 16, 31, 23, 0, 25], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 196 | 4 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, a[110], s = 0;
int main() {
cin >> n;
lol(i, n) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, a[110], s = 0;
int main() {
cin >> n;
lol(i, n) {
... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 154 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
#define vsort(v) sort(v.begin(), v.end)
using namespace std;
signed main() {
int n, memo[100], ans = 0, cnt = 0;
c... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
#define vsort(v) sort(v.begin(), v.end)
using namespace std;
signed main() {
int n, memo[100], ans = 0, cnt = 0;
c... | [["+", 0, 16, 31, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 16, 31, 23, 0, 25], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 136 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, m, ta = 0, mu = 0;
long long a[100000], b[100000];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
ta += a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
mu +... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, m, ta = 0, mu = 0;
long long a[100000], b[100000];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
ta += a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
mu +... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 48]] | 1 | 118 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[100000], b[100000];
long long sum = 0, s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int k = 0; k < m; k++) {
cin >> b[k];
s += a[k];
}
cout << sum * s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[100000], b[100000];
long long sum = 0, s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int k = 0; k < m; k++) {
cin >> b[k];
s += b[k];
}
cout << sum * s << endl;
}
| [["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 1 | 113 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]] | 1 | 266 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
#define int long long
signed main() {
int n;
vector<pair<int, int>> v;
rep(i, n) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, 1));
v.push_back(make_pair(b + 1, -1));
}
sor... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
#define int long long
signed main() {
int n;
cin >> n;
vector<pair<int, int>> v;
rep(i, n) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, 1));
v.push_back(make_pair(b + 1, -1)... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 140 | 4 |
#include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
const int SIZE = 510;
double dp[SIZE][SIZE];
int main() {
int n, m;
int a[SIZE];
long long sum[SIZE];
scanf("%d%d", &n, &m);
sum[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
sum[i + 1] = ... | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
const int SIZE = 510;
double dp[SIZE][SIZE];
int main() {
int n, m;
int a[SIZE];
long long sum[SIZE];
scanf("%d%d", &n, &m);
sum[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
sum[i + 1] = ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 320 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MAX_V 100001
#define INF 1e18
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int V;
vector<edge> G[MAX_V];
int d[MAX_V];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
d[s] = 0;
q... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MAX_V 100001
#define INF 1e18
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int V;
vector<edge> G[MAX_V];
int d[MAX_V];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + MAX_V, INF);
d[s] = 0;... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 419 | 2 |
#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... | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13]] | 1 | 646 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int SIZE = 100010;
const int INF = 1000000000;
struct SST {
int segn2;
vector<int> data, s_data;
SST(int n) {
for (segn2 = 1; segn2 < n; segn2 *= 2)
;
data.assign(segn2 * 2, 0);... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int SIZE = 100010;
const int INF = 1000000000;
struct SST {
int segn2;
vector<int> data, s_data;
SST(int n) {
for (segn2 = 1; segn2 < n; segn2 *= 2)
;
data.assign(segn2 * 2, 0);... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 754 | 2 |
#include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, NAME, ...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__)
#define pr1(a) (#a) << "=" << (a)
#define pr2(a, b) pr1(a) << ", " << pr1(b)
#define pr3(a, b, c) pr2(a, b) << ", " << pr1(c)
#define pr4(a, b, c, d) pr3(a, b, c) <... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, NAME, ...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__)
#define pr1(a) (#a) << "=" << (a)
#define pr2(a, b) pr1(a) << ", " << pr1(b)
#define pr3(a, b, c) pr2(a, b) << ", " << pr1(c)
#define pr4(a, b, c, d) pr3(a, b, c) <... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 1,324 | 4 |
import java.util.Scanner;
public class Main {
void run() {
Scanner scan = new Scanner(System.in);
while (true) {
String g = scan.next();
if (g.equals("#"))
return;
int y = scan.nextInt();
int m = scan.nextInt();
int d = scan.nextInt();
if (y < 31)
System.ou... | import java.util.Scanner;
public class Main {
void run() {
Scanner scan = new Scanner(System.in);
while (true) {
String g = scan.next();
if (g.equals("#"))
return;
int y = scan.nextInt();
int m = scan.nextInt();
int d = scan.nextInt();
if (y < 31)
System.ou... | [["+", 75, 57, 15, 15, 0, 16, 31, 16, 31, 22], ["+", 75, 57, 15, 15, 0, 16, 31, 16, 17, 60], ["+", 75, 57, 15, 15, 0, 16, 31, 16, 12, 499], ["+", 0, 57, 75, 57, 15, 15, 0, 16, 17, 98]] | 3 | 202 | 4 |
//↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 313 | 4 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
if ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const int mod = 1e9 + 7;
#define lol(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
if ... | [["-", 8, 9, 0, 57, 15, 339, 51, 23, 0, 24], ["-", 15, 339, 51, 23, 0, 16, 31, 23, 0, 24], ["-", 51, 23, 0, 16, 31, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["-", 15, 339, 51, 23, 0, 16, 31, 23, 0, 25], ["-", 8, 9, 0, 57, 15, 339, 51, 23, 0, 25]] | 1 | 111 | 6 |
//↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | [["-", 31, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 31, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 17, 48], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22]... | 1 | 305 | 10 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<ll> b(m);
for (auto &x : a)
cin >> x;
for (auto &x : b)
cin >> x;
vector<ll> rui(n + 1, 0);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<ll> b(m);
for (auto &x : a)
cin >> x;
for (auto &x : b)
cin >> x;
vector<ll> rui(n + 1, 0);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for (ll i =... | [["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 228 | 2 |
(function main() {
const n = Number(require('fs').readFileSync('/dev/stdin', 'utf8')) + 1;
const root5 = Math.sqrt(5);
console.log(Math.round(
1 / root5 *
(Math.pow((1 + root5) >> 1, n) - Math.pow((1 - root5) >> 1, n))));
})();
| (function main() {
const n = Number(require('fs').readFileSync('/dev/stdin', 'utf8')) + 1;
const root5 = Math.sqrt(5);
console.log(Math.round(
1 / root5 *
(Math.pow((1 + root5) / 2, n) - Math.pow((1 - root5) / 2, n))));
})();
| [["-", 0, 16, 31, 2, 3, 3, 0, 16, 17, 152], ["-", 0, 16, 31, 2, 3, 3, 0, 16, 12, 555], ["+", 0, 16, 31, 2, 3, 3, 0, 16, 17, 85], ["+", 0, 16, 31, 2, 3, 3, 0, 16, 12, 555], ["-", 0, 16, 12, 2, 3, 3, 0, 16, 17, 152], ["-", 0, 16, 12, 2, 3, 3, 0, 16, 12, 555], ["+", 0, 16, 12, 2, 3, 3, 0, 16, 17, 85], ["+", 0, 16, 12, 2, ... | 2 | 93 | 8 |
import java.util.Scanner;
public class Main {
public static int fib(int n, int num[], boolean data[]) {
if (!(data[n])) {
data[n] = true;
num[n] = fib(n - 1, num, data) + fib(n - 2, num, data);
return num[n];
} else
return num[n];
}
public static void main(String[] args) {
Scan... | import java.util.Scanner;
public class Main {
public static int fib(int n, int num[], boolean data[]) {
if (!(data[n])) {
data[n] = true;
num[n] = fib(n - 1, num, data) + fib(n - 2, num, data);
return num[n];
} else
return num[n];
}
public static void main(String[] args) {
Scan... | [["+", 49, 200, 51, 227, 497, 505, 0, 16, 17, 72], ["+", 49, 200, 51, 227, 497, 505, 0, 16, 12, 499]] | 3 | 185 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[] memo;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
memo = new int[n];
Arrays.fill(memo, -1);
System.out.println(fibonacci(n));
}
public static int fibo... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[] memo;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
memo = new int[n + 1];
Arrays.fill(memo, -1);
System.out.println(fibonacci(n));
}
public static int ... | [["+", 0, 11, 12, 227, 497, 505, 0, 16, 17, 72], ["+", 0, 11, 12, 227, 497, 505, 0, 16, 12, 499]] | 3 | 146 | 2 |
#include <stdio.h>
int main() {
int f[45], i, n;
scanf("%d", &n);
f[0] = 1;
f[1] = 1;
for (i = 2; i <= n; i++) {
f[i] = f[i - 1] + f[i - 1];
}
printf("%d\n", f[n]);
return 0;
} | #include <stdio.h>
int main() {
int f[45], i, n;
scanf("%d", &n);
f[0] = 1;
f[1] = 1;
for (i = 2; i <= n; i++) {
f[i] = f[i - 2] + f[i - 1];
}
printf("%d\n", f[n]);
return 0;
} | [["-", 0, 11, 12, 16, 31, 69, 71, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 69, 71, 16, 12, 13]] | 0 | 92 | 2 |
#include <stdio.h>
#define N 44
void makeFibonacci(int);
int main() {
int n;
scanf("%d", &n);
makeFibonacci(n);
return 0;
}
void makeFibonacci(n) {
int i, F[N];
F[0] = 1;
F[1] = 1;
for (i = 2; i < N; i++)
F[i] = F[i - 2] + F[i - 1];
printf("%d\n", F[n]);
} | #include <stdio.h>
#define N 45
void makeFibonacci(int);
int main() {
int n;
scanf("%d", &n);
makeFibonacci(n);
return 0;
}
void makeFibonacci(n) {
int i, F[N];
F[0] = 1;
F[1] = 1;
for (i = 2; i < N; i++)
F[i] = F[i - 2] + F[i - 1];
printf("%d\n", F[n]);
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 112 | 2 |
#include <stdio.h>
int main() {
int a, i, F[44];
scanf("%d", &a);
F[0] = 1;
F[1] = 1;
for (i = 2; i < 44; i++) {
F[i] = F[i - 2] + F[i - 1];
}
printf("%d\n", F[a]);
return 0;
} | #include <stdio.h>
int main() {
int a, i, F[45];
scanf("%d", &a);
F[0] = 1;
F[1] = 1;
for (i = 2; i <= 44; i++) {
F[i] = F[i - 2] + F[i - 1];
}
printf("%d\n", F[a]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 92 | 4 |
#include <stdio.h>
int n, F[45];
int fibonacci(int n) {
if (n == 0 || n == 1)
return F[n] = 1;
if (F[n] != -100)
return F[n];
return F[n] = fibonacci(n - 2) + fibonacci(n - 1);
}
int main() {
int i;
for (i = 0; i < 44; i++)
F[i] = -100;
scanf("%d", &n);
printf("%d\n", fibonacci(n));
retu... | #include <stdio.h>
int n, F[46];
int fibonacci(int n) {
if (n == 0 || n == 1)
return F[n] = 1;
if (F[n] != -1)
return F[n];
return F[n] = fibonacci(n - 2) + fibonacci(n - 1);
}
int main() {
int i;
for (i = 0; i < 46; i++)
F[i] = -1;
scanf("%d", &n);
printf("%d\n", fibonacci(n));
return 0... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8... | 0 | 126 | 8 |
#include <stdio.h>
int fb[50];
int fib(int n) {
if (n == 1 || n == 0)
return fb[n] = 1;
if (fb[n] != -1)
return fb[n];
return fb[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
fb[i] = -1;
printf("%d\n", fib(n));
return 0;
}
| #include <stdio.h>
int fb[50];
int fib(int n) {
if (n == 1 || n == 0)
return fb[n] = 1;
if (fb[n] != -1)
return fb[n];
return fb[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < 50; i++)
fb[i] = -1;
printf("%d\n", fib(n));
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 126 | 2 |
#include <stdio.h>
int makeFibonacci();
int F[45];
int main() {
int n;
scanf("%d", &n);
printf("%d\n", makeFibonacci(n));
return 0;
}
int makeFibonacci(int N) {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= N; i++) {
F[i] = F[i - 2] + F[i - 1];
}
return F[N - 1];
} | #include <stdio.h>
int makeFibonacci();
int F[45];
int main() {
int n;
scanf("%d", &n);
printf("%d\n", makeFibonacci(n));
return 0;
}
int makeFibonacci(int N) {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= N; i++) {
F[i] = F[i - 2] + F[i - 1];
}
return F[N];
} | [["-", 8, 9, 0, 37, 0, 69, 71, 16, 17, 33], ["-", 8, 9, 0, 37, 0, 69, 71, 16, 12, 13]] | 0 | 115 | 2 |
#include <stdio.h>
int Fib[44];
void makeFibonacci(void);
void makeFibonacci() {
int i;
Fib[0] = 1;
Fib[1] = 1;
for (i = 2; i < 44; i++)
Fib[i] = Fib[i - 2] + Fib[i - 1];
}
int main() {
int n;
makeFibonacci();
scanf("%d", &n);
printf("%d\n", Fib[n]);
return 0;
} | #include <stdio.h>
int Fib[45];
void makeFibonacci(void);
void makeFibonacci() {
int i;
Fib[0] = 1;
Fib[1] = 1;
for (i = 2; i < 45; i++)
Fib[i] = Fib[i - 2] + Fib[i - 1];
}
int main() {
int n;
makeFibonacci();
scanf("%d", &n);
printf("%d\n", Fib[n]);
return 0;
} | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 108 | 4 |
#include <stdio.h>
int main() {
int n, cnt = 1, ans;
int n0 = 1;
int n1 = 1;
scanf("%d", &n);
while (cnt != n) {
ans = n0 + n1;
n0 = n1;
n1 = ans;
cnt++;
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main() {
int n, cnt = 1, ans = 1;
int n0 = 1;
int n1 = 1;
scanf("%d", &n);
while (cnt != n) {
ans = n0 + n1;
n0 = n1;
n1 = ans;
cnt++;
}
printf("%d\n", ans);
return 0;
} | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 75 | 2 |
#include <stdio.h>
void makeFibonacci();
int F[44], n;
int main() {
scanf("%d", &n);
makeFibonacci();
printf("%d\n", F[n]);
return 0;
}
void makeFibonacci() {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
} | #include <stdio.h>
void makeFibonacci();
int F[45], n;
int main() {
scanf("%d", &n);
makeFibonacci();
printf("%d\n", F[n]);
return 0;
}
void makeFibonacci() {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
} | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 0 | 108 | 2 |
#include <stdio.h>
#define FALSE -1
int A[44];
int fibona(int n) {
if (n == 0 || n == 1)
return A[n] = 1;
if (A[n] != FALSE)
return A[n];
return A[n] = fibona(n - 1) + fibona(n - 2);
}
int main() {
int i, num;
for (i = 0; i < 44; i++)
A[i] = -1;
scanf("%d", &num);
printf("%d\n", fibona(num))... | #include <stdio.h>
#define FALSE -1
int A[45];
int fibona(int n) {
if (n == 0 || n == 1)
return A[n] = 1;
if (A[n] != FALSE)
return A[n];
return A[n] = fibona(n - 1) + fibona(n - 2);
}
int main() {
int i, num;
for (i = 0; i < 45; i++)
A[i] = -1;
scanf("%d", &num);
printf("%d\n", fibona(num))... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 129 | 4 |
#include <stdio.h>
#define N 44
int fibonacci(int);
int F[N];
int main() {
int n, i;
for (i = 0; i < N; i++) {
F[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fibonacci(n));
return 0;
}
int fibonacci(int n) {
int i;
if (n == 0 || n == 1)
return F[n] = 1;
if (F[n] != -1)
return F[n];
else
... | #include <stdio.h>
#define N 45
int fibonacci(int);
int F[N];
int main() {
int n, i;
for (i = 0; i < N; i++) {
F[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fibonacci(n));
return 0;
}
int fibonacci(int n) {
int i;
if (n == 0 || n == 1)
return F[n] = 1;
if (F[n] != -1)
return F[n];
else
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 141 | 2 |
#include <stdio.h>
#define N 47
int a[N];
int fib(int n) {
if (a[n] == 0) {
if (n < 2)
a[n] = n;
else
a[n] = fib(n - 1) + fib(n - 2);
}
return a[n];
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
} | #include <stdio.h>
#define N 47
int a[N];
int fib(int n) {
if (a[n] == 0) {
if (n < 2)
a[n] = 1;
else
a[n] = fib(n - 1) + fib(n - 2);
}
return a[n];
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
} | [["-", 64, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 64, 9, 0, 57, 64, 1, 0, 11, 12, 13]] | 0 | 104 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 44
void Fibonacci(int);
int main(void) {
int n;
scanf("%d", &n);
Fibonacci(n);
return 0;
}
void Fibonacci(int n) {
int i, fib[MAX];
fib[0] = 1;
fib[1] = 1;
for (i = 2; i < MAX; i++)
fib[i] = fib[i - 2] + fib[i - 1];
printf("%d\n", fib[n]);... | #include <stdio.h>
#include <stdlib.h>
#define MAX 45
void Fibonacci(int);
int main(void) {
int n;
scanf("%d", &n);
Fibonacci(n);
return 0;
}
void Fibonacci(int n) {
int i, fib[MAX];
fib[0] = 1;
fib[1] = 1;
for (i = 2; i < MAX; i++)
fib[i] = fib[i - 2] + fib[i - 1];
printf("%d\n", fib[n]);... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 118 | 2 |
#include <stdio.h>
int main(void) {
int n, A[50], i;
scanf("%d", &n);
A[0] == 1;
A[1] == 1;
for (i = 2; i < 50; i++) {
A[i] = A[i - 1] + A[i - 2];
}
printf("%d\n", A[n]);
return 0;
} | #include <stdio.h>
int main(void) {
int n, A[50], i;
scanf("%d", &n);
A[0] = 1;
A[1] = 1;
for (i = 2; i < 50; i++) {
A[i] = A[i - 1] + A[i - 2];
}
printf("%d\n", A[n]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32]] | 0 | 93 | 4 |
#include <stdio.h>
int main() {
int a[50];
int n, i, j;
scanf("%d", &n);
a[0] = 1;
a[1] = 1;
for (i = 2; i < n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
printf("%d\n", a[n]);
return 0;
} | #include <stdio.h>
int main() {
int a[50];
int n, i, j;
scanf("%d", &n);
a[0] = 1;
a[1] = 1;
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
printf("%d\n", a[n]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 95 | 2 |
#include <stdio.h>
int main(void) {
int i, n, x, y, z;
x = y = 1;
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
z = x + y;
y = x;
x = z;
}
printf("%d\n", z);
return 0;
} | #include <stdio.h>
int main(void) {
int i, n, x, y, z;
x = y = z = 1;
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
z = x + y;
y = x;
x = z;
}
printf("%d\n", z);
return 0;
} | [["+", 0, 1, 0, 11, 12, 11, 12, 11, 31, 22], ["+", 0, 1, 0, 11, 12, 11, 12, 11, 17, 32]] | 0 | 80 | 2 |
#include <stdio.h>
int T[50];
int fibonacci(int n) {
int i;
T[0] = 1;
T[1] = 1;
for (i = 2; i < n; i++)
T[i] = T[i - 2] + T[i - 1];
return T[i - 1];
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", fibonacci(n));
return 0;
} | #include <stdio.h>
int T[50];
int fibonacci(int n) {
int i;
T[0] = 1;
T[1] = 1;
for (i = 2; i <= n; i++)
T[i] = T[i - 2] + T[i - 1];
return T[i - 1];
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", fibonacci(n));
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 108 | 2 |
#include <stdio.h>
int main() {
int n, F[44], i, j;
scanf("%d", &n);
F[0] = 0;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 1] + F[i - 2];
}
scanf("%d\n", F[n]);
} | #include <stdio.h>
int main() {
int n, F[44], i, j;
scanf("%d", &n);
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 1] + F[i - 2];
}
printf("%d\n", F[n]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 0 | 91 | 7 |
#include <stdio.h>
int dp[50];
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main(void) {
int n, i;
for (i = 0; i < 50; i++) {
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fib(n));
}
return 0;
} | #include <stdio.h>
int dp[50];
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n, i;
for (i = 0; i < 50; i++)
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
} | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 129 | 3 |
#include <stdio.h>
int main(void) {
int n;
int ans[50];
scanf("%d", &n);
ans[0] = 1;
ans[1] = 1;
for (int i = 2; i < n; i++) {
ans[i] = ans[i - 1] + ans[i - 2];
}
printf("%d\n", ans[n]);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int ans[50];
scanf("%d", &n);
ans[0] = 1;
ans[1] = 1;
for (int i = 2; i <= n; i++) {
ans[i] = ans[i - 1] + ans[i - 2];
}
printf("%d\n", ans[n]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 93 | 2 |
#include <stdio.h>
int a;
long long f1, f2, k;
int main(void) {
f1 = 1;
f2 = 1;
scanf("%d", &a);
if (a == 0 || a == 1) {
printf("1\n");
} else {
for (int i = 0; i < a - 2; i++) {
k = f1;
f1 = f1 + f2;
f2 = k;
}
printf("%d\n", f1);
}
return 0;
}
| #include <stdio.h>
int a;
long long f1, f2, k;
int main(void) {
f1 = 1;
f2 = 1;
scanf("%d", &a);
if (a == 0 || a == 1) {
printf("1\n");
} else {
for (int i = 0; i <= a - 2; i++) {
k = f1;
f1 = f1 + f2;
f2 = k;
}
printf("%d\n", f1);
}
return 0;
}
| [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 0 | 106 | 2 |
#include <stdio.h>
int main(void) {
int x, i, f;
int n1 = 1, n2 = 1;
scanf("%d", &x);
if (x == 0 || x == 1) {
printf("1\n");
}
if (x >= 2) {
for (i = 2; i <= x; i++) {
f = n1 + n2;
n2 = n1;
n1 = f;
}
}
printf("%d\n", f);
return 0;
} | #include <stdio.h>
int main(void) {
int x, i, f;
int n1 = 1, n2 = 1;
scanf("%d", &x);
if (x == 0 || x == 1) {
printf("1\n");
}
if (x >= 2) {
for (i = 2; i <= x; i++) {
f = n1 + n2;
n2 = n1;
n1 = f;
}
printf("%d\n", f);
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 105 | 2 |
#include <stdio.h>
int main() {
long long int a = 0, b = 1;
int n;
scanf("%d", &n);
while (n--) {
long long int l;
l = b;
b = a + b;
a = l;
}
printf("%lld\n", a);
return 0;
} | #include <stdio.h>
int main() {
long long int a = 1, b = 1;
int n;
scanf("%d", &n);
while (n--) {
long long int l;
l = b;
b = a + b;
a = l;
}
printf("%lld\n", a);
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 71 | 2 |
#include <stdio.h>
unsigned long long Fibonacci(unsigned long long m) {
static unsigned long long n1 = 0, n2 = 1;
if (m == 0)
return n1 + n2;
n2 += n1 ^= n2 ^= n1 ^= n2;
return Fibonacci(m - 1);
}
int main() {
unsigned long long i;
scanf("%llu", &i);
printf("%llu\n", Fibonacci(i));
return 0;
} | #include <stdio.h>
unsigned long long Fibonacci(unsigned long long m) {
static unsigned long long n1 = 0, n2 = 1;
if (m == 0)
return n2;
n2 += n1 ^= n2 ^= n1 ^= n2;
return Fibonacci(m - 1);
}
int main() {
unsigned long long i;
scanf("%llu", &i);
printf("%llu\n", Fibonacci(i));
return 0;
} | [["-", 8, 9, 0, 57, 64, 37, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 64, 37, 0, 16, 17, 72]] | 0 | 92 | 2 |
import java.util.Scanner;
class Main {
static int[] F = new int[44];
public static void makeFibona() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < F.length; i++)
F[i] = F[i - 2] + F[i - 1];
}
public static int Fibona(int n) {
if (n == 0 || n == 1)
return F[n];
return F[n];
}
... | import java.util.Scanner;
class Main {
static int[] F = new int[45];
public static void makeFibona() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < F.length; i++)
F[i] = F[i - 2] + F[i - 1];
}
public static int Fibona(int n) {
if (n == 0 || n == 1)
return F[n];
return F[n];
}
... | [["-", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499]] | 3 | 160 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) throws IOException {
new Main().exec();
}
public void exec() throws IOException {
BufferedReader br = new BufferedReader(ne... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) throws IOException {
new Main().exec();
}
public void exec() throws IOException {
BufferedReader br = new BufferedReader(ne... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 196 | 2 |
#include <stdio.h>
#define MAX 44
int fibonacci(int);
int F[MAX];
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < MAX; i++) {
F[i] = -1;
}
printf("%d\n", fibonacci(n));
}
int fibonacci(int i) {
if (i == 1 || i == 0)
return F[i] = 1;
else {
if (F[i] != -1)
return F[i];
retur... | #include <stdio.h>
#define MAX 45
int fibonacci(int);
int F[45];
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < MAX; i++) {
F[i] = -1;
}
printf("%d\n", fibonacci(n));
}
int fibonacci(int i) {
if (i == 1 || i == 0)
return F[i] = 1;
else {
if (F[i] != -1)
return F[i];
return... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 0 | 137 | 4 |
#include <stdio.h>
#define N 44
int F[N];
int fib(int n) {
if (n == 1 || n == 0)
return F[n] = 1;
if (F[n] != -1)
return F[n];
return F[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n, i;
for (i = 0; i < N; i++) {
F[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
}
| #include <stdio.h>
#define N 50
int F[N];
int fib(int n) {
if (n == 1 || n == 0)
return F[n] = 1;
if (F[n] != -1)
return F[n];
return F[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n, i;
for (i = 0; i < N; i++) {
F[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
}
| [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 131 | 2 |
// Fibonacci Number
#include <stdio.h>
#define MAX 44
#define NIL -1 // フィボナッチ数列の値として使われない値を番兵としておく
int F[MAX];
// フィボナッチ数列を計算 //
// 計算したn番目の要素は配列に入れておくことで、
// 必要な再帰の回数を減らす
int fibonacci(int n) {
if (n == 0 || n == 1)
return 1;
if (F[n] != NIL)
return F[n]; // 要素nがすでに計算されているとき
else
return F[n] = fi... | // Fibonacci Number
#include <stdio.h>
#define MAX 45
#define NIL -1 // フィボナッチ数列の値として使われない値を番兵としておく
int F[MAX];
// フィボナッチ数列を計算 //
// 計算したn番目の要素は配列に入れておくことで、
// 必要な再帰の回数を減らす
int fibonacci(int n) {
if (n == 0 || n == 1)
return F[n] = 1;
if (F[n] != NIL)
return F[n]; // 要素nがすでに計算されているとき
else
return F[... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 57, 64, 37, 0, 11, 31, 69, 28, 22], ["+", 0, 57, 64, 37, 0, 11, 31, 69, 0, 70], ["+", 0, 57, 64, 37, 0, 11, 31, 69, 71, 22], ["+", 0, 57, 64, 37, 0, 11, 31, 69, 0, 73], ["+", 8, 9, 0, 57, 64, 37, 0, 11, 17, 32]] | 0 | 136 | 7 |
#include <stdio.h>
int a[50];
int fib(int n) {
if (n == 0 || n == 1) {
a[n] = 1;
}
if (a[n] != -1) {
return a[n];
}
return a[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n, i;
for (i = 0; i < 50; i++) {
a[n] = -1;
}
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
}
| #include <stdio.h>
int a[45];
int fib(int n) {
if (n == 0 || n == 1) {
a[n] = 1;
}
if (a[n] != -1) {
return a[n];
}
return a[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n, i;
for (i = 0; i < 45; i++) {
a[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
}
| [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 71, 22]] | 0 | 131 | 6 |
#include <stdio.h>
int main() {
int fib[45] = {1, 1};
int i;
for (i = 1; i < 45; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
scanf("%d", &i);
printf("%d\n", fib[i]);
return 0;
}
| #include <stdio.h>
int main() {
int fib[45] = {1, 1};
int i;
for (i = 2; i < 45; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
scanf("%d", &i);
printf("%d\n", fib[i]);
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 83 | 2 |
#include <stdio.h>
int f[44];
void makeFibonacci(void);
int n, i;
int main() {
for (i = 0; i < 44; i++) {
f[i] = -1;
}
scanf("%d", &n);
makeFibonacci();
printf("%d\n", f[n]);
return 0;
}
void makeFibonacci() {
f[0] = 1;
f[1] = 1;
for (i = 2; i <= n; i++) {
f[i] = f[i - 2] + f[i - 1];
}
... | #include <stdio.h>
int f[45];
void makeFibonacci(void);
int n, i;
int main() {
for (i = 0; i <= 44; i++) {
f[i] = -1;
}
scanf("%d", &n);
makeFibonacci();
printf("%d\n", f[n]);
return 0;
}
void makeFibonacci() {
f[0] = 1;
f[1] = 1;
for (i = 2; i <= n; i++) {
f[i] = f[i - 2] + f[i - 1];
}... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 131 | 4 |
/*
* C言語のサンプルプログラム - Webkaru
* - フィボナッチ数の計算 -
*/
#include <stdio.h>
int main(void) {
/* 変数の宣言 */
int n;
int f0, f1, f2;
int count = 0;
f0 = 0;
f1 = 1;
scanf("%d", &n);
/* フィボナッチ数の計算 */
while (n < 44) {
count++;
// フィボナッチ数の計算
f2 = f1 + f0;
if (n == count) {
printf("%d\n", f2)... | /*
* C言語のサンプルプログラム - Webkaru
* - フィボナッチ数の計算 -
*/
#include <stdio.h>
int main(void) {
/* 変数の宣言 */
int n;
int f0, f1, f2;
int count = 0;
f0 = 0;
f1 = 1;
scanf("%d", &n);
/* フィボナッチ数の計算 */
while (n <= 44) {
count++;
// フィボナッチ数の計算
f2 = f1 + f0;
if (n == count) {
printf("%d\n", f2... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 96 | 2 |
#include <stdio.h>
#define N 44
int main() {
int i, n, data[N];
scanf("%d", &n);
data[0] = 1;
data[1] = 1;
for (i = 2; i < N; i++)
data[i] = data[i - 1] + data[i - 2];
printf("%d\n", data[n]);
}
| #include <stdio.h>
#define N 50
int main() {
int i, n, data[N];
scanf("%d", &n);
data[0] = 1;
data[1] = 1;
for (i = 2; i <= n; i++)
data[i] = data[i - 1] + data[i - 2];
printf("%d\n", data[n]);
}
| [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 90 | 6 |
#include <stdio.h>
#define RANGE 44
int main() {
int i, j, n, fib[RANGE];
scanf("%d", &n);
fib[0] = 1;
fib[1] = 1;
for (i = 2; i < RANGE; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[n]);
return 0;
}
| #include <stdio.h>
#define RANGE 45
int main() {
int i, j, n, fib[RANGE];
scanf("%d", &n);
fib[0] = 1;
fib[1] = 1;
for (i = 2; i < RANGE; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[n]);
return 0;
}
| [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 97 | 2 |
#include <stdio.h>
int main(void) {
int n, i;
int fib[100] = {1, 1};
scanf("%d", &n);
for (i = 1; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[n]);
return 0;
}
| #include <stdio.h>
int main(void) {
int n, i;
int fib[100] = {1, 1};
scanf("%d", &n);
for (i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[n]);
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 86 | 2 |
#include <stdio.h>
int Fib(int n) {
int i, a, b = 1, c = 1;
for (i = 2; i <= n; i++) {
a = b + c;
c = b;
b = a;
}
return a;
}
int n;
int main() {
scanf("%d", &n);
printf("%d\n", Fib(n));
return 0;
} | #include <stdio.h>
int Fib(int n) {
int i, a = 1, b = 1, c = 1;
for (i = 2; i <= n; i++) {
a = b + c;
c = b;
b = a;
}
return a;
}
int n;
int main() {
scanf("%d", &n);
printf("%d\n", Fib(n));
return 0;
} | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 90 | 2 |
#include <stdio.h>
main() {
int n, o, p, q, i;
scanf("%d", &n);
p = 1;
q = 1;
for (i = 0; i <= n; i++) {
o = p + q;
p = q;
q = o;
}
printf("%d\n", p);
return 0;
} | #include <stdio.h>
main() {
int n, o, p, q, i;
scanf("%d", &n);
p = 0;
q = 1;
for (i = 0; i <= n; i++) {
o = p + q;
p = q;
q = o;
}
printf("%d\n", p);
return 0;
} | [["-", 0, 30, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 9, 0, 1, 0, 11, 12, 13]] | 0 | 79 | 2 |
#include <stdio.h>
main() {
int fib[44], n, o, p, q, i;
scanf("%d", &n);
fib[0] = 1;
fib[1] = 1;
for (i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[i]);
return 0;
} | #include <stdio.h>
main() {
int fib[44], n, o, p, q, i;
scanf("%d", &n);
fib[0] = 1;
fib[1] = 1;
for (i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%d\n", fib[n]);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 98 | 2 |
#include <stdio.h>
int fib(int n) {
int i;
int A[45];
A[1] = 1;
A[2] = 1;
for (i = 3; i <= n; i++) {
A[i] = A[i - 1] + A[i - 2];
}
return A[n];
}
main() {
int n;
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
} | #include <stdio.h>
int fib(int n) {
int i;
int A[45];
A[0] = 1;
A[1] = 1;
for (i = 2; i <= n; i++) {
A[i] = A[i - 1] + A[i - 2];
}
return A[n];
}
main() {
int n;
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 31, 69, 71, 13], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 71, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 108 | 6 |
#include <stdio.h>
#define NIL -1
int F[44];
int fibonacci(int n) {
int ans;
if (F[n] != NIL) {
return F[n];
} else {
ans = fibonacci(n - 1) + fibonacci(n - 2);
F[n] = ans;
return ans;
}
}
main() {
int n, i;
for (i = 2; i < 44; i++) {
F[i] = NIL;
}
F[0] = 1;
F[1] = 1;
scanf("%d... | #include <stdio.h>
#define NIL -1
int F[45];
int fibonacci(int n) {
int ans;
if (F[n] != NIL) {
return F[n];
} else {
ans = fibonacci(n - 1) + fibonacci(n - 2);
F[n] = ans;
return ans;
}
}
main() {
int n, i;
for (i = 2; i < 45; i++) {
F[i] = NIL;
}
F[0] = 1;
F[1] = 1;
scanf("%d... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 30, 0, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 30, 0, 9, 0, 7, 15, 16, 12, 13]] | 0 | 141 | 4 |
#include <stdio.h>
int F[45];
int fib(int);
main() {
int n, i, ans;
F[0] = 1;
F[1] = 1;
scanf("%d", &n);
for (i = 2; i < 45; i++) {
F[i] = 0;
}
for (i = 2; i <= n; i++) {
F[i] = fib(i);
}
printf("%d\n", F[i]);
return 0;
}
int fib(int n) {
if (n == 0 || n == 1) {
return 1;
} e... | #include <stdio.h>
int F[45];
int fib(int);
main() {
int n, i;
F[0] = 1;
F[1] = 1;
scanf("%d", &n);
for (i = 2; i < 45; i++) {
F[i] = 0;
}
for (i = 2; i <= n; i++) {
F[i] = fib(i);
}
printf("%d\n", F[n]);
return 0;
}
int fib(int n) {
if (n == 0 || n == 1) {
return 1;
} else {... | [["-", 36, 36, 0, 30, 0, 9, 0, 43, 0, 21], ["-", 36, 36, 0, 30, 0, 9, 0, 43, 49, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 155 | 4 |
#include <stdio.h>
int main() {
int n;
int i;
int z;
int x;
int y;
x = 1;
y = 1;
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
z = x + y;
x = y;
y = z;
}
printf("%d\n", z);
return 0;
} | #include <stdio.h>
int main() {
int n;
int i;
int z;
int x;
int y;
x = 1;
y = 1;
z = 1;
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
z = x + y;
x = y;
y = z;
}
printf("%d\n", z);
return 0;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 85 | 4 |
#include <stdio.h>
int U[45];
int main(void) {
int i, n;
for (i = 0; i < 45; i++) {
U[i] = 0;
}
scanf("%d", &n);
printf("%d\n", fibonacch(n));
return 0;
}
int fibonacch(int x) {
if (U[x] != -1) {
return U[x];
}
if (x == 0 || x == 1) {
U[x] = 1;
return U[x];
} else {
U[x] = f... | #include <stdio.h>
int U[45];
int main(void) {
int i, n;
for (i = 0; i < 45; i++) {
U[i] = -1;
}
scanf("%d", &n);
printf("%d\n", fibonacch(n));
return 0;
}
int fibonacch(int x) {
if (U[x] != -1) {
return U[x];
}
if (x == 0 || x == 1) {
U[x] = 1;
return U[x];
} else {
U[x] = ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 146 | 2 |
#include <stdio.h>
int fibonacci(int n) {
int i, a = 1, b = 1, tmp = 1;
for (i = 0; i < n; i++) {
tmp = a + b;
a = b;
b = tmp;
}
return tmp;
}
main() {
int n, result;
scanf("%d", &n);
if (n >= 0 && n <= 44) {
result = fibonacci(n);
}
printf("%d\n", result);
return 0;
} | #include <stdio.h>
int fibonacci(int n) {
int i, a = 1, b = 1, tmp = 1;
for (i = 1; i < n; i++) {
tmp = a + b;
a = b;
b = tmp;
}
return tmp;
}
main() {
int n, result;
scanf("%d", &n);
if (n >= 0 && n <= 44) {
result = fibonacci(n);
}
printf("%d\n", result);
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 110 | 2 |
#include "stdio.h"
int main(int argc, char const *argv[]) {
int kaku[50];
int bango;
int i;
kaku[0] = 1;
kaku[1] = 1;
scanf("%d", &bango);
for (i = 2; i < 1000; i++) {
kaku[i] = kaku[i - 2] + kaku[i - 1];
}
printf("%d", kaku[bango]);
return 0;
} | #include "stdio.h"
int main(int argc, char const *argv[]) {
int kaku[1000];
int bango;
int i;
kaku[0] = 1;
kaku[1] = 1;
scanf("%d", &bango);
for (i = 2; i < 1000; i++) {
kaku[i] = kaku[i - 2] + kaku[i - 1];
}
printf("%d\n", kaku[bango]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 104 | 3 |
#include <stdio.h>
#define N 45
int Fibonacci[N];
int FibonacciNumber(n) {
int i, f0fibonacci, f1fibonacci, fibonacci;
/* if(n == 0 || n == 1){
return Fibonacci[n] = 1;
}
/if(Fibonacci[n] == 1 ){
return Fibonacci[n];
}
return Fibonacci[n] = FibonacciNumber(n - 2) + FibonacciNumber(n - 1);*/
f0f... | #include <stdio.h>
#define N 45
int Fibonacci[N];
int FibonacciNumber(n) {
int i, f0fibonacci, f1fibonacci, fibonacci;
/* if(n == 0 || n == 1){
return Fibonacci[n] = 1;
}
/if(Fibonacci[n] == 1 ){
return Fibonacci[n];
}
return Fibonacci[n] = FibonacciNumber(n - 2) + FibonacciNumber(n - 1);*/
f0f... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 106 | 4 |
#include <stdio.h>
#define N 44
int fibonacci(int *F, int n) {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
return F[n];
}
int main(void) {
int F[20] = {};
int i, j, n, x = 0;
scanf("%d", &n);
x = fibonacci(F, n);
printf("%d\n", x);
return 0;
} | #include <stdio.h>
#define N 100
int fibonacci(int *F, int n) {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
return F[n];
}
int main(void) {
int F[N] = {};
int i, j, n, x = 0;
scanf("%d", &n);
x = fibonacci(F, n);
printf("%d\n", x);
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 22]] | 0 | 133 | 4 |
#include <stdio.h>
#define N 44
int F[N];
makeFibonacci() {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i < N; i++) {
F[i] = F[i - 2] + F[i - 1];
}
}
int main() {
int n;
makeFibonacci();
scanf("%d", &n);
printf("%d\n", F[n]);
return 0;
} | #include <stdio.h>
#define N 45
int F[N];
makeFibonacci() {
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i < N; i++) {
F[i] = F[i - 2] + F[i - 1];
}
}
int main() {
int n;
makeFibonacci();
scanf("%d", &n);
printf("%d\n", F[n]);
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 107 | 2 |
#include <stdio.h>
int dp[50];
int fibonacci(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fibonacci(n - 1) + fibonacci(n - 2); //?????°
}
int main() {
int n, i;
for (i = 0; i < 44; i++)
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fibonacci(n... | #include <stdio.h>
int dp[50];
int fibonacci(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fibonacci(n - 1) + fibonacci(n - 2); //?????°
}
int main() {
int n, i;
for (i = 0; i <= 44; i++)
dp[i] = -1;
scanf("%d", &n);
printf("%d\n", fibonacci(... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 127 | 2 |
#include <stdio.h>
int main() {
int n, i, F[45];
scanf("%d", &n);
F[0] = 1;
F[1] = 1;
for (i = 0; i < n; i++)
F[i] = F[i - 1] + F[i - 2];
printf("%d\n", F[n]);
return 0;
} | #include <stdio.h>
int main() {
int n, i, F[45];
scanf("%d", &n);
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++)
F[i] = F[i - 1] + F[i - 2];
printf("%d\n", F[n]);
return 0;
} | [["-", 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, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 90 | 4 |
#include <stdio.h>
#define MAX 44
int array[MAX];
void makefibo();
int main() {
int n;
scanf("%d", &n);
makefibo();
printf("%d\n", array[n]);
return 0;
}
void makefibo() {
int i;
array[0] = array[1] = 1;
for (i = 2; i < MAX; i++) {
array[i] = array[i - 2] + array[i - 1];
}
} | #include <stdio.h>
#define MAX 45
int array[MAX];
void makefibo();
int main() {
int n;
scanf("%d", &n);
makefibo();
printf("%d\n", array[n]);
return 0;
}
void makefibo() {
int i;
array[0] = array[1] = 1;
for (i = 2; i < MAX; i++) {
array[i] = array[i - 2] + array[i - 1];
}
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 110 | 2 |
#include <stdio.h>
int main() {
int F[44];
int n, i, total;
F[0] = 1;
F[1] = 1;
scanf("%d", &n);
for (i = 2; i < n; i++) {
F[i] = F[i - 2] + F[i - 1];
}
printf("%d\n", F[n]);
return 0;
}
| #include <stdio.h>
int main() {
int F[44];
int n, i;
F[0] = 1;
F[1] = 1;
scanf("%d", &n);
for (i = 2; i < n + 2; i++) {
F[i] = F[i - 2] + F[i - 1];
}
printf("%d\n", F[n]);
return 0;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 95 | 4 |
#include <stdio.h>
int fibonacci(int);
int F[44];
int main() {
int n, i;
scanf("%d", &n);
/* 初期化 */
for (i = 0; i < 44; i++) {
F[i] = -1;
}
/* 出力 */
printf("%d\n", fibonacci(n));
return 0;
}
int fibonacci(int n) {
if (n == 0 || n == 1)
return F[n] = 1; // F[n]に1をメモしてそれを返す
if (F[n] !... | #include <stdio.h>
int fibonacci(int);
int F[46];
int main() {
int n, i;
scanf("%d", &n);
/* 初期化 */
for (i = 0; i < 46; i++) {
F[i] = -1;
}
/* 出力 */
printf("%d\n", fibonacci(n));
return 0;
}
int fibonacci(int n) {
if (n == 0 || n == 1)
return F[n] = 1; // F[n]に1をメモしてそれを返す
if (F[n] !... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 138 | 4 |
#include <stdio.h>
int F[50];
int main() {
int i, n;
scanf("%d", &n);
F[0] = 1;
F[1] = 1;
for (i = 2; i < n; i++)
F[i] = F[i - 2] + F[i - 1];
printf("%d\n", F[n - 1]);
return 0;
} | #include <stdio.h>
int F[50];
int main() {
int i, n;
scanf("%d", &n);
F[0] = 1;
F[1] = 1;
for (i = 2; i <= n; i++)
F[i] = F[i - 2] + F[i - 1];
printf("%d\n", F[n]);
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 93 | 4 |
#include <iostream>
#include <vector>
using namespace std;
void fibonacci(int n) {
vector<int> fib;
fib.push_back(1);
fib.push_back(1);
if (n < 2) {
cout << "1" << endl;
} else if (n == 2) {
fib.push_back(fib.at(0) + fib.at(1));
cout << fib.back() << endl;
} else {
for (int i = 2; i < n; ... | #include <iostream>
#include <vector>
using namespace std;
void fibonacci(int n) {
vector<int> fib;
fib.push_back(1);
fib.push_back(1);
if (n < 2) {
cout << "1" << endl;
} else if (n == 2) {
fib.push_back(fib.at(0) + fib.at(1));
cout << fib.back() << endl;
} else {
for (int i = 2; i < n +... | [["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 163 | 2 |
#include <iostream>
int Fib[45];
int main() {
int n;
std::cin >> n;
Fib[0] = Fib[1] = 1;
for (int i = 2; i <= n; i++) {
Fib[i] = Fib[n - 1] + Fib[i - 2];
}
std::cout << Fib[n] << std::endl;
return 0;
}
| #include <iostream>
int Fib[45];
int main() {
int n;
std::cin >> n;
Fib[0] = Fib[1] = 1;
for (int i = 2; i <= n; i++) {
Fib[i] = Fib[i - 1] + Fib[i - 2];
}
std::cout << Fib[n] << std::endl;
return 0;
}
| [["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22]] | 1 | 86 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int f[45], n;
cin >> n;
f[0] = 1;
f[1] = 1;
for (int i = 2; i < 45; i++) {
f[i] = f[i - 1] + f[i - 2];
}
cout << f[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int f[45], n;
cin >> n;
f[0] = 1;
f[1] = 1;
for (int i = 2; i < 45; i++) {
f[i] = f[i - 1] + f[i - 2];
}
cout << f[n] << endl;
return 0;
}
| [["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 87 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int m... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 115 | 4 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 758 | 6 |
#include <cmath>
#include <iostream>
using namespace std;
int Fib(int n) {
double phi = (1 + sqrt(5)) / 2;
return floor(pow(phi, n) / sqrt(5) + 0.5);
}
int main() {
int n;
while (cin >> n) {
cout << Fib(n) << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int Fib(int n) {
double phi = (1 + sqrt(5)) / 2;
return floor(pow(phi, n) / sqrt(5) + 0.5);
}
int main() {
int n;
while (cin >> n) {
cout << Fib(n + 1) << endl;
}
return 0;
} | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 77 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[45], n;
cin >> n;
a[0] = 1;
a[1] = 1;
if (n < 2) {
cout << a[n] << endl;
} else {
for (int i = 3; i <= n; i++)
a[i] = a[i - 1] + a[i - 2];
cout << a[n] << endl;
}
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[45], n;
cin >> n;
a[0] = 1;
a[1] = 1;
if (n < 2) {
cout << a[n] << endl;
} else {
for (int i = 2; i <= n; i++)
a[i] = a[i - 1] + a[i - 2];
cout << a[n] << endl;
}
} | [["-", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 102 | 2 |
// ???????¨???????
#include <bits/stdc++.h>
using namespace std;
long long dp[101];
long long fib(long long n) {
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i <= n; ++i)
dp[i] = dp[i - 1] + dp[i - 2];
return dp[n];
}
int main() {
long long n;
cin >> n;
memset(dp, 0, 101);
cout << fib(n) << endl;... | // ???????¨???????
#include <bits/stdc++.h>
using namespace std;
long long dp[101];
long long fib(long long n) {
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; ++i)
dp[i] = dp[i - 1] + dp[i - 2];
return dp[n];
}
int main() {
long long n;
cin >> n;
memset(dp, 0, 101);
cout << fib(n) << endl;... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 112 | 2 |
#include <iostream>
using namespace std;
#define MAX 44
int main() {
int fibo[MAX];
int n;
fibo[0] = fibo[1] = 1;
for (int i = 2; i < MAX; i++)
fibo[i] = fibo[i - 1] + fibo[i - 2];
cin >> n;
cout << fibo[n - 1] << endl;
} | #include <iostream>
using namespace std;
#define MAX 45
int main() {
int fibo[MAX];
int n;
fibo[0] = fibo[1] = 1;
for (int i = 2; i < MAX; i++)
fibo[i] = fibo[i - 1] + fibo[i - 2];
cin >> n;
cout << fibo[n] << endl;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 84 | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<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;
fibona... | #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... | [["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 173 | 4 |
#include <iostream>
using namespace std;
#define MAX 44
int F[MAX];
void Fibonacci() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < MAX; i++)
F[i] = F[i - 2] + F[i - 1];
}
int main(void) {
Fibonacci();
int i;
cin >> i;
cout << F[i] << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX 45
int F[MAX];
void Fibonacci() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < MAX; i++)
F[i] = F[i - 2] + F[i - 1];
}
int main(void) {
Fibonacci();
int i;
cin >> i;
cout << F[i] << endl;
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 98 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int dp[44] = {1, 1};
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
cout << dp[n - 1] << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int dp[44] = {1, 1};
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
cout << dp[n] << endl;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 77 | 4 |
#include <iostream>
using namespace std;
int F[44];
int main() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < 44; ++i) {
F[i] = F[i - 1] + F[i - 2];
}
int input;
cin >> input;
cout << F[input] << endl;
}
| #include <iostream>
using namespace std;
int F[45];
int main() {
F[0] = 1;
F[1] = 1;
for (int i = 2; i < 45; ++i) {
F[i] = F[i - 1] + F[i - 2];
}
int input;
cin >> input;
cout << F[input] << endl;
}
| [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 83 | 4 |
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int first = 1;
int second = 1;
for (int i = 2; i < input; ++i) {
int third = first + second;
first = second;
second = third;
}
cout << second << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int first = 1;
int second = 1;
for (int i = 2; i <= input; ++i) {
int third = first + second;
first = second;
second = third;
}
cout << second << "\n";
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 71 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.