OJ Board

Code: Select all

#include <iostream>
#include <cstring>
using namespace std;

int main()
{
	char input[101][101] = {'\0'};
	int totSen = 0, totRow = 0;
	int row = 0, col = 0;
	int maxLen = 0;

	while(!cin.eof())
	{
		cin.getline(input[totSen], 101);
		totSen++;
	}
	
	cout << endl;
	
	//Find the length.
	for(int i = 0; i < totSen; i++)
	{
		int len = strlen(input[i]);
		
		if(maxLen < len)
		{
			maxLen = len;
		}
	}
	
	while(row < maxLen)
	{
		for(col = totSen-1; col >= 0 ; col--)
		{
			if(input[col][row] != '\0' )
			{
				cout << input[col][row];
			}
			else
			{
				cout << ' ';
			}
		}
		
		cout << endl;
		
		row++;
	}

	return 0;
}

Code: Select all

#include <iostream> 
#include <algorithm>
#include <vector>
#include <string> 
using namespace std; 

int main() 
{ 
	vector<string> buffer; 
	vector<string>::iterator itor ; 
	string str; 
	int count = 0; 
	while(getline(cin, str)) 
	{ 
		buffer.push_back(str); 
	} 
	count = buffer.size(); 
	reverse(buffer.begin(), buffer.end()); 
	while (true) 
	{ 
		for (itor = buffer.begin(); itor != buffer.end(); itor ++) 
		{ // first test the string 's for sure it is not empty
			if (itor->empty()) 
			{ 
				count --; cout << " "; 
				continue;
			} 
			cout.put(itor->at(0)); 
			itor->erase(0, 1); 
		} 
		cout << endl;
	 	if (count == 0) break; 
	} 
}

Code: Select all

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

using namespace std;

int main()
{
	int fld[350][350];
	for(int i=0;i<150;i++)
	    for(int j=0;j<150;j++)
	        fld[i][j]=' ';
	 int maxi=0,n=0;
	 string r;
	 while(!cin.eof())
	 {
			getline(cin,r);
			if(maxi<r.size())maxi=r.size();
			for(int i=0;i<r.size();i++)
			{
				fld[n][i]=r[i];
			}
			n++;
	 }
	 for(int j=0;j<maxi;j++)
	 {
		 for(int i=n-1;i>=0;i--)
		 {
				cout<<char(fld[i][j]);
		 }
		 cout<<endl;
	 }
}

Code: Select all

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
using namespace std ;


int main()
{
//    freopen("in.txt", "r", stdin) ;

    vector<string>in ;
    string  t ;
    int     i, j, max ;

    while( getline(cin, t ) )
    {
        in.push_back(t) ;

        // Find max length of them
        max = 0 ;
        for( i=0; i<in.size(); i++ )
            if( in[i].length() > max ) max = in[i].length() ;

        // Now resize all upto MAX
        for( i=0; i<in.size(); i++ )
            in[i].resize(max) ;
    }

        // Now the odd coding :<
        for( i=0; i<max; i++ )
        {
            for( j=in.size()-1; j>=0; j--)
                cout << in[j][i] ;

            cout << endl ;
        }

    return 0 ;
}

Code: Select all

#include<stdio.h>
#include<string.h>
int main()
{

	char s1[1001]={'\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0'};
	char s2[1001]={'\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0','\0'};
	//freopen("in","r",stdin);
	while(gets(s1))
	{
		int max,len1,len2;
			//if(s1[0]=='\0')
			{
				//gets(s1);
				len1=strlen(s1);
			}
			if(s2[0]=='\0' && s1[0]!='\0')
			{
				gets(s2);
				len2=strlen(s2);
			}
		
			if(len1>len2)
			{
					max=len1;
					for(int i=len2 ; i<max ; i++)
					{
							s2[i]='\0';
					}
			}
			
			else if(len2>len1)
			{
					max=len2;
					for(int i=len1 ; i<max ; i++)
					{
							s1[i]='\0';
					}
			}
			else
					max=len1;
					
					
			int fag=0;
			for(int i=0 ; i<max ; i++)
			{
				printf("%c%c\n",s2[i],s1[i]);
				fag++;
			}

			if(fag!=0)
			{
					for(int i=0 ; i<max ; i++)
					{
							s1[i]='\0';
							s2[i]='\0';
					}
			}

	}
	return 0;
}