B. Mine Sweeper II
AC代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,ans=0;cin>>n>>m;
char a[1005][1005],b[1005][1005];
for(int i=1;i <= n;i++) cin>>a[i]+1;
for(int i=1;i <= n;i++) cin>>b[i]+1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++) if(a[i][j]!=b[i][j]) ans++;
if(ans<=n*m/2){
for(int i=1;i<=n;i++) cout<<a[i]+1<<endl;
}
else{
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]=='X') cout<<".";
else cout<<"X";
}
cout<<endl;
}
}
return 0;
}
G - Fibonacci
AC代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;cin>>n;
long long ans=(n*(n-1))/2;
long long temp=n-1-n/3;
cout<<ans-(temp+1)*temp/2<<endl;
return 0;
}