OJ Board

Code: Select all

10

E  	
	AB          
     CE         
  	  DB 			
	   EC   		

Z
AB
CF

A
ZY
WS
PQ

D
AA
BB
CC
DD

E
AB
BA
AB
BA

Z
AB
BC
CD
DE
EF
FG
GH
HI
IJ
JK
KL
LM
MN
NO
OP
PQ
QR
RS
ST
TU
UV
VW
WX
XY
YZ

A

M

Z

I
AI
BI
CI
DI
IE
IF
IG
IH

Code: Select all

2

24

1

4

4

1

1

13

26

1

Code: Select all

int read_graph(graph *g)
{
	int i,j,p,x,y,res1;
	char c[10],*res2;//this is for take the input
	
	initialize_graph(g);//fluhs the graph
	gets(c);//get the line 
	sscanf(c,"%c",&c[0]);//I scan for the firts caracter
	i = c[0]-'A';
	g->nvertices = i+1;
	
	for(j=0;j<i+1;j++)
		visited[j]=false;
	p=0;
	while(1){
		res2=gets(c);
		res1=sscanf(c,"%s",c);
		if(res1==EOF || res2==NULL)//if there is nothing break
			break;
		x = (int)(c[0] - 'A');//see the node origin
		y = (int)(c[1] - 'A');//see the destiny
		insert_edge(g,x,y,0);//insert edge in the graph
	}
	return 1;
}

Code: Select all

int main() {
    int cases;
    int i,j;
    char line[1000];
    bool check[30];
    char ch,a,b;
    int n;
    int count;
    bool print=false;
    int len;
    
    cin>>cases;
    cin.getline(line,255);
    cin.getline(line,255); //garbage
    while(cases--) {
        cin>>ch;
        cin.getline(line,255); //garbage
        n=ch-'A';
        for(i=0;i<=n;i++) makeset(i);
        memset(check, false , sizeof(check));
        count=0;
        while(true) {
            cin.getline(line,255);
            if(!strcmp(line,"")) break;
            len=strlen(line);
            for(i=0;i<len;i++) 
                if(line[i]>='A' && line[i]<='Z') {
                    a=line[i];
                    i++;
                    break;
                }
            for(;i<len;i++)
                if(line[i]>='A' && line[i]<='Z') {
                    b=line[i];
                    break;
                } 
                
            setunion(a-'A',b-'A');
        }
        for(i=0;i<=n;i++) 
            check[p[i]]=true;
        for(i=0;i<=n;i++) 
            if(check[i]) count++;
        if(print) cout<<endl;
        cout<<count<<endl;
        print=true;
    }
//system("pause");
return 0;
}

Code: Select all

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main(){
    int turn, size, n1, n2, ans;
    char node1,node2;
    string c;
    string read;
    bool visted[26]={0};
    
    cin>>turn;
    cout<<endl;
    while(turn--){
       ans = 0;
       cin>>c;
       cin.ignore();
       size = c[0] - 'A'+1;
       bool table[size][size];
       bool flag;
       
       for(int i=0; i<size; i++)
          for(int j=0; j<size; j++)
             table[i][j] = false;
       
       while(1){               
          getline(cin, read);
          read.erase(remove(read.begin(), read.end(), ' '), read.end());
          
          if( read.empty() == true || read[0] == '\0')
              break;
          n1 = read[0] - 'A';
          n2 = read[1] - 'A';
          if(n1 != n2){
             table[n1][n2] = true;             
             table[n2][n1] = true;
          }   
       }
       
       for(int i=0; i<size; i++){
          flag = false;     
          for(int j=0; j<size; j++){
              if(table[i][j] == true){
                  if(visted[j] == true)
                     flag = true;
                  else   
                     visted[j] = true;          
              }                     
          }
          if(visted[i] == false && flag == false)
              ++ans;
       }
       
       cout<<ans<<endl; 
       cout<<endl;
       for(int i=0;i<size;i++)
          visted[i]= false;                        
    }
   return 0;                 
}

Code: Select all

1

E
AE
EC
CB
BD

Code: Select all

A - E - C - B - D

Code: Select all

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main(){
    int turn, size, n1, n2, ans, max;
    char node1,node2;
    string c;
    string read;
    bool visted[26]={0};
    
    cin>>turn;
    while(turn--){
       ans = 0;
       cin>>c;
       cin.ignore();
       size = c[0] - 'A'+1;
       bool table[size][size];
       
       for(int i=0; i<size; i++)
          for(int j=0; j<size; j++)
             table[i][j] = false;
       
       while(1){               
          getline(cin, read);
          read.erase(remove(read.begin(), read.end(), ' '), read.end());
          
          if( read.empty() == true || read[0] == '\0')
              break;
          n1 = read[0] - 'A';
          n2 = read[1] - 'A';
          if(n1 != n2){
             if(n1 > n2)
                table[n1][n2] = true;
             else
                table[n2][n1] = true;
          }   
       }
       
       for(int i=1; i<size; i++){   
          for(int j=0; j<i; j++){
              if(table[i][j] == true){
                  if(visted[j]==true)
                     visted[i] = true;
                  else                
                     visted[j] = true;          
              }                     
          }
       }
       
       for(int i=0; i<size; i++){
          if(visted[i] == false)
             ++ans;        
       }
          
       if(ans == 0)
          ++ans;
       cout<<ans<<endl; 
       if(turn != 1)
          cout<<endl;
       for(int i=0;i<size;i++)
          visted[i]= false;                        
    }
   return 0;                 
}