HDU4350-Card

Card

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

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

 

题意：一共52个数，输入n，l，r表示把从l到r的数拿出来放到数串的最前面，如此重复n编问最后的串是什么 （n很大）
解题思路：把一个串中的 从l到r移动，每移动r次就会还原，故可对n=n%r后暴力

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

using namespace std;

#define LL long long

int main()
{
    int cas=0,n,l,r,t;
    int a[55],b[55];
    scanf("%d",&t);
    while(t--)
    {
        for(int i=1; i<=52; i++)
            scanf("%d",&a[i]);
        scanf("%d %d %d",&n,&l,&r);
        n=n%r;
        for(int i=0;i<n;i++)
        {
            int k=0;
            for(int j=l;j<=r;j++)
                b[++k]=a[j];
            for(int j=1;j<l;j++)
                b[++k]=a[j];
            for(int j=r+1;j<=52;j++)
                b[++k]=a[j];
            for(int j=1;j<=52;j++)
                a[j]=b[j];
        }
        printf("Case #%d:",++cas);
        for(int i=1; i<=52; i++)
            printf(" %d",a[i]);
        printf("\n");
    }
    return 0;
}