TJU 2839. Dream Counting December 5, 2009

TJU 2839. Dream Counting

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

int main()
{
  long long int i,j,k;
  long long int m,n;
  char s[100],s2[100];
  static int num[10];
  scanf("%lld%lld",&m,&n);
  for(i=m;i<=n;i++)
  {
    sprintf(s,"%lld",i); 
    for(j=0;s[j]!='\0';j++)
    {
      num[s[j]-48]++;
    }
  }
 
  for(i=0;i<=8;i++)
    printf("%d ",num[i]); 
    
  printf("%d\n",num[i]);
return 0;
}

TJU 2791. Bovine Latin November 19, 2009

TJU 2791. Bovine Latin

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

int main()
{
  int i,j,k,n;
  char s[100],ch[2];

  scanf("%d",&n);
  while(n--)
  {
    scanf("%s",s);
    if(s[0]=='a'||s[0]=='e'||s[0]=='i'||s[0]=='o'||s[0]=='u')
    {
     strcat(s,"cow");
     printf("%s",s);
    }
    else
     {
      ch[0]=s[0];
      ch[1]='\0';
      strcat(s,ch);
      strcat(s,"ow");
      for(i=1;s[i]!='\0';i++)
       printf("%c",s[i]);
      }
    printf("\n");
    }

return 0;
}  

TJU 3205. The Perfect Cow November 18, 2009

TJU 3205. The Perfect Cow

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

int main()
{
  int i,j,k;
  int N,a[100][100],tmp;


  scanf("%d",&N);
  for(i=0;i<N;i++)
   for(j=0;j<N;j++)
     scanf("%d",&a[i][j]);

 for(k=0;k<N;k++)
  for(i=0;i<N;i++)
  {
    for(j=0;j<N-1;j++)
    {
      if(a[i][j]>a[i][j+1])
       {
         tmp=a[i][j];
         a[i][j]=a[i][j+1];
         a[i][j+1]=tmp;
       }
     }
   }

 for(j=0;j<N;j++)
  for(i=0;i<N-1;i++)
    if(a[i][N/2]>a[i+1][N/2])
    {
      tmp=a[i][N/2];
      a[i][N/2]=a[i+1][N/2];
      a[i+1][N/2]=tmp;
    }
 

  printf("%d\n",a[N/2][N/2]);


  
return 0;
}