Codeforces Round #680 (based on Moscow Team Olympiad) DIV1 A問題 (500pt)
Codeforces Round #680 (based on Moscow Team Olympiad) DIV2 C問題 (1500pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int fs, f[30];
{
REP(rd_int()){
ll @P, tmp, res = -1;
int @Q;
fs = Factor(Q, f);
rep(i,fs){
tmp = P;
while(tmp%Q==0) tmp /= f[i];
res >?= tmp;
}
wt(res);
}
}
Current time: 2024年04月21日00時53分39秒
Last modified: 2020年11月03日08時18分15秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF680 CF_DIV1_A CF_DIV2_C
トップページに戻る
Logged in as: unknown user (not login)