uoj34 NTT

814 단어 수론
#include
#define MO 998244353
#define M 262155
using namespace std;
inline int read()
{
	int ret=0; char c=getchar(); 
	while(c<48||c>57)c=getchar();
	while(c>=48&&c<=57)ret=ret*10+c-48,c=getchar();
	return ret;
}

int N,v[45],tmp[M],wn[M],WN,*ans,&tt=WN,n,m,a[M],b[M];   

inline int ksm(int p, int k)
{
	v[0]=p;
	for(int i=1; i<=29;++i)v[i]=(long long)v[i-1]*v[i-1]%MO;
	int s=1;
	for(int i=29; i>=0; --i){
		if(1<>1,len=1<

좋은 웹페이지 즐겨찾기