Codeforces 903B - The Modcrab 模拟+记录

模拟过程并记录

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6, maxd = 1000 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int h1, a1, c1;
int h2, a2;

string ans[maxn];

int main() {
kuaidian;

cin >> h1 >> a1 >> c1;
cin >> h2 >> a2;

int cnt = 0;
for(int i = 0; ; ++i) {
if(h2 <= 0) break;

if(a1 < h2 && h1 <= a2) {
ans[cnt++] = "HEAL";
h1 += c1;
//h2 -= a1;
h1 -= a2;
}
else {
ans[cnt++] = "STRIKE";
h1 -= a2;
h2 -= a1;
}
}
cout << cnt << endl;
for(int i = 0; i < cnt; ++i)
cout << ans[i] << endl;

return 0;
}