3032.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 43 行

Source

Problem Id:3032  User Id:fzk 
Memory:1400K  Time:359MS
Language:Java  Result:Accepted

Source 

import java.util.*;
import java.io.*;
import java.lang.reflect.Array;

public class Main {
		
	static public void main( String [] string ) throws Exception{
		Scanner cin = new Scanner( System.in );
		int n = cin.nextInt();
		while( n-- > 0 ) {
			int m = cin.nextInt();
			int [] s = new int[m];
			boolean [] f = new boolean[m];
			int k = -1;
			for( int i=1; i<=m; i ++ ) {
				for( int j=0; j<=i; j++ ) {
					k = (k+1)%m;
					while( f[ k ] )
						k = (k+1)%m;
				}
				f[k] = true;
				s[k] = i;
			}
			
			for( int i=0; i<m; i++ ) {
				if( i != 0 )System.out.print( " " );
				System.out.print( s[i] );
			}
			System.out.println();
		}
		return;
	}
}