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
|
|---|---|---|---|---|
#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;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
// prv[i][j] ->
// iªX^[gn_ÌÆ«Aj©çDZÉßé©
int prv[MAX_V][MAX_V];
// S_ÎÅZoHâèðÆO(V^3)AÓª ÁÄà®ì
void warshall_floyd() {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
for (int k = 0; k < V; k++) {
// d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
if (d[j][k] > d[j][i] + d[i][k]) {
int cp = k;
// XV
while (1) {
prv[j][cp] = prv[i][cp];
cp = prv[i][cp];
if (cp == i)
break;
}
d[j][k] = d[j][i] + d[i][k];
}
}
}
}
}
typedef complex<double> P;
void init(int n) {
V = n;
for (int i = 0; i < MAX_V; i++) {
for (int j = 0; j < MAX_V; j++) {
if (i == j)
d[i][j] = 0;
else
d[i][j] = INF;
prv[i][j] = INF;
}
}
}
int main() {
int n;
while (cin >> n && n != 0) {
map<int, int> idxs;
init(n);
int billNum[MAX_V];
P billP[MAX_V];
for (int i = 0; i < n; i++) {
int x, y;
cin >> billNum[i] >> x >> y;
billP[i] = P(x, y);
idxs[billNum[i]] = i;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
double dist = abs(billP[i] - billP[j]);
// £ª50ȺÈç¹ðìéƯÉAßèûðüêĨ
if (dist < 50 || EQ(dist, 50)) {
d[i][j] = dist;
prv[i][j] = i;
}
}
}
warshall_floyd();
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int s, g;
cin >> s >> g;
s = idxs[s];
g = idxs[g];
if (EQ(d[s][g], INF))
cout << "NA" << endl;
else {
vector<int> v;
int cp = g;
while (1) {
v.push_back(cp + 1);
if (cp == s)
break;
cp = prv[s][cp];
}
for (int j = v.size() - 1; j >= 0; j--) {
cout << v[j];
if (j == 0)
cout << endl;
else
cout << " ";
}
}
}
}
return 0;
}
|
#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;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
// prv[i][j] ->
// iªX^[gn_ÌÆ«Aj©çDZÉßé©
int prv[MAX_V][MAX_V];
// S_ÎÅZoHâèðÆO(V^3)AÓª ÁÄà®ì
void warshall_floyd() {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
for (int k = 0; k < V; k++) {
// d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
if (d[j][k] > d[j][i] + d[i][k]) {
int cp = k;
// XV
while (1) {
prv[j][cp] = prv[i][cp];
cp = prv[i][cp];
if (cp == i)
break;
}
d[j][k] = d[j][i] + d[i][k];
}
}
}
}
}
typedef complex<double> P;
void init(int n) {
V = n;
for (int i = 0; i < MAX_V; i++) {
for (int j = 0; j < MAX_V; j++) {
if (i == j)
d[i][j] = 0;
else
d[i][j] = INF;
prv[i][j] = INF;
}
}
}
int main() {
int n;
while (cin >> n && n != 0) {
map<int, int> idxs;
init(n);
int billNum[MAX_V];
P billP[MAX_V];
for (int i = 0; i < n; i++) {
int x, y;
cin >> billNum[i] >> x >> y;
billP[i] = P(x, y);
idxs[billNum[i]] = i;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
double dist = abs(billP[i] - billP[j]);
// £ª50ȺÈç¹ðìéƯÉAßèûðüêĨ
if (dist < 50 || EQ(dist, 50)) {
d[i][j] = dist;
prv[i][j] = i;
}
}
}
warshall_floyd();
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int s, g;
cin >> s >> g;
s = idxs[s];
g = idxs[g];
if (EQ(d[s][g], INF))
cout << "NA" << endl;
else {
vector<int> v;
int cp = g;
while (1) {
v.push_back(cp);
if (cp == s)
break;
cp = prv[s][cp];
}
for (int j = v.size() - 1; j >= 0; j--) {
cout << billNum[v[j]];
if (j == 0)
cout << endl;
else
cout << " ";
}
}
}
}
return 0;
}
|
[["-", 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
|
#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
|
#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) / 10 + 1);
}
return 0;
}
|
#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) / 3650);
}
return 0;
}
|
[["-", 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, 3, 4, 0, 16, 12, 13]]
| 0
| 140
|
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
|
#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
|
#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
|
#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];
}
}
cout << (A[N] / 10 + 364) / 365 << endl;
}
}
|
#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];
}
}
cout << (A[N] / 10) / 365 + 1 << endl;
}
}
|
[["-", 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
|
#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()); \
x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) \
cerr << "(" << #x << ", " << #y << ") = " \
<< "(" << x << ", " << y << ")" << endl;
#define dbg3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = " \
<< "(" << x << ", " << y << ", " << z << ")" << endl;
#define dbgB(value, size) cerr << #value << ": " << bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T, typename U> void print1(T Array, U size) {
for (int i = 0; i < size; i++) {
cout << Array[i] << " ";
}
cout << endl;
}
template <typename T> void print(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cout << " " << Array[i][j];
}
cout << endl;
}
}
// ------------------------------------------------------------------------------------------
int dp[50];
int n;
void init() {
dp[1] = dp[2] = dp[3] = 1;
for (int i = 1; i <= 30; i++) {
dp[i + 1] += dp[i];
dp[i + 2] += dp[i];
dp[i + 3] += dp[i];
}
}
signed main() {
init();
while (1) {
cin >> n;
if (n == 0)
break;
int kind = dp[n] / 10;
int year = kind / 365;
int days = kind % 365;
cout << year + (days >= 1) << endl;
}
return 0;
}
|
#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()); \
x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) \
cerr << "(" << #x << ", " << #y << ") = " \
<< "(" << x << ", " << y << ")" << endl;
#define dbg3(x, y, z) \
cerr << "(" << #x << ", " << #y << ", " << #z << ") = " \
<< "(" << x << ", " << y << ", " << z << ")" << endl;
#define dbgB(value, size) cerr << #value << ": " << bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T, typename U> void print1(T Array, U size) {
for (int i = 0; i < size; i++) {
cout << Array[i] << " ";
}
cout << endl;
}
template <typename T> void print(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cout << " " << Array[i][j];
}
cout << endl;
}
}
// ------------------------------------------------------------------------------------------
int dp[50];
int n;
void init() {
dp[1] = dp[2] = dp[3] = 1;
for (int i = 1; i <= 30; i++) {
dp[i + 1] += dp[i];
dp[i + 2] += dp[i];
dp[i + 3] += dp[i];
}
}
signed main() {
init();
while (1) {
cin >> n;
if (n == 0)
break;
int kind = dp[n] / 10;
int year = kind / 365;
int days = kind % 365;
cout << max(1LL, year + (days >= 1)) << endl;
}
return 0;
}
|
[["+", 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
|
#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 = 3650;
cout << (dp[n] + mult - 1) / mult << endl;
}
return 0;
}
|
#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 = 3650;
cout << (dp[n] + mult - 1) / mult << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 128
|
#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();
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int day = dp[n] / 10;
cout << day / 365 + (day % 365 != 0) << endl;
}
return 0;
}
|
#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();
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int day = dp[n] / 10;
cout << max(1, day / 365 + (day % 365 != 0)) << endl;
}
return 0;
}
|
[["+", 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
|
#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 << ((count(n) + 9) / 10 + 364) / 365 << endl;
cin >> n;
}
}
|
#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 << ((count(n) + 9) / 10 + 364) / 365 << endl;
cin >> n;
}
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 151
|
#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>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define cauto const auto &
#else
#endif
using namespace std;
namespace {
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(), (v).rend()
#define MOD 1000000007LL
#define EPS 1e-8
static const int INF = 1 << 24;
ll dp[31];
void mainmain() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
reep(i, 4, 31) {
rep(j, 3) { dp[i] += dp[i - j - 1]; }
}
// reep(i,4,7){
// cout<<dp[i]<<endl;
// }
// rep(i,35){
// cout<<i<<" "<<i*3650<<endl;
// }
int n;
while (cin >> n) {
ll t = dp[n] - 1;
// cout<<t<<endl;
t /= 3650;
cout << t + 1 << endl;
}
}
} // namespace
main() try { mainmain(); } catch (...) {
}
|
#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>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define cauto const auto &
#else
#endif
using namespace std;
namespace {
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(), (v).rend()
#define MOD 1000000007LL
#define EPS 1e-8
static const int INF = 1 << 24;
ll dp[31];
void mainmain() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
reep(i, 4, 31) {
rep(j, 3) { dp[i] += dp[i - j - 1]; }
}
// reep(i,4,7){
// cout<<dp[i]<<endl;
// }
// rep(i,35){
// cout<<i<<" "<<i*3650<<endl;
// }
// rep(i,31){
// cout<<i<<" "<<dp[i]<<endl;
// }
int n;
while (cin >> n, n) {
ll t = dp[n] - 1;
// cout<<t<<endl;
t /= 3650;
cout << t + 1 << endl;
}
// int tt=7299;
// tt/=3650;
// cout<<tt+1<<endl;
}
} // namespace
main() try { mainmain(); } catch (...) {
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 417
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void) {
int n;
// d[0] = 1patern d[1] = 1paten d[2] = 2patern
int dp[41] = {1, 1, 2};
for (int i = 3; i <= 31; i++) {
dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
}
while (cin >> n)
FIN(dp[n] / 3650 + 1);
return 0;
}
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void) {
int n;
// d[0] = 1patern d[1] = 1paten d[2] = 2patern
int dp[41] = {1, 1, 2};
for (int i = 3; i <= 31; i++) {
dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
}
while (cin >> n, n)
FIN(dp[n] / 3650 + 1);
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 215
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
template <typename T> void remove(vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
long long dp[31] = {1, 1, 2};
void func(int n) {
for (int i = 3; i < 30; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
}
int main(void) {
func(30);
int n;
while (cin >> n, n) {
cout << dp[n] / 10 / 365 + 1 << endl;
}
return 0;
}
int StrToInt(string s) {
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i) {
stringstream ss;
ss << i;
return ss.str();
}
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
template <typename T> void remove(vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
long long dp[31] = {1, 1, 2};
void func(int n) {
for (int i = 3; i <= 30; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
}
int main(void) {
func(30);
int n;
while (cin >> n, n) {
cout << dp[n] / 10 / 365 + 1 << endl;
}
return 0;
}
int StrToInt(string s) {
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i) {
stringstream ss;
ss << i;
return ss.str();
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 316
|
#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];
}
}
cout << (A[N] / 10 + 364) / 365 << endl;
cin >> N;
}
}
|
#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];
}
}
cout << ((A[N] + 9) / 10 + 364) / 365 << endl;
cin >> N;
}
}
|
[["+", 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
|
#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) + dp(a - 2) + dp(a - 1);
}
}
int main() {
int n;
while (cin >> n, !(n == 0)) {
long long day = dp(n);
if (day % 365 == 0)
cout << day / 3650 << endl;
else
cout << day / 3650 + 1 << endl;
}
return 0;
}
|
#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) + dp(a - 2) + dp(a - 1);
}
}
int main() {
int n;
while (cin >> n, !(n == 0)) {
long long day = dp(n);
if (day % 3650 == 0)
cout << day / 3650 << endl;
else
cout << day / 3650 + 1 << endl;
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]]
| 1
| 146
|
#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) < (n); (i)++)
#define rev(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define vrep(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template <class T1, class T2> inline void minup(T1 &m, T2 x) {
if (m > x)
m = static_cast<T2>(x);
}
template <class T1, class T2> inline void maxup(T1 &m, T2 x) {
if (m < x)
m = static_cast<T2>(x);
}
#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12
const int MAX_N = 30;
int n;
int dp[MAX_N + 1];
int main() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
rrep(i, 4, MAX_N) dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
while ((cin >> n) && n) {
cout << dp[n] / 3650 + (dp[n] % 3650 ? 1 : 0) << endl;
}
return 0;
}
|
#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) < (n); (i)++)
#define rev(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define vrep(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template <class T1, class T2> inline void minup(T1 &m, T2 x) {
if (m > x)
m = static_cast<T2>(x);
}
template <class T1, class T2> inline void maxup(T1 &m, T2 x) {
if (m < x)
m = static_cast<T2>(x);
}
#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12
const int MAX_N = 30;
int n;
int dp[MAX_N + 1];
int main() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
erep(i, 4, MAX_N) dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
while ((cin >> n) && n) {
cout << dp[n] / 3650 + (dp[n] % 3650 ? 1 : 0) << endl;
}
return 0;
}
|
[["-", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22], ["+", 0, 1, 0, 11, 31, 69, 28, 2, 63, 22]]
| 1
| 297
|
#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 / 365 + 1;
cout << y << endl;
}
return 0;
}
|
#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 / 365 + 1;
cout << y << endl;
}
return 0;
}
|
[["-", 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
|
#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] + dp[i - 2] + dp[i - 3];
}
for (;;) {
int n;
cin >> n;
if (n == 0)
break;
int ans = dp[n] / (10 * 365);
if (dp[n] % 365 > 0)
ans++;
cout << ans << endl;
}
}
|
#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] + dp[i - 2] + dp[i - 3];
}
for (;;) {
int n;
cin >> n;
if (n == 0)
break;
int ans = dp[n] / (10 * 365);
if (dp[n] % (365 * 10) > 0)
ans++;
cout << ans << endl;
}
}
|
[["+", 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
|
#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 == 0)
break;
int ans = dp[n] / (365 * 10);
if (dp[n] % 365 > 0)
ans++;
cout << ans << endl;
}
return 0;
}
|
#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 == 0)
break;
int ans = dp[n] / (365 * 10);
if (dp[n] % (365 * 10) > 0)
ans++;
cout << ans << endl;
}
return 0;
}
|
[["+", 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
|
#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];
}
}
A[n] = 1 + (A[n] / 3651);
Q.push(A[n]);
cin >> n;
}
while (Q.empty() == 0) {
cout << Q.front() << endl;
Q.pop();
}
}
|
#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];
}
}
A[n] = 1 + (A[n] - 1) / 3650;
Q.push(A[n]);
cin >> n;
}
while (Q.empty() == 0) {
cout << Q.front() << endl;
Q.pop();
}
}
|
[["-", 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
|
#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; i <= m; i++)
using namespace std;
int main() {
int dp[100] = {0};
int n;
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
repn(i, 4, 30) dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
while (cin >> n, n) {
cout << (dp[n] / 10 / 365) + (dp[n] % 3650 == 0 ? 0 : 1) << endl;
}
return 0;
}
|
#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; i <= m; i++)
using namespace std;
int main() {
int dp[100] = {0};
int n;
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
repn1(i, 4, 30) dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
while (cin >> n, n) {
cout << dp[n] / 3650 + (dp[n] % 3650 == 0 ? 0 : 1) << endl;
}
return 0;
}
|
[["-", 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], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13]]
| 1
| 171
|
#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
|
#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;
}
for (int a = 0; a < i; a++) {
cout << result[a] << endl;
}
return 0;
}
|
#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;
}
for (int a = 0; a < i; a++) {
cout << result[a] << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 155
|
#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] = func(i);
cnt += dp[i];
}
return cnt;
}
int main() {
while (scanf("%d", &n) != EOF) {
if (n == 0)
return 0;
memset(dp, -1, sizeof(dp));
printf("%d\n", (func(0) / 10 + 364) / 365);
}
}
|
#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] = func(i);
cnt += dp[i];
}
return cnt;
}
int main() {
while (scanf("%d", &n) != EOF) {
if (n == 0)
return 0;
memset(dp, -1, sizeof(dp));
printf("%d\n", ((func(0) + 9) / 10 + 364) / 365);
}
}
|
[["-", 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
|
#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] = func(i);
// cnt += dp[i];
// }
// return cnt;
//}
//
// int main() {
// while (scanf("%d", &n) != EOF) {
// if (n == 0) return 0;
// memset(dp, -1, sizeof(dp));
// printf("%d\n", ((func(0)+9) / 10 + 364) / 365);
// }
//}
int main() {
int n, dp[33] = {};
dp[29] = 1;
for (int i = 28; 0 <= i; i--) {
dp[i] = dp[i + 1] + dp[i + 2] + dp[i + 3];
}
while (1) {
scanf("%d", &n);
if (!n)
return 0;
printf("%d\n", ((dp[29 - n] + 9) / 10 + 364) / 365);
}
return 0;
}
/*
dp[i] = {dp[i+1]+dp[i+2]+dp[i+3] ????????????
*/
|
#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] = func(i);
// cnt += dp[i];
// }
// return cnt;
//}
//
// int main() {
// while (scanf("%d", &n) != EOF) {
// if (n == 0) return 0;
// memset(dp, -1, sizeof(dp));
// printf("%d\n", ((func(0)+9) / 10 + 364) / 365);
// }
//}
int main() {
int n, dp[33] = {};
dp[30] = 1;
for (int i = 29; 0 <= i; i--) {
dp[i] = dp[i + 1] + dp[i + 2] + dp[i + 3];
}
while (1) {
scanf("%d", &n);
if (!n)
return 0;
printf("%d\n", ((dp[30 - n] + 9) / 10 + 364) / 365);
}
return 0;
}
/*
dp[i] = {dp[i+1]+dp[i+2]+dp[i+3] ????????????
*/
|
[["-", 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
|
#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[n + 2] << endl;
}
return 0;
}
|
#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[n + 2] / 3650 + 1 << endl;
}
return 0;
}
|
[["+", 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
|
#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 <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll sq(ll num) { return num * num; }
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
if (n == 1)
return x % MOD;
ll res = sq(mod_pow(x, n / 2));
res %= MOD;
if (n % 2 == 1) {
res *= x;
res %= MOD;
}
return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a * b % MOD; }
ll n;
ll solve(int now) {
if (now == 0)
return 1;
if (now < 0)
return 0;
ll res = 0;
res = solve(now - 1) + solve(now - 2) + solve(now - 3);
return res;
}
int main() {
while (cin >> n && n) {
cout << ceil(solve(n) / 3650) << endl;
}
}
|
#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 <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll sq(ll num) { return num * num; }
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
if (n == 1)
return x % MOD;
ll res = sq(mod_pow(x, n / 2));
res %= MOD;
if (n % 2 == 1) {
res *= x;
res %= MOD;
}
return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a * b % MOD; }
// kannondou??¨??¢?´¢
ll n;
ll solve(int now) {
if (now == 0)
return 1;
if (now < 0)
return 0;
ll res = 0;
res = solve(now - 1) + solve(now - 2) + solve(now - 3);
return res;
}
int main() {
while (cin >> n && n) {
cout << solve(n) / 3650 + 1 << endl;
}
}
|
[["-", 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
|
#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);
}
}
int main() {
while (1) {
int days = 0, years = 0;
cin >> x;
if (x == 0) {
break;
}
dfs(x);
days = c / 10;
if (c % 10 != 0) {
days++;
}
years = days / 365;
if (days % 365 != 0) {
years++;
}
cout << years << endl;
}
}
|
#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);
}
}
int main() {
while (1) {
int days = 0, years = 0;
c = 0;
cin >> x;
if (x == 0) {
break;
}
dfs(x);
days = c / 10;
if (c % 10 != 0) {
days++;
}
years = days / 365;
if (days % 365 != 0) {
years++;
}
cout << years << endl;
}
}
|
[["+", 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
|
#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
|
#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>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))
const int INF = -1;
typedef long long ll;
typedef pair<int, int> pii;
ll dp[31];
int N;
void solve() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for (int i = 4; i <= 30; ++i)
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
int main() {
clr(dp, -1);
solve();
while (cin >> N, N) {
cout << (dp[N] / 10) / 365 + bool(dp[N] % 365) << endl;
}
return 0;
}
|
#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>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))
const int INF = -1;
typedef long long ll;
typedef pair<int, int> pii;
ll dp[31];
int N;
void solve() {
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for (int i = 4; i <= 30; ++i)
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
int main() {
clr(dp, -1);
solve();
while (cin >> N, N) {
cout << (dp[N] / 10) / 365 + bool(dp[N] % 3650) << endl;
}
return 0;
}
|
[["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 263
|
#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 rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T> using vv = vector<vector<T>>;
typedef deque<int> di;
typedef deque<deque<int>> ddi;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0) {
break;
}
int dp[30];
dp[0] = 1;
dp[1] = 2;
dp[2] = 4;
FOR(i, 3, n) { dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3]; }
if (dp[n] % 3650 == 0) {
cout << dp[n - 1] / 3650 << endl;
} else {
cout << dp[n - 1] / 3650 + 1 << endl;
}
}
return 0;
}
|
#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 rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T> using vv = vector<vector<T>>;
typedef deque<int> di;
typedef deque<deque<int>> ddi;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0) {
break;
}
int dp[30];
dp[0] = 1;
dp[1] = 2;
dp[2] = 4;
FOR(i, 3, n) { dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3]; }
if (dp[n - 1] % 3650 == 0) {
cout << dp[n - 1] / 3650 << endl;
} else {
cout << dp[n - 1] / 3650 + 1 << endl;
}
}
return 0;
}
|
[["+", 31, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 292
|
#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[n] + 3600 - 1) / 3600 << endl;
}
return 0;
}
|
#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[n] + 3650 - 1) / 3650 << endl;
}
return 0;
}
|
[["-", 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
|
#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++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define fi first
#define se second
#define INF 2147483600
long dp[31];
int main() {
fill(dp, dp + 31, 0);
dp[0] = 1;
for (int i = 1; i <= 30; i++) {
for (int j = 1; j <= 3; j++) {
if (i - j >= 0)
dp[i] += dp[i - j];
}
}
int n;
while (cin >> n, n) {
long res = ((dp[n] / 10) + 364) / 365;
cout << res << endl;
}
return 0;
}
|
#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++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define fi first
#define se second
#define INF 2147483600
long dp[31];
int main() {
fill(dp, dp + 31, 0);
dp[0] = 1;
for (int i = 1; i <= 30; i++) {
for (int j = 1; j <= 3; j++) {
if (i - j >= 0)
dp[i] += dp[i - j];
}
}
int n;
while (cin >> n, n) {
long res = (((dp[n] + 9) / 10) + 364) / 365;
cout << res << endl;
}
return 0;
}
|
[["+", 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
|
#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 / 365 + 1 << endl;
}
}
|
#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 / 10 + 1 << endl;
}
}
|
[["-", 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
|
#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;
rec(n);
ans = cnt / 3650;
cout << ans + 1 << endl;
}
return 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;
int ans = 0;
rec(n);
ans = cnt / 3650;
cout << ans + 1 << endl;
}
return 0;
}
|
[["+", 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
|
#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 << endl;
}
}
|
#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 << endl;
}
}
|
[["-", 0, 43, 49, 50, 51, 16, 31, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 13]]
| 1
| 123
|
#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, n) {
int ans = 0;
for (int i = 1; i < 4; ++i)
ans += dp[n][i];
ans = (ans + 9) / 10;
ans = (ans + 364) / 365;
cout << ans << endl;
}
return 0;
}
|
#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];
}
}
while (cin >> n, n) {
int ans = 0;
for (int i = 1; i < 4; ++i)
ans += dp[n][i];
ans = (ans + 9) / 10;
ans = (ans + 364) / 365;
cout << ans << endl;
}
return 0;
}
|
[["-", 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, 8, 9, 0, 46]]
| 1
| 217
|
#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, 30) kai[i] = (kai[i] + 3649) / 3650;
while (cin >> a, a)
cout << kai[a] << endl;
return 0;
}
|
#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, 31) kai[i] = (kai[i] + 3649) / 3650;
while (cin >> a, a)
cout << kai[a] << endl;
return 0;
}
|
[["-", 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
|
#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(i, 0, n)
ll d[40];
void solve() {}
void show() {
for (int i = 0; i < 40; i++) {
cout << i << ":" << d[i] << endl;
}
}
void init() {
fill(d, d + 40, 0);
d[1] = 1;
d[2] = 2;
d[3] = 4;
for (int i = 4; i < 31; i++) {
d[i] = d[i - 3] + d[i - 2] + d[i - 1];
}
}
int main() {
int n;
init();
show();
while (cin >> n, n) {
cout << (d[n] / 3650) + 1 << endl;
}
return 0;
}
|
#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(i, 0, n)
ll d[40];
void solve() {}
void show() {
for (int i = 0; i < 40; i++) {
cout << i << ":" << d[i] << endl;
}
}
void init() {
fill(d, d + 40, 0);
d[1] = 1;
d[2] = 2;
d[3] = 4;
for (int i = 4; i < 31; i++) {
d[i] = d[i - 3] + d[i - 2] + d[i - 1];
}
}
int main() {
int n;
init();
while (cin >> n, n) {
cout << (d[n] / 3650) + 1 << endl;
}
return 0;
}
|
[["-", 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
|
#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) {
cin >> n;
if (!n)
break;
a = 0;
for (int i = 0; i <= n / 3; i++) {
for (int j = 0; j <= (n - 3 * i) / 2; j++) {
a += com(i + j + (n - 3 * i - 2 * j), i + j) * com(i + j, i);
}
}
d = a / 10;
if (d * 10 != a)
a++;
y = d / 365;
if (y * 365 != d)
y++;
cout << y << endl;
}
}
|
#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) {
cin >> n;
if (!n)
break;
a = 0;
for (int i = 0; i <= n / 3; i++) {
for (int j = 0; j <= (n - 3 * i) / 2; j++) {
a += com(i + j + (n - 3 * i - 2 * j), i + j) * com(i + j, i);
}
}
d = a / 10;
if (d * 10 != a)
d++;
y = d / 365;
if (y * 365 != d)
y++;
cout << y << endl;
}
}
|
[["-", 8, 9, 0, 57, 64, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 27, 28, 22]]
| 1
| 240
|
#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() {
int t[31 + 3];
t[0] = t[1] = 0;
t[2] = 1;
for (int i = 3; i < 31 + 3; ++i)
t[i] = t[i - 1] + t[i - 2] + t[i - 3];
int n;
while (scanf("%d", &n), n)
printf("%d\n", (t[n + 2] / 10 + 364) / 365);
return 0;
}
|
#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() {
int t[31 + 3];
t[0] = t[1] = 0;
t[2] = 1;
for (int i = 3; i < 31 + 3; ++i)
t[i] = t[i - 1] + t[i - 2] + t[i - 3];
int n;
while (scanf("%d", &n), n)
printf("%d\n", ((t[n + 2] + 9) / 10 + 364) / 365);
return 0;
}
|
[["+", 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
|
#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
|
#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", ans + 1);
}
return 0;
}
|
#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", ans + 1);
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 135
|
#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
|
#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 <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
int main() {
int dp[32] = {0}, n;
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i < 31; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
while (cin >> n, n) {
cout << (dp[n] / 365) * 10 + 1 << endl;
}
}
|
#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 <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
int main() {
int dp[32] = {0}, n;
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i < 31; i++) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
while (cin >> n, n) {
cout << (dp[n] / 365) / 10 + 1 << endl;
}
}
|
[["-", 0, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 85]]
| 1
| 206
|
#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 / 2; b++) {
for (int c = 0; c <= n; c++) {
if (3 * a + 2 * b + c == n) {
pattern += factorial(a + b + c) /
(factorial(a) * factorial(b) * factorial(c));
}
}
}
}
long int day = pattern / 10 + (pattern % 10 == 0 ? 0 : 1);
long int year = day / 365 + (day % 365 == 0 ? 0 : 1);
cout << year << endl;
}
}
|
#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 <= n / 2; b++) {
for (int c = 0; c <= n; c++) {
if (3 * a + 2 * b + c == n) {
pattern += factorial(a + b + c) / factorial(a) / factorial(b) /
factorial(c);
}
}
}
}
long int day = pattern / 10 + (pattern % 10 == 0 ? 0 : 1);
long int year = day / 365 + (day % 365 == 0 ? 0 : 1);
cout << year << endl;
}
}
|
[["-", 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, 23, 0, 16, 12, 2, 3, 4, 0, 25]]
| 1
| 210
|
#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, 13]]
| 1
| 127
|
#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
|
#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;
if (ans[i] % 365 != 0)
ans[i]++;
if (ans[i] == 0)
ans[i]++;
}
while (cin >> n, n != 0) {
cout << ans[n] << endl;
}
return 0;
}
|
#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 (ans[i] % 365 != 0)
ans[i]++;
if (ans[i] == 0)
ans[i]++;
}
/*
for(int i = 0; i < 31 ; i++){
cout << ans[i] << " ";
}
cout << endl;
for(int i = 0; i < 31 ; i++){
cout << dp[i] << " ";
}
*/
while (cin >> n, n != 0) {
cout << ans[n] << endl;
}
return 0;
}
|
[["-", 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, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 191
|
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
end
def main
STDIN.each_line{|line|
n = line.to_i
puts solve n
if n == 0
break
end
}
end
main
|
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
end
def main
STDIN.each_line{|line|
n = line.to_i
if n == 0
break
end
puts solve n
}
end
main
|
[["-", 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
|
$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
|
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
|
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) == '0')
break;
int A = 0;
int bj = 0;
for (int i = 0; i < str.length; i++) {
int val = min(10, Integer.parseInt(str[i]));
if (val != 1)
bj += val;
else
A++;
}
if (bj > 21) {
System.out.println(0);
} else if (A == 0) {
System.out.println(bj);
} else {
int tmp = bj;
bj = 0;
for (int i = 0; i <= A; i++) {
if (tmp + i + 11 * (A - i) > 22)
continue;
bj = max(bj, tmp + i + 11 * (A - i));
}
System.out.println(bj);
}
}
}
public static void main(String[] args) { new Main().run(); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
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) == '0')
break;
int A = 0;
int bj = 0;
for (int i = 0; i < str.length; i++) {
int val = min(10, Integer.parseInt(str[i]));
if (val != 1)
bj += val;
else
A++;
}
if (bj > 21) {
System.out.println(0);
} else if (A == 0) {
System.out.println(bj);
} else {
int tmp = bj;
bj = 0;
for (int i = 0; i <= A; i++) {
// debug(tmp);
if (tmp + i + 11 * (A - i) > 21)
continue;
bj = max(bj, tmp + i + 11 * (A - i));
}
System.out.println(bj);
}
}
}
public static void main(String[] args) { new Main().run(); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]]
| 3
| 324
|
#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(x) cerr << #x << "=" << static_cast<bitset<16>>(x) << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < (int)(n); i++)
#define if_range(x, y, w, h) \
if (0 <= (int)(x) && (int)(x) < (int)(w) && 0 <= (int)(y) && \
(int)(y) < (int)(h))
const int INF = 10000000;
typedef double D;
const D EPS = 1e-8;
const double PI = 3.14159;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
using namespace std;
typedef pair<int, int> P;
typedef struct {
double x, y;
} Point;
double rad(double deg) { return deg * 2 * PI / 360; }
int sig(D a, D b) {
if (a < b - EPS)
return -1;
if (a > b + EPS)
return +1;
return 0;
}
/** Problem0166 : Area of Polygon **/
double area(vector<Point> points) {
points.push_back(points[0]);
double S = 0;
for (int i = 0; i < points.size(); i++) {
S += fabs(points[i].x * points[i + 1].y - points[i + 1].x * points[i].y);
}
return S / 2;
}
int main() {
int M, N;
while (cin >> M, M) {
int angle = 0;
vector<Point> p1, p2;
rep(k, M - 1) {
int t;
cin >> t;
angle += t;
Point p;
p.x = cos(rad(angle)), p.y = sin(rad(angle));
p1.push_back(p);
}
angle = 0;
cin >> N;
rep(k, N - 1) {
int t;
cin >> t;
angle += t;
Point p;
p.x = cos(rad(angle)), p.y = sin(rad(angle));
p2.push_back(p);
}
double S1 = area(p1), S2 = area(p2);
if (sig(S1, S2) > 0)
cout << 1 << endl;
else if (sig(S1, S2) == 0)
cout << 0 << endl;
else
cout << 2 << endl;
}
}
|
#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(x) cerr << #x << "=" << static_cast<bitset<16>>(x) << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < (int)(n); i++)
#define if_range(x, y, w, h) \
if (0 <= (int)(x) && (int)(x) < (int)(w) && 0 <= (int)(y) && \
(int)(y) < (int)(h))
const int INF = 10000000;
typedef double D;
const D EPS = 1e-9;
const double PI = 3.14159;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
using namespace std;
typedef pair<int, int> P;
typedef struct {
double x, y;
} Point;
double rad(double deg) { return deg * 2 * PI / 360; }
int sig(D a, D b) {
if (a < b - EPS)
return -1;
if (a > b + EPS)
return +1;
return 0;
}
/** Problem0166 : Area of Polygon **/
double area(vector<Point> points) {
points.push_back(points[0]);
double S = 0;
for (int i = 0; i < points.size(); i++) {
S += fabs(points[i].x * points[i + 1].y - points[i + 1].x * points[i].y);
}
return S / 2;
}
int main() {
int M, N;
while (cin >> M, M) {
int angle = 0;
double S1 = 0;
rep(k, M - 1) {
int t;
cin >> t;
angle += t;
S1 += sin(rad(t));
}
S1 += sin(rad(360 - angle));
angle = 0;
cin >> N;
double S2 = 0;
rep(k, N - 1) {
int t;
cin >> t;
angle += t;
S2 += sin(rad(t));
}
S2 += sin(rad(360 - angle));
if (sig(S1, S2) > 0)
cout << 1 << endl;
else if (sig(S1, S2) == 0)
cout << 0 << endl;
else
cout << 2 << endl;
}
}
|
[["-", 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, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 9, 0, 43, 39, 78], ["-", 0, 52, 8, 9, 0, 9, 0, 43, 49, 22], ["-", 0, 52, 8, 9, 0, 9, 0, 43, 0, 35], ["-", 0, 1, 0, 34, 31, 11, 31, 118, 28, 22], ["-", 0, 1, 0, 34, 31, 11, 31, 118, 17, 131], ["-", 0, 1, 0, 34, 31, 11, 31, 118, 119, 120], ["-", 0, 9, 0, 1, 0, 34, 31, 11, 17, 32], ["-", 0, 1, 0, 34, 31, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 9, 0, 1, 0, 34, 0, 21], ["-", 0, 1, 0, 34, 12, 11, 31, 118, 28, 22], ["-", 0, 1, 0, 34, 12, 11, 31, 118, 17, 131], ["-", 0, 1, 0, 34, 12, 11, 31, 118, 119, 120], ["-", 0, 9, 0, 1, 0, 34, 12, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["-", 0, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["-", 0, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 52, 8, 9, 0, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 9, 0, 46], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 8, 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, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25]]
| 1
| 501
|
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)
except:break
|
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)
except:break
|
[["-", 31, 652, 3, 4, 0, 658, 8, 657, 17, 85], ["-", 31, 652, 3, 4, 0, 658, 8, 657, 12, 612]]
| 5
| 143
|
#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];
u[j] = u[j + 1];
u[j + 1] = sum;
cnt++;
}
}
}
printf("%d\n", cnt);
}
return 0;
}
|
#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];
u[j] = u[j + 1];
u[j + 1] = sum;
cnt++;
}
}
}
printf("%d\n", cnt);
}
return 0;
}
|
[["+", 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
|
#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");
}
insertedData = (int *)malloc(sizeof(int) * arraySize);
for (int i = 0; i < arraySize; i++)
scanf("%d", &insertedData[i]);
int result = bubbleSort(insertedData, arraySize);
//結果出力
printf("%d", result);
free(insertedData);
}
printf("%d");
return 0;
}
int bubbleSort(int array[], int n) {
int counter = 0;
int flag = 1;
while (flag == 1) {
flag = 0;
for (int i = 0; i < n - 1; i++) {
if (array[i] > array[i + 1]) {
flag = array[i];
array[i] = array[i + 1];
array[i + 1] = flag;
flag = 1;
counter++;
}
}
}
return counter;
}
|
#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");
}
insertedData = (int *)malloc(sizeof(int) * arraySize);
for (int i = 0; i < arraySize; i++)
scanf("%d", &insertedData[i]);
int result = bubbleSort(insertedData, arraySize);
//結果出力
printf("%d", result);
free(insertedData);
}
printf("\n");
return 0;
}
int bubbleSort(int array[], int n) {
int counter = 0;
int flag = 1;
while (flag == 1) {
flag = 0;
for (int i = 0; i < n - 1; i++) {
if (array[i] > array[i + 1]) {
flag = array[i];
array[i] = array[i + 1];
array[i + 1] = flag;
flag = 1;
counter++;
}
}
}
return counter;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 264
|
#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 (a[j] > a[j + 1])
c += swap(a + j, a + j + 1);
printf("%d\n", c);
}
return 0;
}
|
#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++)
if (a[j] > a[j + 1])
c += swap(a + j, a + j + 1);
printf("%d\n", c);
}
return 0;
}
|
[["+", 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
|
#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] > dataset[j + 1]) {
tmp = dataset[j];
dataset[j] = dataset[j + 1];
dataset[j + 1] = tmp;
count++;
}
}
}
printf("[%d]\n", count);
}
return 0;
}
|
#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] > dataset[j + 1]) {
tmp = dataset[j];
dataset[j] = dataset[j + 1];
dataset[j + 1] = tmp;
count++;
}
}
}
printf("%d\n", count);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 166
|
#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++) {
if (box[j] > box[j + 1]) {
tmp = box[j];
box[j] = box[j + 1];
box[j + 1] = tmp;
count++;
}
}
}
printf("%d/n", count);
}
return (0);
}
|
#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++) {
if (box[j] > box[j + 1]) {
tmp = box[j];
box[j] = box[j + 1];
box[j + 1] = tmp;
count++;
}
}
}
printf("%d\n", count);
}
return (0);
}
|
[["-", 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
|
#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);
printf("%d\n", change);
}
return 0;
}
int bubble_sort(int *a, int n, int change) {
int i, j, tmp;
int n2;
n2 = n;
for (j = 1; j < n; j++) {
for (i = 0; i < n2 - 1; i++) {
if (a[i] >= a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
change++;
}
}
n2--;
}
return 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);
printf("%d\n", change);
}
return 0;
}
int bubble_sort(int *a, int n, int change) {
int i, j, tmp;
int n2;
n2 = n;
for (j = 1; j < n; j++) {
for (i = 0; i < n2 - 1; i++) {
if (a[i] > a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
change++;
}
}
n2--;
}
return change;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]]
| 0
| 237
|
#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 << endl;
}
}
|
#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++;
}
}
cout << sum << endl;
}
}
|
[["-", 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, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 117
|
#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; i++)
for (int j = 0; j < n - 1; j++)
if (a[j] < a[j + 1]) {
swap(a[j], a[j + 1]);
ans++;
}
printf("%d\n", ans);
}
}
|
#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; i++)
for (int j = 0; j < n - 1; j++)
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
ans++;
}
printf("%d\n", ans);
}
}
|
[["-", 8, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 7, 8, 57, 15, 339, 51, 16, 17, 47]]
| 1
| 183
|
#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++) {
if (t[j] > t[j + 1]) {
ans++;
swap(t[j], t[j + 1]);
}
}
}
cout << ans << endl;
}
return 0;
}
|
#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++) {
if (t[j] > t[j + 1]) {
ans++;
swap(t[j], t[j + 1]);
}
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 153
|
#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 <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T> T RoundOff(T a) { return int(a + .5 - (a < 0)); }
template <class T, class C> void chmax(T &a, C b) {
if (a < b)
a = b;
}
template <class T, class C> void chmin(T &a, C b) {
if (b < a)
a = b;
}
template <class T, class C> pair<T, C> mp(T a, C b) { return make_pair(a, b); }
int main() {
for (int n; cin >> n && n;) {
int res = 0;
vint v(n);
rep(i, n) cin >> v[i];
for (int j = n - 1; 0 < j; j--)
for (int i = 0; i < j; i++) {
if (v[i] > v[i + 1]) {
swap(v[i], v[i - 1]);
res++;
}
}
cout << res << endl;
}
}
|
#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 <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T> T RoundOff(T a) { return int(a + .5 - (a < 0)); }
template <class T, class C> void chmax(T &a, C b) {
if (a < b)
a = b;
}
template <class T, class C> void chmin(T &a, C b) {
if (b < a)
a = b;
}
template <class T, class C> pair<T, C> mp(T a, C b) { return make_pair(a, b); }
int main() {
for (int n; cin >> n && n;) {
int res = 0;
vint v(n);
rep(i, n) cin >> v[i];
for (int j = n - 1; 0 < j; j--)
for (int i = 0; i < j; i++) {
if (v[i] > v[i + 1]) {
swap(v[i], v[i + 1]);
res++;
}
}
cout << res << endl;
}
}
|
[["+", 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
|
#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 (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
ans++;
}
}
}
printf("%d\n", ans);
}
return 0;
}
|
#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++) {
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
ans++;
}
}
}
printf("%d\n", ans);
}
return 0;
}
|
[["-", 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
|
#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 <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef unsigned long long ull;
const int INF = (int)1e8;
int main() {
int n;
while (cin >> n, n) {
vector<int> v(n);
FOR(i, n) cin >> v[i];
int ans = 0;
FOR(i, n) for (int j = i; j + 1 < n; j++) {
if (v[j] > v[j + 1]) {
swap(v[j], v[j + 1]);
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#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 <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef unsigned long long ull;
const int INF = (int)1e8;
int main() {
int n;
while (cin >> n, n) {
vector<int> v(n);
FOR(i, n) cin >> v[i];
int ans = 0;
FOR(i, n) for (int j = 0; j + 1 < n - i; j++) {
if (v[j] > v[j + 1]) {
swap(v[j], v[j + 1]);
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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
|
#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++) {
if (list[j] > list[j + 1]) {
swap(list[j], list[j + 1]);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#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++) {
if (list[j] > list[j + 1]) {
swap(list[j], list[j + 1]);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]]
| 1
| 145
|
#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) / 2;
marge_count(s, m);
marge_count(m, g);
int p = s, q = m, r = s;
while (p < m && q < g) {
if (a[p] < a[q]) {
t[r++] = a[p++];
} else {
t[r++] = a[q++];
ans += m - p;
}
}
if (p < m) {
while (p < m)
t[r++] = a[p++];
} else {
while (q < g) {
t[r++] = a[q++];
}
}
if (r != g)
cout << "error" << endl;
for (int i = s; i < g; i++) {
a[i] = t[i];
}
}
int n;
int main() {
while (cin >> n && n) {
ans = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
marge_count(0, n);
// for(int i=0;i<n;i++)cout<<" "<<a[i];
// cout<<endl;
cout << ans << endl;
}
return 0;
}
|
#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) / 2;
marge_count(s, m);
marge_count(m, g);
int p = s, q = m, r = s;
while (p < m && q < g) {
if (a[p] <= a[q]) {
t[r++] = a[p++];
} else {
t[r++] = a[q++];
ans += m - p;
}
}
if (p < m) {
while (p < m)
t[r++] = a[p++];
} else {
while (q < g) {
t[r++] = a[q++];
}
}
if (r != g)
cout << "error" << endl;
for (int i = s; i < g; i++) {
a[i] = t[i];
}
}
int n;
int main() {
while (cin >> n && n) {
ans = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
marge_count(0, n);
// for(int i=0;i<n;i++)cout<<" "<<a[i];
// cout<<endl;
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]]
| 1
| 345
|
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
|
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
|
#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[3] = 4;
for (i = 4; i < 31; i++)
kai[i] = kai[i - 3] + kai[i - 2] + kai[i - 1];
return kai[n];
}
|
#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;
kai[3] = 4;
for (i = 4; i < 31; i++)
kai[i] = kai[i - 3] + kai[i - 2] + kai[i - 1];
return kai[n];
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 0
| 170
|
#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)
dp[i][j] += dp[i - 1][j + k];
}
for (i = 0; i < n; i++)
r += dp[i][n - 1];
printf("%d\n", r / 3650 + (r % 3650 ? 1 : 0));
}
return 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)
dp[i][j] += dp[i - 1][j + k];
}
for (i = 0; i < n; i++)
r += dp[i][n - 1];
printf("%d\n", r / 3650 + (r % 3650 ? 1 : 0));
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]]
| 0
| 208
|
#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;
}
if (x % 5 == 0) {
x /= 5;
}
if (x == 1) {
cnt++;
}
}
printf("%d\n", cnt);
}
return (0);
}
|
#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;
}
while (x % 5 == 0) {
x /= 5;
}
if (x == 1) {
cnt++;
}
}
printf("%d\n", cnt);
}
return (0);
}
|
[["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89]]
| 0
| 143
|
#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
|
#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++) {
for (j = 0; pow(2, i) * pow(3, j) <= num; j++) {
for (k = 0; pow(2, i) * pow(3, j) * pow(5, k) <= num; k++) {
count++;
}
}
}
return count;
}
|
#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++) {
for (j = 0; pow(2, i) * pow(3, j) <= num; j++) {
for (k = 0; pow(2, i) * pow(3, j) * pow(5, k) <= num; k++) {
count++;
}
}
}
return count;
}
|
[["-", 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
|
#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 < 10000001; i *= 3) {
f[i] = true;
}
for (int i = 5; i < 10000001; i *= 5) {
f[i] = true;
}
for (int i = 2; i < 10000001; i++) {
if (f[i] == true) {
for (int j = i; j < 10000001; j *= 5)
f[j] = true;
for (int j = i; j < 10000001; j *= 3)
f[j] = true;
for (int j = i; j < 10000001; j *= 2)
f[j] = true;
}
}
int a, b;
while (1) {
int ans = 0;
cin >> a;
if (a == 0)
break;
cin >> b;
for (int i = a; i <= b; i++)
if (f[i] == true) {
ans++;
} // cout<<i<<endl;}
cout << ans << endl;
}
return 0;
}
|
#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 < 10000001; i *= 3) {
f[i] = true;
}
for (int i = 5; i < 10000001; i *= 5) {
f[i] = true;
}
for (int i = 2; i < 10000001; i++) {
if (f[i] == true) {
for (int j = i; j < 10000001; j *= 5)
f[j] = true;
for (int j = i; j < 10000001; j *= 3)
f[j] = true;
for (int j = i; j < 10000001; j *= 2)
f[j] = true;
}
}
int a, b;
while (1) {
int ans = 0;
cin >> a;
if (a == 0)
break;
cin >> b;
for (int i = a; i <= b; i++)
if (f[i] == true) {
ans++;
} // cout<<i<<endl;}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13]]
| 1
| 285
|
#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[]) {
while (true) {
int m;
cin >> m;
if (m == 0) {
break;
}
int n;
cin >> n;
int count = 0;
for (int i = m; i <= n; i++) {
if (div(i)) {
count++;
}
}
cout << count;
}
return 0;
}
|
#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[]) {
while (true) {
int m;
cin >> m;
if (m == 0) {
break;
}
int n;
cin >> n;
int count = 0;
for (int i = m; i <= n; i++) {
if (div(i)) {
count++;
}
}
cout << count << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 173
|
#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) {
x[p] = 1;
}
}
}
}
while (true) {
sum = 0;
cin >> a;
if (a == 0) {
break;
}
cin >> b;
for (int i = a; i <= b; i++) {
sum += x[i];
}
cout << sum << endl;
}
}
|
#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 < 2000000) {
x[p] = 1;
}
}
}
}
while (true) {
sum = 0;
cin >> a;
if (a == 0) {
break;
}
cin >> b;
for (int i = a; i <= b; i++) {
sum += x[i];
}
cout << sum << endl;
}
}
|
[["-", 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
|
#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;
if (i == 1)
hamming[j] = true;
}
int m, n;
while (1) {
cin >> m;
if (m == 0)
break;
cin >> n;
int count = 0;
for (int i = m; i <= n; i++)
if (hamming[i])
count++;
cout << count << endl;
}
return 0;
}
|
#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;
if (i == 1)
hamming[j] = true;
}
int m, n;
while (1) {
cin >> m;
if (m == 0)
break;
cin >> n;
int count = 0;
for (int i = m; i <= n; i++)
if (hamming[i])
count++;
cout << count << endl;
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]]
| 1
| 171
|
#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;
if (i * 3 < MAX_N)
table[i * 3] = true;
if (i * 5 < MAX_N)
table[i * 5] = true;
}
}
while (cin >> n >> m, n && m) {
int ans = 0;
for (int i = n; i <= m; i++) {
if (table[i]) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#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 * 2] = true;
if (i * 3 < MAX_N)
table[i * 3] = true;
if (i * 5 < MAX_N)
table[i * 5] = true;
}
}
while (cin >> n >> m, n && m) {
int ans = 0;
for (int i = n; i <= m; i++) {
if (table[i]) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
[["+", 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
|
#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 / 3;
while (a % 5 == 0)
a = a / 5;
if (a == 1)
cnt++;
}
cout << cnt << endl;
cnt = 0;
}
}
|
#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 / 3;
while (a % 5 == 0)
a = a / 5;
if (a == 1)
cnt++;
}
cout << cnt << endl;
cnt = 0;
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 141
|
#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 f(int n) {
if (~dp[n])
return dp[n];
int ans = 0;
if (n % 2 == 0)
ans |= f(n / 2);
else if (n % 3 == 0)
ans |= f(n / 3);
else if (n % 5 == 0)
ans |= f(n / 5);
return dp[n] = ans;
}
int main() {
int m, n;
for (int i = 0; i <= 1000000; i++)
dp[i] = -1;
dp[1] = 1;
for (int i = 1000000; i >= 1; i++)
f(i);
while (cin >> m && m) {
cin >> n;
int ans = 0;
for (int i = m; i <= n; i++)
ans += dp[i];
cout << ans << endl;
}
return 0;
}
|
#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 f(int n) {
if (~dp[n])
return dp[n];
int ans = 0;
if (n % 2 == 0)
ans |= f(n / 2);
else if (n % 3 == 0)
ans |= f(n / 3);
else if (n % 5 == 0)
ans |= f(n / 5);
return dp[n] = ans;
}
int main() {
int m, n;
for (int i = 0; i <= 1000000; i++)
dp[i] = -1;
dp[1] = 1;
for (int i = 1000000; i >= 1; i--)
f(i);
while (cin >> m && m) {
cin >> n;
int ans = 0;
for (int i = m; i <= n; i++)
ans += dp[i];
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 68]]
| 1
| 209
|
#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;
// cout<<i<<endl;
}
}
int cnt = 0;
for (int i = 0; i <= D; i++) {
if (flg[i])
cnt++;
ans[i] = cnt;
// cout<<ans[i]<<endl;
}
while (cin >> m, m) {
cin >> n;
cout << ans[n] - ans[m - 1] << endl;
}
}
|
#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] = true;
// cout<<i<<endl;
}
}
int cnt = 0;
for (int i = 0; i <= D; i++) {
if (flg[i])
cnt++;
ans[i] = cnt;
// cout<<ans[i]<<endl;
}
while (cin >> m, m) {
cin >> n;
cout << ans[n] - ans[m - 1] << endl;
}
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]]
| 1
| 185
|
#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, 0, 0, 0, 0, 0, 600, 1150},
{0, 1, 0, 0, 0, 0, 0, 500},
{0, 1, 1, 1, 1, 0, 0, 0}};
int n, m, ih, it, oh, ot;
int p = 0;
while (1) {
scanf("%d", &n);
if (!n)
break;
scanf("%d %d %d %d %d", &ih, &it, &m, &oh, &ot);
if (n > m) {
p = n;
n = m;
m = p;
}
p = d[n][m];
it += 60 * ih;
ot += 60 * oh;
if (d[m][n] == 0 && ((17 * 60 + 30 <= it && it <= 19 * 60 + 30) ||
17 * 60 + 30 <= ot && ot <= 19 * 60 + 30))
p /= 2;
if (p % 50)
p += 25;
printf("%d\n", p);
}
return 0;
}
|
#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, 0, 0, 0, 0, 0, 600, 1150},
{0, 1, 0, 0, 0, 0, 0, 500},
{0, 1, 1, 1, 0, 0, 0, 0}};
int n, m, ih, it, oh, ot;
int p = 0;
while (1) {
scanf("%d", &n);
if (!n)
break;
scanf("%d %d %d %d %d", &ih, &it, &m, &oh, &ot);
if (n > m) {
p = n;
n = m;
m = p;
}
p = d[n][m];
it += 60 * ih;
ot += 60 * oh;
if (d[m][n] == 0 && ((17 * 60 + 30 <= it && it <= 19 * 60 + 30) ||
17 * 60 + 30 <= ot && ot <= 19 * 60 + 30))
p /= 2;
if (p % 50)
p += 25;
printf("%d\n", p);
}
return 0;
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]]
| 0
| 344
|
#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},
{58, 52, 45, 40, 35, 15, 0}};
void swap(int *x, int *y) {
int z;
z = *x;
*x = *y;
*y = z;
}
int main() {
while (scanf("%d", &x) * x) {
scanf("%d %d %d %d %d", &h1, &h2, &y, &h2, &m2);
if (x > y)
swap(&x, &y);
x--;
y--;
t1 = h1 * 60 + m1;
t2 = h2 * 60 + m2;
if (table[y][x] <= 41 && ((17 * 60 + 30 <= t1 && t1 <= 19 * 60 + 30) ||
(17 * 60 + 30 <= t2 && t2 <= 19 * 60 + 30)))
printf("%d\n", (table[x][y] / 2 + table[x][y] % 2) * 50);
else
printf("%d\n", table[x][y] * 50);
}
return 0;
}
|
#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},
{58, 52, 45, 40, 35, 15, 0}};
void swap(int *x, int *y) {
int z;
z = *x;
*x = *y;
*y = z;
}
int main() {
while (scanf("%d", &x) * x) {
scanf("%d %d %d %d %d", &h1, &m1, &y, &h2, &m2);
if (x > y)
swap(&x, &y);
x--;
y--;
t1 = h1 * 60 + m1;
t2 = h2 * 60 + m2;
if (table[y][x] <= 40 && ((17 * 60 + 30 <= t1 && t1 <= 19 * 60 + 30) ||
(17 * 60 + 30 <= t2 && t2 <= 19 * 60 + 30)))
printf("%d\n", (table[x][y] / 2 + table[x][y] % 2) * 50);
else
printf("%d\n", table[x][y] * 50);
}
return 0;
}
|
[["-", 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
|
#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},
{1350, 1150, 1000, 850, 600, 0, 500},
{1650, 1500, 1350, 1300, 1150, 500, 0},
};
int main() {
int s, g;
while (cin >> s, s) {
int h, m;
bool half = false;
cin >> h >> m;
if (17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 18 * 60 + 30)
half = true;
cin >> g >> h >> m;
if (17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 18 * 60 + 30)
half = true;
half &= abs(dist[s - 1] - dist[g - 1]) <= 40;
if (half)
cout << ((cost[s - 1][g - 1] / 50) + 1) / 2 * 50 << endl;
else
cout << cost[s - 1][g - 1] << endl;
}
}
|
#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},
{1350, 1150, 1000, 850, 600, 0, 500},
{1650, 1500, 1350, 1300, 1150, 500, 0},
};
int main() {
int s, g;
while (cin >> s, s) {
int h, m;
bool half = false;
cin >> h >> m;
if (17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 19 * 60 + 30)
half = true;
cin >> g >> h >> m;
if (17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 19 * 60 + 30)
half = true;
half &= abs(dist[s - 1] - dist[g - 1]) <= 40;
if (half)
cout << ((cost[s - 1][g - 1] / 50) + 1) / 2 * 50 << endl;
else
cout << cost[s - 1][g - 1] << endl;
}
}
|
[["-", 51, 16, 12, 16, 12, 16, 31, 16, 31, 13], ["+", 51, 16, 12, 16, 12, 16, 31, 16, 31, 13]]
| 1
| 327
|
#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}};
const int B = 17 * 60 + 30, E = 19 * 60 + 30;
int main() {
int id1, h1, m1;
int id2, h2, m2;
while (scanf("%d", &id1), id1) {
scanf("%d %d %d %d %d", &h1, &m1, &id2, &h2, &m2);
if (id1 > id2)
swap(id1, id2);
int t1 = h1 * 60 + m1;
int t2 = h2 * 60 + m2;
--id1;
--id2;
int v = t[id1][id2];
int l = t[id2][id1];
bool f = true;
if (l > 40)
f = false;
if ((B <= t1 && t1 <= E) || (B <= t2 && t2 <= E)) {
v /= 2;
int f = !!(v % 50);
v = v / 50 * 50 + f * 50;
}
printf("%d\n", v);
}
return 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}};
const int B = 17 * 60 + 30, E = 19 * 60 + 30;
int main() {
int id1, h1, m1;
int id2, h2, m2;
while (scanf("%d", &id1), id1) {
scanf("%d %d %d %d %d", &h1, &m1, &id2, &h2, &m2);
if (id1 > id2)
swap(id1, id2);
int t1 = h1 * 60 + m1;
int t2 = h2 * 60 + m2;
--id1;
--id2;
int v = t[id1][id2];
int l = t[id2][id1];
bool f = true;
if (l > 40)
f = false;
if (((B <= t1 && t1 <= E) || (B <= t2 && t2 <= E)) && f) {
v /= 2;
int f = !!(v % 50);
v = v / 50 * 50 + f * 50;
}
printf("%d\n", v);
}
return 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
|
#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 << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((n))
#define scout(n) cout << setw(n)
#define vary(type, name, size, init) vector<type> name(size, init)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define repi(it, array) \
for (auto it = array.begin(), end = array.end(); it != end; ++it)
#define repa(n, array) for (auto &n : (array))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string, int>;
using pii = pair<int, int>;
constexpr int imax = ((1 << 30) - 1) * 2 + 1;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0);
double eps = 1e-10;
const int dy[] = {-1, 0, 1, 0};
const int dx[] = {0, -1, 0, 1};
inline bool value(int x, int y, int w, int h) {
return (x >= 0 && x < w && y >= 0 && y < h);
}
template <typename T> void Unique(vector<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
template <typename T> T ston(string &str, T n) {
istringstream sin(str);
T num;
sin >> num;
return num;
}
void Ans(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int calc(int p) {
if (p % 50) {
p += 50 - p % 50;
}
return p;
}
const int colum[7][7] = {{0, 6, 13, 18, 23, 43, 58},
{300, 0, 7, 12, 17, 37, 52},
{500, 350, 0, 5, 25, 40},
{600, 450, 250, 0, 5, 25, 40},
{700, 600, 400, 250, 0, 20, 35},
{1350, 1150, 1000, 850, 600, 0, 15},
{1650, 1500, 1350, 1300, 1150, 500, 0}};
bool check(int h1, int m1) {
if ((h1 == 17 && m1 >= 30) || (17 < h1 && h1 < 19) ||
(h1 == 19 && m1 <= 30)) {
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int dt, at, h1, m1, h2, m2;
while (cin >> dt && dt) {
cin >> h1 >> m1 >> at >> h2 >> m2;
--dt, --at;
if (at < dt) {
swap(at, dt);
}
int price = colum[at][dt];
if ((check(h1, m1) || check(h2, m2)) && colum[dt][at] <= 40) {
price /= 2;
price = calc(price);
}
cout << price << endl;
}
return 0;
}
|
#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 << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((n))
#define scout(n) cout << setw(n)
#define vary(type, name, size, init) vector<type> name(size, init)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define repi(it, array) \
for (auto it = array.begin(), end = array.end(); it != end; ++it)
#define repa(n, array) for (auto &n : (array))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string, int>;
using pii = pair<int, int>;
constexpr int imax = ((1 << 30) - 1) * 2 + 1;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0);
double eps = 1e-10;
const int dy[] = {-1, 0, 1, 0};
const int dx[] = {0, -1, 0, 1};
inline bool value(int x, int y, int w, int h) {
return (x >= 0 && x < w && y >= 0 && y < h);
}
template <typename T> void Unique(vector<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
template <typename T> T ston(string &str, T n) {
istringstream sin(str);
T num;
sin >> num;
return num;
}
void Ans(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int calc(int p) {
if (p % 50) {
p += 50 - p % 50;
}
return p;
}
const int colum[7][7] = {{0, 6, 13, 18, 23, 43, 58},
{300, 0, 7, 12, 17, 37, 52},
{500, 350, 0, 5, 10, 30, 45},
{600, 450, 250, 0, 5, 25, 40},
{700, 600, 400, 250, 0, 20, 35},
{1350, 1150, 1000, 850, 600, 0, 15},
{1650, 1500, 1350, 1300, 1150, 500, 0}};
bool check(int h1, int m1) {
if ((h1 == 17 && m1 >= 30) || (17 < h1 && h1 < 19) ||
(h1 == 19 && m1 <= 30)) {
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int dt, at, h1, m1, h2, m2;
while (cin >> dt && dt) {
cin >> h1 >> m1 >> at >> h2 >> m2;
--dt, --at;
if (at < dt) {
swap(at, dt);
}
int price = colum[at][dt];
if ((check(h1, m1) || check(h2, m2)) && colum[dt][at] <= 40) {
price /= 2;
price = calc(price);
}
cout << price << endl;
}
return 0;
}
|
[["-", 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
|
#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, 45, 40, 35, 15, 0}};
int b;
while (cin >> b, b) {
int c, d, e, f, g;
scanf("%d%d%d%d%d", &c, &d, &e, &f, &g);
c = c * 60 + d;
f = f * 60 + g;
if (c >= 1050 && c <= 1170 || f >= 1050 && f <= 1170) {
if (a[max(b, e) - 1][min(b, e) - 1] <= 40) {
int o = a[min(b, e) - 1][max(b, e) - 1];
if (o % 50)
o += 50 - o % 50;
printf("%d\n", o);
} else
printf("%d\n", a[min(b, e) - 1][max(b, e) - 1]);
} else
printf("%d\n", a[min(b, e) - 1][max(b, e) - 1]);
}
}
|
#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, 45, 40, 35, 15, 0}};
int b;
while (cin >> b, b) {
int c, d, e, f, g;
scanf("%d%d%d%d%d", &c, &d, &e, &f, &g);
c = c * 60 + d;
f = f * 60 + g;
if (c >= 1050 && c <= 1170 || f >= 1050 && f <= 1170) {
if (a[max(b, e) - 1][min(b, e) - 1] <= 40) {
int o = a[min(b, e) - 1][max(b, e) - 1] / 2;
if (o % 50)
o += 50 - o % 50;
printf("%d\n", o);
} else
printf("%d\n", a[min(b, e) - 1][max(b, e) - 1]);
} else
printf("%d\n", a[min(b, e) - 1][max(b, e) - 1]);
}
}
|
[["+", 64, 9, 0, 43, 49, 50, 51, 16, 17, 85], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 12, 13]]
| 1
| 356
|
#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},
{0, 18, 12, 5, 0, 250, 850, 1300},
{0, 23, 17, 10, 5, 0, 600, 1150},
{0, 43, 37, 30, 25, 20, 0, 500},
{0, 58, 52, 45, 40, 35, 15, 0}};
while (1) {
int s, g;
int sh, sm, gh, gm;
cin >> s;
if (s == 0)
break;
cin >> sh >> sm;
cin >> g;
cin >> gh >> gm;
int temp;
if (s > g) {
temp = s;
s = g;
g = temp;
}
bool half = false;
if (m(sh, sm) >= m(17, 30) && m(sh, sm) <= m(19, 30) && base[g][s] <= 40) {
half = true;
} else if (m(gh, gm) >= m(17, 30) && m(gh, gm) <= m(19, 30) &&
base[g][s] <= 40) {
half = true;
}
if (half) {
temp = (base[s][g] / 2 + 50) / 50 * 50;
cout << temp << endl;
} else {
cout << base[s][g] << endl;
}
}
return 0;
}
|
#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},
{0, 18, 12, 5, 0, 250, 850, 1300},
{0, 23, 17, 10, 5, 0, 600, 1150},
{0, 43, 37, 30, 25, 20, 0, 500},
{0, 58, 52, 45, 40, 35, 15, 0}};
while (1) {
int s, g;
int sh, sm, gh, gm;
cin >> s;
if (s == 0)
break;
cin >> sh >> sm;
cin >> g;
cin >> gh >> gm;
int temp;
if (s > g) {
temp = s;
s = g;
g = temp;
}
bool half = false;
if (m(sh, sm) >= m(17, 30) && m(sh, sm) <= m(19, 30) && base[g][s] <= 40) {
half = true;
} else if (m(gh, gm) >= m(17, 30) && m(gh, gm) <= m(19, 30) &&
base[g][s] <= 40) {
half = true;
}
if (half) {
temp = (base[s][g] / 2 + 49) / 50 * 50;
cout << temp << endl;
} else {
cout << base[s][g] << endl;
}
}
return 0;
}
|
[["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 404
|
#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) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1 << 30
int main() {
int table[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, 10, 5, 0, 500},
{58, 52, 45, 40, 35, 15, 0}};
int ss = 17 * 60 + 30;
int tt = 19 * 60 + 30;
int s, sh, sm, t, th, tm;
while (cin >> s, s) {
cin >> sh >> sm >> t >> th >> tm;
s--;
t--;
if (s > t)
swap(s, t);
int ans = table[s][t];
int sss = sh * 60 + sm;
int ttt = th * 60 + tm;
if (table[t][s] <= 40) {
if (ss <= sss && sss <= tt || ss <= ttt && ttt <= tt) {
ans /= 2;
ans = (ans + 49) / 50 * 50;
}
}
cout << ans << endl;
}
}
|
#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) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1 << 30
int main() {
int table[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}};
int ss = 17 * 60 + 30;
int tt = 19 * 60 + 30;
int s, sh, sm, t, th, tm;
while (cin >> s, s) {
cin >> sh >> sm >> t >> th >> tm;
s--;
t--;
if (s > t)
swap(s, t);
int ans = table[s][t];
int sss = sh * 60 + sm;
int ttt = th * 60 + tm;
if (table[t][s] <= 40) {
if (ss <= sss && sss <= tt || ss <= ttt && ttt <= tt) {
ans /= 2;
ans = (ans + 49) / 50 * 50;
}
}
cout << ans << endl;
}
}
|
[["-", 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
|
#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> // require freopen
#include <functional>
#include <iomanip> // require setw
#include <iostream>
#include <limits>
#include <map>
#include <numeric> // require accumulate
#include <queue>
#include <set>
#include <sstream> // require stringstream
#include <stack>
#include <stdint.h> // require uint64_t
#include <string>
#include <vector>
using namespace std;
int main() {
int price[][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},
{0, 0, 0, 0, 0, 600, 1150},
{0, 0, 0, 0, 0, 0, 500},
{0, 0, 0, 0, 0, 0, 0}};
int dist[][7] = {{0, 0, 0, 0, 0, 0, 0}, {6, 0, 0, 0, 0, 0, 0},
{13, 7, 0, 0, 0, 0, 0}, {18, 12, 5, 0, 0, 0, 0},
{23, 17, 10, 5, 0, 0, 0}, {43, 37, 30, 25, 20, 0, 0},
{58, 52, 45, 40, 35, 15, 0}};
for (int i = 0; i < 7; ++i) {
for (int j = 0; j < 7; ++j) {
if (i != j) {
if (price[i][j] == 0) {
price[i][j] = price[j][i];
} // end if
if (dist[i][j] == 0) {
dist[i][j] = dist[j][i];
} // end if
} // end if
} // en for
} // end for
// cut here before submit
// freopen ("testcase.highwaytoll", "r", stdin );
int from;
while (cin >> from && from) {
int fromh, fromm;
cin >> fromh >> fromm;
int to, toh, tom;
cin >> to >> toh >> tom;
from--;
to--;
int res = 0;
int em = fromh * 60 + fromm;
int dm = toh * 60 + tom;
// ツ環暗クツ妥篠湘崢づ個篠楪甘板妥堕づづ債づ按つ「
// if (em < 17*60 + 30 && dm > 19*60 + 30 ){
if ((17 * 60 + 30 <= em && em <= 19 * 60 + 30) ||
(17 * 60 + 30 <= dm && dm <= 19 * 60 + 30)) {
int d = dist[from][to];
if (d > 40) {
res = price[from][to];
} else {
res = (price[from][to] / 2 + 50) / 50 * 50;
} // end if
} else {
res = price[from][to];
} // end if
cout << res << endl;
} // end loop
return 0;
}
|
#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> // require freopen
#include <functional>
#include <iomanip> // require setw
#include <iostream>
#include <limits>
#include <map>
#include <numeric> // require accumulate
#include <queue>
#include <set>
#include <sstream> // require stringstream
#include <stack>
#include <stdint.h> // require uint64_t
#include <string>
#include <vector>
using namespace std;
int main() {
int price[][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},
{0, 0, 0, 0, 0, 600, 1150},
{0, 0, 0, 0, 0, 0, 500},
{0, 0, 0, 0, 0, 0, 0}};
int dist[][7] = {{0, 0, 0, 0, 0, 0, 0}, {6, 0, 0, 0, 0, 0, 0},
{13, 7, 0, 0, 0, 0, 0}, {18, 12, 5, 0, 0, 0, 0},
{23, 17, 10, 5, 0, 0, 0}, {43, 37, 30, 25, 20, 0, 0},
{58, 52, 45, 40, 35, 15, 0}};
for (int i = 0; i < 7; ++i) {
for (int j = 0; j < 7; ++j) {
if (i != j) {
if (price[i][j] == 0) {
price[i][j] = price[j][i];
} // end if
if (dist[i][j] == 0) {
dist[i][j] = dist[j][i];
} // end if
} // end if
} // en for
} // end for
// cut here before submit
// freopen ("testcase.highwaytoll", "r", stdin );
int from;
while (cin >> from && from) {
int fromh, fromm;
cin >> fromh >> fromm;
int to, toh, tom;
cin >> to >> toh >> tom;
from--;
to--;
int res = 0;
int em = fromh * 60 + fromm;
int dm = toh * 60 + tom;
// ツ環暗クツ妥篠湘崢づ個篠楪甘板妥堕づづ債づ按つ「
// if (em < 17*60 + 30 && dm > 19*60 + 30 ){
if ((17 * 60 + 30 <= em && em <= 19 * 60 + 30) ||
(17 * 60 + 30 <= dm && dm <= 19 * 60 + 30)) {
int d = dist[from][to];
if (d > 40) {
res = price[from][to];
} else {
res = (price[from][to] / 2 + 49) / 50 * 50;
} // end if
} else {
res = price[from][to];
} // end if
cout << res << endl;
} // end loop
return 0;
}
|
[["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 604
|
#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, 5, 0, 600, 1150},
{0, 43, 37, 30, 25, 20, 0, 500},
{0, 58, 52, 45, 40, 35, 15, 0}};
int l, lh, lm, a, ah, am;
int main() {
while (true) {
cin >> l;
if (!l)
return 0;
cin >> lh >> lm;
lm += lh * 100;
cin >> a;
cin >> ah >> am;
am += ah * 100;
if (cost[max(l, a)][min(l, a)] > 40)
cout << cost[min(l, a)][max(l, a)] << endl;
else if ((lm >= 1730 && lm <= 1930) || (am >= 1730 && am <= 1930)) {
bool flag = false;
if ((cost[min(l, a)][max(l, a)] / 2) % 50)
flag = true;
int ans = cost[min(l, a)][max(l, a)] / 2 -
((cost[min(l, a)][max(l, a)] / 2) % 50);
if (flag)
ans += 50;
cout << ans << endl;
} else
cout << cost[min(l, a)][max(l, a)] << endl;
}
}
|
#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, 5, 0, 600, 1150},
{0, 43, 37, 30, 25, 20, 0, 500},
{0, 58, 52, 45, 40, 35, 15, 0}};
int l, lh, lm, a, ah, am;
int main() {
while (true) {
cin >> l;
if (!l)
return 0;
cin >> lh >> lm;
lm += lh * 100;
cin >> a;
cin >> ah >> am;
am += ah * 100;
if (cost[max(l, a)][min(l, a)] > 40)
cout << cost[min(l, a)][max(l, a)] << endl;
else if ((lm >= 1730 && lm <= 1930) || (am >= 1730 && am <= 1930)) {
bool flag = false;
if ((cost[min(l, a)][max(l, a)] / 2) % 50)
flag = true;
int ans = cost[min(l, a)][max(l, a)] / 2 -
((cost[min(l, a)][max(l, a)] / 2) % 50);
if (flag)
ans += 50;
cout << ans << endl;
} else
cout << cost[min(l, a)][max(l, a)] << endl;
}
}
|
[["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]]
| 1
| 401
|
#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},
{0, 0, 0, 0, 0, 600, 1150}, {0, 0, 0, 0, 0, 0, 500},
};
int in, out;
while (cin >> in, in) {
int h1, m1, h2, m2, fare;
cin >> h1 >> m1;
cin >> out;
cin >> h2 >> m2;
if (in > out) {
int tmp = in;
in = out;
in = tmp;
}
int d = D[out - 1] - D[in - 1];
int min1 = h1 * 60 + m1;
int min2 = h2 * 60 + m2;
if ((discount[0] <= min1 && min1 <= discount[1]) ||
(discount[0] <= min2 && min2 <= discount[1]) && d <= 40)
fare = (C[in - 1][out - 1] / 2 + 49) / 50 * 50;
else
fare = C[in - 1][out - 1];
cout << fare << endl;
}
return 0;
}
|
#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},
{0, 0, 0, 0, 0, 600, 1150}, {0, 0, 0, 0, 0, 0, 500},
};
int in, out;
while (cin >> in, in) {
int h1, m1, h2, m2, fare;
cin >> h1 >> m1;
cin >> out;
cin >> h2 >> m2;
if (in > out) {
int tmp = in;
in = out;
in = tmp;
}
int d = D[out - 1] - D[in - 1];
int min1 = h1 * 60 + m1, min2 = h2 * 60 + m2;
if (((discount[0] <= min1 && min1 <= discount[1]) ||
(discount[0] <= min2 && min2 <= discount[1])) &&
d <= 40)
fare = (C[in - 1][out - 1] / 2 + 49) / 50 * 50;
else
fare = C[in - 1][out - 1];
cout << fare << endl;
}
return 0;
}
|
[["-", 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
|
#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:
case 20:
return 600;
case 23:
return 700;
case 25:
return 850;
case 30:
return 1000;
case 35:
case 37:
return 1150;
case 40:
return 1300;
case 43:
case 45:
return 1350;
case 52:
return 1500;
case 58:
return 1650;
}
}
int main() {
int ic_km[8] = {
0, 0, 6, 13, 18, 23, 43, 58,
};
while (true) {
int from_num;
int from_hour, from_min;
cin >> from_num;
if (from_num == 0)
break;
cin >> from_hour >> from_min;
int from_time = from_hour * 100 + from_min;
int to_num;
int to_hour, to_min;
cin >> to_num;
cin >> to_hour >> to_min;
int to_time = to_hour * 100 + to_min;
int km_diff = abs(ic_km[to_num] - ic_km[from_num]);
int fare = km_to_yen(km_diff);
if (((1730 <= from_time && from_time <= 1930) ||
(1730 <= to_time && to_time <= 1930)) &&
(km_diff < 40)) {
fare /= 2;
if (fare % 50 != 0) {
fare = (fare / 50 + 1) * 50;
}
}
cout << fare << endl;
}
}
|
#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:
case 20:
return 600;
case 23:
return 700;
case 25:
return 850;
case 30:
return 1000;
case 35:
case 37:
return 1150;
case 40:
return 1300;
case 43:
case 45:
return 1350;
case 52:
return 1500;
case 58:
return 1650;
}
}
int main() {
int ic_km[8] = {
0, 0, 6, 13, 18, 23, 43, 58,
};
while (true) {
int from_num;
int from_hour, from_min;
cin >> from_num;
if (from_num == 0)
break;
cin >> from_hour >> from_min;
int from_time = from_hour * 100 + from_min;
int to_num;
int to_hour, to_min;
cin >> to_num;
cin >> to_hour >> to_min;
int to_time = to_hour * 100 + to_min;
int km_diff = abs(ic_km[to_num] - ic_km[from_num]);
int fare = km_to_yen(km_diff);
if (((1730 <= from_time && from_time <= 1930) ||
(1730 <= to_time && to_time <= 1930)) &&
(km_diff <= 40)) {
fare /= 2;
if (fare % 50 != 0) {
fare = (fare / 50 + 1) * 50;
}
}
cout << fare << endl;
}
}
|
[["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 18], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 19]]
| 1
| 332
|
#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, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 45, 40, 35, 15, 0}};
int sIC, sh, sm, gIC, gh, gm, smin, gmin, cost;
while (cin >> sIC && sIC) {
cin >> sh >> sm >> gIC >> gh >> gm;
smin = sh * 60 + sm;
gmin = gh * 60 + gm;
if (sIC > gIC)
swap(sIC, gIC);
cout << ((((smin >= S && smin <= G) || (gmin >= S && gmin <= G)) &&
tmp[gIC - 1][sIC - 1] <= 40)
? kiriage(tmp[sIC - 1][gIC - 1] / 2)
: tmp[sIC - 1][gIC - 1])
<< endl;
}
}
int kiriage(int cost) { return (cost % 50 == 0 ? cost : cost / 50 * 50 + 50); }
|
#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, 250, 850, 1300},
{23, 17, 10, 5, 0, 600, 1150}, {43, 37, 30, 25, 20, 0, 500},
{58, 52, 45, 40, 35, 15, 0}};
int sIC, sh, sm, gIC, gh, gm, smin, gmin, cost;
while (cin >> sIC && sIC) {
cin >> sh >> sm >> gIC >> gh >> gm;
smin = sh * 60 + sm;
gmin = gh * 60 + gm;
if (sIC > gIC)
swap(sIC, gIC);
cout << ((((smin >= S && smin <= G) || (gmin >= S && gmin <= G)) &&
tmp[gIC - 1][sIC - 1] <= 40)
? kiriage(tmp[sIC - 1][gIC - 1] / 2)
: tmp[sIC - 1][gIC - 1])
<< endl;
}
}
int kiriage(int cost) { return (cost % 50 == 0 ? cost : cost / 50 * 50 + 50); }
|
[["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]]
| 1
| 317
|
#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 << a << " " << b << endl;
}
return 0;
}
|
#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;
}
cout << a << " " << b << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 119
|
#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 (b < a)
b++;
cout << a << " " << b << endl;
}
return 0;
}
|
#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 (a < b)
b++;
cout << a << " " << b << endl;
}
return 0;
}
|
[["-", 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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.