3 solutions

  • 1
    @ 2026-1-21 13:37:03
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
      cout<<"YES";
      return 0;
    }
    
    • 1
      @ 2026-1-21 13:34:26
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          string n;
      	cin>>n;
      	n+=" ";
      	while(1)
      	{
      		bool a=0;
      		for(int i=0;i<n.length();i++)if(n[i]=='('||n[i]==')')a=1;
      		if(a==0)
      		{
      			cout<<"YES";
      			return 0;
      		}
      		for(int i=0;i<n.length();i++)
      		{
      			if(n[i]=='('&&n[i+1]==')')
      			{
      				for(int ii=i+2;ii<n.length();ii++)
      				{
      					n[ii-2]=n[ii];
      				}
      				n[n.length()-1]=char(0);
      				n[n.length()-2]=char(0);
      				break;
      			}
      			else if(i==n.length()-1)
      			{
      				cout<<"NO";
      				return 0;
      			}
      		}
      	}
      	return 0;
      }
      
      • 0
        @ 2026-4-4 9:41:05
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
        	string a;
        	cin>>a;
        	int b=a.size();
        	for(int z=0;z<b;z++)
        	{
        		bool c=0;
        		for(int i=0;i<a.size()-1;i++)
        		{
        			
        			//cout<<a<<"["<<i<<"]="<<a[i]<<" "<<a[i+1]<<"\n";
        			if(a[i]=='(' && a[i+1]==')')
        			{
        				a[i]=32;
        				a[i+1]=32;
        				
        				string b="";
        				for(int j=0;j<a.size();j++)
        				{
        					if(a[j]==')'||a[j]=='(')
        					{
        						b+=a[j];
        					}
        				}
        				a=b;
        				//cout<<a<<"\n";
        				c=1;
        				bool d=1;
        				for(int j=0;j<a.size();j++)
        				{
        					if(a[j]!=32)d=0;
        				}
        				if(d)
        				{
        					cout<<"YES";
        					return 0;
        				}
        			}
        		}
        		if(!c)
        		{
        			cout<<a;
        			cout<<"NO";
        			break;
        		}
        	}
        }
        
        • 1

        Information

        ID
        1821
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        10
        Tags
        # Submissions
        8
        Accepted
        3
        Uploaded By