忘記把上一筆的資料清掉而 WA 了
計算問題 推一下答案就出來了
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef unsigned long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 20
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n;
struct rules{
char c;
Int add\[180\];
rules(){
Set(add,0);
}
}rule\[M\];
Int now\[200\],tmp\[200\];
void solve(){
int q;
scanf("%d",&q);
char str\[200\];
char tr;
Int ti;
while(q--){
Set(now,0);
Set(tmp,0);
scanf("%s %c %llu",str,&tr,&ti);
Int len=strlen(str);
for(Int i=0;i<len;i++)now\[str\[i\]\]++;
for(Int i=0;i<ti;i++){
for(Int j=0;j<n;j++){
// prIntf(">>%c\\n",rule\[j\].c);
for(Int k=33;k<127;k++){
if(k==rule\[j\].c){
tmp\[k\]+=now\[k\]\*rule\[j\].add\[k\]-now\[k\];
}
else tmp\[k\]+=now\[rule\[j\].c\]\*rule\[j\].add\[k\];
// if(k=='G'||k=='N'||k=='U'||k=='t')debug("%c %d\\n",k,now\[k\]);
}//Pln();
}
for(Int j=33;j<127;j++)now\[j\]+=tmp\[j\];
Set(tmp,0);
}
printf("%llu\\n",now\[tr\]);
}
}
void clear(){
for(int i=0;i<n;i++){
Set(rule\[i\].add,0);
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
scanf("%llu%\*c",&n);
for(Int i=0;i<n;i++){
char str\[110\];
scanf("%c->%s%\*c",&rule\[i\].c,str);
Int len=strlen(str);
// puts(str);
for(Int j=0;j<len;j++){
rule\[i\].add\[str\[j\]\]++;
}
}
solve();
clear();
}
}