2144197_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <iostream>
using namespace std;
void input()
{
	int i, j;
	char t, com;
	char tex[500];

	scanf("%c",&com);
	getchar();
	i = 0;
	while(scanf("%c",&t)==1)
	{
		if(t=='\n')
			t = ' ';
		if(t==' '&&(!i||tex[i-1]==' '))
			continue;
		tex[i++] = t;
	}
	tex[i] = '\0';
	for(j = 75; j < i; j+=75)
		{
			if(tex[j]==' ')
				tex[j] = '\n';
			else
			{
				while(tex[j]!=' ')
					j--;
				tex[j++] = '\n';
			}
		}
	if(com=='L')
		puts(tex);
	if(com=='R')
	{
		for(j = -1; j < i; j++)
			if(j==-1||tex[j]=='\n')
			{
				for(int k = j+1; tex[k]!='\n'&&tex[k]!='\0'; k++);
				for(int l = 0; l < 75-(k-j-1); l++)
					printf(" ");
				for(l = j+1; l <= k; l++)
					printf("%c",tex[l]);
			}
	}
	if(com=='C')
	{
		for(j = -1; j < i; j++)
			if(j==-1||tex[j]=='\n')
			{
				for(int k = j+1; tex[k]!='\n'&&tex[k]!='\0'; k++);
				for(int l = 0; l < (75-(k-j-1))/2; l++)
					printf(" ");
				for(l = j+1; l < k; l++)
					printf("%c",tex[l]);
				for(l = 0; l < (75-(k-j-1))-(75-(k-j-1))/2; l++)
					printf(" ");
				printf("\n");
			}
	}
	if(com=='J')
	{
		for(j = -1; j < i; j++)
			if(j==-1||tex[j]=='\n')
			{
				int num = 0;
				for(int k = j+1; tex[k]!='\n'&&tex[k]!='\0'; k++)
					if(tex[k]==' ')
						num++;
				if(num)
				{
			    	int m, n;
			    	m = 75-(k-j-1);
			    	n = m%num;
			    	m /= num;
			    	for(int l = j+1; l <= k; l++)
				    	if(tex[l]!=' ')
					    	printf("%c",tex[l]);
				    	else
						{
					    	for(int p = 0; p <= m; p++)
						    	printf(" ");
				    		if(n)
							{
				    			n--;
					    		printf(" ");
							}
						}
				}
				else
					for(int l = j+1; l <= k; l++)
						printf("%c",tex[l]);
			}
	}
}

int main()
{
	input();
	return 1;
}