|
|
Hi
Could somebody check this ?
11 12
11 13
11 14
11 15
7 4
-----
1
1
1
0
12
and what is the answer for
10000 997
10000 13
thx a lot. > Hi
> Could somebody check this ?
> 11 12
> 11 13
> 11 14
> 11 15
> 7 4
When n < k, the answer should be 0, not 1.
> 1 - wrong
> 1 - wrong
> 1 - wrong
> 0 - correct
> 12 - correct
>
> and what is the answer for
> 10000 997 ----------> 100300
> 10000 13 ----------> 7692307 var
n,k:longint;
kl:longint;
begin
readln(n,k);
kl:=(n*n-(n*n mod k))div k;
write(kl);
end. Thank you. I understand! It's wrong :( |
|
|
