Codeforces 91A Newspaper Headline

A. Newspaper Headline

time limit per test：2 second

memory limit per test：256 megabytes

input：standard input

output：standard output

题目链接:https://codeforces.com/problemset/problem/91/A

A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string. After that walrus erase several letters from this string in order to get a new word s2. It is considered that when Fangy erases some letter, there's no whitespace formed instead of the letter. That is, the string remains unbroken and it still only consists of lowercase Latin letters.

For example, the heading is "abc". If we take two such headings and glue them one to the other one, we get "abcabc". If we erase the letters on positions 1 and 5, we get a word "bcac".

Which least number of newspaper headings s1 will Fangy need to glue them, erase several letters and get word s2?

Input

The input data contain two lines. The first line contain the heading s1, the second line contains the word s2. The lines only consist of lowercase Latin letters (1 ≤ |s1| ≤ 104, 1 ≤ |s2| ≤ 106).

Output

If it is impossible to get the word s2 in the above-described manner, print "-1" (without the quotes). Otherwise, print the least number of newspaper headings s1, which Fangy will need to receive the word s2.

Examples

input

abc
xyz

output

-1

input

abcd
dabc

output

2

题意

把最少n个字符串s1拼起来，得到拼接好的字符串，删去若干字符，得到字符串s2

思路

按顺序寻找字符串s2的各个字符，因为s2的各个字符的相对位置在拼接的字符串中是不变的，所以一遍一遍在s1中寻找s2的各个字符即可，记录s1被寻找了几遍，即最少需要多少字符串s1

代码

#include <iostream>
#include <cstring>
using namespace std;char s1[10010],s2[1000010];
bool st1[26],st2[26];//st1、st2分别记录字符串s1、s2中哪些字符出现了int main()
{cin>>s1+1>>s2+1;int len1=strlen(s1+1);int len2=strlen(s2+1);for(int i=1;i<=len1;i++)st1[s1[i]-'a']=1;for(int j=1;j<=len2;j++)st2[s2[j]-'a']=1;for(int i=0;i<26;i++){if(st2[i]==1&&st1[i]==0)//如果s2中出现的字母s1中没有出现就输出-1{cout<<-1<<endl;return 0;}}int ans=1,j,i=1;while(1){for(j=1;j<=len1;j++){if(s1[j]==s2[i])i++;if(i>len2)goto here;}ans++;}here:cout<<ans<<endl;return 0;
}

Codeforces 91A Newspaper Headline相关推荐

Codeforces 91A-Newspaper Headline
Codeforces 91A Newspaper Headline 题目原址 [http://codeforces.com/problemset/problem/91/A] 题意给两条字符串s1,s ...
算法偏见是什么_算法可能会使任何人（包括您）有偏见
算法偏见是什么在上一篇文章中,我们展示了当数据将情绪从动作中剥离时会发生什么 (In the last article, we showed what happens when data strip ...
GO语言实现设计模式【全】
文章目录 0.前言 1.责任链模式概念示例登机过程测试程序运行结果 2.命令模式概念示例电饭煲接收器电饭煲命令测试程序运行结果 3.迭代器模式概念示例班级成员运行结果 4 ...
Dubious Document
问题 K: Dubious Document 时间限制: 1 Sec 内存限制: 128 MB 提交: 34 解决: 28 [提交][状态][讨论版][命题人:admin] 题目描述 Snuke ...
平常水题 - Atcoder 058 - C - 怪文書 / Dubious Document(字符串的处理）
C - 怪文書 / Dubious Document Time limit : 2sec / ...
ENG Note 1 : 英语写作模板
英语写作模板:引入==>论证(论点.论据)==>呼应第一段的写法:引入(第一句)-引起关注(第二句) Just as an old proverb says,where there is ...
GO 语言实现设计模式【全】
文章目录 0.前言 1.责任链模式概念示例登机过程测试程序运行结果 2.命令模式概念示例电饭煲接收器电饭煲命令测试程序运行结果 3.迭代器模式概念示例班级成员运行结果 4 ...
wi-fi以连接但无法上网_Wi-Fi无法扩展以弥合数字鸿沟
wi-fi以连接但无法上网 Access to the Internet is poor across the nation. There's a Digital Divide that has so ...
java判断日文_判断字符串是否含有日文
日文字符的Unicode编码范围是: U+3040–U+309F: Hiragana U+30A0–U+30FF: Katakana U+4E00–U+9FBF: Kanji 所以我们只需要对每一个字 ...

Codeforces 91A Newspaper Headline

A. Newspaper Headline

Input

Output

Examples

input

output

input

output

2

题意

思路

代码

Codeforces 91A Newspaper Headline相关推荐

最新文章

热门文章