| ||||||||||
| 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:几行代码就行In Reply To:几行代码就行 Posted by:gfedcba at 2009-01-16 15:36:48 > int n;
> int val;
> cin>>n;
> while (n--)
> {
> cin>>val;
> cout<<(int)sqrt(double(val))<<endl;
> }
问你个问题,怎么证明完全平方数有奇数个相因数?
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator