题意 :
- 给a和b两个正整数,如果他们相加的过程中需要进位,输出hard,否则输出easy
思路 :
- 直接模拟
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#include <math.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
using namespace std;
using ll = long long;
typedef pair<int, int> PII;
int main()
{
cin.tie(nullptr) -> sync_with_stdio(false);
ll a, b; cin >> a >> b;
while (a > 0 && b > 0)
{
if ((a % 10) + (b % 10) > 9)
{
cout << "Hard" << endl;
return 0;
}
a /= 10, b /= 10;
}
cout << "Easy" << endl;
return 0;
}