OJ Board

Code: Select all

#include <iostream>
#include <stack>
#include <queue>
#include <string.h>
#include <math.h>
#include <vector>
#include <stdio.h>
#define MAX 1000
using namespace std;
int main()
{
	int test,senti,str_len;
	cin>>test;
	getchar();
	char str[MAX];
	stack<char> stk;
	char a;
	for(int j=1;j<=test;j++)
	{

		cin.getline(str,1000);  
		str_len=strlen(str);
		stack<char> stk;
		senti=0;
		
		for(int i=0;i<str_len;i++)
		{
			if(str[i]!='(' && str[i]!=')' && str[i]!='[' && str[i]!=']')
			continue;
			
			if(str[i]=='(' || str[i]=='[')
			stk.push(str[i]);
			
			if(stk.empty())
			{
				senti=1;
				break;
			}
			
			if(str[i]==')'	&& stk.top()!='(')
			{
				senti=1;
				break;
			}
			
			if(str[i]==']'	&& stk.top()!='[')
			{
				senti=1;
				break;
			}
			
			if( (str[i]==')' && stk.top()=='(') || ( str[i]==']' && stk.top()=='[' ))
			stk.pop();
						
		}
		
		if(senti==0 && stk.empty())
		cout<<"Yes";
		else
		cout<<"No";
		
		if(j!=test)
		cout<<endl;
	}
}

Code: Select all

//parenthesis balance
#include <stdio.h>

int main()
{
	char ch[128];
	int cas,i,j,a,b;
	int sum1,sum2;

	scanf("%d",&cas);

	for(i=0;i<cas;i++)
	{
		scanf("%s",&ch);

		sum1=0,sum2=0;

		for(j=0;ch[j]!='\0';j++)
		{
			if(ch[j]>90)
			sum1+=ch[j];
			else
			sum2+=ch[j];
		}
		if(sum1%2==0)
		a=1;
		else
		a=0;


		if(sum2<81)
		{
			if(sum2==0)
			b=1;
			else
			b=0;
		}

		else
		{
			if(sum2%81==0)
			b=1;
			else
			b=0;
		}


		if(a*b==1)
		printf("Yes\n");
		else
		printf("No\n");

	}
	return 0;
}[code]

Code: Select all

  scanf("%d",&n);
   
   gets(text); //dummy input
   for(j=1;j<=n;j++)
   {
   
      o=0;
      input[o]='\0';
       //scanf("%s",text);
        
      gets(text);
     

   }

Code: Select all

#include <iostream>
#include <string>
using namespace std;
int main()
{
	int n, stk, stack[128], check, wrong;
	string str;
	cin >> n;
	cin.ignore (80, '\n');
	for (int i = 0; i < n; i++)
	{
		getline(cin, str);
		if (str == "")
			stk = 0;
		else
		{
			stk = 0;
			wrong = 0;
			for (int j = 0; j < str.size(); j++)
			{
				if (str[j] == '(')
				{
					stack[stk] = 41;
					stk++;
				}
				else if (str[j] == '[')
				{
					stack[stk] = 93;
					stk++;
				}
				else if (str[j] == ')')
				{
					if (stack[stk - 1] == 41)
						stk = stk - 1;
					else
					{
						wrong = 1;
						break;
					}
				}
				else if (str[j] == ']')
				{
					if (stack[stk - 1] == 93)
						stk = stk - 1;
					else
					{
						wrong = 1;
						break;
					}
				}
			}
		}
		if (stk == 0 && wrong == 0)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
	return 0;
}

Code: Select all

#include <stdio.h>
#include <iostream>
#include <stack>
using namespace std;

int main()
{
  stack <char> bracks;
  char c;
   string s;
  long unsigned numOfTestCase;

   cin>>numOfTestCase;

  for (long unsigned i=0;i<numOfTestCase ; i++)
  {
      cin>>s;
      for (int i=0;i<s.length() ; i++)
    {
   
      if (bracks.empty())
        {
          bracks.push(s[i]);
         }


      else if (bracks.top()=='(' && s[i]==')' || bracks.top()=='[' && s[i]==']')
        {
             bracks.pop();

        }

      else if(s[i]=='(' || s[i]==')' ||  s[i]=='[' || s[i]==']')
        {
             bracks.push(s[i]);

        }
    }

  if (bracks.empty()) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;

  while(!bracks.empty()){bracks.pop();}
  }
  return 0;
}

Code: Select all

#include<stdio.h>
#include<iostream>
#include<string.h>
int form(char s[10])
{
    int formt=0,n=1;
    for(int i=strlen(s)-1;i>=0;i--)
    {
        formt=formt+(s[i]-48)*n;
        n*=10;
    }
    return formt;
}

int main(void)
{

    using namespace std;
    char str[100],n[10];
    int m;
    gets(n);
    m=form(n);
    for(int p=0;p<m;p++)
    {
        gets(str);
        int num1=0,num2=0;
        for(int i=0;i<strlen(str);i++)
        {
        if(str[i]=='('||str[i]=='[')
        num1++;
        else if(str[i]==')'||str[i]==']')
        num2++;
        }
        if(num1==num2 && num1!=0 && num2!=0)
        printf("Yes\n");
        else printf("No\n");
    }
}