zoukankan      html  css  js  c++  java
  • B

    Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though it can be very difficult from time to time. In the course of solving one of the crosswords, Leha had to solve a simple task. You are able to do it too, aren't you?

    Leha has two strings s and t. The hacker wants to change the string s at such way, that it can be found in t as a substring. All the changes should be the following: Leha chooses one position in the string s and replaces the symbol in this position with the question mark "?". The hacker is sure that the question mark in comparison can play the role of an arbitrary symbol. For example, if he gets string s="ab?b" as a result, it will appear in t="aabrbb" as a substring.

    Guaranteed that the length of the string s doesn't exceed the length of the string t. Help the hacker to replace in s as few symbols as possible so that the result of the replacements can be found in t as a substring. The symbol "?" should be considered equal to any other symbol.

    Input

    The first line contains two integers n and m (1 ≤ n ≤ m ≤ 1000) — the length of the string s and the length of the string t correspondingly.

    The second line contains n lowercase English letters — string s.

    The third line contains m lowercase English letters — string t.

    Output

    In the first line print single integer k — the minimal number of symbols that need to be replaced.

    In the second line print k distinct integers denoting the positions of symbols in the string s which need to be replaced. Print the positions in any order. If there are several solutions print any of them. The numbering of the positions begins from one.

    Examples

    Input
    3 5
    abc
    xaybz
    Output
    2
    2 3
    Input
    4 10
    abcd
    ebceabazcd
    Output
    1
    2
     1 #include<bits/stdc++.h>
     2 using namespace  std;
     3 
     4 int main() {
     5     int a,b,count;
     6     int ans = 0;
     7     int yy[1005],re[1005];
     8     char str1[1005],str2[1005];
     9     cin>>a>>b;
    10     cin>>str1;
    11     cin>>str2;
    12     queue<int>que;
    13     ans = 1009;
    14     for(int i = 0; i <= b - a; i++) {
    15         count = 0;
    16         for(int j = 0; j < a; j++) {
    17             if(str1[j] != str2[j+i]) {
    18                 yy[count] = j;
    19                 count++;
    20             }
    21         }
    22         if(count < ans) {
    23             for(int k = 0; k < count; k++) {
    24                 re[k] = yy[k];
    25             }
    26             ans = count;
    27         }
    28     }
    29     cout<<ans<<endl;
    30     for(int i = 0; i < ans; i++) {
    31         cout<<re[i]+1<<" ";
    32     }
    33     cout<<endl;
    34     return 0;
    35 }
  • 相关阅读:
    [Java]lambda表达式
    [设计模式]访问者模式
    【Java】基本数据类型
    【JavaWeb】防止表单的重复提交
    [Java]异常在项目中的使用
    Java容器-个人整理1
    【MyBatis-Spring】Mybatis和并入Spring框架
    python 正则表达式模块——re 知识点小结
    关于使用python批量操作网络设备(交换机,路由器)的知识点小结
    GitHub 基础常用命令用法
  • 原文地址:https://www.cnblogs.com/jj81/p/9123266.html
Copyright © 2011-2022 走看看