AcWing 776. 字符串移位包含问题
原题链接
困难
作者:
小清同学
,
2024-04-07 22:15:38
,
所有人可见
,
阅读 2
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
const int N = 1e7;
typedef long long ll;
#define rep(a , b , c) for( int a = b ; a < c ; a ++ )
#define def(a , b , c) for( int a = b ; a <= c ; a ++ )
#define dpe(a , b , c) for( a & b : c )
#define iqoo ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
int finding( string a, string b )
{
int len = a.size();
a += a;
if ( a.find(b) != string::npos ) return true;
else return false;
}
int main()
{
iqoo;
string a, b;
cin >> a >> b;
if ( a.size() < b.size() ) swap( a, b );
if ( finding( a, b ) ) cout << "true";
else cout << "false";
return 0;
}