HDOJ 4350 —— 找规律

Card

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 987    Accepted Submission(s): 574

Problem Description

Bearchild is playing a card game with himself. But first of all, he needs to shuffle the cards. His strategy is very simple: After putting all the cards into a single stack,
he takes out some cards in the middle, from the L-th to the R-th when counting from top to bottom, inclusive, and puts them on the top. He repeats this action again
and again for N times, and then he regards his cards as shuffled.

Given L,R and N, and the initial card stack, can you tell us what will the card stack be like after getting shuffled?

 

Input

First line contains an integer T(1 <= T <= 1000), which is the test cases.
For each test case, first line contains 52 numbers(all numbers are distinct and between 1 and 52), which is the card number of the stack, from top to bottom. 
Then comes three numbers, they are N, L and R as described. (0<=N<=10 ⁹, 1<=L<=R<=52)

 

Output

For each test case, output "Case #X:", X is the test number, followed by 52 numbers, which is the card number from the top to bottom.Note that you should output one and only 
one blank before every number.

 

Sample Input

  
  

   
   1
13 2 10 50 1 28 37 32 30 46 19 47 33 41 24 52 27 42 49 18 9 48 23 35 31 8 7 12 6 5 3 22 43 36 51 40 26 4 44 
17 39 38 15 14 25 16 29 20 21 45 11 34
902908328 38 50
  
  

 

Sample Output

  
  

   
   Case #1: 26 4 44 17 39 38 15 14 25 16 29 20 21 45 13 2 10 50 1 28 37 32 30 46 19 47 33 41 24 52 27 42 49 18 
9 48 23 35 31 8 7 12 6 5 3 22 43 36 51 40 11 34
  
  

 

Author

elfness@UESTC_Oblivion

 

Source

2012 Multi-University Training Contest 6

 

Recommend

zhuyuanchen520

 

找规律，显然把一个数移动r次相当于没有移动，那么我们就移动n % r次，模拟即可。

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <map>
#include <string>
#include <stack>
#include <cctype>
#include <vector>
#include <queue>
#include <set>
#include <utility>

using namespace std;
//#define Online_Judge
#define outstars cout << "***********************" << endl;
#define clr(a,b) memset(a,b,sizeof(a))
#define lson l , mid  , rt << 1
#define rson mid + 1 , r , rt << 1 | 1
//#define mid ((l + r) >> 1)
#define mk make_pair
#define FOR(i , x , n) for(int i = (x) ; i < (n) ; i++)
#define FORR(i , x , n) for(int i = (x) ; i <= (n) ; i++)
#define REP(i , x , n) for(int i = (x) ; i > (n) ; i--)
#define REPP(i ,x , n) for(int i = (x) ; i >= (n) ; i--)
const int MAXN = 100000 + 500;
const long long LLMAX = 0x7fffffffffffffffLL;
const long long LLMIN = 0x8000000000000000LL;
const int INF = 0x7fffffff;
const int IMIN = 0x80000000;
const double e = 2.718281828;
#define eps 1e-8
#define DEBUG 1
#define mod 1000000007
typedef long long LL;
const double PI = acos(-1.0);
typedef double D;
typedef pair<int , int> pi;
///#pragma comment(linker, "/STACK:102400000,102400000")__int64 a[10050];
int a[120] , b[120];
int main()
{
    int t;
    scanf("%d" , &t);
    FORR(kase , 1 , t)
    {
        int N ,  L , R;
        FORR(i , 1 , 52)
        {
            scanf("%d" , &a[i]);
        }
        scanf("%d%d%d" , &N,  &L , &R);
        int x = N % R;
        while(x--)
        {
            int pos = 1;
            FORR(i , L , R)b[pos++] = a[i];
            FOR(i , 1 , L)b[pos++] = a[i];
            FORR(i , R + 1 , 52)b[pos++] = a[i];
            FORR(i , 1,  52)a[i] = b[i];
        }
        printf("Case #%d:" , kase);
        FORR(i , 1 , 52)printf(" %d" , a[i]);
        puts("");
    }

    return 0;
}