亲和串 HDU - 2203

    xiaoxiao2021-04-12  32

    问题类型:一次性AC,string。

    03pie’s solution for [HDU-2203]: 题目链接

    #include<iostream> #include<string> #include<cstdio> using namespace std; int main() { string s1,s2; while(cin>>s1) { cin>>s2; s1=s1+s1; int ok=s1.find(s2); printf("%s\n",ok>=0?"yes":"no"); } return 0; }
    转载请注明原文地址: https://ju.6miu.com/read-667757.html

    最新回复(0)