A题 签到 转换一下大小写即可
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
string s;
cin>>s;
for(int j=0;j<s.size();j++){
if(s[j]>='A'&&s[j]<='Z'){
s[j]=s[j]-'A'+'a';
}
}
if(s=="jessie"){
puts("Good guy!");
}
else puts("Dare you say that again?");
}
return 0;
}
I题 签到
将1*1*2的长方体 放到 a*b*c的长方体中 判断是否可能
算一下体积比是否为整数即可
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
while(~scanf("%d%d%d", &a, &b, &c))
{
if((a*b*c)%2) puts("No");
else puts("Yes");
}
return 0;
}
J
高精度开根
有点麻烦 抄板子了。。
#include <bits/stdc++.h>
using namespace std;
#define DIGIT 4
#define DEPTH 10000
#define MAX 100
typedef int bignum_t[MAX+1];
int read(bignum_t a,istream& is=cin){
char buf[MAX*DIGIT+1],ch;
int i,j;
memset((void*)a,0,sizeof(bignum_t));
if (!(is>>buf)) return 0;
for (a[0]=strlen(buf),i=a[0]/2-1;i>=0;i--)
ch=buf[i],buf[i]=buf[a[0]-1-i],buf[a[0]-1-i]=ch;
for (a[0]=(a[0]+DIGIT-1)/DIGIT,j=strlen(buf);j<a[0]*DIGIT;buf[j++]='0');
for (i=1;i<=a[0];i++)
for (a[i]=0,j=0;j<DIGIT;j++)
a[i]=a[i]*10+buf[i*DIGIT-1-j]-'0';
for (;!a[a[0]]&&a[0]>1;a[0]--);
return 1;
}
void write(const bignum_t a,ostream& os=cout){
int i,j;
for (os<<a[i=a[0]],i--;i;i--)
for (j=DEPTH/10;j;j/=10)
os<<a[i]/j%10;
}
int comp(const bignum_t a,const bignum_t b){
int i;
if (a[0]!=b[0])
return a[0]-b[0];
for (i=a[0];i;i--)
if (a[i]!=b[i])
return a[i]-b[i];
return 0;
}
int comp(const bignum_t a,const int b){
int c[12]={1};
for (c[1]=b;c[c[0]]>=DEPTH;c[c[0]+1]=c[c[0]]/DEPTH,c[c[0]]%=DEPTH,c[0]++);
return comp(a,c);
}
int comp(const bignum_t a,const int c,const int d,const bignum_t b){
int i,t=0,O=-DEPTH*2;
if (b[0]-a[0]<d&&c)
return 1;
for (i=b[0];i>d;i--){
t=t*DEPTH+a[i-d]*c-b[i];
if (t>0) return 1;
if (t<O) return 0;
}
for (i=d;i;i--){
t=t*DEPTH-b[i];
if (t>0) return 1;
if (t<O) return 0;
}
return t>0;
}
void add(bignum_t a,const bignum_t b){
int i;
for (i=1;i<=b[0];i++)
if ((a[i]+=b[i])>=DEPTH)
a[i]-=DEPTH,a[i+1]++;
if (b[0]>=a[0])
a[0]=b[0];
else
for (;a[i]>=DEPTH&&i<a[0];a[i]-=DEPTH,i++,a[i]++);
a[0]+=(a[a[0]+1]>0);
}
void add(bignum_t a,const int b){
int i=1;
for (a[1]+=b;a[i]>=DEPTH&&i<a[0];a[i+1]+=a[i]/DEPTH,a[i]%=DEPTH,i++);
for (;a[a[0]]>=DEPTH;a[a[0]+1]=a[a[0]]/DEPTH,a[a[0]]%=DEPTH,a[0]++);
}
void sub(bignum_t a,const bignum_t b){
int i;
for (i=1;i<=b[0];i++)
if ((a[i]-=b[i])<0)
a[i+1]--,a[i]+=DEPTH;
for (;a[i]<0;a[i]+=DEPTH,i++,a[i]--);
for (;!a[a[0]]&&a[0]>1;a[0]--);
}
void sub(bignum_t a,const int b){
int i=1;
for (a[1]-=b;a[i]<0;a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH,i++);
for (;!a[a[0]]&&a[0]>1;a[0]--);
}
void sub(bignum_t a,const bignum_t b,const int c,const int d){
int i,O=b[0]+d;
for (i=1+d;i<=O;i++)
if ((a[i]-=b[i-d]*c)<0)
a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH;
for (;a[i]<0;a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH,i++);
for (;!a[a[0]]&&a[0]>1;a[0]--);
}
void mul(bignum_t c,const bignum_t a,const bignum_t b){
int i,j;
memset((void*)c,0,sizeof(bignum_t));
for (c[0]=a[0]+b[0]-1,i=1;i<=a[0];i++)
for (j=1;j<=b[0];j++)
if ((c[i+j-1]+=a[i]*b[j])>=DEPTH)
c[i+j]+=c[i+j-1]/DEPTH,c[i+j-1]%=DEPTH;
for (c[0]+=(c[c[0]+1]>0);!c[c[0]]&&c[0]>1;c[0]--);
}
void mul(bignum_t a,const int b){
int i;
for (a[1]*=b,i=2;i<=a[0];i++){
a[i]*=b;
if (a[i-1]>=DEPTH)
a[i]+=a[i-1]/DEPTH,a[i-1]%=DEPTH;
}
for (;a[a[0]]>=DEPTH;a[a[0]+1]=a[a[0]]/DEPTH,a[a[0]]%=DEPTH,a[0]++);
for (;!a[a[0]]&&a[0]>1;a[0]--);
}
void mul(bignum_t b,const bignum_t a,const int c,const int d){
int i;
memset((void*)b,0,sizeof(bignum_t));
for (b[0]=a[0]+d,i=d+1;i<=b[0];i++)
if ((b[i]+=a[i-d]*c)>=DEPTH)
b[i+1]+=b[i]/DEPTH,b[i]%=DEPTH;
for (;b[b[0]+1];b[0]++,b[b[0]+1]=b[b[0]]/DEPTH,b[b[0]]%=DEPTH);
for (;!b[b[0]]&&b[0]>1;b[0]--);
}
void div(bignum_t c,bignum_t a,const bignum_t b){
int h,l,m,i;
memset((void*)c,0,sizeof(bignum_t));
c[0]=(b[0]<a[0]+1)?(a[0]-b[0]+2):1;
for (i=c[0];i;sub(a,b,c[i]=m,i-1),i--)
for (h=DEPTH-1,l=0,m=(h+l+1)>>1;h>l;m=(h+l+1)>>1)
if (comp(b,m,i-1,a)) h=m-1;
else l=m;
for (;!c[c[0]]&&c[0]>1;c[0]--);
c[0]=c[0]>1?c[0]:1;
}
void div(bignum_t a,const int b,int& c){
int i;
for (c=0,i=a[0];i;c=c*DEPTH+a[i],a[i]=c/b,c%=b,i--);
for (;!a[a[0]]&&a[0]>1;a[0]--);
}
void sqrt(bignum_t b,bignum_t a){
int h,l,m,i;
memset((void*)b,0,sizeof(bignum_t));
for (i=b[0]=(a[0]+1)>>1;i;sub(a,b,m,i-1),b[i]+=m,i--)
for (h=DEPTH-1,l=0,b[i]=m=(h+l+1)>>1;h>l;b[i]=m=(h+l+1)>>1)
if (comp(b,m,i-1,a)) h=m-1;
else l=m;
for (;!b[b[0]]&&b[0]>1;b[0]--);
for (i=1;i<=b[0];b[i++]>>=1);
}
int length(const bignum_t a){
int t,ret;
for (ret=(a[0]-1)*DIGIT,t=a[a[0]];t;t/=10,ret++);
return ret>0?ret:1;
}
int digit(const bignum_t a,const int b){
int i,ret;
for (ret=a[(b-1)/DIGIT+1],i=(b-1)%DIGIT;i;ret/=10,i--);
return ret%10;
}
int zeronum(const bignum_t a){
int ret,t;
for (ret=0;!a[ret+1];ret++);
for (t=a[ret+1],ret*=DIGIT;!(t%10);t/=10,ret++);
return ret;
}
void comp(int* a,const int l,const int h,const int d){
int i,j,t;
for (i=l;i<=h;i++)
for (t=i,j=2;t>1;j++)
while (!(t%j))
a[j]+=d,t/=j;
}
void convert(int* a,const int h,bignum_t b){
int i,j,t=1;
memset(b,0,sizeof(bignum_t));
for (b[0]=b[1]=1,i=2;i<=h;i++)
if (a[i])
for (j=a[i];j;t*=i,j--)
if (t*i>DEPTH)
mul(b,t),t=1;
mul(b,t);
}
void combination(bignum_t a,int m,int n){
int* t=new int[m+1];
memset((void*)t,0,sizeof(int)*(m+1));
comp(t,n+1,m,1);
comp(t,2,m-n,-1);
convert(t,m,a);
delete []t;
}
void permutation(bignum_t a,int m,int n){
int i,t=1;
memset(a,0,sizeof(bignum_t));
a[0]=a[1]=1;
for (i=m-n+1;i<=m;t*=i++)
if (t*i>DEPTH)
mul(a,t),t=1;
mul(a,t);
}
#define SGN(x) ((x)>0?1:((x)<0?-1:0))
#define ABS(x) ((x)>0?(x):-(x))
int read(bignum_t a,int &sgn,istream& is=cin){
char str[MAX*DIGIT+2],ch,*buf;
int i,j;
memset((void*)a,0,sizeof(bignum_t));
if (!(is>>str)) return 0;
buf=str,sgn=1;
if (*buf=='-') sgn=-1,buf++;
for (a[0]=strlen(buf),i=a[0]/2-1;i>=0;i--)
ch=buf[i],buf[i]=buf[a[0]-1-i],buf[a[0]-1-i]=ch;
for (a[0]=(a[0]+DIGIT-1)/DIGIT,j=strlen(buf);j<a[0]*DIGIT;buf[j++]='0');
for (i=1;i<=a[0];i++)
for (a[i]=0,j=0;j<DIGIT;j++)
a[i]=a[i]*10+buf[i*DIGIT-1-j]-'0';
for (;!a[a[0]]&&a[0]>1;a[0]--);
if (a[0]==1&&!a[1]) sgn=0;
return 1;
}
struct bignum{
bignum_t num;
int sgn;
public:
inline bignum(){memset(num,0,sizeof(bignum_t));num[0]=1;sgn=0;}
inline int operator!(){return num[0]==1&&!num[1];}
inline bignum& operator=(const bignum& a){memcpy(num,a.num,sizeof(bignum_t));sgn=a.sgn;return *this;}
inline bignum& operator=(const int a){memset(num,0,sizeof(bignum_t));num[0]=1;sgn=SGN(a);add(num,sgn*a);return *this;};
inline bignum& operator+=(const bignum& a){if(sgn==a.sgn)add(num,a.num);else if(sgn&&a.sgn){int ret=comp(num,a.num);if(ret>0)sub(num,a.num);else if(ret<0){bignum_t t;
memcpy(t,num,sizeof(bignum_t));memcpy(num,a.num,sizeof(bignum_t));sub(num,t);sgn=a.sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)memcpy(num,a.num,sizeof(bignum_t)),sgn=a.sgn;return *this;}
inline bignum& operator+=(const int a){if(sgn*a>0)add(num,ABS(a));else if(sgn&&a){int ret=comp(num,ABS(a));if(ret>0)sub(num,ABS(a));else if(ret<0){bignum_t t;
memcpy(t,num,sizeof(bignum_t));memset(num,0,sizeof(bignum_t));num[0]=1;add(num,ABS(a));sgn=-sgn;sub(num,t);}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)sgn=SGN(a),add(num,ABS(a));return *this;}
inline bignum operator+(const bignum& a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret+=a;return ret;}
inline bignum operator+(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret+=a;return ret;}
inline bignum& operator-=(const bignum& a){if(sgn*a.sgn<0)add(num,a.num);else if(sgn&&a.sgn){int ret=comp(num,a.num);if(ret>0)sub(num,a.num);else if(ret<0){bignum_t t;
memcpy(t,num,sizeof(bignum_t));memcpy(num,a.num,sizeof(bignum_t));sub(num,t);sgn=-sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)add(num,a.num),sgn=-a.sgn;return *this;}
inline bignum& operator-=(const int a){if(sgn*a<0)add(num,ABS(a));else if(sgn&&a){int ret=comp(num,ABS(a));if(ret>0)sub(num,ABS(a));else if(ret<0){bignum_t t;
memcpy(t,num,sizeof(bignum_t));memset(num,0,sizeof(bignum_t));num[0]=1;add(num,ABS(a));sub(num,t);sgn=-sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)sgn=-SGN(a),add(num,ABS(a));return *this;}
inline bignum operator-(const bignum& a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret-=a;return ret;}
inline bignum operator-(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret-=a;return ret;}
inline bignum& operator*=(const bignum& a){bignum_t t;mul(t,num,a.num);memcpy(num,t,sizeof(bignum_t));sgn*=a.sgn;return *this;}
inline bignum& operator*=(const int a){mul(num,ABS(a));sgn*=SGN(a);return *this;}
inline bignum operator*(const bignum& a){bignum ret;mul(ret.num,num,a.num);ret.sgn=sgn*a.sgn;return ret;}
inline bignum operator*(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));mul(ret.num,ABS(a));ret.sgn=sgn*SGN(a);return ret;}
inline bignum& operator/=(const bignum& a){bignum_t t;div(t,num,a.num);memcpy(num,t,sizeof(bignum_t));sgn=(num[0]==1&&!num[1])?0:sgn*a.sgn;return *this;}
inline bignum& operator/=(const int a){int t;div(num,ABS(a),t);sgn=(num[0]==1&&!num[1])?0:sgn*SGN(a);return *this;}
inline bignum operator/(const bignum& a){bignum ret;bignum_t t;memcpy(t,num,sizeof(bignum_t));div(ret.num,t,a.num);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn*a.sgn;return ret;}
inline bignum operator/(const int a){bignum ret;int t;memcpy(ret.num,num,sizeof(bignum_t));div(ret.num,ABS(a),t);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn*SGN(a);return ret;}
inline bignum& operator%=(const bignum& a){bignum_t t;div(t,num,a.num);if (num[0]==1&&!num[1])sgn=0;return *this;}
inline int operator%=(const int a){int t;div(num,ABS(a),t);memset(num,0,sizeof(bignum_t));num[0]=1;add(num,t);return t;}
inline bignum operator%(const bignum& a){bignum ret;bignum_t t;memcpy(ret.num,num,sizeof(bignum_t));div(t,ret.num,a.num);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn;return ret;}
inline int operator%(const int a){bignum ret;int t;memcpy(ret.num,num,sizeof(bignum_t));div(ret.num,ABS(a),t);memset(ret.num,0,sizeof(bignum_t));ret.num[0]=1;add(ret.num,t);return t;}
inline bignum& operator++(){*this+=1;return *this;}
inline bignum& operator--(){*this-=1;return *this;};
inline int operator>(const bignum& a){return sgn>0?(a.sgn>0?comp(num,a.num)>0:1):(sgn<0?(a.sgn<0?comp(num,a.num)<0:0):a.sgn<0);}
inline int operator>(const int a){return sgn>0?(a>0?comp(num,a)>0:1):(sgn<0?(a<0?comp(num,-a)<0:0):a<0);}
inline int operator>=(const bignum& a){return sgn>0?(a.sgn>0?comp(num,a.num)>=0:1):(sgn<0?(a.sgn<0?comp(num,a.num)<=0:0):a.sgn<=0);}
inline int operator>=(const int a){return sgn>0?(a>0?comp(num,a)>=0:1):(sgn<0?(a<0?comp(num,-a)<=0:0):a<=0);}
inline int operator<(const bignum& a){return sgn<0?(a.sgn<0?comp(num,a.num)>0:1):(sgn>0?(a.sgn>0?comp(num,a.num)<0:0):a.sgn>0);}
inline int operator<(const int a){return sgn<0?(a<0?comp(num,-a)>0:1):(sgn>0?(a>0?comp(num,a)<0:0):a>0);}
inline int operator<=(const bignum& a){return sgn<0?(a.sgn<0?comp(num,a.num)>=0:1):(sgn>0?(a.sgn>0?comp(num,a.num)<=0:0):a.sgn>=0);}
inline int operator<=(const int a){return sgn<0?(a<0?comp(num,-a)>=0:1):(sgn>0?(a>0?comp(num,a)<=0:0):a>=0);}
inline int operator==(const bignum& a){return (sgn==a.sgn)?!comp(num,a.num):0;}
inline int operator==(const int a){return (sgn*a>=0)?!comp(num,ABS(a)):0;}
inline int operator!=(const bignum& a){return (sgn==a.sgn)?comp(num,a.num):1;}
inline int operator!=(const int a){return (sgn*a>=0)?comp(num,ABS(a)):1;}
inline int operator[](const int a){return digit(num,a);}
friend inline istream& operator>>(istream& is,bignum& a){read(a.num,a.sgn,is);return is;}
friend inline ostream& operator<<(ostream& os,const bignum& a){if(a.sgn<0)os<<'-';write(a.num,os);return os;}
friend inline bignum sqrt(const bignum& a){bignum ret;bignum_t t;memcpy(t,a.num,sizeof(bignum_t));sqrt(ret.num,t);ret.sgn=ret.num[0]!=1||ret.num[1];return ret;}
friend inline bignum sqrt(const bignum& a,bignum& b){bignum ret;memcpy(b.num,a.num,sizeof(bignum_t));sqrt(ret.num,b.num);ret.sgn=ret.num[0]!=1||ret.num[1];b.sgn=b.num[0]!=1||ret.num[1];return ret;}
inline int length(){return ::length(num);}
inline int zeronum(){return ::zeronum(num);}
inline bignum C(const int m,const int n){combination(num,m,n);sgn=1;return *this;}
inline bignum P(const int m,const int n){permutation(num,m,n);sgn=1;return *this;}
};
int main(){
int t, flag1, flag2;
cin>>t;
while(t--){
bignum n, tmp, tmp2;
cin>>n;
tmp=sqrt(n);
if(tmp*tmp==n) flag1=true;
else flag1=false;
tmp2=n*(n-1)/2;
tmp=sqrt(tmp2);
if(tmp*tmp==tmp2)flag2=true;
else flag2=false;
if(flag1&&flag2){
puts("Arena of Valor");
}
else if(flag2){
puts("Clash Royale");
}
else if(flag1){
puts("Hearth Stone");
}
else puts("League of Legends");
}
return 0;
}
G candies
手推一下发现答案=2^(n-1)%MOD
n有点大
扩展欧拉定理
证明:https://blog.csdn.net/synapse7/article/details/19610361
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD (int)(1e9+7)
ll ans=0;
ll ppow(ll a,ll n){
ll ret=1;
while(n){
if(n&1) ret=ret*a%MOD;
a=a*a%MOD;
n>>=1;
}
return ret;
}
int main()
{
int T;cin>>T;
while(T--){
string s;
cin>>s;
ans=0;
for(int i=0;i<s.size();++i){
ans=(ans*10+s[i]-'0')%(MOD-1);
}
cout<<ppow(2,ans-1)<<endl;
}
return 0;
}
K 多重背包
见代码注释
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD (int)(1e9+7)
ll v[30],c[30];
ll dp[10010];
ll goods[500];
//多重背包
int main()
{
int T;
scanf("%d",&T);
while(T--){
int n,q;
scanf("%d%d",&n,&q);
int cnt=0;
for(int i=1;i<=n;i++){
cin>>v[i];
cin>>c[i];
//按照二进制位分成c[i]种不同的物品 显然每种状态都可以一步步转移得到
for(int j=0;j<c[i];j++){
goods[++cnt]=(v[i]<<j);//统计物品个数和相应的代价
}
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=cnt;i++){//完全背包
for(int k=10000;k>=goods[i];k--){//倒序
dp[k]=(dp[k]+dp[k-goods[i]])%MOD;
}
}
while(q--){
int s;
scanf("%d",&s);
cout<<dp[s]<<endl;
}
}
return 0;
}
B
dp
见注释
由于有负数 所以要保存最大值最小值
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD (int)(1e9+7)
#define FORP(i,a,b) for(int i=a;i<=b;++i)
#define maxn 1023
ll c[maxn];
string s;
ll dp[2][maxn][10];
ll max3(ll a,ll b,ll t){
return max(a,max(b,t));
}
ll min3(ll a,ll b,ll t){
return min(a,min(b,t));
}
//0 max 1 min
int main()
{
int T;
scanf("%d",&T);
while(T--){
memset(dp[0],-0x3f,sizeof(dp[0]));
memset(dp[1],0x3f,sizeof(dp[1]));
int n,m,k;
cin>>n>>m>>k;
FORP(i,1,n){
cin>>c[i];
}
FORP(i,0,n){
dp[0][i][0]=k;
dp[1][i][0]=k;
}
cin>>s;
s='#'+s;
FORP(i,1,n){
for(int j=1;j<=i&&j<=m;++j){
if(s[j]=='+'){
dp[0][i][j]=max(dp[0][i-1][j-1]+c[i],dp[0][i-1][j]);// 操作 前一个数的最大值加当前值 不操作,前一个数的最大值
dp[1][i][j]=min(dp[1][i-1][j-1]+c[i],dp[1][i-1][j]);// 操作 前一个数的最小值加当前值 不操作,前一个数的最小值
}
else if(s[j]=='-'){
dp[0][i][j]=max(dp[0][i-1][j-1]-c[i],dp[0][i-1][j]);// 操作 前一个数的最大值减当前值 不操作,前一个数的最大值
dp[1][i][j]=min(dp[1][i-1][j-1]-c[i],dp[1][i-1][j]); // 操作 前一个数的最小值减当前值 不操作,前一个数的最小值
}
else if(s[j]=='*'){
dp[0][i][j]=max3(dp[1][i-1][j-1]*c[i],dp[0][i-1][j-1]*c[i],dp[0][i-1][j]);//由于负数的存在 最大值可以变成最小值 反之亦然
dp[1][i][j]=min3(dp[1][i-1][j-1]*c[i],dp[0][i-1][j-1]*c[i],dp[1][i-1][j]);
}
else if(s[j]=='/'){
dp[0][i][j]=max3(dp[1][i-1][j-1]/c[i],dp[0][i-1][j-1]/c[i],dp[0][i-1][j]);
dp[1][i][j]=min3(dp[1][i-1][j-1]/c[i],dp[0][i-1][j-1]/c[i],dp[1][i-1][j]);
}
}
}
cout<<dp[0][n][m]<<endl;
}
return 0;
}
L
quick matrix pow
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FORP(i,a,b) for(int i=a;i<=b;++i)
#define MOD (int)(1e9+7)
struct Matrix{
ll m[10][10];
}a,e,ans,tran;
void db(Matrix aa){
cout<<"---------"<<endl;
for(int i=1;i<=9;++i){
for(int j=1;j<=9;++j){
cout<<aa.m[i][j]<<" ";
}
cout<<endl;
}
}
void init(){
FORP(i,1,9) e.m[i][i]=1;
}
Matrix Mul(Matrix a,Matrix b){
Matrix c;
memset(c.m,0,sizeof(c.m));
for(int i=1;i<=9;++i){
for(int j=1;j<=9;j++){
for(int k=1;k<=9;k++){
c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j])%MOD;
}
}
}
return c;
}
Matrix Matrix_pow(Matrix a,ll n){
Matrix ret=e;
while(n){
if(n&1) ret=Mul(ret,a);
a=Mul(a,a);
n>>=1;
}
//db(ret);
return ret;
}
void solve(ll n){
Matrix temp;
memset(temp.m,0,sizeof(temp.m));
FORP(i,1,9) temp.m[1][i]=1;
memset(tran.m,0,sizeof(tran.m));
tran.m[2][1]=tran.m[3][1]=1;
tran.m[4][2]=tran.m[5][2]=tran.m[6][2]=1;
tran.m[7][3]=tran.m[9][3]=1;
tran.m[1][4]=tran.m[2][4]=tran.m[3][4]=1;
tran.m[4][5]=tran.m[6][5]=1;
tran.m[8][6]=tran.m[9][6]=1;
tran.m[1][7]=tran.m[2][7]=1;
tran.m[4][8]=tran.m[5][8]=1;
tran.m[7][9]=tran.m[8][9]=1;
//db(tran);
if(n==1){
cout<<3<<endl;
}
else if(n==2){
cout<<9<<endl;
}
else{
Matrix t=Matrix_pow(tran,n-2);
//db(t);
t=Mul(temp,t);
//db(t);
ll ans=0;
FORP(i,1,9) ans=(ans+t.m[1][i])%MOD;
cout<<ans<<endl;
}
}
int main(){
int T;
cin>>T;
init();
while(T--){
ll n;
cin>>n;
solve(n);
}
return 0;
}
SAM
#include <bits/stdc++.h>
using namespace std;
const int MAXN=4e5+10;
char ss[MAXN>>1];
const int alpha=26;
int tot,last,ch[MAXN][alpha],fa[MAXN],len[MAXN];
int sum[MAXN],tp[MAXN],cnt[MAXN];
void init(){
last=tot=1;
len[1]=0;
memset(ch,0,sizeof ch);
memset(fa,0,sizeof fa);
memset(cnt,0,sizeof cnt);
}
void add(int x){
int p=last,np=last=++tot;
len[np]=len[p]+1;
cnt[last]=1;
while(p&&!ch[p][x]) ch[p][x]=np,p=fa[p];
if(!p) fa[np]=1;
else{
int q=ch[p][x];
if(len[q]==len[p]+1){
fa[np]=q;
}
else{
int nq=++tot;
memcpy(ch[nq],ch[q],sizeof ch[q]);
len[nq]=len[p]+1;
fa[nq]=fa[q];
fa[q]=fa[np]=nq;
while(p&&ch[p][x]==q){
ch[p][x]=nq,p=fa[p];
}
}
}
}
void topsort(){
for(int i=1;i<=len[last];++i) sum[i]=0;
for(int i=1;i<=tot;++i) sum[len[i]]++;
for(int i=1;i<=len[last];++i) sum[i]+=sum[i-1];
for(int i=1;i<=tot;++i) tp[sum[len[i]]--] =i;
}
int main(){
int k1,k2;
while(~scanf("%s",ss)){
init();
scanf("%d%d",&k1,&k2);
long long ans=0;
int length=strlen(ss);
for(int i=0;i<length;++i){
add(ss[i]-'A');
}
topsort();
for(int i=tot;i;--i){
int p=tp[i],fp=fa[p];
cnt[fp]+=cnt[p];
if(cnt[p]>=k1&&cnt[p]<=k2) ans+=len[p]-len[fp];
}
cout<<ans<<endl;
}
return 0;
}