Codeforce Round #422(Div 2) B

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int main(){char a[1005],b[1005];int n,m;scanf("%d %d",&n,&m);scanf("%s %s",a,b);int t=n,p=0;   for(int i=0;i<=m-n;i++){int cnt=0;for(int j=0;j<n;j++){if(a[j]!=b[j+i])cnt++;}if(cnt<t)  {p=i;  t=cnt;}}printf("%d\n",t);int flag=0;for(int i=0;i<n;i++){if(a[i]!=b[p+i]&&flag==0) {printf("%d",i+1); flag=1;continue;}if(a[i]!=b[i+p])  printf(" %d",i+1);}printf("\n");}