队列

#include <bits/stdc++.h>
using namespace std;
queue <char> q;
queue <char> p;
string s , s1;
int k;
int main(){
	cin >> s >> s1;
	if (s.size () != s1.size ()){
		cout<<"No";
		return 0;
	} 
	for (int i = 0;i < s.size (); ++ i){
		q.push (s[i]); 
	}
	for (int i = 0;i < s1.size (); ++ i){
		p.push (s1[i]); 
	}
	while (true){
		++ k;
		if (k > 150){
			break;
		} 
		char t = p.front ();
		p.pop ();
		p.push (t);
		if (q == p){
			cout << "Yes";
			return 0;
		}
	}
	cout << "No";
	return 0;
}