计蒜客 39279.Swap-打表找规律 (The 2019 ACM-ICPC China Shannxi Provincial Programming Contest L.) 2019ICPC西安邀请赛现场赛重现赛

Swap

There is a sequence of numbers of length nn, and each number in the sequence is different. There are two operations:

1. Swap the first half and the last half of the sequence (if nn is odd, the middle number does not change)

1. Swap all the numbers in the even position with the previous number (the position number starts from 11, and if⁡⁡ nn is odd, the last number does not change)

Both operations can be repeated innumerable times. Your task is to find out how many different sequences may appear (two sequences are different as long as the numbers in any one position are different).

Input

Each test file contains a single test case. In each test file:

The first line contains an integer nn, indicating the length of the sequence (1 \le n \le 10000)(1≤n≤10000).

The second line contains nn different numbers.

Output

Output the number of different sequences.

样例输入1复制

3
2 5 8

样例输出1复制

6

样例输入2复制

4
1 2 3 4

样例输出2复制

4

找规律，打个表就发现了。

打表代码也贴下面。

代码:

 //L-找规律
 #include<bits/stdc++.h>
 using namespace std;
 const int maxn=1e4+;

 int a[maxn];

 int main()
 {
     int n;
     scanf("%d",&n);
     for(int i=;i<=n;i++){
         scanf("%d",&a[i]);
     }
     if(n>=&&n<=&&n!=){
         printf("%d\n",n);
         return ;
     }
     else if(n==){
         printf("%d\n",n*);
         return ;
     }
     if(n%==){
         if((n/)%==){
             printf("4\n");
         }
         else{
             printf("%d\n",n);
         }
     }
     else{
         if((n-)%==){
             printf("12\n");
         }
         else{
             printf("%d\n",n*);
         }
     }
 }

 /*
 1
 2
 6
 4
 10
 6
 12
 4
 18
 10
 12
 4
 26
 14
 12
 4
 34
 18
 12
 4
 */

 /*
 打表找规律
 打表的代码

 #include<bits/stdc++.h>
 using namespace std;
 const double PI=acos(-1.0);
 const int maxn=1e5+10;

 char a[maxn];

 int main()
 {
     for(int k=1;k<=20;k++){
         int n=k;
         memset(a,0,sizeof(a));
         for(int i=1;i<=n;i++){
             a[i]='a'+i-1;
         }
         int num=0;
         int cnt=50;
         map<string,int> mp;
         string s;
         while(cnt--){
             for(int i=1;i<n;i+=2){
                 swap(a[i],a[i+1]);
             }
             s.clear();
             for(int i=1;i<=n;i++){
                 s+=a[i];
             }
             if(mp[s]==0) num++,mp[s]=1;
             int ret;
             if(n%2==1) ret=n/2+1;
             else ret=n/2;
             for(int i=1;i<=n/2;i++){
                 swap(a[i],a[i+ret]);
             }
             s.clear();
             for(int i=1;i<=n;i++){
                 s+=a[i];
             }
             if(mp[s]==0) num++,mp[s]=1;
         }
         cout<<num<<endl;
     }
 }

 */