Cara nak selesaikan soalan ini adalah dengan pisahkan perkataan-perkataan dalam ayat itu dengan menggunakan "split" lepas tu kita pecahkan perkataan tersebut kepada karakter-karakter dan kita display karakter yang paling hujung sekali sehinggalah karakter dengan index 0.
Solution :
import java.util.*;
public class uva483 {
public static void main(String [] args) {
Scanner scn = new Scanner(System.in);
while(scn.hasNextLine()) {
String s = scn.nextLine();
String [] st = s.split(" ");
for(int x=0;x<st.length;x++) {
for(int y=st[x].length()-1;y>=0;y--)
System.out.print(st[x].charAt(y));
if(x != st.length-1)
System.out.print(" ");
}
System.out.println("");
}
}
}
Share this
Related Posts
10038 - Jolly Jumpers
Problem E: Jolly Jumpers
A sequence of n > 0 integers is called a jolly jumper
if t- 2013 ACM-ICPC Malaysia National Programming Contest (QUESTION A-TRAILING SIFAR)A
TRAILING SIFAR
Problem Description
Sifar is a malay word for zero or 0. In mathematic
- C-PROM 2014 (PROBLEM 8 :COMPUTE COOKIES SOLD)
800x600
Normal
0
false
false
false
EN-US
X-NONE
- 2013 ACM-ICPC Malaysia National Programming Contest (QUESTION G-RICE SACK)G
RICE SACK
Problem Description
Several sacks of rice need to be transported to five Or
:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:P
:o
:>)
(o)
:p
:-?
(p)
:-s
(m)
8-)
:-t
:-b
b-(
:-#
=p~
$-)
(y)
(f)
x-)
(k)
(h)
cheer