ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1073
. Square Country
grayluck
递推能过..
[1] // Problem
1073. Square Country
22 Sep 2009 06:19
for i := 2 to n do
begin
min:=maxlongint;
for j := 1 to trunc(sqrt(i)) do
if min>f[i-j*j] then
min:=f[i-j*j];
f[i]:=min+1;
end;
wzh597124104
Re: 递推能过..
// Problem
1073. Square Country
21 Jan 2011 13:16
发源代码是不好的行为
© 2000–2026
Timus Online Judge Team
. All rights reserved.