标签：限制 har ble script vertica ++ one like break
Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:
h d e l l r lowoThat is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.
Input Specification:
Each input file contains one test case. Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.
Output Specification:
For each test case, print the input string in the shape of U as specified in the description.
Sample Input:helloworld!Sample Output:
h ! e d l l lowor
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); String n=in.nextLine(); int num=n.length(); int n1,n3,x = 0,y = 0; for(n3=3;n3<=num;n3++){ for(n1=n3;n1>=0;n1--){ //System.out.println(n1+" "+n3+" "+(2*n1+n3-2)+" "+num); if(2*n1+n3-2==num){ x=n1; y=n3; break; } if(x!=0&&y!=0) break; } } //System.out.println(num+" "+x+" "+y); for(int i=0,j=num-1;i<x-1;i++,j--){ System.out.print(n.charAt(i)); for(int k=0;k<y-2;k++) { System.out.print(" "); } System.out.println(n.charAt(j)); } for(int i=x-1;i<x-1+y;i++){ System.out.print(n.charAt(i)); } } }
标签：限制 har ble script vertica ++ one like break
原文地址：http://www.cnblogs.com/chen20135517/p/7745499.html
