OJ Board

Code: Select all

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

#define MAX 100
#define SIZE 65

int compare( const void * a, const void * b )
{
 return ( strcmp( ( char * ) a, ( char * ) b ) );
}

int main()
{
 int n = 0, i = 0, j = 0, r = 0, len = 0, div = 0;
 char data[MAX][SIZE];

 while ( scanf( "%d\n", &n ) == 1 )
 {
    for ( i = 0; i < n; i++ )
    {
       memset( data[i], '\0', sizeof( data[i] ) );
       gets( data[i] );
    }

    qsort( ( void * ) data, n, sizeof( data[0] ), compare );
    puts( "------------------------------------------------------------" );

    for ( i = 0, len = 0; i < n; i++ )
       if ( strlen( data[i] ) > len )
          len = strlen( data[i] );

    div = 60 / ( len + 2 );
    r = ( n % div ) ? ( ( n / div ) + 1 ) : ( n / div );

    for ( i = 0; i < r; i++ )
    {
       for ( j = 0; j < div; j++ )
       {
          int space;

          if ( i + ( j * r ) < n )
          {
             space = len - strlen( data[ i + ( j * r ) ] ) + 2;

             printf( "%s", data[ i + ( j * r ) ] );

             while ( space )
             {
                putchar( 32 );
                space--;
             }
          }
       }

       putchar( '\n' );
    }
 }

 return 0;
}

Code: Select all

int main()
{
    vector<string> strings;
    string temp;
    vector<string>::const_iterator iter;
    unsigned num=0;
    unsigned count=0;
    unsigned maxLength = 0;
    unsigned cols=0;
    unsigned rows=0;
    unsigned wid=0;
    int i=0;
    int j=0;

    while(cin>>num)
    {
                   getline(cin,temp);//to read the '\n' after the number
                   maxLength=rows=cols=0;
                   for(count=0;count<num;++count)
                   {
                    getline(cin,temp);
                    maxLength = max(maxLength, unsigned(temp.length()));
                    strings.push_back(temp);
                    }
                    sort(strings.begin(),strings.end());
                    //cout<<maxLength<<endl;
                    //assert(maxLength<=60);
                    cols=(60-maxLength)/(maxLength+2) + 1;
                    rows= (num%cols)?(num/cols+1):(num/cols);
                    
                    i=j=0;
                    //cout<<maxLength<<"\t"<<rows<<"\t"<<cols;
                    //draw a line of dashes
                    while(i++<60)
                                 cout<<'-';
                    for(i=0;i<rows;i++)
                    {
                           cout<<endl;
                           for(j=0;j<cols;j++)
                               if((i+j*rows)<num)
                               {
                                    cout.setf(ios::left,ios::adjustfield);
                                    wid=(j==cols-1)?(maxLength):maxLength+2;
                                    cout<<setw(wid)<<strings[i+j*rows];
                               }
                    }
                    cout<<endl;
                    strings.clear();
   }

   return 0;
}

Code: Select all

3 
bernardo_acm_unix_ls_accepted 
finally 
no_more_p_e 

Code: Select all

------------------------------------------------------------
bernardo_acm_unix_ls_accepted..
finally........................
no_more_p_e....................

Code: Select all

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

int sort_function(const void *a, const void *b)  {

   return( strcmp((char *)a,(char *)b) );

}

int main()
{
	char st[101][61];
	int n,i,j,max,r,c,k,l;
	while(scanf("%d",&n)==1){
		max=0;
		for(i=0;i<n;i++){
			while(1){gets(st[i]);if(st[i][0]!=0)break;}
			j = strlen(st[i]);
			if(j>max)max=j;
			for(;j<61;j++){st[i][j]=' ';break;}
		}
		qsort( (void *)st,n,sizeof(st[0]),sort_function);
		c = 60/max;
		while(c*max+(c-1)*2>60&&c>=1)c--;
		if(c){
			if(n%c==0)r = n/c;
			else r = n/c+1;
		}
		else r = n;
		printf("------------------------------------------------------------\n");
		for(i=0;i<r;i++){
			for(j=0;j<c;j++){
				for(k=0;st[i+j*r][k];k++){
					if(i+j*r<n){
						if(isspace(st[i+j*r][k])){
							for(l=k;l<max;l++)printf(" ");
							if(j==c-1)puts("");
							else printf("  ");
							break;
						}
						else
							printf("%c",st[i+j*r][k]);
					}
					else {puts("");break;}
				}
				if(i+j*r>=n)break;
			}
		}
	}
	return 0;
}

Code: Select all

length of "koala.jpg" = 9
length of "australia.exe" = 13
length of "kangaroo.txt" = 12
length of "foo.bar" = 7
length of "homer.simpson" = 13

Code: Select all

AC