2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)
思路:
A Exam
思路:水题
代码:
#include<bits/stdc++.h> using namespace std; int main(){ int k; scanf("%d",&k); char s1[1010],s2[1010]; scanf("%s%s",s1,s2); int same=0; int n=strlen(s1); for(int i=0;i<n;i++){ same+=s1[i]==s2[i]; } cout<<min(same,k)+min(n-same,n-k)<<endl; return 0; }