Permutation

 

Permutation

 

 

 

 

找规律

先输出奇数 1 2 3 4 5...

偶数就用剩下的依次加1

 

 

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 int main() {
 5     int t, n;
 6     cin >> t;
 7     while(t--) {
 8         cin >> n;
 9         int a = 1, b = n/2+1 +((n&1)?1:0);
10         for(int i = 1; i <= n; i ++) {
11             if(i&1){
12                 printf("%d%c",a++,i==n?'\n':' ');
13             } else {
14                 printf("%d%c",b++,i==n?'\n':' ');
15             }
16         }
17     }
18     return 0;
19 }

 

转载于:https://www.cnblogs.com/xingkongyihao/p/7819442.html