#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long i64;
#define out64 "%lld\n"
#define in64 "%lld"
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b) for( int i = (a) ; i >= (b) ; i --)
#define S64(a) scanf(in64,&a)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 1011;
const int maxc = 32;
int n,s;
int a[maxn];
int ax[maxn];
int c[maxn];
int cx[maxn];
int xmod[maxc];
int p;
int main()
{
cin>>n>>s;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
xmod[0]=2%n;
for(int i=1;i<maxc;i++)
{
xmod[i]=(xmod[i-1]*xmod[i-1])%n;
}
p=1;
for(int i=0;(1<<i)<=s;i++)
{
if(s&(1<<i))
{
p*=xmod[i];
p%=n;
}
}
ax[1]=1;
for(int i=2;i<=n;i++)
{
ax[i]=a[ax[i-1]];
}
int temp = 1;
for(int i=1;i<=n;i++)
{
cx[temp]=ax[i];
temp+=p;
temp=(temp-1)%n+1;
}
for(int i=1;i<n;i++)
{
c[cx[i]]=cx[i+1];
}
c[cx[n]]=cx[1];
for(int i=1;i<=n;i++)
{
cout<<c[i]<<endl;
}
return 0;
}
POJ 1721 CARDS
最新推荐文章于 2018-05-17 21:33:00 发布