ACM 짝수 분리 자바

package com.ding.acm;

import java.util.Scanner;

/**
 *           :3000 ms |     :65535 KB   :1           n(2<= n
 * <=10000),     :  1 n            ,             。            i(2<=i<30)    i
 *      ;          n。                               2 10 14      1 3 5 7 9 2 4 6
 * 8 10
 * 
 * 1 3 5 7 9 11 13 2 4 6 8 10 12 14
 * 
 * @author daniel
 * @email [email protected]
 * @time 2016-4-18   2:10:55
 */
public class Acm11 {

	/**
	 * @author daniel
	 * @time 2016-4-18   1:49:12
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);
		System.out.print("       :");
		int count = input.nextInt();

		for (int testCount = 0; testCount < count; testCount++) {

			System.out.print("       :");
			int num = input.nextInt();
			StringBuffer odd = new StringBuffer();
			StringBuffer even = new StringBuffer();
			for (int i = 1; i <= num; i++) {
				if (i % 2 != 0) {
					odd.append(i);
					odd.append(" ");
				} else {
					even.append(i);
					even.append(" ");
				}

			}
			System.out.println(odd.toString() + " 

" + even); } } }

좋은 웹페이지 즐겨찾기