ZOJ 1240: IBM Minus One

这题就是直白的ROT(+1)编码问题

A->B, C->D, Y->Z, Z->A

数据量也不大 难度系数=0

通过率数据：39.29% (6712/17080)

import java.util.*;

public class Main 
{	
	public static void main(String[] args) 
	{
		Scanner in = new Scanner(System.in);
		int j;
		char c;
		int n=in.nextInt();
		String s=in.nextLine();
		for (int i=0;i<n;i++)
		{
			s=in.nextLine();
			System.out.printf("String #%d\n", i+1);
			for (j=0;j<s.length();j++)
			{
				c=s.charAt(j);
				c++;
				if (c>'Z') c='A';
				System.out.printf("%s", c);
			}
			System.out.printf("\n\n");
		}
	}
}