1295: Reverse Text
Problem Description
ZOJ-1001
Solution in Java
package ZOJ;
/**
* @author Teerapat Phokhonwong
* @Onlinejudge: ZOJ
* @Problem: 1295 Reverse Text
* @Link: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=295
* @Timelimit: 2 Seconds
* @Status: Accepted
* @Submission: 2013-07-23 01:32:36
* @Runtime: 30 ms
* @Solution:
* @Note:
*/
import java.util.Scanner;
public class P1295_Reverse_Text {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String n = sc.nextLine();
for (int i = 0; i < Integer.parseInt(n); i++) {
String word = sc.nextLine();
String s = word;
String answer = "";
for (int j = word.length() - 1; j >= 0; j--) {
answer += s.charAt(j);
}
if (i < Integer.parseInt(n) - 1) System.out.println(answer);
else System.out.print(answer);
}
}
}