OJ Board

Code: Select all

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <stack>
using namespace std;

stack<char> x;
bool judge(char *in)
{
	static int i,len;

	while(!x.empty())	x.pop();
	
	len=strlen(in);
	if(in[0] == ']' || in[0] == ')')	return 0;
	if(len % 2 != 0)	return 0;
	for(i=0;i<len;++i){
		switch(in[i]){
			case '[':
			case '(':	x.push(in[i]);	break;

			case ']':	if(x.top() == '[')	x.pop();
						else 	return 0;
						break;
			case ')':	if(x.top() == '(')	x.pop();
						else 	return 0;
						break;
			default : break;
		}

	}
	if(x.empty())	return 1;
	else return 0;

}
int main()
{
	int j,times;
	char in[130];

	times=atol(gets(in));
	for(j=0;j<times;++j){
		gets(in);

		if(judge(in))	cout << "Yes\n";
		else cout << "No\n";


	}


    system("pause");
    return 0;
}

Code: Select all

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define MAX 128

#define PAR 0
#define COL 1

typedef struct _pilha
{
	int vet[MAX];
	int topo;
} pilha;

void inipilha(pilha *p)
{
	p->topo = -1;
}

int topo(pilha p)
{
	return p.vet[p.topo];
}

void push(pilha *p, int valor)
{
	(p->topo)++;
	p->vet[p->topo] = valor;
}

int pop(pilha *p)
{
	int valor = p->vet[p->topo];
	(p->topo)--;

	return valor;
}

int main(void)
{
	pilha p;

	char entrada[MAX];

	char sqtd[MAX];
	int qtd;

	int i;
	int j;


	fgets(sqtd, MAX, stdin);
	qtd = atoi(sqtd);

	for (i = 0; i < qtd; i++)
	{
		inipilha(&p);
		fgets(entrada, MAX, stdin);
		entrada[strlen(entrada)-1] = '\0';

		for (j = 0; j < strlen(entrada); j++)
		{
			if (entrada[j] == '(')
			{
				push(&p, PAR);
			}
			else if (entrada[j] == '[')
			{
				push(&p, COL);
			}
			else if (entrada[j] == ')' && p.topo >= 0 && topo(p) == PAR)
			{
				pop(&p);
			}
			else if (entrada[j] == ']' && p.topo >= 0 && topo(p) == COL)
			{
				pop(&p);
			}
			else
			{
				p.topo = -2; /* um numero qualquer para dizer que t

Code: Select all

* edited *

Code: Select all

(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))

Code: Select all

#define DIM 129
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
	int i=0,col=0,j,n,par=0;
	char **string,*e;
	
	scanf("%d",&n);
	gets(e);
	string = (char **) malloc (n * sizeof(char *)); 	
	for (i=0; i<DIM; i++)
     {
        *(string +i) = (char *) malloc(DIM * sizeof (char));
     }
     
	for(j=0;j<n;j++){
     gets(string[j]);
 	}

	for(j=0;j<n;j++)
	{		
		par=0; col=0;
	
		{
		for(i=0;i<DIM;i++)
		{
					
			if( string[j][i] == '(')
			{
				par++;
			}
			
			if( string[j][i] == ')')
			{
				par--;
			}
			
			if( string[j][i] == '[')
			{
				col++;
			}
			
			if( string[j][i] == ']')
			{
				col--;
			}
			if((col <0) || (par <0) || (string[j][i] == '\0') )
			{
			break;
			}
			
		   	       	
	
		 }
	 	}
	if((par == 0) && (col == 0))
		puts("Yes");
	
	else puts("No");
	}
	
	
	
	
		
	return 0;
}

Code: Select all

#include<stdio.h>
#include<string.h>
int main(){
	int N,index,stop,string[130];
	bool res;
	char str[130] ;
	if(fgets(str,129,stdin) == NULL){
		return 1;
	}
	sscanf(str,"%d\n",&N);
	while(N--){
		index = stop = 0;
		res = true;
		for( ;  res && stop == 0 ; ){
			switch(getchar()){
				case '\n':
					stop = 1;
					break;
				case '(':
					string[index++] = 1;
					break;
				case '[':
					string[index++] = 2;
					break;
				case ')':
					if(index == 0 || (index>0 && string[--index] != 1) ){
						res = false; 
					}
					break;
				case ']':
					if(index == 0 || (index>0 && string[--index] != 2) ){
						res = false;
					}
					break;
				default:
					break;
			}
		}
		if(index == 0 && res ){
			fprintf(stdout,"Yes\n");
		}else{
			fprintf(stdout,"No\n");
		}
	}
}