Codeforces Round #694 DIV1 B問題 (750pt)
Codeforces Round #694 DIV2 D問題 (1500pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N, A[3d5], cnt[3d5];
int ps, p[1d3], p2[1d3], dv[1d6+1];
{
ps = Prime(1d3, p);
rep(i,ps) p2[i] = p[i]*p[i];
rep[p2](i,ps) rep(j,i,1d6+1,i) dv[j] = i;
REP(rd_int()){
int res1, res2;
rd(N,A(N));
rep(i,N) while(dv[A[i]]) A[i] /= dv[A[i]];
rep(i,N) cnt[i] = 1;
Unique(N, A, cnt);
res1 = max(cnt(N));
rep(i,N) if(cnt[i]%2==0) A[i] = 1;
Unique(N, A, cnt);
res2 = max(cnt(N));
REP(rd_int()) wt(if[rd_ll()==0, res1, res2]);
}
}
Current time: 2024年04月19日22時20分03秒
Last modified: 2021年01月08日22時25分40秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF694 CF_DIV1_B CF_DIV2_D
トップページに戻る
Logged in as: unknown user (not login)