| ||||||||||
| 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:OMS的是怎么过的呀?In Reply To:OMS的是怎么过的呀? Posted by:druse at 2008-05-24 21:03:52 我也是强做的 0MS过。。用的是<bitset>
bitset<n> b;
b.reset();
for(step=1;step<=n;++step)
{
for(j=step;j<=n;j+=step)
b.flip(j);
}
printf("%d\n",b.count());
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator