#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;typedeflongdouble ld;typedef pair<int,int> pii;constint maxn=1e6+5;intmain(){
ios::sync_with_stdio(0);char a[4][4]={0};int n =2;for(int i =0; i < n;i++){for(int j =0; j < n;j++){
cin >> a[i][j];}}int vis[3][3]={0};for(int i =0; i < n;i++){for(int j =0; j < n;j++){if(a[i][j]=='#')
vis[i][j]=1;}}int flag =0;for(int i =0; i < n;i++){int sum =0;for(int j =0; j < n;j++){
sum += vis[i][j];}//cout << sum << endl;if(sum>1){
flag =1;}}for(int i =0; i < n;i++){int sum =0;for(int j =0; j < n;j++){
sum += vis[j][i];}//cout << sum << endl;if(sum>1){
flag =1;}}if(!flag)
cout <<"No"<< endl;else
cout <<"Yes"<< endl;return0;}
B - Hard Calculation
题意:A+B后是否存在进位操作,有则输出Hard,反之Easy。
解析:按位加,结果>=10则为进位
#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;typedeflongdouble ld;typedef pair<int,int> pii;constint maxn=1e6+5;voidsolve(){
string a, b;int flag =0;
cin>>a>>b;for(int i =0; i <min(a.size(), b.size());i++){if(a[a.size()-1-i]-'0'+b[b.size()-1-i]-'0'>=10)
flag =1;}if(flag)
cout <<"Hard";else
cout <<"Easy";}intmain(){
ios::sync_with_stdio(0);solve();return0;}
#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;typedeflongdouble ld;typedef pair<int,int> pii;constint maxn=1e6+5;voidsolve(){
string s;
cin>>s;int n = s.size();int k;
cin >> k;int r =0, cur =0, ans =0;for(int i =0; i < n;i++){while(r<n&&s[r]=='X'||(s[r]=='.'&&cur+1<=k)){
cur+=(s[r]=='.');
r++;}
ans =max(ans, r - i);
cur -=(s[i]=='.');}
cout << ans << endl;}intmain(){
ios::sync_with_stdio(0);solve();return0;}