4 solutions

  • 3
    @ 2024-12-1 15:12:46
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	string s1,s2;
    	cin>>s1>>s2;
    	if(s1.size()<s2.size())
    	{
    		string t=s1;
    		s1=s2;
    		s2=t;
    	}
    	string s3=s1+s1;
    	if(s3.find(s2)!=-1)
    	{
    		cout<<"true";
    	}
    	else
    	{
    		cout<<"false";
    	}
    	return 0;
    }
    
    • 2
      @ 2025-7-18 14:18:15
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
      	string s1,s2;
      	cin>>s1>>s2;
      	if(s1.size()<s2.size())
      	{
      		string t=s1;
      		s1=s2;
      		s2=t;
      	}
      	string s3=s1+s1;
      	if(s3.find(s2)!=-1)
      	{
      		cout<<"true";
      	}
      	else
      	{
      		cout<<"false";
      	}
      	return 0;
      }
      
      
      • -1
        @ 2025-3-6 19:24:17
        #include <bits/stdc++.h>
        using namespace std;
        int main(){
            string s1,s2;
            cin >> s1 >> s2;
            if(s1.find(s2)!=-1){
                cout << "true";
                return 0;
            }
            for(int i = 0;i<s1.size();i++){
                char c = s1[0];
                s1.erase(0,1);
                s1.push_back(c);
                if(s1.find(s2)!=-1){
                    cout << "true";
                    return 0;
                }
            }
            cout << "false";
        
        
        
        
        
        
            return 0;
        }
        
        • -2
          @ 2025-1-16 15:09:16
          
          #include<bits/stdc++.h>
          using namespace std; 
          int main()
          {
          	string s1,s2;
          	cin>>s1>>s2;
          	if(s1.size()<s2.size())
          	{
          		swap(s1,s2);
          	}
          	string s3=s1+s1;
          	if(s3.find(s2)!=-1)
          	{
          		cout<<"true";
          	}
          	else
          	{
          		cout<<"false";	
          	}
          	return 0;
          }
          • 1

          Information

          ID
          94
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          3
          Tags
          (None)
          # Submissions
          62
          Accepted
          33
          Uploaded By