I have some tests for my program:
N    K    Result
3    2    4
4    3    5
4    2    8
5    2    12
5    3    8
5    4    6
6    2    18
6    3    12
6    4    8
6    5    7
7    2    24
7    3    16
7    4    12
7    5    9
7    6    8
8    2    32
8    3    21
8    4    16
8    5    12
Check my answers, please!
                        Thank you.

Just use diagonal painting:
1 2 3 ... k ... (total n times)
2 3 4 ... 1 ... (total n times)
. . . ... . ... (total n times)
Calculate, how many 1,2, ... k in this table. Answer will be minimal
of them(every rectangle 1xK covers K different colors).
I don't no is this mathematically correct, but this solution got AC.
Don't forget, that if N < K answer is 0.
P.S. Sorry for bad English.

>var n,k,ans1,ans2:longint;
>
>begin
>  read(n,k);
>  if n<k then write('0') else begin
>   ans1:=(n div k)*(n + n mod k);
>   ans2:=(n-k)*4;
>  if ans1>ans2 then write(ans1) else write(ans2); end;
>end.

Why are these(n div k)*n+(n div k)*(n mod k), n*n div k not right?

Show me my mistake.

Thanks a lot.

I have another problem...
What If the cemetery is m*n
and coffin is k*l...
What is the correct formula?
The 1255 Problem I've done,
but this I cann't do...
Help me, I need it...

I recive wrong answer on test 7,how can I test my program:
5 3==8,9 6==12!
What is testing test number 7 ???

Please give me some unusual tests that you can think of.I really want see where is my mistake.I always got wa on 10#test.
By the way, if you have some good methods that are easy to understand,please mail me at xjoxjoxjo@126.com.
thanx.

Pogalusta proverti 1 test. Pohoge on ne vernuy ili
prishlite mne.

Look at the function f():

#define SGN(X) (((X)>eps)?1:(((X)<-eps)?-1:0))
const double eps=1e-6;
double sol(double k,double p){
____double l,r,m;
____l=0;
____r=1e5;
____while(r-l>eps){
________m=(l+r)/2;
________if(((k+m)/sqrt(m*m+1))<p)
____________r=m;
________else
____________l=m;
____}
____return m;
}
int f(double k,double p){
____int n;
____double x,w;
____if(SGN(p-1)<=0)
________return 0;
____x=sol(k,p);
____w=(1+x*k)/sqrt(x*x+1);
____if(SGN(p-w)>=0){
________n=floor((p-w)/sqrt(x*x+1));
________return(1+(int)n);
____}else
________return 0;
}

My (like any other) AC program outputs "0" for test "99 100", but it's incorrect! Because we can place coffins near main diagonal.
Let's denote AC-program output as INCORRECT(n,k). Then the correct answer will be

max{INCORRECT(n,k), (n+(n%k))*(n/k)+f(k,n%k)}

and for test "99 100" it will be "82", not "0". Examples:
"5 6" --> "1"
"7 8" --> "2"
"11 12" --> "4"
"9999 10000" --> "9855".
You may cut out respective paper rectangles to check it manually :^). But (it's really fun!) there are no tests like this (i.e. in all cases INCORRECT(n,k) >= (n+(n%k))*(n/k)+f(k,n%k) ), and programs which output INCORRECT(n,k) got AC!

I think that coffins must be paralell to sides of graveyard.
It is my solution. Why my idea is wrong?

program Project1;
var n,r,a,b,k,i:integer;
begin
readln(n,k); a:=n; b:=n;
r:=(a div k)*b; a:=a mod k;
r:=r+(b div k)*a; b:=b mod k;
writeln(r);
readln;
end.

P.S. Sorry for bad English.

I solved it!
If anyone is interested, could ask me for something or even see my
solution...just mail me on
///////
vladovasilev@abv.bg
//////////
But my solution is not a constant...so if anyone knows some really
nice solution, could you tell me it, please..I'd like to know it!

As I think if n > k then the solution is (n*n - 1) div k and that's
why the answer for 7 4 is 12
1  2  3  4  4  4  4
1  2  3  5  5  5  5
1  2  3  6  6  6  6
1  2  3     7  8  9
10 10 10 10 7  8  9
11 11 11 11 7  8  9
12 12 12 12 7  8  9
And when n < k then it's quite difficult => wait and bleed)))

It's a very interesting fact- the problem which is incorrect!!!!!!

I've come across the solution(it is "accepted") where the aswer for
99 100 is 0- so i'd like to know how could it be- the diagonal of the
square is 140 and you are trying to say we can't place even 1
rectangle => so my recomendation is to put the task correctly and
chek really correct programs

I'm looking forward to hearing from you)

var N,K,Result:longint;
begin
  Read(N,K);
  If N<K then Result:=0
  Else
  Begin
  if N mod K=0 then Result:=(N*N) div K
               else Result:=(N*N-1) div k;

  end;
  Write(Result);

end.

I have a question:
      What answer will be when K>N     ??????
             Help me, please !

Var
  N, K                : LongInt;
begin
  Readln(N, K);
  WriteLn((Sqr(N)-Sqr(N Mod K)) Div K);
end.
 isn`t answer of
7 4
--->
10?

aidin_n7@hotmail.com

Can anybody help me- what is the answer for 99 100?

I think that the problem is Pi... and the authors are pi...