题解 [PR #5] 循环移位
真就诈骗题
仔细观察题目发现这玩意什么性质都没有
结果正解是“观察到加了剪枝的暴力状态数是 \(1e9\) 级别的可以打表”
那么就爆搜，记录当前的 \(i\)，当前的 \(p_1\) 在原序列中的位置，已经确定值的位置个数（方便新确定一个位置的值时算方案数）以及当前方案数
还要开个数组记录一下哪些位置是确定的
然后就爆搜，发现 \(n\) 个值都确定时当前 \(p_1\) 肯定等于 1，剪掉即可
然后还需要高精加
这边打表跑了大约 50 min
点击查看代码
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define N 100010
#define ll long long
//#define int long long
char buf[1<<21], *p1=buf, *p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf, 1, 1<<21, stdin)), p1==p2?EOF:*p1++)
inline int read() {
int ans=0, f=1; char c=getchar();
while (!isdigit(c)) {if (c=='-') f=-f; c=getchar();}
while (isdigit(c)) {ans=(ans<<3)+(ans<<1)+(c^48); c=getchar();}
return ans*f;
}
class Int{//Manchery的高精模板
#define BASE 1000000000
public:
typedef long long value;
void New(size_t l){
if (a!=NULL)delete[] a;a=new value[l];
len=1;a[0]=0;sign=1;
}
Int():a(NULL),base(BASE){New(1);}
Int(value x):a(NULL),base(BASE){New(1);*this=x;}
Int(value x,value _base):a(NULL),base(_base){New(1);*this=x;}
Int(const Int &B):a(NULL),base(BASE){New(1);*this=B;}
~Int(){delete[] a;}
Int& operator =(value x){
size_t l=1;for (value x1=max(x,-x);x1>=base;++l,x1/=base);New(l);
if (x<0)x=-x,sign=0;else sign=1;
len=0;while (x)a[len++]=x%base,x/=base;
if (!len)a[len++]=0;
return *this;
}
Int& operator =(const Int &A){
New(A.len);len=A.len;memcpy(a,A.a,sizeof(value)*len);
base=A.base;sign=A.sign;return *this;
}
friend Int operator -(Int A){A.sign=1-A.sign;return A;}
bool operator !(){if (len==1&&a[0]==0)return 1;else return 0;}
friend Int operator +(Int A,Int B){
if (A.sign!=B.sign){B.sign=1-B.sign;return A-B;}
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
Int res;res.set_base(A.base); int len=A.len>B.len?A.len:B.len;
res.New(len+1);res.sign=A.sign;
memset(res.a,0,(len+1)*sizeof(value));
for (int i=0;i<len;++i){
if (i<A.len)res.a[i]+=A.a[i];
if (i<B.len)res.a[i]+=B.a[i];
}
for (int i=0;i<len;++i)
if (res.a[i]>=res.base)++res.a[i+1],res.a[i]-=res.base;
if (res.a[len])res.len=len+1;else res.len=len;
if (!res)res.sign=1;return res;
}
friend Int operator -(Int A,Int B){
if (A.sign!=B.sign){B.sign=1-B.sign;return A+B;}
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
if (small(A,B))swap(A,B),A.sign=1-A.sign;
Int res;res.set_base(A.base); int len=A.len>B.len?A.len:B.len;
res.New(len);res.sign=A.sign;
memset(res.a,0,len*sizeof(value));
for (int i=0;i<len;++i){
if (i>=B.len)res.a[i]+=A.a[i];
else res.a[i]+=A.a[i]-B.a[i];
if (res.a[i]<0)res.a[i]+=res.base,--res.a[i+1];
}
while (len>1&&!res.a[len-1])--len;res.len=len;
if (!res)res.sign=1;return res;
}
friend Int operator *(Int A,Int B){
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
Int res;res.set_base(A.base); int len=A.len+B.len;
res.New(len);res.sign=(A.sign==B.sign);
memset(res.a,0,len*sizeof(value));
for (int i=0;i<A.len;++i)
for (int j=0;j<B.len;++j){
res.a[i+j]+=A.a[i]*B.a[j];
res.a[i+j+1]+=res.a[i+j]/res.base;
res.a[i+j]%=res.base;
}
/*
for (int i=0;i<A.len;++i)
for (int j=0;j<B.len;++j)res.a[i+j]+=A.a[i]*B.a[j];
for (int i=0;i<len-1;++i)res.a[i+1]+=res.a[i]/res.base,res.a[i]%=res.base;
*/
while (len>1&&!res.a[len-1])--len;res.len=len;
return res;
}
friend pair<Int,Int> divide(Int A,Int B){
if (!B){puts("error:div zero!");for (;;);}
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
if (small(A,B))return make_pair(Int(0),A);
Int C,D;C.set_base(A.base);D.set_base(A.base);C.New(A.len);C.len=A.len;
bool Csign=(A.sign==B.sign),Dsign=A.sign;A.sign=B.sign=1;
for (int i=A.len-1;i>=0;--i){
C.a[i]=0;D=D*D.base;D.a[0]=A.a[i];
int l=0,r=A.base-1,mid;
while (l<r){
mid=(l+r+1)>>1;
if (small(B*mid,D+1))l=mid;
else r=mid-1;
}
C.a[i]=l;D=D-B*l;
}
C.sign=Csign;D.sign=Dsign;if (!D)D.sign=1;
while (C.len>1&&!C.a[C.len-1])--C.len;
return make_pair(C,D);
}
Int operator /(value x){
if (!x){puts("error:div zero!");for (;;);}
value d=0;Int res;res.set_base(base);res.New(len);res.len=len;
if (x<0)x=-x,res.sign=(sign==0);
else res.sign=(sign==1);
for (int i=len-1;i>=0;--i)
d=d*base+a[i],res.a[i]=d/x,d%=x;
while (res.len>1&&!res.a[res.len-1])--res.len;
return res;
}
Int operator %(value x){
value d=0;if (x<0)x=-x;
for (int i=len-1;i>=0;--i)d=(d*base+a[i])%x;
return d;
}
friend Int abs(Int A){A.sign=1;return A;}
friend bool small(Int A,Int B){
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
if (A.len!=B.len)return A.len<B.len;
for (int i=A.len-1;i>=0;--i)
if (A.a[i]!=B.a[i])return A.a[i]<B.a[i];
return 0;
}
friend bool operator <(Int A,Int B){
if (A.sign!=B.sign)return A.sign<B.sign;
return A.sign==1?small(A,B):small(B,A);
}
friend bool operator ==(Int A,Int B){
if (A.base!=B.base)
if (A.base>B.base)B.set_base(A.base);
else A.set_base(B.base);
if (A.sign!=B.sign||A.len!=B.len)return 0;
for (int i=0;i<A.len;++i)if (A.a[i]!=B.a[i])return 0;
return 1;
}
friend bool operator !=(Int A,Int B){return !(A==B);}
friend bool operator >(Int A,Int B){return !(A<B||A==B);}
friend bool operator <=(Int A,Int B){return A<B||A==B;}
friend bool operator >=(Int A,Int B){return A>B||A==B;}
Int operator /(Int B){return divide(*this,B).first;}
Int operator %(Int B){return divide(*this,B).second;}
Int& operator +=(Int B){*this=*this+B;return *this;}
Int& operator -=(Int B){*this=*this-B;return *this;}
Int& operator *=(Int B){*this=*this*B;return *this;}
Int& operator /=(Int B){*this=*this/B;return *this;}
Int& operator %=(Int B){*this=*this%B;return *this;}
Int& operator ++(){*this=*this+1;return *this;}
Int& operator --(){*this=*this-1;return *this;}
Int operator ++(int){Int res(*this);*this=*this+1;return res;}
Int operator --(int){Int res(*this);*this=*this-1;return res;}
Int operator +(value x){return *this+Int(x,this->base);}
Int operator -(value x){return *this-Int(x,this->base);}
Int operator *(value x){return *this*Int(x,this->base);}
//Int operator /(value x){Int T;T=x;return *this/T;}
//Int operator %(value x){Int T;T=x;return *this%T;}
Int& operator *=(value x){*this=*this*x;return *this;}
Int& operator +=(value x){*this=*this+x;return *this;}
Int& operator -=(value x){*this=*this-x;return *this;}
Int& operator /=(value x){*this=*this/x;return *this;}
Int& operator %=(value x){*this=*this%x;return *this;}
bool operator ==(value x){return *this==Int(x,this->base);}
bool operator !=(value x){return *this!=Int(x,this->base);}
bool operator <=(value x){return *this<=Int(x,this->base);}
bool operator >=(value x){return *this>=Int(x,this->base);}
bool operator <(value x){return *this<Int(x,this->base);}
bool operator >(value x){return *this>Int(x,this->base);}
friend Int gcd(Int x,Int y){
Int t;int cnt=0;
while (1){
if (x<y)t=x,x=y,y=t;
if (y==0){
while (cnt--)x*=2;
return x;
}
if (x%2==0&&y%2==0)x/=2,y/=2,++cnt;
else if (x%2==0)x/=2;
else if (y%2==0)y/=2;
else {t=x;x=y;y=t-y;}
}
}
void to_arr(char *c){
char *c1=c;
for (int i=0;i<len-1;++i)
for (value x=a[i],b=base/10;b>=1;b/=10)*c1++='0'+x%10,x/=10;
for (value x=a[len-1];x>0;x/=10)*c1++='0'+x%10;
if (len==1&&a[len]==0)*c1++='0';
if (sign==0)*c1++='-';*c1=0;reverse(c,c1);
}
void from_arr(char *c){
size_t base_l=get_basel(),b=1;int cl=strlen(c);value x=0;
New((cl+base_l-1)/base_l);len=0;
if (*c=='-')sign=0,++c,--cl;else sign=1;
while (--cl>=0){
x+=(c[cl]-'0')*b;b*=10;if (b==base)a[len++]=x,x=0,b=1;
}
if (!len||x)a[len++]=x;
while (len>1&&!a[len-1])--len;
}
void set_base(int _base){
if (base==_base)return;
char *c=new char[len*get_basel()+1];
to_arr(c);base=_base;from_arr(c);
delete[] c;
}
void set_basel(int _l){
size_t _base=1;while (_l--)_base*=10;set_base(_base);
}
void read(){
vector<char> s;char ch;
scanf(" %c",&ch);if (ch=='-')s.push_back('-'),ch=getchar();
for (;ch>='0'&&ch<='9';ch=getchar())s.push_back(ch);
char *c=new char[s.size()+1];
for (int i=0;i<s.size();++i)c[i]=s[i];c[s.size()]=0;
from_arr(c);delete[] c;
if (!*this)this->sign=1;
}
void print(){
if (!sign)putchar('-');
printf("%d",int(a[len-1]));
for (int i=len-2;i>=0;--i){
for (int j=base/10;j>=10;j/=10)
if (a[i]<j)putchar('0');
else break;
printf("%d",(int)a[i]);
}
}
void println(){print();putchar('\n');}
private:
value *a,base;int len;bool sign; //0="-"
size_t get_basel()const{
size_t res=0;for (int b=base/10;b>=1;b/=10,++res);
return res;
}
#undef BASE
};
int n;
Int ans;
bool vis[N];
// void dfs(int i, int pos, Int cnt, Int ways) {
// if (cnt==n) return ;
// if (i==n) {
// ways*=n-cnt;
// for (; cnt+1<n; ways*=++cnt);
// ans+=ways;
// return ;
// }
// if (vis[(pos+i)%n]) dfs(i+1, pos, cnt, ways);
// else {
// vis[(pos+i)%n]=1;
// dfs(i+1, pos, cnt+1, ways*cnt);
// dfs(i+1, (pos+i)%n, cnt+1, ways);
// vis[(pos+i)%n]=0;
// }
// }
void dfs(int i, int pos, Int cnt, Int ways) {
if (cnt==n) return ;
if (i==n) {
ways*=n-cnt;
for (; cnt+1<n; ways*=++cnt);
ans+=ways;
return ;
}
if (vis[(pos+i)%n]) dfs(i+1, pos, cnt, ways);
else {
vis[(pos+i)%n]=1;
dfs(i+1, pos, cnt+1, ways*cnt);
dfs(i+1, (pos+i)%n, cnt+1, ways);
vis[(pos+i)%n]=0;
}
}
string tab[]={
"0",
"0",
"0",
"1",
"3",
"22",
"137",
"1023",
"8221",
"79056",
"799039",
"9011440",
"109029410",
"1448549484",
"20337178707",
"311044490036",
"4984639648085",
"85710226823328",
"1548166804400506",
"29711570335176924",
"594907737586609386",
"12603853891110056180",
"277631121641187658896",
"6426330946913634736452",
"154475206683850988416268",
"3884159222899816081311936",
"101066047177694943692598000",
"2742824432740966950505899120",
"76855531251932233341767159850",
"2237856955585935143053269399696",
"67204226258811313767838734952632",
"2090912787031299758058411353807520",
"66941455263805092811860419803577383",
"2216530638523244009076295005871328256",
"75405742184535279655210168314083458176",
"2646542750919063263921838254385335359296",
"95333687409799371738385246754668326736320",
"3536350769544296768242436302475752806856560",
"134432093788769769071404891906890311935615056",
"5255445602020024722712116211506774729468563184",
"210302379850964483238163085628089110159782496200",
"8639747663671245968893005729141383394728062673280",
"363034112114677725911711960294923695984623345346624"
};
signed main()
{
n=read();
// vis[0]=1;
// dfs(1, 0, Int(1), Int(1));
// ans.println();
// cout<<"tot: "<<tot<<endl;
// for (int i=1; i<=42; ++i) {
// n=i;
// for (int j=0; j<i; ++j) vis[j]=0;
// vis[0]=1; ans=0;
// dfs(1, 0, Int(1), Int(1));
// ans.println();
// }
cout<<tab[n]<<endl;
return 0;
}
