]]>
]]>
Total Submission(s): 1391 Accepted Submission(s): 577
Problem Description
Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.
Output
For each test case, you should output the text which is processed.
Sample Input
3 olleh !dlrow m'I morf .udh I ekil .mca
Sample Output
hello world! I'm from hdu. I like acm.HintRemember to use getchar() to read '\n' after the interger T, then you may use gets() to read a line and process it.
Author
Ignatius.L
#include <string.h>
int main()
{
int i=0,n,length,t,j;
char ch,p[1001],temp;
scanf("%d",&n);
ch=getchar();
while(n--)
{
gets(p);
length=strlen(p);
t=0;
for(i=0;i<=length;i++)
{
if(p[i]==' '||p[i]=='\0')
{
for(j=t;j<(i+t)/2;j++)
{
temp=p[j];
p[j]=p[i-j+t-1];
p[i-j+t-1]=temp;
}
t=i+1;
}
}
printf("%s\n",p);
}
return 0;
}
]]>
#include <string.h>
#include <ctype.h>
char * index( const char *s, int c);
/*
** State machine for romantoint
**
** M D C L X V I
** 0: +1000/0 +500/0 +100/1 +50/0 +10/2 +5/0 +1/3
** 1: +800/0 -- +100/0 +50/0 +10/2 +5/0 +1/3
** 2: -- -- +80/0 +30/0 +10/2 +5/0 +1/3
** 3: -- -- -- -- +8/0 +3/0 +1/3
**
*/
int FromRoman(char *s)
{
int n=0;
int prev=0;
while (*s!=' '&&*s!=NULL) {
switch (toupper(*s))
{
case 'M': n += 1000 - prev*2;
prev=0;
break;
case 'D': n += 500 - prev*2;
prev=0;
break;
case 'C': n += 100;
if (prev < 100) n -= 2*prev;
prev=100;
break;
case 'L': n += 50;
if (prev < 50) n -= 2*prev;
prev=0;
break;
case 'X': n += 10;
if (prev < 10) n -= 2*prev;
prev=10;
break;
case 'V': n += 5;
if (prev < 5) n -= 2*prev;
prev=0;
break;
case 'I': n += 1;
prev=1;
break;
}
s++;
}
return n;
}
void PrintRoman(int n)
{
if (n<=0 || n>4999)
{
printf("out of range exception\n");
return;
}
while (n/1000)
{
printf("M");
n -= 1000;
}
switch(n/100)
{
case 0: break;
case 1: printf("C"); break;
case 2: printf("CC"); break;
case 3: printf("CCC"); break;
case 4: printf("CD"); break;
case 5: printf("D"); break;
case 6: printf("DC"); break;
case 7: printf("DCC"); break;
case 8: printf("DCCC"); break;
case 9: printf("CM"); break;
}
n %= 100;
switch(n/10)
{
case 0: break;
case 1: printf("X"); break;
case 2: printf("XX"); break;
case 3: printf("XXX"); break;
case 4: printf("XL"); break;
case 5: printf("L"); break;
case 6: printf("LX"); break;
case 7: printf("LXX"); break;
case 8: printf("LXXX"); break;
case 9: printf("XC"); break;
}
n %= 10;
switch(n) {
case 0: break;
case 1: printf("I"); break;
case 2: printf("II"); break;
case 3: printf("III"); break;
case 4: printf("IV"); break;
case 5: printf("V"); break;
case 6: printf("VI"); break;
case 7: printf("VII"); break;
case 8: printf("VIII"); break;
case 9: printf("IX"); break;
}
printf("\n");
}
#define STACKSIZE 1024
int nitems=0;
int stack[STACKSIZE];
int Pop()
{
if (!nitems) {
printf("stack underflow\n");
return 0;
}
return stack[--nitems];
}
void Push(int n)
{
if (nitems == STACKSIZE-1) {
printf("stack overflow\n");
return;
}
stack[nitems++] = n;
}
int PrintTop(void)
{
if (!nitems) {
printf("stack underflow\n");
return -1;
}
else {
PrintRoman(stack[nitems-1]);
return 0;
}
}
int PerformAdd(void)
{
int x,y;
if (nitems < 2) {
printf("stack underflow\n");
return -1;
}
y = Pop();
x = Pop();
Push(x+y);
return 0;
}
int PerformSub(void)
{
int x,y;
if (nitems < 2) {
printf("stack underflow\n");
return -1;
}
y = Pop();
x = Pop();
Push(x-y);
return 0;
}
int PerformMul(void)
{
int x,y;
if (nitems < 2) {
printf("stack underflow\n");
return -1;
}
y = Pop();
x = Pop();
Push(x*y);
return 0;
}
int PerformDiv(void)
{
int x,y;
if (nitems < 2) {
printf("stack underflow\n");
return -1;
}
y = Pop();
x = Pop();
if (y!=0)
Push(x/y);
else {
printf("division by zero exception\n");
Push(x);
}
return 0;
}
main()
{
char line[256];
//freopen("H.in","r",stdin);
// freopen("H.out","w",stdout);
while (fgets(line,sizeof(line),stdin)) {
if (line[0] == '=')
PrintTop();
else if (line[0] == '+')
PerformAdd();
else if (line[0] == '-')
PerformSub();
else if (line[0] == '*')
PerformMul();
else if (line[0] == '/')
PerformDiv();
else {
int n = FromRoman(line);
if (n > 0) {
Push(n);
}
}
}
}
]]>
涓銆?nbsp; 鍗ц柂灝濊儐( o8 R; y" Z. q& N/ j( F) O
鐙間笉浼氫負浜嗘墍璋撶殑灝婁弗鍦ㄨ嚜宸卞急灝忔椂鏀誨嚮姣旇嚜宸卞己澶х殑涓滆タ6 I6 F0 h% B4 ?+ N3 y9 v
浜屻?nbsp; 浼楃嫾涓蹇?font style="FONT-SIZE: 0px; COLOR: #fff">* B, B Q7 {* e. q t
濡傛灉鐙間笉寰椾笉闈㈠姣旇嚜宸卞己澶х殑涓滆タ錛屽繀緹よ搗鑰屾敾涔?font style="FONT-SIZE: 0px; COLOR: #fff">- r/ p% G& t# |( p& z7 D
涓夈?nbsp; 鑷煡涔嬫槑
- F% p/ z$ Y* B+ q w8 K( Z, k3 ^2 `鐙煎緢鎯沖綋鍏界帇錛岃岀嫾鐭ラ亾鑷繁鏄嫾鑰屼笉鏄檸: |4 ?% b D1 D# Q' ~! a$ b
鍥涖?nbsp; 欏烘按琛岃垷3 A8 J+ i2 Y W2 ?& R+ z# O' Q4 a( Y
鐙肩煡閬撳浣曠敤鏈灝忕殑浠ｄ環(huán)鎹㈠彇鏈澶х殑鍥炴姤
2 l& R/ o) O: F" V7 g" ?+ p; P7 o) j浜斻?nbsp; 鍚岃繘鍚岄
+ r4 K2 h& D2 u; [- |) t鐙艱櫧鐒墮氬父鐙嚜媧誨姩錛屼絾鐙兼槸鏈鍥㈢粨鐨勶紝浣犱笉浼氬彂鐜板摢鍙嫾鍦ㄥ悓浼村彈浼ゆ椂鐙嚜閫冭蛋% c9 R" d# D, O. p+ L/ g) o
鍏?nbsp; 琛ㄩ噷濡備竴2 ^' f+ j5 h! [7 E& u) h% @
鐙間篃寰堟兂鍠勮壇錛屼絾鐙肩煡閬撹嚜宸辯殑鑳冭兘娑堝寲浠涔堬紝鎵浠ョ嫾姣忔閮藉共騫插噣鍑鐨勫悆鎺夋瘡嬈＄殑鐚庣墿錛屽彲鏈変簺鑷涓?#8220;鍠勮壇”鐨勫姩鐗╁嵈鍦ㄩ厭搴楅キ搴勯噷鍋氫簺涓嶆槸“寰堝杽鑹?#8221;鐨勪簨( w( D& P8 ?8 ~# G' g
涓冦?nbsp; 鐙間害閽熸儏9 Z, ~( g) G9 R; [$ p- Q
鐙間細涓鐩村畧鍦ㄦ瀛曠殑姣嶇嫾韜竟鐩磋嚦灝忕嫾闀垮ぇ錛屽彲鏌愪簺鑷涓?#8220;鍞竴鏈夋劅鎯?#8221;鐨勫姩鐗╋紝鍗村湪濡誨瓙鎬瀛曟椂鍦ㄥ鑺卞ぉ閰掑湴
) ]* l) |# B0 z鍏?nbsp; 鎺堢嫾浠ユ笖
5 Z3 ]! p8 f# {鐙間細鍦ㄥ皬鐙兼湁鐙珛鑳藉姏鐨勬椂鍊欏潥鍐崇殑紱誨紑浠栵紝鍥犱負鐙肩煡閬擄紝濡傛灉褰撲笉鎴愮嫾閭ｅ氨鍙兘褰撶緤9 x1 D% C, G. s! [3 E+ g5 a
涔?jié)銆?nbsp; 鑷敱鍙吹
9 \4 r! x+ q! p' s$ a( ^鐙間笉浼氫負浜嗛鐗╄屼笉欏懼皧涓ョ殑鍚戜富浜烘憞澶存憜灝撅紝鍥犱負鐙肩煡閬擄紝涓嶅彲鏈夊偛姘旓紝浣嗗喅涓嶅彲鏃犲偛楠?br> }. C$ N `. _+ }! t鍗併?nbsp; 灝婇噸瀵規(guī)墜
' k+ d! U9 {8 o n- }- A鐙煎皧閲嶆瘡涓鎵嬶紝鐙煎湪姣忔鏀誨嚮鍓嶉兘浼氬幓浜嗚В瀵規(guī)墜錛岃屼笉浼氬幓杞昏浠栵紝鎵浠ョ嫾涓鐢熺殑鏀誨嚮寰堝皯澶辮
鐙間笉浼氫負浜嗘墍璋撶殑灝婁弗鍦ㄨ嚜宸卞急灝忔椂鏀誨嚮姣旇嚜宸卞己澶х殑涓滆タ6 I6 F0 h% B4 ?+ N3 y9 v
浜屻?nbsp; 浼楃嫾涓蹇?font style="FONT-SIZE: 0px; COLOR: #fff">* B, B Q7 {* e. q t
濡傛灉鐙間笉寰椾笉闈㈠姣旇嚜宸卞己澶х殑涓滆タ錛屽繀緹よ搗鑰屾敾涔?font style="FONT-SIZE: 0px; COLOR: #fff">- r/ p% G& t# |( p& z7 D
涓夈?nbsp; 鑷煡涔嬫槑
- F% p/ z$ Y* B+ q w8 K( Z, k3 ^2 `鐙煎緢鎯沖綋鍏界帇錛岃岀嫾鐭ラ亾鑷繁鏄嫾鑰屼笉鏄檸: |4 ?% b D1 D# Q' ~! a$ b
鍥涖?nbsp; 欏烘按琛岃垷3 A8 J+ i2 Y W2 ?& R+ z# O' Q4 a( Y
鐙肩煡閬撳浣曠敤鏈灝忕殑浠ｄ環(huán)鎹㈠彇鏈澶х殑鍥炴姤
2 l& R/ o) O: F" V7 g" ?+ p; P7 o) j浜斻?nbsp; 鍚岃繘鍚岄
+ r4 K2 h& D2 u; [- |) t鐙艱櫧鐒墮氬父鐙嚜媧誨姩錛屼絾鐙兼槸鏈鍥㈢粨鐨勶紝浣犱笉浼氬彂鐜板摢鍙嫾鍦ㄥ悓浼村彈浼ゆ椂鐙嚜閫冭蛋% c9 R" d# D, O. p+ L/ g) o
鍏?nbsp; 琛ㄩ噷濡備竴2 ^' f+ j5 h! [7 E& u) h% @
鐙間篃寰堟兂鍠勮壇錛屼絾鐙肩煡閬撹嚜宸辯殑鑳冭兘娑堝寲浠涔堬紝鎵浠ョ嫾姣忔閮藉共騫插噣鍑鐨勫悆鎺夋瘡嬈＄殑鐚庣墿錛屽彲鏈変簺鑷涓?#8220;鍠勮壇”鐨勫姩鐗╁嵈鍦ㄩ厭搴楅キ搴勯噷鍋氫簺涓嶆槸“寰堝杽鑹?#8221;鐨勪簨( w( D& P8 ?8 ~# G' g
涓冦?nbsp; 鐙間害閽熸儏9 Z, ~( g) G9 R; [$ p- Q
鐙間細涓鐩村畧鍦ㄦ瀛曠殑姣嶇嫾韜竟鐩磋嚦灝忕嫾闀垮ぇ錛屽彲鏌愪簺鑷涓?#8220;鍞竴鏈夋劅鎯?#8221;鐨勫姩鐗╋紝鍗村湪濡誨瓙鎬瀛曟椂鍦ㄥ鑺卞ぉ閰掑湴
) ]* l) |# B0 z鍏?nbsp; 鎺堢嫾浠ユ笖
5 Z3 ]! p8 f# {鐙間細鍦ㄥ皬鐙兼湁鐙珛鑳藉姏鐨勬椂鍊欏潥鍐崇殑紱誨紑浠栵紝鍥犱負鐙肩煡閬擄紝濡傛灉褰撲笉鎴愮嫾閭ｅ氨鍙兘褰撶緤9 x1 D% C, G. s! [3 E+ g5 a
涔?jié)銆?nbsp; 鑷敱鍙吹
9 \4 r! x+ q! p' s$ a( ^鐙間笉浼氫負浜嗛鐗╄屼笉欏懼皧涓ョ殑鍚戜富浜烘憞澶存憜灝撅紝鍥犱負鐙肩煡閬擄紝涓嶅彲鏈夊偛姘旓紝浣嗗喅涓嶅彲鏃犲偛楠?br> }. C$ N `. _+ }! t鍗併?nbsp; 灝婇噸瀵規(guī)墜
' k+ d! U9 {8 o n- }- A鐙煎皧閲嶆瘡涓鎵嬶紝鐙煎湪姣忔鏀誨嚮鍓嶉兘浼氬幓浜嗚В瀵規(guī)墜錛岃屼笉浼氬幓杞昏浠栵紝鎵浠ョ嫾涓鐢熺殑鏀誨嚮寰堝皯澶辮
]]>