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 <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int MAX_V = 1001;
// d[u][v]Íu©çvÖÌRXgBßÉ×Ú·éGbWÌRXgðüêĨ¢½è·êÎæ¢Í¸B
double d[MAX_V][MAX_V];
const int INF = 1000000000;
// ¸_
int V;
... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int MAX_V = 1001;
// d[u][v]Íu©çvÖÌRXgBßÉ×Ú·éGbWÌRXgðüêĨ¢½è·êÎæ¢Í¸B
double d[MAX_V][MAX_V];
const int INF = 1000000000;
// ¸_
int V;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 12, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 661 | 5 |
#include <stdio.h>
main() {
long nk[30] = {
1,
};
int i;
int n;
for (i = 0; i < 30; i++) {
nk[i + 1] += nk[i];
nk[i + 2] += nk[i];
nk[i + 3] += nk[i];
}
while (scanf("%d", &n) != EOF) {
if (!n)
break;
printf("%ld\n", nk[n] / 3650 + 1);
}
return 0;
} | #include <stdio.h>
main() {
long nk[40] = {
1,
};
int i;
int n;
for (i = 0; i < 30; i++) {
nk[i + 1] += nk[i];
nk[i + 2] += nk[i];
nk[i + 3] += nk[i];
}
while (scanf("%d", &n) != EOF) {
if (!n)
break;
printf("%ld\n", nk[n] / 3650 + 1);
}
return 0;
} | [["-", 0, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 0 | 119 | 2 |
#include <stdio.h>
#define FOR(i, m, n) for (i = m; i < n; i++)
#define rep(i, n) FOR(i, 0, n)
int main(void) {
int n, dp[31], i;
dp[0] = dp[1] = 1;
dp[2] = 2;
FOR(i, 3, 31) dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
for (;;) {
scanf("%d", &n);
if (!n)
break;
printf("%d\n", (dp[n] / 365 + 1)... | #include <stdio.h>
#define FOR(i, m, n) for (i = m; i < n; i++)
#define rep(i, n) FOR(i, 0, n)
int main(void) {
int n, dp[31], i;
dp[0] = dp[1] = 1;
dp[2] = 2;
FOR(i, 3, 31) dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
for (;;) {
scanf("%d", &n);
if (!n)
break;
printf("%d\n", (dp[n] + 3649) / ... | [["-", 31, 16, 31, 23, 0, 16, 31, 16, 17, 85], ["-", 31, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2,... | 0 | 140 | 8 |
n;
R(a, b, c) { n-- ? R(b, c, a + b + c) : printf("%d\n", c / 3650 + 1); }
main() {
for (; ~scanf("%d", &n); n && R(0, 0, 1))
;
} ////// | n;
R(a, b, c) { n-- ? R(b, c, a + b + c) : printf("%d\n", c / 3650 + 1); }
main() {
for (; scanf("%d", &n) * n; R(0, 0, 1))
;
} ///////////// | [["-", 0, 30, 0, 9, 0, 7, 15, 91, 17, 92], ["-", 36, 36, 0, 30, 0, 9, 0, 7, 0, 35], ["+", 0, 30, 0, 9, 0, 7, 15, 16, 17, 48], ["-", 0, 30, 0, 9, 0, 7, 26, 16, 17, 98], ["+", 36, 36, 0, 30, 0, 9, 0, 7, 0, 35]] | 0 | 76 | 5 |
#include <stdio.h>
int main() {
int n, p[31] = {}, i, res;
p[0] = 1;
p[1] = 1;
p[2] = 2;
while (scanf("%d", &n) && n) {
for (i = 3; i <= n; i++)
p[i] = p[i - 1] + p[i - 2] + p[i - 3];
res = (p[n] + 3549) / 3650;
printf("%d\n", res);
}
return 0;
} | #include <stdio.h>
int main() {
int n, p[31] = {}, i, res;
p[0] = 1;
p[1] = 1;
p[2] = 2;
while (scanf("%d", &n) && n) {
for (i = 3; i <= n; i++)
p[i] = p[i - 1] + p[i - 2] + p[i - 3];
res = (p[n] + 3649) / 3650;
printf("%d\n", res);
}
return 0;
} | [["-", 0, 11, 12, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 12, 13]] | 0 | 125 | 2 |
#include <iostream>
using namespace std;
long dp[31];
main() {
dp[0] = 1;
for (int i = 1; i <= 30; i++) {
for (int j = 1; j <= 3 && i - j >= 0; j++)
dp[i] += dp[i - j];
}
int n;
while (cin >> n, n)
cout << (dp[n] - 1) / 365 + 1 << endl;
}
| #include <iostream>
using namespace std;
long dp[31];
main() {
dp[0] = 1;
for (int i = 1; i <= 30; i++) {
for (int j = 1; j <= 3 && i - j >= 0; j++)
dp[i] += dp[i - j];
}
int n;
while (cin >> n, n)
cout << (dp[n] - 1) / 3650 + 1 << endl;
}
| [["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13]] | 1 | 100 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
#if 0
所用時間:
感想:
#endif
int N;
int A[30];
int main() {
while (cin >> N && N) {
A[0] = 1;
A[1] = 1;
A[2] = A[1] + A[0];
if (N > 2) {
for (int i = 3; i <= N; ++i) {
A[i] = A[i - 1] + A[i - 2] + A[i - 3]... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
#if 0
所用時間:
感想:
#endif
int N;
int A[30];
int main() {
while (cin >> N && N) {
A[0] = 1;
A[1] = 1;
A[2] = A[1] + A[0];
if (N > 2) {
for (int i = 3; i <= N; ++i) {
A[i] = A[i - 1] + A[i - 2] + A[i - 3]... | [["-", 31, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 31, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 140 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int 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 int 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, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 471 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[50];
int n;
void init() {
dp[0] = 1;
for (int i = 1; i <= 30; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] += dp[i];
}
}
}
signed main() {
init();
while (1) {
cin >> n;
if (n == 0)
break;
int mult... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[50];
int n;
void init() {
dp[0] = 1;
for (int i = 0; i <= 30; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] += dp[i];
}
}
}
signed main() {
init();
while (1) {
cin >> n;
if (n == 0)
break;
int mult... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 128 | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[50];
void print() {
for (int i = 1; i < 33; i++) {
cout << dp[i] << " ";
}
cout << endl;
}
void init() {
dp[1] = 1, dp[2] = 2, dp[3] = 4;
for (int i = 4; i < 33; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
}
int main() {
init();
wh... | #include <bits/stdc++.h>
using namespace std;
int dp[50];
void print() {
for (int i = 1; i < 33; i++) {
cout << dp[i] << " ";
}
cout << endl;
}
void init() {
dp[1] = 1, dp[2] = 2, dp[3] = 4;
for (int i = 4; i < 33; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
}
int main() {
init();
wh... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 178 | 5 |
#include <iostream>
int dp[31];
int count(int n) {
if (dp[n] < 0) {
dp[n] = count(n - 3) + count(n - 2) + count(n - 1);
}
return dp[n];
}
using namespace std;
int main() {
for (int i = 0; i < 30; ++i) {
dp[i] = -1;
}
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
int n;
cin >> n;
while (n) {
cout <... | #include <iostream>
int dp[31];
int count(int n) {
if (dp[n] < 0) {
dp[n] = count(n - 3) + count(n - 2) + count(n - 1);
}
return dp[n];
}
using namespace std;
int main() {
for (int i = 0; i < 31; ++i) {
dp[i] = -1;
}
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
int n;
cin >> n;
while (n) {
cout <... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 151 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 417 | 2 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 215 | 2 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 316 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int A[128], N;
int main() {
A[0] = 1;
cin >> N;
while (N != 0) {
for (int i = 0; i < N + 1; ++i) {
if (A[i] == 0) {
A[i] = A[i - 1];
if (i > 1)
A[i] += A[i - 2];
if (i > 2)
A[i] += A[i - 3];
... | #include <algorithm>
#include <iostream>
using namespace std;
int A[128], N;
int main() {
A[0] = 1;
cin >> N;
while (N != 0) {
for (int i = 0; i < N + 1; ++i) {
if (A[i] == 0) {
A[i] = A[i - 1];
if (i > 1)
A[i] += A[i - 2];
if (i > 2)
A[i] += A[i - 3];
... | [["+", 31, 23, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 23, 0, 16, 31, 16, 31, 23, 0, 25]] | 1 | 139 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long dp(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else {
return dp(a - 3) +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long dp(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else {
return dp(a - 3) +... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 146 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | [["-", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22], ["+", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22]] | 1 | 297 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, p[31];
p[0] = 1;
p[1] = 1;
p[2] = 2;
for (int i = 3; i < 30; ++i) {
p[i] = p[i - 1] + p[i - 2] + p[i - 3];
}
while (1) {
int y;
cin >> n;
if (n == 0) {
break;
}
y = p[n] / 10 ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int p[31];
p[0] = 1;
p[1] = 1;
p[2] = 2;
for (int i = 3; i <= 30; ++i) {
p[i] = p[i - 1] + p[i - 2] + p[i - 3];
}
while (1) {
int y, n;
cin >> n;
if (n == 0) {
break;
}
y = p[n] / 10... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22]] | 1 | 132 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main() {
vector<int> dp(31, 0);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i < 31; i++) {
dp[i] = dp[i - 1] + d... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main() {
vector<int> dp(31, 0);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i < 31; i++) {
dp[i] = dp[i - 1] + ... | [["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 24], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 17, 48], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 25]] | 1 | 161 | 16 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
vector<int> dp(31, 0);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= 30; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
for (;;) {
int n;
cin >> n;
if (n ==... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
vector<int> dp(31, 0);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= 30; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
for (;;) {
int n;
cin >> n;
if (n ==... | [["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 24], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 17, 48], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 25]] | 1 | 158 | 4 |
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, A[40];
queue<int> Q;
A[0] = 1;
cin >> n;
while (n != 0) {
for (int i = 1; i < n + 1; ++i) {
A[i] = A[i - 1];
if (i > 1) {
A[i] += A[i - 2];
}
if (i > 2) {
A[i] += A[i - 3];
}
}
... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, A[40];
queue<int> Q;
A[0] = 1;
cin >> n;
while (n != 0) {
for (int i = 1; i < n + 1; ++i) {
A[i] = A[i - 1];
if (i > 1) {
A[i] += A[i - 2];
}
if (i > 2) {
A[i] += A[i - 3];
}
}
... | [["-", 0, 11, 12, 16, 12, 23, 0, 16, 17, 85], ["-", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 175 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repn(i, n, m) for (int i = n; i < m; i++)
#define repn1(i, n, m) for (int i = n; ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repn(i, n, m) for (int i = n; i < m; i++)
#define repn1(i, n, m) for (int i = n; ... | [["-", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22], ["+", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22], ["-", 0, 16, 31, 16, 12, 16, 31, 23, 0, 24], ["-", 12, 16, 31, 23, 0, 16, 31, 16, 17, 85], ["-", 12, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 31, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["-", 0, 16, 31, 16, 12, 16, 31, 23, 0, 25], ["+",... | 1 | 171 | 8 |
#include <iostream>
using namespace std;
long long n[50], p;
int main() {
n[0] = 1;
n[1] = 1;
n[2] = 2;
for (int i = 0; i < 40; i++) {
n[i] = n[i - 1] + n[i - 2] + n[i - 3];
}
while (true) {
cin >> p;
if (!p) {
break;
}
cout << (n[p] + 3649) / 3650 << endl;
}
} | #include <iostream>
using namespace std;
long long n[50], p;
int main() {
n[0] = 1;
n[1] = 1;
n[2] = 2;
for (int i = 3; i < 40; i++) {
n[i] = n[i - 1] + n[i - 2] + n[i - 3];
}
while (true) {
cin >> p;
if (!p) {
break;
}
cout << (n[p] + 3649) / 3650 << endl;
}
} | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 118 | 2 |
#include <iostream>
using namespace std;
int dp[31], n, i, result[100];
int main() {
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int a = 3; a < 30; a++) {
dp[a] = dp[a - 1] + dp[a - 2] + dp[a - 3];
}
for (;; i++) {
cin >> n;
if (n == 0) {
break;
}
result[i] = dp[n] / 3650 + 1;
}
... | #include <iostream>
using namespace std;
int dp[31], n, i, result[100];
int main() {
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int a = 3; a < 31; a++) {
dp[a] = dp[a - 1] + dp[a - 2] + dp[a - 3];
}
for (;; i++) {
cin >> n;
if (n == 0) {
break;
}
result[i] = dp[n] / 3650 + 1;
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 155 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int n, dp[30];
int func(int p) {
if (p == n) {
return 1;
}
int cnt = 0;
for (int i = p + 1; n >= i && 3 + p >= i; i++) {
if (dp[i] == -1)
dp[i... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int n, dp[31];
int func(int p) {
if (p == n) {
return 1;
}
int cnt = 0;
for (int i = p + 1; n >= i && 3 + p >= i; i++) {
if (dp[i] == -1)
dp[i... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13]] | 1 | 187 | 6 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
// int n, dp[31];
//
// int func(int p) {
// if (p == n) {
// return 1;
// }
// int cnt = 0;
// for (int i = p + 1; n >= i && 3 + p >= i; i++) {
// if (dp[i] == -1... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
// int n, dp[31];
//
// int func(int p) {
// if (p == n) {
// return 1;
// }
// int cnt = 0;
// for (int i = p + 1; n >= i && 3 + p >= i; i++) {
// if (dp[i] == -1... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 31, 13], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 31, 13]] | 1 | 180 | 6 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, i;
while (1) {
cin >> n;
int a[35] = {};
if (n == 0)
break;
a[0] = 0;
a[1] = 0;
a[2] = 1;
for (i = 0; i < n; i++) {
a[i + 3] = a[i + 2] + a[i + 1] + a[i];
}
cout << a... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, i;
while (1) {
cin >> n;
int a[35] = {};
if (n == 0)
break;
a[0] = 0;
a[1] = 0;
a[2] = 1;
for (i = 0; i < n; i++) {
a[i + 3] = a[i + 2] + a[i + 1] + a[i];
}
cout << a... | [["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 124 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <u... | [["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 376 | 5 |
#include <cstdio>
#include <iostream>
#include <stdio.h>
using namespace std;
int x, c = 0;
void dfs(int pos) {
if (pos == 1) {
c++;
return;
} else if (pos == 2) {
c = c + 2;
return;
} else if (pos == 3) {
c = c + 4;
return;
} else {
dfs(pos - 1);
dfs(pos - 2);
dfs(pos - 3);
... | #include <cstdio>
#include <iostream>
#include <stdio.h>
using namespace std;
int x, c = 0;
void dfs(int pos) {
if (pos == 1) {
c++;
return;
} else if (pos == 2) {
c = c + 2;
return;
} else if (pos == 3) {
c = c + 4;
return;
} else {
dfs(pos - 1);
dfs(pos - 2);
dfs(pos - 3);
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 180 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long day[31];
day[0] = 0;
day[1] = 1;
day[2] = 1;
for (int i = 3; i <= 30; i++) {
day[i] = day[i - 3] + day[i - 2] + day[i - 1];
}
while (cin >> n, n) {
int year = day[n + 1] / 10 / 365;
cout << year + 1 << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long day[32];
day[0] = 0;
day[1] = 1;
day[2] = 1;
for (int i = 3; i <= 31; i++) {
day[i] = day[i - 3] + day[i - 2] + day[i - 1];
}
while (cin >> n, n) {
int year = day[n + 1] / 10 / 365;
cout << year + 1 << endl;
}
... | [["-", 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 | 117 | 4 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#inc... | [["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 263 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | [["+", 31, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 292 | 2 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int dp[31];
fill(dp, dp + 31, 0);
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for (int i = 4; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
cout << (dp[... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int dp[31];
fill(dp, dp + 31, 0);
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for (int i = 4; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
cout << (dp[... | [["-", 12, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 133 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | [["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 25]] | 1 | 205 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
int memo[100];
while (1) {
cin >> n;
if (n == 0)
break;
memo[0] = 1;
memo[1] = 1;
memo[2] = 2;
for (int i = 3; i < n; i++) {
memo[i] = memo[i - 1] + memo[i - 2] + memo[i - 3];
}
cout << memo[n] / 10 / ... | #include <iostream>
using namespace std;
int main() {
int n;
int memo[100];
while (1) {
cin >> n;
if (n == 0)
break;
memo[0] = 1;
memo[1] = 1;
memo[2] = 2;
for (int i = 3; i <= n; i++) {
memo[i] = memo[i - 1] + memo[i - 2] + memo[i - 3];
}
cout << memo[n] / 365 ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 31, 16, 12, 16, 31, 16, 31, 16, 17, 85], ["-", 31, 16, 12, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13]] | 1 | 117 | 6 |
#include <iostream>
using namespace std;
int cnt;
int dp[100][100];
void rec(int left) {
if (left < 0) {
return;
}
if (left == 0) {
cnt++;
return;
}
rec(left - 1);
rec(left - 2);
rec(left - 3);
}
int main(int argc, char const *argv[]) {
int n;
while (cin >> n, n) {
int ans = 0;
... | #include <iostream>
using namespace std;
int cnt;
int dp[100][100];
void rec(int left) {
if (left < 0) {
return;
}
if (left == 0) {
cnt++;
return;
}
rec(left - 1);
rec(left - 2);
rec(left - 3);
}
int main(int argc, char const *argv[]) {
int n;
while (cin >> n, n) {
cnt = 0;
i... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 125 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int A[32], N;
int main() {
A[0] = 1;
for (int i = 1; i <= 31; i++) {
A[i] = A[i - 1];
if (i > 1)
A[i] += A[i - 2];
if (i > 2)
A[i] += A[i - 3];
}
while (cin >> N && N != 0) {
int year = A[N] / 365 + 1;
cout << year << ... | #include <algorithm>
#include <iostream>
using namespace std;
int A[32], N;
int main() {
A[0] = 1;
for (int i = 1; i <= 31; i++) {
A[i] = A[i - 1];
if (i > 1)
A[i] += A[i - 2];
if (i > 2)
A[i] += A[i - 3];
}
while (cin >> N && N != 0) {
int year = A[N] / 3650 + 1;
cout << year <<... | [["-", 0, 43, 49, 50, 51, 16, 31, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 13]] | 1 | 123 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int dp[30][3] = {};
dp[1][1] = 1;
dp[2][1] = dp[2][2] = 1;
dp[3][1] = 2;
dp[3][2] = dp[3][3] = 1;
for (int i = 4; i < 31; ++i)
for (int j = 1; j < 4; ++j)
dp[i][j] += dp[i - j][1] + dp[i - j][2] + dp[i - j][3];
while (cin >> n,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int dp[31][4] = {};
dp[1][1] = 1;
dp[2][1] = dp[2][2] = 1;
dp[3][1] = 2;
dp[3][2] = dp[3][3] = 1;
for (int i = 4; i < 31; ++i) {
for (int j = 1; j < 4; ++j) {
dp[i][j] += dp[i - j][1] + dp[i - j][2] + dp[i - j][3];
}
}
whi... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7,... | 1 | 217 | 8 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 999999999
using namespace std;
int main() {
int a, kai[31];
kai[0] = 1;
kai[1] = 1;
kai[2] = 2;
for (int i = 3; i <= 31; i++) {
kai[i] = kai[i - 1] + kai[i - 2] + kai[i - 3];
}
rep(i, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 999999999
using namespace std;
int main() {
int a, kai[31];
kai[0] = 1;
kai[1] = 1;
kai[2] = 2;
for (int i = 3; i < 31; i++) {
kai[i] = kai[i - 1] + kai[i - 2] + kai[i - 3];
}
rep(i, 3... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13]] | 1 | 142 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 223 | 4 |
#include <iostream>
using namespace std;
int com(int x, int y) {
long long int ans;
if (y == 0)
return 1;
if (y == 1)
return x;
ans = x;
for (int i = 1; i < y; i++)
ans *= x - i;
for (int i = 0; i < y; i++)
ans /= y - i;
return ans;
}
int main() {
int n;
int a, d, y;
while (1) {
... | #include <iostream>
using namespace std;
int com(int x, int y) {
long long int ans;
if (y == 0)
return 1;
if (y == 1)
return x;
ans = x;
for (int i = 1; i < y; i++)
ans *= x - i;
for (int i = 0; i < y; i++)
ans /= y - i;
return ans;
}
int main() {
int n;
int a, d, y;
while (1) {
... | [["-", 8, 9, 0, 57, 64, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 27, 28, 22]] | 1 | 240 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | [["+", 31, 23, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 23, 0, 16, 31, 16, 31, 23, 0, 25]] | 1 | 154 | 4 |
#include <iostream>
using namespace std;
int main() {
int result[30];
result[0] = 1;
result[1] = 1;
result[2] = 2;
for (int i = 3; i < 30; i++) {
result[i] = result[i - 1] + result[i - 2] + result[i - 3];
}
int n;
while (cin >> n, n) {
cout << result[n] / 3650 + 1 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int result[31];
result[0] = 1;
result[1] = 1;
result[2] = 2;
for (int i = 3; i < 31; i++) {
result[i] = result[i - 1] + result[i - 2] + result[i - 3];
}
int n;
while (cin >> n, n) {
cout << result[n] / 3650 + 1 << endl;
}
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, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 110 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[15000] = {0};
while (scanf("%d", &n), n) {
int ans = 0;
a[0] = 1;
a[1] = 1;
a[2] = 2;
for (int i = 3; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2] + a[i - 3];
}
ans = a[n] / 365;
printf("%d\n", ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[15000] = {0};
while (scanf("%d", &n), n) {
int ans = 0;
a[0] = 1;
a[1] = 1;
a[2] = 2;
for (int i = 3; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2] + a[i - 3];
}
ans = a[n] / 3650;
printf("%d\n",... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 135 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
int m[30] = {1, 1, 2};
for (int i = 3; i < 30; i++) {
m[i] = m[i - 1] + m[i - 2] + m[i - 3];
}
while (cin >> n, n) {
cout << m[n] / (365 * 10) + 1 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
int m[31] = {1, 1, 2};
for (int i = 3; i <= 30; i++) {
m[i] = m[i - 1] + m[i - 2] + m[i - 3];
}
while (cin >> n, n) {
cout << m[n] / (365 * 10) + 1 << endl;
}
} | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 98 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["-", 0, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 85]] | 1 | 206 | 2 |
#include <iostream>
using namespace std;
long int factorial(int x) {
if (x == 0)
return 1;
return x * factorial(x - 1);
}
int main() {
while (true) {
int n; // 段数
cin >> n;
if (n == 0)
break;
long int pattern = 0;
for (int a = 0; a <= n / 3; a++) {
for (int b = 0; b <= n /... | #include <iostream>
using namespace std;
long double factorial(int x) {
if (x == 0)
return 1;
return x * factorial(x - 1);
}
int main() {
while (true) {
int n; // 段数
cin >> n;
if (n == 0)
break;
long int pattern = 0;
for (int a = 0; a <= n / 3; a++) {
for (int b = 0; b <= ... | [["-", 36, 36, 0, 30, 0, 14, 39, 86, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 39, 40], ["-", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["-", 12, 16, 12, 23, 0, 16, 31, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 85], ["-", 0, 11, 12, 16, 12, 23, 0, 16, 17, 48], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["-", 12... | 1 | 210 | 8 |
#include <iostream>
using namespace std;
int main() {
int a[31] = {0, 1, 2, 4};
for (int i = 4; i <= 30; ++i) {
a[i] = a[i - 1] + a[i - 2] + a[i - 3];
}
int n;
while (cin >> n) {
if (n == 0)
break;
cout << (n == 1 ? 1 : ((a[n] / 10 / 365) + (a[n] / 10 % 365 != 0))) << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a[31] = {0, 1, 2, 4};
for (int i = 4; i <= 30; ++i) {
a[i] = a[i - 1] + a[i - 2] + a[i - 3];
}
int n;
while (cin >> n) {
if (n == 0)
break;
cout << (a[n] < 10 ? 1 : ((a[n] / 10 / 365) + (a[n] / 10 % 365 != 0)))
<< endl;
... | [["+", 12, 23, 0, 41, 15, 16, 31, 69, 28, 22], ["+", 0, 41, 15, 16, 31, 69, 341, 342, 0, 70], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 17, 60], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13], ["+", 0, 41, 15, 16, 31, 69, 341, 342, 0, 73], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 17, 18], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 12, ... | 1 | 127 | 7 |
#include <iostream>
using namespace std;
int main() {
int n;
long long int dp[31] = {1, 1, 2};
for (int i = 3; i < 30; i++)
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
for (; cin >> n, n;)
cout << (long long int)((dp[n] / 3650.0) + 0.999999) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
long long int dp[31] = {1, 1, 2};
for (int i = 3; i < 31; i++)
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
for (; cin >> n, n;)
cout << (long long int)((dp[n] / 3650.0) + 0.999999) << endl;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 103 | 2 |
#include <iostream>
using namespace std;
long long dp[30] = {1, 1, 2};
int ans[30];
int n;
int main() {
for (int i = 3; i < 30; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
for (int i = 0; i < 30; i++) {
ans[i] = dp[i] / 10;
if (dp[i] % 10 != 0)
ans[i]++;
ans[i] = ans[i] / 365;
... | #include <iostream>
using namespace std;
int dp[31] = {1, 1, 2};
int ans[31];
int n;
int main() {
for (int i = 3; i < 31; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
for (int i = 0; i < 31; i++) {
ans[i] = dp[i] / 10;
if (dp[i] % 10 != 0)
ans[i]++;
ans[i] = ans[i] / 365;
if (a... | [["-", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 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,... | 1 | 191 | 11 |
def rec(n, current)
if @dp[current] != -1
return @dp[current]
end
if current == n
1
elsif current > n
0
else
@dp[current] = rec(n, current + 1) + rec(n, current + 2) + rec(n, current + 3)
end
end
def solve(n)
@dp = Array.new(34, -1)
sum = rec(n, 0)
result = ( (sum / 10) + 365 ) / 365... | def rec(n, current)
if @dp[current] != -1
return @dp[current]
end
if current == n
1
elsif current > n
0
else
@dp[current] = rec(n, current + 1) + rec(n, current + 2) + rec(n, current + 3)
end
end
def solve(n)
@dp = Array.new(34, -1)
sum = rec(n, 0)
result = ( (sum / 10) + 365 ) / 365... | [["-", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["-", 8, 734, 0, 652, 3, 4, 0, 652, 735, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["+", 8, 734, 0, 652, 3, 4, 0, 652, 735, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 4 | 129 | 6 |
$kannondou = [0, 1, 2, 4]
$size = $kannondou.size
def count(n)
while $size < n
$kannondou[$size] = $kannondou[$size-1] + $kannondou[$size-2] + $kannondou[$size-3]
$size += 1
end
$kannondou[n]
end
while n = gets.to_i
break if n.zero?
puts count(n) / 3650 + 1
end | $kannondou = [0, 1, 2, 4]
$size = $kannondou.size
def count(n)
while $size <= n
$kannondou[$size] = $kannondou[$size-1] + $kannondou[$size-2] + $kannondou[$size-3]
$size += 1
end
$kannondou[n]
end
while n = gets.to_i
break if n.zero?
puts count(n) / 3650 + 1
end | [["-", 0, 735, 8, 736, 0, 89, 15, 738, 17, 18], ["+", 0, 735, 8, 736, 0, 89, 15, 738, 17, 19]] | 4 | 80 | 2 |
Moves = [1,2,3]
MaxStep = 30
def solve
dp = Array.new(MaxStep + 1, 0)
dp[0] = 1
for step in 1...MaxStep
Moves.each do |m|
break if step - m < 0
dp[step] += dp[step - m]
end
end
dp
end
result = solve
while (n = $stdin.gets.to_i) != 0
printf "%d\n", (result[n].to_f / 3650.to_f).ceil
end | Moves = [1,2,3]
MaxStep = 30
def solve
dp = Array.new(MaxStep + 1, 0)
dp[0] = 1
for step in 1..MaxStep
Moves.each do |m|
break if step - m < 0
dp[step] += dp[step - m]
end
end
dp
end
result = solve
while (n = $stdin.gets.to_i) != 0
printf "%d\n", (result[n].to_f / 3650.to_f).ceil
end | [["-", 8, 736, 0, 88, 51, 267, 0, 475, 17, 389], ["+", 8, 736, 0, 88, 51, 267, 0, 475, 17, 757]] | 4 | 103 | 2 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
void run() {
Scanner sc = new Scanner(System.in);
sc.useDelimiter("\n");
for (; sc.hasNext();) {
String[] str = sc.nextLine().split(" ");
if (str[0].charAt(0) == ... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
void run() {
Scanner sc = new Scanner(System.in);
sc.useDelimiter("\n");
for (; sc.hasNext();) {
String[] str = sc.nextLine().split(" ");
if (str[0].charAt(0) == ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 324 | 2 |
#include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22], ["-", 8, ... | 1 | 501 | 97 |
from math import *
def S(p):
return sum([sin(a*pi/180)/2 for a in p])+sin((360-sum(p))*pi/180)
while True:
try:
p1=[int(input()) for i in range(eval(input())-1)]
p2=[int(input()) for i in range(eval(input())-1)]
s1,s2=S(p1),S(p2)
if s1-s2>1e-10: print(1)
elif s2-s1>1e-10: print(2)
else:print(0)
exc... | from math import *
def S(p):
return sum([sin(a*pi/180) for a in p])+sin((360-sum(p))*pi/180)
while True:
try:
p1=[int(input()) for i in range(eval(input())-1)]
p2=[int(input()) for i in range(eval(input())-1)]
s1,s2=S(p1),S(p2)
if s1-s2>1e-10: print(1)
elif s2-s1>1e-10: print(2)
else:print(0)
excep... | [["-", 31, 652, 3, 4, 0, 658, 8, 657, 17, 85], ["-", 31, 652, 3, 4, 0, 658, 8, 657, 12, 612]] | 5 | 143 | 2 |
#include <stdio.h>
int main() {
int i, j;
int n;
int u[500];
int sum;
int cnt;
while (scanf("%d", &n), n != 0) {
for (i = 0; i < n; i++)
scanf("%d", &u[i]);
cnt = 0;
for (i = n - 1; i > 0; i--) {
for (j = 0; j < i; j++) {
if (u[j] > u[j + 1]) {
sum = u[i];
... | #include <stdio.h>
int main() {
int i, j;
int n;
int u[500];
int sum;
int cnt;
while (scanf("%d", &n), n != 0) {
for (i = 0; i < n; i++) {
scanf("%d", &u[i]);
}
cnt = 0;
for (i = n - 1; i > 0; i--) {
for (j = 0; j < i; j++) {
if (u[j] > u[j + 1]) {
sum = u[j]... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22]] | 0 | 168 | 4 |
#include <stdio.h>
#include <stdlib.h>
int bubbleSort(int array[], int n);
int main() {
int arraySize;
int *insertedData;
int changeLineFlag = 0;
while (1) {
scanf("%d", &arraySize);
if (arraySize == 0)
break;
if (changeLineFlag == 0) {
changeLineFlag++;
} else {
printf("\n")... | #include <stdio.h>
#include <stdlib.h>
int bubbleSort(int array[], int n);
int main() {
int arraySize;
int *insertedData;
int changeLineFlag = 0;
while (1) {
scanf("%d", &arraySize);
if (arraySize == 0)
break;
if (changeLineFlag == 0) {
changeLineFlag++;
} else {
printf("\n")... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 264 | 2 |
#include <stdio.h>
int swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
return 1;
}
int main(void) {
int n, a[100], i, j, c;
for (;;) {
scanf("%d", &n);
if (!n)
break;
for (i = 0; i < n; i++)
scanf("%d", a + i);
for (i = n - 1; i; i--)
for (j = 0; j < i; j++)
if ... | #include <stdio.h>
int swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
return 1;
}
int main(void) {
int n, a[100], i, j, c;
for (;;) {
scanf("%d", &n);
if (!n)
break;
c = 0;
for (i = 0; i < n; i++)
scanf("%d", a + i);
for (i = n - 1; i; i--)
for (j = 0; j < i; j++)
... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 172 | 4 |
#include <stdio.h>
int main() {
int dataset[100];
int length = 0;
int i, j, count, tmp;
while (scanf("%d", &length) && length) {
for (i = 0; i < length; i++)
scanf("%d", &dataset[i]);
count = 0;
for (i = length - 1; i >= 0; i--) {
for (j = 0; j < i; j++) {
if (dataset[j] > da... | #include <stdio.h>
int main() {
int dataset[100];
int length = 0;
int i, j, count, tmp;
while (scanf("%d", &length) && length) {
for (i = 0; i < length; i++)
scanf("%d", &dataset[i]);
count = 0;
for (i = length - 1; i >= 0; i--) {
for (j = 0; j < i; j++) {
if (dataset[j] > da... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 166 | 2 |
#include <stdio.h>
int main(void) {
int N;
int i, j;
int count;
int box[100];
int tmp;
while (1) {
scanf("%d", &N);
if (N == 0) {
break;
}
count = 0;
for (i = 0; i < N; i++) {
scanf("%d", &box[i]);
}
for (i = 0; i < N - 1; i++) {
for (j = 0; j < N - i - 1; j... | #include <stdio.h>
int main(void) {
int N;
int i, j;
int count;
int box[100];
int tmp;
while (1) {
scanf("%d", &N);
if (N == 0) {
break;
}
count = 0;
for (i = 0; i < N; i++) {
scanf("%d", &box[i]);
}
for (i = 0; i < N - 1; i++) {
for (j = 0; j < N - i - 1; j... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 184 | 3 |
#include <stdio.h>
int bubble_sort(int *a, int n, int change);
int main(void) {
int n;
int change;
int i;
int a[100] = {};
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
change = 0;
change = bubble_sort(a, n, change... | #include <stdio.h>
int bubble_sort(int *a, int n, int change);
int main(void) {
int n;
int change;
int i;
int a[100] = {};
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
change = 0;
change = bubble_sort(a, n, change... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 237 | 2 |
#include <iostream>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int a[n], sum = 0;
r(i, n) cin >> a[i];
r(i, n) for (int j = 1; j < n; j++) {
if (a[i] > a[j]) {
swap(a[i], a[j]);
sum++;
}
}
cout << sum... | #include <iostream>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int a[n], sum = 0;
r(i, n) cin >> a[i];
r(i, n) for (int j = 1; j < n; j++) {
if (a[j - 1] > a[j]) {
swap(a[j - 1], a[j]);
sum++;
}
}
cou... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17... | 1 | 117 | 8 |
#include <stdio.h>
void swap(int &a, int &b) {
int temp = a;
a = b;
b = temp;
return;
}
const int N = 1e5 + 10;
int main() {
int n, a[N];
while (true) {
scanf("%d", &n);
if (n == 0)
return 0;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int ans = 0;
for (int i = 0; i < n; ... | #include <stdio.h>
void swap(int &a, int &b) {
int temp = a;
a = b;
b = temp;
return;
}
const int N = 1e5 + 10;
int main() {
int n, a[N];
while (true) {
scanf("%d", &n);
if (n == 0)
return 0;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int ans = 0;
for (int i = 0; i < n; ... | [["-", 8, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 7, 8, 57, 15, 339, 51, 16, 17, 47]] | 1 | 183 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int t[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
}
if (n == 1) {
cout << 0 << endl;
continue;
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++) {... | #include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int t[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
}
if (n == 1) {
cout << 0 << endl;
continue;
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 153 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72]] | 1 | 341 | 4 |
#include <iostream>
using namespace std;
long long int a[500], n;
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
long long int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i; j < n - 1; j++) {
if ... | #include <iostream>
using namespace std;
long long int a[500], n;
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
long long int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 17, 33], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 12, 22]] | 1 | 158 | 4 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <m... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <m... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 223 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 10000010
int main() {
int n;
int list[MAX];
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> list[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 110
int main() {
int n;
int list[MAX];
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> list[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 145 | 2 |
#include <cstdio>
#include <iostream>
#include <time.h>
using namespace std;
#define N 314159
int a[N], t[N];
long long ans = 0;
void marge_count(int s, int g) {
if (s + 1 >= g)
return;
if (s + 2 == g) {
if (a[s] > a[s + 1]) {
swap(a[s], a[s + 1]);
ans++;
}
return;
}
int m = (s + g) ... | #include <cstdio>
#include <iostream>
#include <time.h>
using namespace std;
#define N 314159
int a[N], t[N];
long long ans = 0;
void marge_count(int s, int g) {
if (s + 1 >= g)
return;
if (s + 2 == g) {
if (a[s] > a[s + 1]) {
swap(a[s], a[s + 1]);
ans++;
}
return;
}
int m = (s + g) ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 345 | 2 |
def bubble_sort(arr)
arr.size.times do |i|
0.upto(arr.size-i-2) do |j|
if arr[j] > arr[j+1]
arr[j], arr[j+1] = arr[j+1], arr[j]
@c += 1
end
end
end
end
while gets do
n = $_.to_i
break if n == 0
arr = n.times.map{ gets }
@c = 0
bubble_sort(arr)
puts @c
end | def bubble_sort(arr)
arr.size.times do |i|
0.upto(arr.size-i-2) do |j|
if arr[j] > arr[j+1]
arr[j], arr[j+1] = arr[j+1], arr[j]
@c += 1
end
end
end
end
while gets do
n = $_.to_i
break if n == 0
arr = n.times.map{ gets.to_i }
@c = 0
bubble_sort(arr)
puts @c
end | [["+", 12, 652, 196, 196, 8, 734, 0, 652, 17, 131], ["+", 12, 652, 196, 196, 8, 734, 0, 652, 735, 22]] | 4 | 105 | 2 |
while True:
n = int(input())
if n==0: break
a = [input() for _ in range(n)]
count = 0
for i in range(n):
for j in range(n)[:0:-1]:
if a[j] < a[j-1]:
a[j], a[j-1] = a[j-1], a[j]
count+=1
print(count) | while True:
n = int(input())
if n==0: break
a = [int(input()) for _ in range(n)]
count = 0
for i in range(n):
for j in range(n)[:0:-1]:
if a[j] < a[j-1]:
a[j], a[j-1] = a[j-1], a[j]
count+=1
print(count) | [["+", 0, 1, 0, 662, 12, 658, 8, 652, 63, 22], ["+", 0, 662, 12, 658, 8, 652, 3, 4, 0, 24], ["+", 8, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 100 | 3 |
#include <stdio.h>
int dp(int);
int main() {
int n, m;
while (1) {
scanf("%d", &n);
if (!n)
break;
m = dp(n) / 10;
if (m % 365)
printf("%d\n", m / 365 + 1);
else
printf("%d\n", m / 365);
}
return 0;
}
int dp(int n) {
int kai[31];
int i;
kai[1] = 1;
kai[2] = 2;
kai... | #include <stdio.h>
int dp(int);
int main() {
int n, m;
while (1) {
scanf("%d", &n);
if (!n)
break;
m = dp(n) / 10 + 1;
if (m % 365)
printf("%d\n", m / 365 + 1);
else
printf("%d\n", m / 365);
}
return 0;
}
int dp(int n) {
int kai[31];
int i;
kai[1] = 1;
kai[2] = 2;
... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 170 | 2 |
#include <stdio.h>
#include <string.h>
int dp[31][31], n, i, j, k, r;
int main() {
for (; scanf("%d", &n), n;) {
r = 0;
memset(dp, 0, sizeof(dp));
dp[0][0] = dp[0][1] = dp[0][2] = 1;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
for (k = -1; k >= -3; k--)
if (j + k >= 0)... | #include <stdio.h>
#include <string.h>
int dp[31][31], n, i, j, k, r;
int main() {
for (; scanf("%d", &n), n;) {
r = 0;
memset(dp, 0, sizeof(dp));
dp[0][0] = dp[0][1] = dp[0][2] = 1;
for (i = 1; i < n; i++)
for (j = 0; j < n; j++) {
for (k = -1; k >= -3; k--)
if (j + k >= 0)... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 208 | 2 |
#include <stdio.h>
int main(void) {
int m, n;
int x;
int i;
int cnt;
while (1) {
scanf("%d %d", &m, &n);
if (m == 0) {
break;
}
cnt = 0;
for (i = m; i <= n; i++) {
x = i;
if (x % 2 == 0) {
x /= 2;
}
if (x % 3 == 0) {
x /= 3;
}
... | #include <stdio.h>
int main(void) {
int m, n;
int x;
int i;
int cnt;
while (1) {
scanf("%d %d", &m, &n);
if (m == 0) {
break;
}
cnt = 0;
for (i = m; i <= n; i++) {
x = i;
while (x % 2 == 0) {
x /= 2;
}
while (x % 3 == 0) {
x /= 3;
}... | [["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89]] | 0 | 143 | 6 |
#include <stdio.h>
int main(void) {
unsigned long long int m, n, i, s, t = 108839116800000000;
while (scanf("%llu", &m), m != 0) {
scanf("%llu", &n);
s = 0;
for (i = m; i <= n; i++) {
if (!(t % i)) {
s++;
}
}
printf("%llu", s);
}
return 0;
} | #include <stdio.h>
int main(void) {
unsigned long long int m, n, i, s, t = 108839116800000000;
while (scanf("%llu", &m), m != 0) {
scanf("%llu", &n);
s = 0;
for (i = m; i <= n; i++) {
if (!(t % i)) {
s++;
}
}
printf("%llu\n", s);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 98 | 1 |
#include <math.h>
#include <stdio.h>
int OR3(int num);
int main(void) {
int m, n;
while (scanf("%d", &n) != EOF && n != 0) {
scanf("%d", &n);
printf("%d\n", OR3(n) - OR3(m - 1));
}
return 0;
}
int OR3(int num) {
if (num <= 0)
return 0;
int i, j, k, count = 0;
for (i = 0; pow(2, i) <= num; i++... | #include <math.h>
#include <stdio.h>
int OR3(int num);
int main(void) {
int m, n;
while (scanf("%d", &n) != EOF && n != 0) {
scanf("%d", &m);
printf("%d\n", OR3(m) - OR3(n - 1));
}
return 0;
}
int OR3(int num) {
if (num <= 0)
return 0;
int i, j, k, count = 0;
for (i = 0; pow(2, i) <= num; i++... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 3, 4, 0, 16, 31, 2, 3, 4, 0, 22], ["+", 3, 4, 0, 16, 31, 2, 3, 4, 0, 22], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22]] | 0 | 191 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool f[10000002];
int main() {
f[2] = true;
f[3] = true;
f[5] = true;
for (int i = 2; i < 10000001; i *= 2) {
f[i] = true;
}
// cout<<"#";
for (int i = 3; i < 100... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool f[10000002];
int main() {
f[1] = true;
f[3] = true;
f[5] = true;
for (int i = 2; i < 10000001; i *= 2) {
f[i] = true;
}
// cout<<"#";
for (int i = 3; i < 100... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13]] | 1 | 285 | 2 |
#include <iostream>
using namespace std;
bool div(int a) {
if (a == 1) {
return true;
} else if (a % 2 == 0) {
return div(a / 2);
} else if (a % 3 == 0) {
return div(a / 3);
} else if (a % 5 == 0) {
return div(a / 5);
} else {
return false;
}
}
int main(int argc, const char *argv[]) {... | #include <iostream>
using namespace std;
bool div(int a) {
if (a == 1) {
return true;
} else if (a % 2 == 0) {
return div(a / 2);
} else if (a % 3 == 0) {
return div(a / 3);
} else if (a % 5 == 0) {
return div(a / 5);
} else {
return false;
}
}
int main(int argc, const char *argv[]) {... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 173 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int x[2000000];
long long p;
int a, b, sum;
int main() {
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 13; j++) {
for (int k = 0; k < 9; k++) {
p = (int)pow(2, i) * (int)pow(3, j) * (int)pow(5, k);
if (p < 2000000) {
... | #include <cmath>
#include <iostream>
using namespace std;
int x[2000000];
long long p;
int a, b, sum;
int main() {
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 13; j++) {
for (int k = 0; k < 9; k++) {
p = (long long)pow(2, i) * (long long)pow(3, j) * (long long)pow(5, k);
if (p < 200... | [["-", 12, 16, 31, 16, 31, 74, 39, 77, 39, 40], ["+", 31, 16, 31, 74, 39, 77, 39, 86, 0, 96], ["-", 12, 16, 31, 16, 12, 74, 39, 77, 39, 40], ["+", 31, 16, 12, 74, 39, 77, 39, 86, 0, 96], ["-", 0, 11, 12, 16, 12, 74, 39, 77, 39, 40], ["+", 12, 16, 12, 74, 39, 77, 39, 86, 0, 96]] | 1 | 183 | 9 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 100
using namespace std;
int main() {
bool hamming[N] = {false};
hamming[1] = true;
for (int j = 2; j < N; j++) {
int i = j;
while (i % 2 == 0)
i /= 2;
while (i % 3 == 0)
i /= 3;
while (i % 5 == 0)
i /= 5;
i... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 1000001
using namespace std;
int main() {
bool hamming[N] = {false};
hamming[1] = true;
for (int j = 2; j < N; j++) {
int i = j;
while (i % 2 == 0)
i /= 2;
while (i % 3 == 0)
i /= 3;
while (i % 5 == 0)
i /= 5;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 171 | 2 |
#include <iostream>
using namespace std;
const int MAX_N = 1001000;
bool table[MAX_N];
int main() {
int n, m;
for (int i = 0; i < MAX_N; i++)
table[i] = false;
table[2] = table[3] = table[5] = true;
for (int i = 2; i < MAX_N; i++) {
if (table[i]) {
if (i * 2 < MAX_N)
table[i * 2] = true... | #include <iostream>
using namespace std;
const int MAX_N = 1001000;
bool table[MAX_N];
int main() {
int n, m;
for (int i = 0; i < MAX_N; i++)
table[i] = false;
table[1] = table[2] = table[3] = table[5] = true;
for (int i = 2; i < MAX_N; i++) {
if (table[i]) {
if (i * 2 < MAX_N)
table[i ... | [["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 1, 0, 11, 12, 11, 31, 69, 28, 22], ["+", 0, 11, 12, 11, 31, 69, 341, 342, 0, 70]] | 1 | 199 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m;
int n, a, cnt;
m = 0, n = 0, a = 0, cnt = 0;
while (1) {
cin >> m;
if (m == 0)
break;
cin >> n;
for (int i = m; i < n; i++) {
a = i;
while (a % 2 == 0)
a = a / 2;
while (a % 3 == 0)
a = a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
int n, a, cnt;
m = 0, n = 0, a = 0, cnt = 0;
while (1) {
cin >> m;
if (m == 0)
break;
cin >> n;
for (int i = m; i <= n; i++) {
a = i;
while (a % 2 == 0)
a = a / 2;
while (a % 3 == 0)
a = ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 141 | 2 |
#include <iostream>
using namespace std;
/*
bool sw[1000001];
int i;
void sws(int k){
if(k==1){
sw[i]=true;
return;
}
if(k%2==0) sws(k/2);
else if(k%3==0) sws(k/3);
else if(k%5==0) sws(k/5);
return;
}
*/
// korenisuru
int dp[1000001];
int ... | #include <iostream>
using namespace std;
/*
bool sw[1000001];
int i;
void sws(int k){
if(k==1){
sw[i]=true;
return;
}
if(k%2==0) sws(k/2);
else if(k%3==0) sws(k/3);
else if(k%5==0) sws(k/5);
return;
}
*/
// korenisuru
int dp[1000001];
int ... | [["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 209 | 2 |
#include <iostream>
#define D 100
using namespace std;
bool flg[D];
int ans[D];
int main() {
int m, n;
flg[1] = true;
for (int i = 0; i <= D; i++) {
if (flg[i]) {
if (2 * i <= D)
flg[2 * i] = true;
if (3 * i <= D)
flg[3 * i] = true;
if (5 * i <= D)
flg[5 * i] = true;... | #include <iostream>
#define D 1000000
using namespace std;
bool flg[D];
int ans[D];
int main() {
int m, n;
flg[1] = true;
for (int i = 0; i <= D; i++) {
if (flg[i]) {
if (2 * i <= D)
flg[2 * i] = true;
if (3 * i <= D)
flg[3 * i] = true;
if (5 * i <= D)
flg[5 * i] = t... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 185 | 2 |
#include <stdio.h>
int main() {
const int d[8][8] = {{0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 0, 250, 400, 1000, 1350},
{0, 0, 0, 0, 0, 250, 850, 1300},
... | #include <stdio.h>
int main() {
const int d[8][8] = {{0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 0, 250, 400, 1000, 1350},
{0, 0, 0, 0, 0, 250, 850, 1300},
... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 0 | 344 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int x, y, h1, m1, h2, m2, t1, t2;
int table[7][7] = {{0, 6, 10, 12, 14, 27, 33}, {6, 0, 7, 9, 12, 23, 30},
{13, 7, 0, 5, 8, 20, 27}, {18, 12, 5, 0, 5, 17, 26},
{23, 17, 10, 5, 0, 12, 23}, {43, 37, 30, 25, 20, 0, 10},
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int x, y, h1, m1, h2, m2, t1, t2;
int table[7][7] = {{0, 6, 10, 12, 14, 27, 33}, {6, 0, 7, 9, 12, 23, 30},
{13, 7, 0, 5, 8, 20, 27}, {18, 12, 5, 0, 5, 17, 26},
{23, 17, 10, 5, 0, 12, 23}, {43, 37, 30, 25, 20, 0, 10},
... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13]] | 0 | 363 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int dist[] = {0, 6, 13, 18, 23, 43, 58};
int cost[][7] = {
{0, 300, 500, 600, 700, 1350, 1650},
{300, 0, 350, 450, 600, 1150, 1500},
{500, 350, 0, 250, 400, 1000, 1350},
{600, 450, 250, 0, 250, 850, 1300},
{700, 600, 400, 250, 0, 600, 1150},... | #include <cmath>
#include <iostream>
using namespace std;
int dist[] = {0, 6, 13, 18, 23, 43, 58};
int cost[][7] = {
{0, 300, 500, 600, 700, 1350, 1650},
{300, 0, 350, 450, 600, 1150, 1500},
{500, 350, 0, 250, 400, 1000, 1350},
{600, 450, 250, 0, 250, 850, 1300},
{700, 600, 400, 250, 0, 600, 1150},... | [["-", 51, 16, 12, 16, 12, 16, 31, 16, 31, 13], ["+", 51, 16, 12, 16, 12, 16, 31, 16, 31, 13]] | 1 | 327 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int t[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, 0, 250, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 45, 40, 35, 15, 0}... | #include <bits/stdc++.h>
using namespace std;
const int t[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, 0, 250, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 45, 40, 35, 15, 0}... | [["+", 51, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 12, 23, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 344 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21]] | 1 | 701 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, 0, 250, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 4... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, 0, 250, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 4... | [["+", 64, 9, 0, 43, 49, 50, 51, 16, 17, 85], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 356 | 2 |
#include <iostream>
using namespace std;
int m(int h, int m) { return h * 60 + m; }
int main() {
int base[8][8] = {{0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 6, 0, 350, 450, 600, 1150, 1500},
{0, 13, 7, 0, 250, 400, 1000, 1350},
... | #include <iostream>
using namespace std;
int m(int h, int m) { return h * 60 + m; }
int main() {
int base[8][8] = {{0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 6, 0, 350, 450, 600, 1150, 1500},
{0, 13, 7, 0, 250, 400, 1000, 1350},
... | [["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]] | 1 | 404 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21]] | 1 | 334 | 6 |
#include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require memset
#include <deque>
#include <fstream> // requi... | #include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require memset
#include <deque>
#include <fstream> // requi... | [["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]] | 1 | 604 | 2 |
#include <iostream>
using namespace std;
int cost[8][8] = {{},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 6, 0, 350, 450, 600, 1150, 1500},
{0, 13, 7, 0, 250, 450, 1000, 1350},
{0, 18, 12, 5, 0, 250, 850, 1300},
{0, 23, 17, 10, ... | #include <iostream>
using namespace std;
int cost[8][8] = {{},
{0, 0, 300, 500, 600, 700, 1350, 1650},
{0, 6, 0, 350, 450, 600, 1150, 1500},
{0, 13, 7, 0, 250, 400, 1000, 1350},
{0, 18, 12, 5, 0, 250, 850, 1300},
{0, 23, 17, 10, ... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 401 | 2 |
#include <iostream>
using namespace std;
int main() {
int discount[2] = {17 * 60 + 30, 19 * 60 + 30};
int D[7] = {0, 6, 13, 18, 23, 43, 58};
int C[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 250, 400, 1000, 1350}, {0, 0, 0, 0, 250, 850, 1300},
... | #include <iostream>
using namespace std;
int main() {
int discount[2] = {17 * 60 + 30, 19 * 60 + 30};
int D[7] = {0, 6, 13, 18, 23, 43, 58};
int C[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 250, 400, 1000, 1350}, {0, 0, 0, 0, 250, 850, 1300},
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 51, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 12, 23, 0, 25]] | 1 | 346 | 5 |
#include <iostream>
using namespace std;
int abs(int i) { return (i < 0 ? -i : i); }
int km_to_yen(int km) {
switch (km) {
case 5:
return 250;
case 6:
return 300;
case 7:
return 350;
case 10:
return 400;
case 12:
return 450;
case 13:
case 15:
return 500;
case 17:
case 18:
... | #include <iostream>
using namespace std;
int abs(int i) { return (i < 0 ? -i : i); }
int km_to_yen(int km) {
switch (km) {
case 5:
return 250;
case 6:
return 300;
case 7:
return 350;
case 10:
return 400;
case 12:
return 450;
case 13:
case 15:
return 500;
case 17:
case 18:
... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 18], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 19]] | 1 | 332 | 2 |
#include <algorithm>
#include <iostream>
#define S 1050 // 1050min = 17:30 //
#define G 1170 // 1170min = 19:30 //
using namespace std;
int kiriage(int);
int main() {
int tmp[7][7] = {
{0, 300, 500, 600, 700, 1350}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, 0, 250... | #include <algorithm>
#include <iostream>
#define S 1050 // 1050min = 17:30 //
#define G 1170 // 1170min = 19:30 //
using namespace std;
int kiriage(int);
int main() {
int tmp[7][7] = {
{0, 300, 500, 600, 700, 1350, 1650}, {6, 0, 350, 450, 600, 1150, 1500},
{13, 7, 0, 250, 400, 1000, 1350}, {18, 12, 5, ... | [["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 317 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (cin >> str, str[0] - '0') {
int a, b = 0;
for (int i = 1; i < str.size(); ++i) {
if (str[i] == 'A')
++a;
if (str[i] == 'B')
++b;
}
if (a > b) {
++a;
} else {
++b;
}
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (cin >> str, str[0] - '0') {
int a = 0, b = 0;
for (int i = 1; i < str.size(); ++i) {
if (str[i] == 'A')
++a;
if (str[i] == 'B')
++b;
}
if (a > b) {
++a;
} else {
++b;
}
... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 119 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string c;
while (true) {
cin >> c;
if (c == "0")
break;
int a = 0, b = 0;
for (int i = 1; i < c.size(); i++) {
if (c[i] == 'A')
a++;
if (c[i] == 'B')
b++;
}
if (a > b)
a++;
if ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string c;
while (true) {
cin >> c;
if (c == "0")
break;
int a = 0, b = 0;
for (int i = 1; i < c.size(); i++) {
if (c[i] == 'A')
a++;
if (c[i] == 'B')
b++;
}
if (a > b)
a++;
if ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 127 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.