OJ Board

Code: Select all

#include <iostream>
#include <cstdio>
#include <stack>
#include <string.h>

using namespace std;

int main()
{

    int a;
    unsigned int i=0;
    scanf("%d",&a);
    while(a--)
    {
        string p;
        stack<char> s;
        cin>>p;
        for( i =0;i<p.length();i++)
        {
            if(p[i]=='('||p[i]=='[')
               s.push(p[i]);
            else
            {
                if(p[i]==')')
                    {
                        if(!s.empty() && s.top()=='(')
                           s.pop();    
                        else
                            s.push(p[i]);
                    }
                else
                {
                    if(!s.empty() && s.top()=='[')
                        s.pop();
                    else
                        s.push(p[i]);
                }
            }
        }
        if(!s.empty())
            cout<<"No"<<endl;
        else
            cout<<"Yes"<<endl;
    }
    return 0;
}

Code: Select all

4

([])
(([()])))
([()[]()])()

Code: Select all

Yes
Yes
No
Yes

Code: Select all

#include<cstdio>

using namespace std;
typedef struct 
{
	int top;
	char items[1000];

}stack;
bool isempty(stack *s)
{
	if(s->top==-1)
		return true;
	else
		return false;

}
char push(stack *s,int data)
{
	
	s->items[++s->top]=data;
}
char pop(stack *s)
{
		if(!isempty(s))
			return s->items[s->top--];
		

}
char stacktop(stack *s)
{
	if(!isempty(s))
		return s->items[s->top];


}
bool matchpair(char a,char b)
{
	if(a=='('&&b==')')
		return true;
	if(a=='['&&b==']')
		return true;
	if(a=='{'&&b=='}')
		return true;
	else
		return false;


}
int main()
{	
	int t;
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		
		//printf("TRIAL %d\n",t);
		stack s;
		s.top=-1;
		char c;
		bool balance=true;
		
		while(scanf("%c",&c)==1)
		{
			
			//printf("%c ",c);
			if(c=='\n' || c==EOF)
				break;
			if(c=='['||c=='('||c=='{')
				push(&s,c);
			if(c==']'||c==')'||c=='}')
			{
				if(matchpair(pop(&s),c)==false)
				{
					balance=false;
					
				}
			}
		
		//getchar();
		}
		if(isempty(&s)==false)
			balance=false;
		if(balance==true)
			printf("Yes");
		else
			printf("No");
		printf("\n");
	
	}
   return 0;
}

Code: Select all

Accepted!

Code: Select all

1
(

Code: Select all

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <stack>
#include <map>

using namespace std;
int main()
{
    string str1, str2;
    stack <char> ch;
    int a, b, c, tst,len;
    cin>>tst;
    while(tst--)
    {
        getline(cin, str1);
        len=str1.size();
        if(str1.size()<1)
        {
            cout<<"Yes\n";
            continue;
        }

        while(!ch.empty())
            ch.pop();

        for(a=0; a<len; a++)
        {
            if(str1[a]=='(' || str1[a]=='[')
            ch.push(str1[a]);


            if(str1[a]==')' ||str1[a]==']')
            {
                if(ch.empty())
                {
                    ch.push('0');
                    break;
                }
                char tmp=ch.top();

                if(tmp=='(' && str1[a]==')') ch.pop();
                if(tmp=='[' && str1[a]==']') ch.pop();

            }


        }
        if(ch.empty())cout<<"Yes\n";

        else cout<<"No\n";
    }
    return 0;
}

Code: Select all

package uva673;
import java.util.*;
public class Uva673 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        Scanner key=new Scanner(System.in);
        int t=key.nextInt();
        Stack<Character> a;
        while(t>0)
        {
            int flag=0;            
            a = new Stack<Character>();
        String s=key.next();
            for (int i = 0; i <s.length(); i++) 
            {
            if(s.charAt(i)=='('|| s.charAt(i)=='[')
            {
            a.push(s.charAt(i));
            }
            else
            {
            if(a.empty())
            {
                System.out.println("No");
            flag++;
            break;
            }
            else if(s.charAt(i)==')'&&a.peek()=='(')
            {
            a.pop();
            }
            else if(s.charAt(i)==']'&&a.peek()=='[')
            {
            a.pop();
            }
            }
            }
        if(a.empty()&&flag!=1)
        {
            System.out.println("Yes");
        }
        else if(!a.empty())
        {
            System.out.println("No");
        }
        t--;
        }
    }    
}