| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:暴力优化,然后用最原始的办法求euler phi也能过In Reply To:暴力优化,然后用最原始的办法求euler phi也能过 Posted by:frkstyc at 2005-07-14 00:17:48 k = j/sushu[i];
if(j%sushu[i] == 0)
{
if(k%sushu[i] == 0)
phy[j] = phy[k]*sushu[i];
else
phy[j] = phy[k]*(sushu[i] - 1);
break;
}
什么意思???
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator