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 |
|---|---|---|---|---|---|
#include <iostream>
using namespace std;
#define INF -1
int dp[45];
int main() {
for (int i = 0; i < 45; i++) {
dp[i] = INF;
}
int n;
cin >> n;
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[n] = dp[n - 1] + dp[n - 2];
}
cout << dp[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
#define INF -1
int dp[45];
int main() {
for (int i = 0; i < 45; i++) {
dp[i] = INF;
}
int n;
cin >> n;
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
cout << dp[n] << endl;
return 0;
} | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 112 | 6 |
#include <cstdio>
int main() {
int a[44], n;
a[0] = a[1] = 1;
for (int i = 2; i <= 44; i++)
a[i] = a[i - 1] + a[i - 2];
scanf("%d", &n);
printf("%d\n", n);
return 0;
} | #include <cstdio>
int main() {
int a[44], n;
a[0] = a[1] = 1;
for (int i = 2; i <= 44; i++)
a[i] = a[i - 1] + a[i - 2];
scanf("%d", &n);
printf("%d\n", a[n]);
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 84 | 3 |
#include <iostream>
using namespace std;
typedef long long hyper;
hyper fib(int n) {
if (n < 2)
return 1;
if (n == 2)
return 2;
if (n == 3)
return 3;
return 3 * fib(n - 2) + fib(n - 4);
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long hyper;
hyper fib(int n) {
if (n < 2)
return 1;
if (n == 2)
return 2;
if (n == 3)
return 3;
return 3 * fib(n - 2) - fib(n - 4);
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 72], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 33]] | 1 | 88 | 2 |
#include <iostream>
using namespace std;
int memo[100];
int fibonacci(int n) {
if (memo[n] == -1) {
return memo[n];
}
if (n == 0) {
return 0;
}
if (n == 1) {
return 1;
}
memo[n] = fibonacci(n - 1) + fibonacci(n - 2);
return memo[n];
}
int main() {
int n;
cin >> n;
fill(memo, memo +... | #include <iostream>
using namespace std;
int memo[100];
int fibonacci(int n) {
if (memo[n] != -1) {
return memo[n];
}
if (n == 0) {
return 1;
}
if (n == 1) {
return 1;
}
memo[n] = fibonacci(n - 1) + fibonacci(n - 2);
return memo[n];
}
int main() {
int n;
cin >> n;
fill(memo, memo +... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 117 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int fib[44];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 44; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
int n;
scanf("%d", &n);
printf("%d\n", fib[n]);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int fib[45];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 45; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
int n;
scanf("%d", &n);
printf("%d\n", fib[n]);
} | [["-", 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, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 95 | 4 |
#include <iostream>
using namespace std;
const int MAX = 44;
int F[MAX];
int fib(int n) {
if (n == 0 || n == 1)
return F[n];
if (F[n] != -1)
return F[n];
return F[n] = fib(n - 1) + fib(n - 2);
}
int main() {
ios::sync_with_stdio(false);
F[0] = F[1] = 1;
for (int i = 2; i < MAX; i++)
F[i] = -... | #include <iostream>
using namespace std;
const int MAX = 44;
int F[MAX];
int fib(int n) {
if (n == 0 || n == 1)
return F[n];
if (F[n] != -1)
return F[n];
return F[n] = fib(n - 1) + fib(n - 2);
}
int main() {
ios::sync_with_stdio(false);
F[0] = F[1] = 1;
for (int i = 2; i <= MAX; i++)
F[i] = ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 142 | 2 |
#include <iostream>
#include <stdlib.h>
using namespace std;
#define MAX_N 44
class Fib {
private:
int size;
int *A;
public:
Fib(int size) {
this->size = size;
makeFib();
}
int getFib(int n) { return A[n]; }
void makeFib() {
int i;
this->A = (int *)malloc(sizeof(int) * this->size);
... | #include <iostream>
#include <stdlib.h>
using namespace std;
#define MAX_N 44
class Fib {
private:
int size;
int *A;
public:
Fib(int size) {
this->size = size;
makeFib();
}
int getFib(int n) { return A[n]; }
void makeFib() {
int i;
this->A = (int *)malloc(sizeof(int) * (this->size + 1)... | [["+", 0, 105, 51, 74, 51, 66, 28, 23, 0, 24], ["+", 51, 74, 51, 66, 28, 23, 0, 16, 17, 72], ["+", 51, 74, 51, 66, 28, 23, 0, 16, 12, 13], ["+", 0, 105, 51, 74, 51, 66, 28, 23, 0, 25], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 198 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
int Fibonatch(int result[], int num) {
int ret = result[num];
if (ret != 0) {
if (num > 1) {
ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
} else {
ret = 1;
}
result[num] = ret;
}
return ret;
}
int main(v... | #include <cstdio>
#include <iostream>
using namespace std;
int Fibonatch(int result[], int num) {
int ret = result[num];
if (ret == 0) {
if (num > 1) {
ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
} else {
ret = 1;
}
result[num] = ret;
}
return ret;
}
int main(v... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 137 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
#if 0
int Fibonatch(int result[], int num)
{
int ret = result[num];
if (ret == 0) {
if (num > 1) {
ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
}
else {
ret = 1;
}
resul... | #include <cstdio>
#include <iostream>
using namespace std;
#if 0
int Fibonatch(int result[], int num)
{
int ret = result[num];
if (ret == 0) {
if (num > 1) {
ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
}
else {
ret = 1;
}
resul... | [["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13]] | 1 | 254 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int fib[50];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 50; i++) {
fib[i] = fib[i - 1] + fib[i + 2];
}
cout << fib[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int fib[50];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 50; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
cout << fib[n] << endl;
return 0;
} | [["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 86 | 2 |
#include <iostream>
using namespace std;
unsigned long long ull[45];
int main() {
int i;
int n;
ull[0] = 1;
ull[1] = 1;
cin >> n;
for (i = 2; i < n; i++) {
ull[i] = ull[i - 1] + ull[i - 2];
}
cout << ull[n - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
unsigned long long ull[45];
int main() {
int i;
int n;
ull[0] = 1;
ull[1] = 1;
cin >> n;
for (i = 2; i <= n; i++) {
ull[i] = ull[i - 1] + ull[i - 2];
}
cout << ull[n] << endl;
return 0;
} | [["-", 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 | 92 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
#define debug(x) cout << #x << "==" << x << endl;
using namespace std;
//??\???
#define MAX_N 44
int N;
int dp[MAX_N];
int main() {
ios::sync_with_stdio(false);
cin >> N;
// dp[0] = dp[1] = 1;
// for(int i = 2; i <= N; i++) {
// dp[i] = dp[i-1]... | #include <algorithm>
#include <iostream>
#include <vector>
#define debug(x) cout << #x << "==" << x << endl;
using namespace std;
//??\???
#define MAX_N 44
int N;
int dp[MAX_N];
int main() {
ios::sync_with_stdio(false);
cin >> N;
// dp[0] = dp[1] = 1;
// for(int i = 2; i <= N; i++) {
// dp[i] = dp[i-1]... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 103 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, fib[45];
fib[0] = fib[1] = 0;
scanf("%d", &n);
for (int i = 2; i <= n; i++)
fib[i] = fib[i - 1] + fib[i - 2];
printf("%d\n", fib[n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, fib[45];
fib[0] = fib[1] = 1;
scanf("%d", &n);
for (int i = 2; i <= n; i++)
fib[i] = fib[i - 1] + fib[i - 2];
printf("%d\n", fib[n]);
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13]] | 1 | 91 | 2 |
#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... | [["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 156 | 2 |
#include <bits/stdc++.h>
using namespace std;
int F[114] = {};
int fib(int n) {
if (n == 0 || n == 1)
return 1;
else if (F[n] != 0)
return F[n];
else {
return F[n] = fib(n - 1) + fib(n - 2);
}
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
fib(n);
cout << F[n] << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int F[114] = {};
int fib(int n) {
if (n == 0 || n == 1)
return F[n] = 1;
else if (F[n] != 0)
return F[n];
else {
return F[n] = fib(n - 1) + fib(n - 2);
}
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
fib(n);
cout << F[n] << endl... | [["+", 0, 57, 64, 37, 0, 11, 31, 69, 28, 22], ["+", 64, 37, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 64, 37, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 64, 37, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 64, 37, 0, 11, 17, 32]] | 1 | 112 | 5 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
int dp[44] = {};
cin >> n;
dp[1] = dp[0] = 1;
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
cout << dp[n - 1] << endl;
} | #include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
// 0 -> 1
// 1 -> 1
// 2 -> 2
// 3 -> 3
int main() {
int n;
int dp[44] = {};
cin >> n;
dp[1] = dp[0] = 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 | 90 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int f[50] = {1, 1};
for (int i = 2; i < n; ++i) {
f[i] = f[i - 1] + f[i - 2];
}
cout << f[n] << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int f[50] = {1, 1};
for (int i = 2; i <= n; ++i)
f[i] = f[i - 1] + f[i - 2];
cout << f[n] << endl;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 75 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int dp[45];
int fib... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int dp[45];
int fib... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 169 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int fib(int n) { return n <= 1 ? 1 : fib(n - 1) + fib(n - 2); }
int dp[1000];
int fibMemoR(int n) {
if (n <= 1)
return dp[n] = 1;
if (dp[n])
return dp[n];
return dp[n] = fibMemoR(n - 1) + fibMemoR(n - 2);
}
int fibdp(int n) {
vector<int> dp... | #include <iostream>
#include <vector>
using namespace std;
int fib(int n) { return n <= 1 ? 1 : fib(n - 1) + fib(n - 2); }
int dp[1000];
int fibMemoR(int n) {
if (n <= 1)
return dp[n] = 1;
if (dp[n])
return dp[n];
return dp[n] = fibMemoR(n - 1) + fibMemoR(n - 2);
}
int fibdp(int n) {
vector<int> dp... | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 247 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
// n???0???1?????£?????????????????????
if (n <= 1) {
cout << 1 << endl;
} else {
// n???2??\????????£??????dp??????
vector<int> dp(n + 1);
dp[0] = dp[1] = 1;
for (int i = 2; i <= n; i++)
d... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
// n???0???1?????£?????????????????????
if (n <= 1) {
cout << 1 << endl;
} else {
// n???2??\????????£??????dp??????
vector<int> dp(n + 1);
dp[0] = dp[1] = 1;
for (int i = 2; i <= n; i++)
d... | [["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 106 | 3 |
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
int i;
vector<long long> fib;
scanf("%d", &n);
fib.resize(n);
fib[0] = fib[1] = 1;
for (i = 2; i < n; ++i) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%lld\n", fib[n - 1]);
return 0;
} | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
int i;
vector<long long> fib;
scanf("%d", &n);
fib.resize(n + 1);
fib[0] = fib[1] = 1;
for (i = 2; i <= n; ++i) {
fib[i] = fib[i - 1] + fib[i - 2];
}
printf("%lld\n", fib[n]);
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 108 | 6 |
#include <iostream>
using namespace std;
int main() {
int x = 1, y = 1, n, value = 0;
cin >> n;
if (n == 0 && n == 1)
value = 1;
else {
while (n > 1) {
value = x + y;
x = y;
y = value;
n--;
}
}
cout << value << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x = 1, y = 1, n, value = 0;
cin >> n;
if (n == 0 || n == 1)
value = 1;
else {
while (n > 1) {
value = x + y;
x = y;
y = value;
n--;
}
}
cout << value << endl;
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 82 | 2 |
#include <iostream>
using namespace std;
int dp[44];
int fib(int n) {
if (dp[n] != -1)
return dp[n];
int res;
if (n == 0 || n == 1) {
res = 1;
} else {
res = fib(n - 1) + fib(n - 2);
}
dp[n] = res;
return res;
}
int main() {
for (int i = 0; i < 44; i++) {
dp[i] = -1;
}
int n;
... | #include <iostream>
using namespace std;
int dp[45];
int fib(int n) {
if (dp[n] != -1)
return dp[n];
int res;
if (n == 0 || n == 1) {
res = 1;
} else {
res = fib(n - 1) + fib(n - 2);
}
dp[n] = res;
return res;
}
int main() {
for (int i = 0; i < 45; i++) {
dp[i] = -1;
}
int 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]] | 1 | 131 | 4 |
#include <iostream>
#define MAX_N 45
int F[MAX_N];
int fib(int n) {
if (F[n] > 0)
return F[n];
if (n == 0 || n == 1)
return F[n] = 1;
return F[n] = F[n - 1] + F[n - 2];
}
int main() {
int n;
std::cin >> n;
std::cout << fib(n) << std::endl;
return 0;
} | #include <iostream>
#define MAX_N 45
int F[MAX_N];
int fib(int n) {
if (F[n] > 0)
return F[n];
if (n == 0 || n == 1)
return F[n] = 1;
return F[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
std::cin >> n;
std::cout << fib(n) << std::endl;
return 0;
} | [["-", 0, 37, 0, 11, 12, 16, 31, 69, 28, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 70], ["+", 0, 37, 0, 11, 12, 16, 31, 2, 63, 22], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 24], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 37, 0, 11, 12, 16, 12, 69, 28, 22], ["-", 0... | 1 | 103 | 12 |
#include <iostream>
using namespace std;
int makeFibonacci(int n) {
int a[100];
a[0] = 1;
a[1] = 1;
for (int i = 2; i <= n - 1; i++) {
a[i] = a[i - 2] + a[i - 1];
}
return a[n - 1];
}
int main(void) {
int n;
cin >> n;
int ans = makeFibonacci(n);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int makeFibonacci(int n) {
int a[100];
a[0] = 1;
a[1] = 1;
for (int i = 2; i <= n; i++) {
a[i] = a[i - 2] + a[i - 1];
}
return a[n];
}
int main(void) {
int n;
cin >> n;
int ans = makeFibonacci(n);
cout << ans << endl;
return 0;
} | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 37, 0, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 37, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 110 | 4 |
#include <cstdint>
using namespace std;
#define MEMO_SIZE 44
int64_t memo[MEMO_SIZE];
void fib_init() {
for (uint32_t i = 0; i < MEMO_SIZE; i++) {
memo[i] = -1;
}
}
uint32_t fib(uint32_t i) {
if (i == 0) {
return memo[0] = 1;
} else if (i == 1) {
return memo[1] = 1;
} else {
if (memo[i] !=... | #include <cstdint>
using namespace std;
#define MEMO_SIZE 45
int64_t memo[MEMO_SIZE];
void fib_init() {
for (uint32_t i = 0; i < MEMO_SIZE; i++) {
memo[i] = -1;
}
}
uint32_t fib(uint32_t i) {
if (i == 0) {
return memo[0] = 1;
} else if (i == 1) {
return memo[1] = 1;
} else {
if (memo[i] !=... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 157 | 2 |
#include <iostream>
using namespace std;
int main() {
int a[45];
a[0] = 0;
a[1] = 1;
int n, i;
cin >> n;
if (n >= 2) {
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
}
cout << a[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[45];
a[0] = 1;
a[1] = 1;
int n, i;
cin >> n;
if (n >= 2) {
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
}
cout << a[n] << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 95 | 2 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template <t... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template <t... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 383 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int F[50];
F[0] = F[1] = 1;
for (int i = 2; i <= n; n++) {
F[i] = F[i - 1] + F[i - 2];
}
cout << F[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int F[50];
F[0] = 1;
F[1] = 1;
for (int i = 2; i <= n; i++) {
F[i] = F[i - 1] + F[i - 2];
}
cout << F[n] << endl;
return 0;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 84 | 4 |
#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;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 114 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, i;
int a[44];
cin >> n;
a[0] = 1;
a[1] = 1;
a[2] = 2;
for (i = 2; i < n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
cout << a[n - 1] << endl;
} |
#include <iostream>
using namespace std;
int main() {
int n, i;
int a[44];
cin >> n;
a[0] = 1;
a[1] = 1;
a[2] = 2;
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2];
}
cout << a[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 | 93 | 4 |
#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 = two;
}
return two;
}
int main() {
int n;
cin >> n;
cout << solution(n) << endl;
r... | #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... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 101 | 2 |
#include <iostream>
using namespace std;
int result[44];
int fib(int n) {
if (n == 0 || n == 1)
return result[n] = 1;
if (result[n] != -1)
return result[n];
return result[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
for (int i = 0; i < 44; ++i) {
result[i] = -1;
}
cin >> n;
cout <<... | #include <iostream>
using namespace std;
int result[45];
int fib(int n) {
if (n == 0 || n == 1)
return result[n] = 1;
if (result[n] != -1)
return result[n];
return result[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
for (int i = 0; i < 45; ++i) {
result[i] = -1;
}
cin >> n;
cout <<... | [["-", 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 | 121 | 4 |
#include <bits/stdc++.h>
using namespace std;
long long dp[50];
long long fib(int n) {
if (n <= 1)
return 1;
if (dp[n])
return n;
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long dp[50];
long long fib(int n) {
if (n <= 1)
return 1;
if (dp[n])
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
}
| [["+", 8, 9, 0, 57, 64, 37, 0, 69, 28, 22], ["+", 0, 57, 64, 37, 0, 69, 341, 342, 0, 70], ["+", 0, 57, 64, 37, 0, 69, 341, 342, 0, 73]] | 1 | 83 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int f[45];
int n;
cin >> n;
f[0] = 1;
f[1] = 1;
for (int i = 2; i <= n; i++)
f[n] = f[n - 1] + f[n - 2];
cout << f[n] << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int f[45];
int n;
cin >> n;
f[0] = 1;
f[1] = 1;
for (int i = 2; i <= n; i++)
f[i] = f[i - 1] + f[i - 2];
cout << f[n] << "\n";
return 0;
}
| [["-", 8, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 106 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 290 | 4 |
#include <iostream>
using namespace std;
int fib(int n) {
int ans[45] = {0, 1}, i;
for (i = 2; i <= n; i++) {
ans[i] = ans[i - 1] + ans[i - 2];
}
return ans[i];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int fib(int n) {
int ans[45] = {1, 1}, i;
for (i = 2; i <= n; i++) {
ans[i] = ans[i - 1] + ans[i - 2];
}
return ans[n];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
| [["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 8, 9, 0, 37, 0, 69, 341, 342, 0, 22], ["+", 8, 9, 0, 37, 0, 69, 341, 342, 0, 22]] | 1 | 93 | 4 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int F[50];
F[0] = 1;
F[1] = 1;
for (int i = 2; i < 50; i++)
F[i] = F[i - 2] + F[i];
printf("%d\n", F[n]);
return 0;
}
| #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int F[50];
F[0] = 1;
F[1] = 1;
for (int i = 2; i < 50; i++)
F[i] = F[i - 2] + F[i - 1];
printf("%d\n", F[n]);
return 0;
}
| [["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 88 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
int n1, n2, st;
n1 = 1;
n2 = 1;
st = 1;
cin >> n;
for (int i = 1; i < n; i++) {
st = n1 + n1;
n1 = n2;
n2 = st;
}
cout << st << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
int n1, n2, st;
n1 = 1;
n2 = 1;
st = 1;
cin >> n;
for (int i = 1; i < n; i++) {
st = n1 + n2;
n1 = n2;
n2 = st;
}
cout << st << endl;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 74 | 5 |
#include <iostream>
using namespace std;
int main() {
int n;
int n1, n2, st;
n1 = 1;
n2 = 1;
st = 1;
cin >> n;
for (int i = 1; i < n; i++) {
st = n1 + n1;
n1 = n2;
n2 = st;
}
cout << st << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
int n1, n2, st;
// initialize
n1 = 1;
n2 = 1;
st = 1;
// load number
cin >> n;
// fibonacci
for (int i = 1; i < n; i++) {
st = n1 + n2;
n1 = n2;
n2 = st;
}
// print
cout << st << endl;
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 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]] | 1 | 74 | 5 |
#include <iostream>
using namespace std;
int fibonacci(int n) {
if (n == 0)
return 1; //たぶん本当はフィボナッチ数列はf(0)=0
//だと思うのだが、問題文がそうなっていたので１を返す。
else if (n == 1)
return 1;
else
return fibonacci(n - 2) + fibonacci(n - 1);
}
int fibonacci_dp(int n) {
int i;
int fib[45];
fib[0] = 1;
fi... | #include <iostream>
using namespace std;
//再帰
int fibonacci(int n) {
if (n == 0)
return 1; //たぶん本当はフィボナッチ数列はf(0)=0
//だと思うのだが、問題文がそうなっていたので１を返す。
else if (n == 1)
return 1;
else
return fibonacci(n - 2) + fibonacci(n - 1);
}
// DP
int fibonacci_dp(int n) {
int i;
int fib[45];
fib[0... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 14, 8, 9, 0, 37, 0, 69, 28, 22], ["+", 8, 9, 0, 37, 0, 69, 341, 342, 0, 70], ["+", 8, 9, 0, 37, 0, 69, 341, 342, 0, 22], ["+", 8, 9, 0, 37, 0, 69, 341, 342, 0, 73], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 142 | 6 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef long long ll;
// A*Bの計算
mat mul(mat &A, mat &B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++) {
for (int k = 0; k < B.size(); k++) {
for (int j = 0; j < B[0].size(... | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef long long ll;
// A*Bの計算
mat mul(mat &A, mat &B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++) {
for (int k = 0; k < B.size(); k++) {
for (int j = 0; j < B[0].size(... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 351 | 2 |
#include <cstdio>
const int MAX_V = 44;
int fib_array[MAX_V]{0};
void make_fib_array() {
fib_array[0] = 1;
fib_array[1] = 1;
for (int i = 2; i < MAX_V; i++)
fib_array[i] = fib_array[i - 1] + fib_array[i - 2];
}
int main() {
make_fib_array();
int n;
scanf("%d", &n);
printf("%d\n", fib_array[n]);
} | #include <cstdio>
const int MAX_V = 45;
int fib_array[MAX_V]{0};
void make_fib_array() {
fib_array[0] = 1;
fib_array[1] = 1;
for (int i = 2; i < MAX_V; i++)
fib_array[i] = fib_array[i - 1] + fib_array[i - 2];
}
int main() {
make_fib_array();
int n;
scanf("%d", &n);
printf("%d\n", fib_array[n]);
} | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 106 | 2 |
#include <iostream>
using namespace std;
int main() {
int f[3] = {1, 1}, n;
cin >> n;
while (n--) {
f[2] = f[0] + f[1];
f[0] = f[1];
f[1] = f[2];
}
cout << f[2] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int f[3] = {1, 1, 1}, n;
cin >> n;
while (1 < n--) {
f[2] = f[0] + f[1];
f[0] = f[1];
f[1] = f[2];
}
cout << f[2] << endl;
return 0;
} | [["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 31, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18]] | 1 | 84 | 4 |
#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... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 6,205 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | [["+", 8, 9, 0, 57, 64, 37, 0, 91, 17, 33]] | 1 | 779 | 1 |
package main
import "fmt"
func main() {
var n int
fmt.Scan(&n)
x, y := int64(0), int64(1)
for i := 0; i < n; i++ {
x, y = y, x+y
}
fmt.Println(x)
} | package main
import "fmt"
func main() {
var n int
fmt.Scan(&n)
x, y := int64(1), int64(1)
for i := 0; i < n; i++ {
x, y = y, x+y
}
fmt.Println(x)
} | [["-", 0, 431, 12, 432, 0, 2, 3, 4, 0, 433], ["+", 0, 431, 12, 432, 0, 2, 3, 4, 0, 433]] | 7 | 71 | 2 |
import java.util.Scanner;
public class Main {
static int N = 100;
public static void main(String[] args) {
// TODO Auto-generated method stub
int i, j, k, l, n, m[][] = new int[N + 1][N + 1], p[] = new int[N + 1];
Scanner sca = new Scanner(System.in);
n = sca.nextInt();
for (i = 0; i < n; i++) {... | import java.util.Scanner;
public class Main {
static int N = 100;
public static void main(String[] args) {
// TODO Auto-generated method stub
int i, j, k, l, n, m[][] = new int[N + 1][N + 1], p[] = new int[N + 1];
Scanner sca = new Scanner(System.in);
n = sca.nextInt();
for (i = 0; i < n; i++) {... | [["-", 0, 16, 31, 16, 12, 16, 12, 504, 71, 22], ["+", 0, 16, 31, 16, 12, 16, 12, 504, 71, 22], ["-", 0, 11, 12, 16, 12, 16, 12, 504, 71, 22], ["+", 0, 11, 12, 16, 12, 16, 12, 504, 71, 22]] | 3 | 321 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a;
cin >> a;
cout << a / 30 << " " << a % 2 * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a;
cin >> a;
cout << a / 30 << " " << a % 30 * 2 << endl;
} | [["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13]] | 1 | 45 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << x / 30 << ' ' << x % 30 * 2 * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << x / 30 << ' ' << x % 30 * 2 << endl;
return 0;
}
| [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 48], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 42 | 2 |
g=int(eval(input()))
h=g/30.0
m=(h-int(h))*60.0
H=str(int(h))
M=str(int(m))
print(H+" "+M)
| g=int(eval(input()))
h=g/30.0
m=(h-int(h))*60.0
H=str(int(h))
M=str(int(round(m,0)))
print(H+" "+M)
| [["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 21], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 56 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 48], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 16, 31, 23, 0, 16, 12, 16, 17, 48], ["+", 0, 16, 31, 23, 0, 16, 12, 16, 12, 13]] | 1 | 287 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1e9
int main() {
int n;
cin >> n;
using pii = pair<int, int>;
using piii = pair<pii, int>;
vector<pii> range;
vector<int> nd(361, 0);
vector<int> s;
rep(i, n) {
int m, d, v, _s;
cin >> m >> d ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1e9
int main() {
int n;
cin >> n;
using pii = pair<int, int>;
using piii = pair<pii, int>;
vector<pii> range;
vector<int> nd(361, 0);
vector<int> s;
rep(i, n) {
int m, d, v, _s;
cin >> m >> d ... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 75, 76, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 441 | 4 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
#define MAXCH(a, b) a = max(a, b);
#define INF (1LL << 30)
using namespace std;
typedef long long ll;
ll N, M[100], D[100], V[100], S[100];
int main(void) {
cin >> N;
REP(i, 0, N) cin >> M[i] >> D[i] >> V[i] >> S[i];
vector<ll... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
#define MAXCH(a, b) a = max(a, b);
#define INF (1LL << 30)
using namespace std;
typedef long long ll;
ll N, M[100], D[100], V[100], S[100];
int main(void) {
cin >> N;
REP(i, 0, N) cin >> M[i] >> D[i] >> V[i] >> S[i];
vector<ll... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13]] | 1 | 274 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N;
int M[100], D[100], V[100], S[100];
int fi[100], se[100];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> M[i] >> D[i] >> V[i] >> S[i];
fi[i] = (M[i] - 1) * 30 + (D[i] - 1);
se[i] = (fi[i] + V[i]) % 360;
}
int ans = 1e9;
for (int x ... | #include <bits/stdc++.h>
using namespace std;
int N;
int M[100], D[100], V[100], S[100];
int fi[100], se[100];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> M[i] >> D[i] >> V[i] >> S[i];
fi[i] = (M[i] - 1) * 30 + (D[i] - 1);
se[i] = (fi[i] + V[i]) % 360;
}
int ans = 1e9;
for (int x ... | [["+", 51, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 17, 72]] | 1 | 311 | 2 |
#include <stdio.h>
#include <stdlib.h>
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int main() {
int N, i, m = 0, d = 1, ans = 0;
scanf("%d", &N);
int *a = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < N; i++) {
... | #include <stdio.h>
#include <stdlib.h>
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int main() {
int N, i, m = 0, d = 0, ans = 0;
scanf("%d", &N);
int *a = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < N; i++) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 325 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[100000];
int X[100000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, x = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int a[100000];
int X[100000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 240 | 6 |
#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)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | #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)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | [["-", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13]] | 1 | 238 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1 << 30
#define LINF 1LL << 60
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> a(N);
ll ans = 0;
for (int i = 0; i < N; i++)
cin >> a[i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1 << 30
#define LINF 1LL << 60
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> a(N);
ll ans = 0;
for (int i = 0; i < N; i++)
cin >> a[i... | [["-", 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 | 284 | 6 |
#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 ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 222 | 4 |
#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>... | [["-", 51, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 17, 72], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22]] | 1 | 994 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<vector<int>> t;
vector<bool> used;
int eval(int root) {
int ret = 0;
for (int i = 0; i < t[root].size(); i++) {
int node = t[root][i];
if (t[node].size() == 0) {
used[root] = used[node] = true;
ret++;
} else
ret... | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<vector<int>> t;
vector<bool> used;
int eval(int root) {
int ret = 0;
for (int i = 0; i < t[root].size(); i++) {
int node = t[root][i];
if (!used[root] && t[node].size() == 0) {
used[root] = used[node] = true;
ret++;
}... | [["+", 0, 57, 15, 339, 51, 16, 31, 91, 17, 111], ["+", 15, 339, 51, 16, 31, 91, 28, 69, 28, 22], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 70], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 91, 28, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 235 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int N, M, W[100000];
vector<int> g[100000];
bool v[100000];
int order[100000], low[100000], ptr;
int64 sum[100000], ans[100000];
vector<int> tree[100000];
void dfs(int idx, int par) {
v[idx] = true;
order[idx] = ptr++;
low[idx] = order[id... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int N, M, W[100000];
vector<int> g[100000];
bool v[100000];
int order[100000], low[100000], ptr;
int64 sum[100000], ans[100000];
vector<int> tree[100000];
void dfs(int idx, int par) {
v[idx] = true;
order[idx] = ptr++;
low[idx] = order[id... | [["+", 64, 9, 0, 57, 64, 1, 0, 11, 12, 146], ["+", 0, 57, 64, 9, 0, 57, 64, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32]] | 1 | 545 | 5 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
#define INF (1LL << 60)
using namespace std;
typedef long long ll;
ll N, A, B, Q, X, Y, Z;
template <typename T> class SegmentTree {
public:
ll n;
T e;
T (*op)(T, T);
vector<T> dat;
SegmentTree(T _e, T (*_op)(T, T), ll _n)... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
#define INF (1LL << 60)
using namespace std;
typedef long long ll;
ll N, A, B, Q, X, Y, Z;
template <typename T> class SegmentTree {
public:
ll n;
T e;
T (*op)(T, T);
vector<T> dat;
SegmentTree(T _e, T (*_op)(T, T), ll _n)... | [["-", 0, 69, 341, 342, 0, 16, 31, 16, 12, 22], ["+", 341, 342, 0, 16, 31, 16, 12, 118, 28, 22], ["+", 341, 342, 0, 16, 31, 16, 12, 118, 17, 131], ["+", 341, 342, 0, 16, 31, 16, 12, 118, 119, 120]] | 1 | 714 | 8 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
const T INF;
vector<T> seg;
int sz;
SegmentTree(int n) : INF(numeric_limits<T>::max()) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz - 1, INF);
}
T merge(T a, T b) { return (min(a, b)); }
... | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
const T INF;
vector<T> seg;
int sz;
SegmentTree(int n) : INF(numeric_limits<T>::max()) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz - 1, INF);
}
T merge(T a, T b) { return (min(a, b)); }
... | [["-", 0, 338, 8, 1, 0, 2, 63, 118, 28, 22], ["+", 0, 338, 8, 1, 0, 2, 63, 118, 28, 22]] | 1 | 993 | 2 |
#include <stdio.h>
int main(void) {
// Your code here!
int x, i, year;
scanf("%d", &x);
printf("ai1333");
year = x / 100;
for (i = 1; i <= year; i++) {
printf("3");
}
printf("%d\n");
}
| #include <stdio.h>
int main(void) {
// Your code here!
int x, i, year;
scanf("%d", &x);
printf("ai1333");
year = x / 100;
for (i = 1; i <= year; i++) {
printf("3");
}
printf("\n");
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 70 | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, n) for (LL i = 0; i < n; i++)
#define REPR(i, n) for (LL ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, n) for (LL i = 0; i < n; i++)
#define REPR(i, n) for (LL ... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 223 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include ... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 375 | 2 |
//#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include ... | //#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include ... | [["-", 0, 30, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 0, 30, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 873 | 2 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int x, b;
scanf("%d", &x);
b = x / 100;
std::string str = std::string(b, '3');
std::cout << "ai333";
std::cout << str << std::endl;
return 0;
}
| #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int x, b;
scanf("%d", &x);
b = x / 100;
std::string str = std::string(b, '3');
std::cout << "ai1333";
std::cout << str << std::endl;
return 0;
}
| [["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 75 | 2 |
print("id1333" + "3" * int(int(input()) / 100))
| print("ai1333" + "3" * int(int(input()) / 100))
| [["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6]] | 5 | 22 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
int num = Integer.parseInt(... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
int num = Integer.parseInt(... | [["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499]] | 3 | 125 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int ... | [["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 145 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 48], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 156 | 6 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 163 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define rep(i, n) REP(i,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define rep(i, n) REP(i,... | [["+", 51, 16, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 23, 0, 16, 12, 23, 0, 25], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 219 | 4 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", (int)log2(n));
return 0;
}
| #include <math.h>
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
n++;
printf("%d\n", (int)log2(n));
return 0;
}
| [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 43 | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, i = 1;
scanf("%d", &n);
while (true) {
if (i * 2 > n) {
printf("%d\n", ans);
return 0;
} else {
ans++;
}
i *= 2;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, i = 1;
scanf("%d", &n);
while (true) {
if (i * 2 - 1 > n) {
printf("%d\n", ans);
return 0;
} else {
ans++;
}
i *= 2;
}
}
| [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 72 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, ans, m = 0;
cin >> N;
for (int i = 0;; ++i) {
if (N <= m) {
ans = i;
break;
}
m += pow(2, i);
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, ans, m = 0;
cin >> N;
for (int i = 0;; ++i) {
if (N < m) {
ans = i - 1;
break;
}
m += pow(2, i);
}
cout << ans << endl;
return 0;
}
| [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 72 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1;; i++) {
if (pow(2, i) > n) {
cout << i - 1 << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1;; i++) {
if (pow(2, i) - 1 > n) {
cout << i - 1 << endl;
return 0;
}
}
return 0;
}
| [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 63 | 2 |
import math
print(int(math.log(int(input()), 2)))
| import math
print(int(math.log(int(input()) + 1, 2)))
| [["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 21 | 2 |
#include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 581 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
const int inf = 1012345678;
struct state {
int pos, cost;
};
bool operator<(const state &s1, const state &s2) { return s1.cost > s2.cost; }
int H, W, N, x[109], y[109], dist[109][1009];
int main() {
cin >> H >> W >> N;
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
const int inf = 1012345678;
struct state {
int pos, cost;
};
bool operator<(const state &s1, const state &s2) { return s1.cost > s2.cost; }
int H, W, N, x[109], y[109], dist[109][1009];
int main() {
cin >> H >> W >> N;
for (int i = 0; ... | [["-", 0, 191, 51, 83, 0, 69, 28, 69, 28, 22], ["-", 51, 83, 0, 69, 28, 69, 341, 342, 0, 70], ["-", 51, 83, 0, 69, 28, 69, 341, 342, 0, 73], ["-", 0, 191, 51, 83, 0, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 191, 51, 83, 0, 16, 17, 72], ["-", 0, 191, 51, 83, 0, 69, 341, 342, 0, 73], ["+", 0, 191, 51, 83, 0, 16, 12, 16, 17, ... | 1 | 545 | 8 |
#ifndef VS
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
#define ALL(v) (v).begin(), (v).... | #ifndef VS
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
#define ALL(v) (v).begin(), (v).... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 806 | 2 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
struct state {
ll v, r, cost;
bool operator>(const state s) const { return cost > s.cost; }
};
int main(void) {
ll W, H, N;
cin >> W >> H >> N;
vector<ll> X(N), Y(N);
REP(i, 0, N... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
struct state {
ll v, r, cost;
bool operator>(const state s) const { return cost > s.cost; }
};
int main(void) {
ll W, H, N;
cin >> W >> H >> N;
vector<ll> X(N), Y(N);
REP(i, 0, N... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 418 | 4 |
#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;
struct aa {
int id;
int li;
int cost;
const bool operator<(const aa &r) const { return this->cost > r.cost; }
};
int main() {
int W, H,... | #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;
struct aa {
int id;
int li;
int cost;
const bool operator<(const aa &r) const { return this->cost > r.cost; }
};
int main() {
int W, H,... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33]] | 1 | 525 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#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() {
int n;
cin >> n;
map<vi, int> f;
vector<vi> pp;
rep(i, n) {
int w;
... | #include <algorithm>
#include <iostream>
#include <map>
#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() {
int n;
cin >> n;
map<vi, int> f;
vector<vi> pp;
rep(i, n) {
int w;
... | [["+", 8, 9, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 82, 8, 9, 0, 9, 0, 1, 0, 35]] | 1 | 308 | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int N, ami[6], a, w, p[3];
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; ++i) {
scanf("%lld", &w);
*p = 0;
p[1] = 1;
p[2] = 2;
for (int j = 0; j < w; ++j) {
scanf("%lld", &a);
swap(p[1], p[a * 2]);
}
w = *p * ... | #include <bits/stdc++.h>
using namespace std;
long long int N, ami[6], a, w, p[3];
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; ++i) {
scanf("%lld", &w);
*p = 0;
p[1] = 1;
p[2] = 2;
for (int j = 0; j < w; ++j) {
scanf("%lld", &a);
swap(p[1], p[a * 2]);
}
w = *p * ... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13]] | 1 | 299 | 6 |
#include "bits/stdc++.h"
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a)-1; i >= b; i--)
#define chmi... | #include "bits/stdc++.h"
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a)-1; i >= b; i--)
#define chmi... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 729 | 6 |
#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;
bool operator<(const vector<int> &l, const vector<int> &r) {
for (int i = 0; i < l.size(); ++i) {
if (l[i] < r[i])
return true;
el... | #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;
bool operator<(const vector<int> &l, const vector<int> &r) {
for (int i = 0; i < l.size(); ++i) {
if (l[i] < r[i])
return true;
el... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 722 | 2 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
class MaxFlow {
public:
struct edge {
ll to, cap, rev;
};
const ll INF = 1LL << 60;
ll N;
vector<vector<edge>> E;
vector<bool> used;
MaxFlow(ll n) : N(n), E(n), used(n){};... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
class MaxFlow {
public:
struct edge {
ll to, cap, rev;
};
const ll INF = 1LL << 60;
ll N;
vector<vector<edge>> E;
vector<bool> used;
MaxFlow(ll n) : N(n), E(n), used(n){};... | [["+", 64, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 802 | 3 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class suffix_array {
// This is an O(n log^2 n) suffix array algorithm.
// It uses hashing (modulo 2^64) so the hash value may collide.
private:
int size_;
std::string s;
std::vector<unsigned long long> prefix_h... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class suffix_array {
// This is an O(n log^2 n) suffix array algorithm.
// It uses hashing (modulo 2^64) so the hash value may collide.
private:
int size_;
std::string s;
std::vector<unsigned long long> prefix_h... | [["-", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72]] | 1 | 892 | 2 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
const ll MAX_N = 500000;
ll n, k;
ll rnk[MAX_N + 1];
ll tmp[MAX_N + 1];
bool compare_sa(ll i, ll j) {
if (rnk[i] != rnk[j])
return rnk[i] < rnk[j];
ll ri = i + k <= n ? rnk[i + k] : -1;... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
const ll MAX_N = 500000;
ll n, k;
ll rnk[MAX_N + 1];
ll tmp[MAX_N + 1];
bool compare_sa(ll i, ll j) {
if (rnk[i] != rnk[j])
return rnk[i] < rnk[j];
ll ri = i + k <= n ? rnk[i + k] : -1;... | [["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 147], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 647 | 6 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using ll = long long;
using Pll = pair<ll, ll>;
class SuffixArray {
private:
string s;
int n;
vector<int> rank;
vector<int> sa;
public:
SuffixArray(string _s) ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using ll = long long;
using Pll = pair<ll, ll>;
class SuffixArray {
private:
string s;
int n;
vector<int> rank;
vector<int> sa;
public:
SuffixArray(string _s) ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 760 | 2 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67]] | 1 | 1,151 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define DBG cerr << '!' << endl;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE secon... | #include <bits/stdc++.h>
using namespace std;
#define DBG cerr << '!' << endl;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE secon... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 721 | 2 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
const double EPS = 1e-10;
double dist(double px, double py, double qx, double qy) {
return sqrt((px - qx) * (px - qx) + (py - qy) * (py - qy));
}
int main(void) {
ll N, M;
cin >> N >>... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
const double EPS = 1e-6;
double dist(double px, double py, double qx, double qy) {
return sqrt((px - qx) * (px - qx) + (py - qy) * (py - qy));
}
int main(void) {
ll N, M;
cin >> N >> ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 1,004 | 2 |
$fiba = [1,1]
def fib(n)
while $fiba.size<=n
$fiba << $fiba[n-1] + $fiba[n-2]
end
return $fiba[n]
end
while gets
puts fib($_.to_i)
end | $fiba = [1,1]
def fib(n)
while $fiba.size<=n
$fiba << $fiba[-1] + $fiba[-2]
end
return $fiba[n]
end
while gets
puts fib($_.to_i)
end | [["-", 0, 738, 12, 738, 31, 742, 0, 738, 31, 22], ["-", 0, 738, 12, 738, 12, 742, 0, 738, 31, 22]] | 4 | 50 | 2 |
def f(n)
if n == 1
return 1, 1
elsif n % 2 == 0
a, b = f(n / 2)
return 2 * a * b - a ** 2, a ** 2 + b ** 2
else
a, b = f(n / 2)
return a ** 2 + b ** 2, 2 * a * b + b ** 2
end
end
puts f(gets.to_i) | def f(n)
if n == 1
return 1, 1
elsif n % 2 == 0
a, b = f(n / 2)
return 2 * a * b - a ** 2, a ** 2 + b ** 2
else
a, b = f(n / 2)
return a ** 2 + b ** 2, 2 * a * b + b ** 2
end
end
puts f(gets.to_i + 1)[0] | [["+", 0, 742, 500, 652, 3, 4, 0, 738, 17, 72], ["+", 0, 742, 500, 652, 3, 4, 0, 738, 12, 612], ["+", 0, 493, 0, 652, 3, 4, 0, 742, 0, 70], ["+", 0, 493, 0, 652, 3, 4, 0, 742, 0, 612], ["+", 0, 493, 0, 652, 3, 4, 0, 742, 0, 73]] | 4 | 85 | 5 |
def fib(n)
f, p1 = 0, 1
1.upto(n) do
p2, p1 = p1, f
f = p1 + p2
end
return f
end
puts fib(gets.to_i) | def fib(n)
f, p1 = 1, 1
2.upto(n) do
p2, p1 = p1, f
f = p1 + p2
end
return f
end
puts fib(gets.to_i) | [["-", 0, 735, 8, 736, 0, 662, 12, 762, 0, 612], ["-", 0, 735, 8, 736, 0, 662, 12, 762, 0, 21], ["+", 0, 735, 8, 736, 0, 662, 12, 762, 0, 21], ["+", 0, 493, 0, 735, 8, 736, 0, 652, 486, 612]] | 4 | 42 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.