Codeforces Beta Round #5 March 20, 2010

B. Center Alignment

–AC–

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

int main()
{
  char s[2000][2000];
  int i,j,k,l,m,n,max,p,tmp=0;
  i=1;
  while(1){
  if(!gets(s[i])) break;
  ++i;
  }
  max=0;
  for(j=1;j<=i;j++){
    l=strlen(s[j]);
    if(l>max)
     max=l;
  }

  tmp=1;
  for(j=0;j<=max+1;j++)
   
   
    printf("*");
  printf("\n");
  for(j=1;j<i;j++){
     printf("*");
     l=strlen(s[j]);
     m=max-l;
     n=m/2;
     p=n;
     if(m%2!=0){
       tmp++;
       if(tmp%2==0){
           n=n;
           p=n+m%2;
       }    
       else{
        p=n;
        n=n+m%2;
       
        }
      }
    for(k=0;k<n;k++)
     printf(" ");
     printf("%s",s[j]);
    for(k=0;k<p;k++)
     printf(" ");
     printf("*\n");
   }

   for(j=0;j<=max+1;j++)
    printf("*");
   printf("\n");

return 0;
}
  

Codeforces Beta Round #5 March 20, 2010

A. Chat Server’s Outgoing Traffic
–AC–

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

int main()
{
  char s1[1000],s2[1000];
  int i,j,k,l,m,n,count;
  int total;
   count=0;
   total=0;
  while(1){
   if(!gets(s1)) break;
  
   if(s1[0]=='+') ++count;
   else if(s1[0]=='-') --count;
   else {l=0;
         for(i=0;s1[i]!=':';i++);
         for(i=i+1;s1[i]!='\0';i++)
           ++l;
         total=total+l*count;
        }
   }

  printf("%d\n",total);

return 0;
}