Can i replace position of + and =?
For example can i answer for
1+12=13
100
----
11+2=13

Are there leading zeroes in input, and can i output answer with leading zeroes?

Edited by author 06.03.2007 22:48

ok, I got it

Edited by author 23.03.2008 13:47

This problem is very simple.
I think it can be more interesting if one of dimensions can be odd.

For example:
4 5
1 1 2 2 3
4 5 5 6 3
4 7 7 6 10
8 8 9 9 10

Cube has 24 start position. All position possible?

I am trying to take all possible combinations of k and run union-find to check if 0-1 are connected in that combinations. complexity is O(M(2^K)). is there a faster approach?

Edited by author 16.08.2008 01:01

I submitted several times but got TL#4.
Where is my fault?

var
 r,p,m,n,i:longint;
 kod:integer;
 j:shortint;
 q,s,t:string[10];
 st:array [1..1000000] of string[50];

begin
 readln(n); str(n,q); r:=1;
 for i:=1 to length(q)-1 do r:=r*10; i:=n-r;
 repeat
  inc(i); str(i,s); j:=0;
  repeat
   inc(j); t:=s; delete(t,j,1); val(t,m,kod);
   if m+i=n then
    begin
     inc(p); st[p]:=s+' '+'+'+' '+t+' '+'='+' '+q; break;
    end;
  until j=length(s);
 until i=n;
 writeln(p); for i:=1 to p do writeln(st[i]);
end.

What's the min value of the first number. I mean it's min value according to N

Edited by author 22.11.2007 14:40

who can me  help? Beside I do not pass the test a number 7. wait the answer.

plz,help mi. Who knows test 7??

What I must write if n=1?
Please, give me answers for tests:
1 1
1
(yes, it's uncorrect ;)

1 2
1

1 3
1

1 4
4

Edited by author 08.04.2007 16:10

One method uses formula a4=(t1^4-6*t1^2*t2+3*t2^2+8*t1*t3-6*t4)/24 mod p
For it we must find previously 24^(-1) mod p
But it needs in loop with ~ p=10^9 iterations
May this calculation lead to TL before main program?

I'm getting f**ing TL on the test 11.
I'm using java and solved the problem as it is supposed to be in JAVA. I used objects "standings" which contains id and m( i.e. standing( id, m ) ). I'm using bubble sort since quicksort gives wrong answer.
Does anyone know how to gid rid of the Time Limit using JAVA? I know JAVA is slowest compiler i've ever seen :-)
Please, need help

Is it possible to solve this problem in Java without MLE?

If we use HashMap<Integer,Long> as "cache" we get 287k entries in worst case. Even if ww think about raw data (no objects, no overlap) - it is 3.4Mb

Still thinking how to avoid "full-sized" caching (h X m+h X n).

What about this test?

If a girl does not like the boy who loves her, how do we resolve collisin.
And if there is more than two boys and girls not liking anyone how do we resolve that.

Can anyone tell me what is wrong in answer to test:
4
0 4 1 2
0 0 3 0

ans: 3 4 1 2

and where is it written in problem description?
in my opinion it is correct output according to problem statement. Am I wrong?

Best Regards!

please - answer also to tu219717@students.mimuw.edu.pl

I got TLE when I used Java,and got AC used C++..
And another question is what's the meaning of Crash? Stack overflow or buffer overflow ?How can I get AC using my JAVA program?Please help me..thank you!
Here is my java program
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.DecimalFormat;
public class Main{
    static double c[]=new double[500000];
    public static void main(String argsp[]){
        Scanner cin=new Scanner(System.in);
        int i=0,n;
        while(cin.hasNext()){
            c[i++]=cin.nextDouble();
        }
        n=i;
        for(i=n-1;i>=0;i--){
            DecimalFormat df=new DecimalFormat("0.0000");
            System.out.println(df.format(Math.sqrt(c[i])));
        }
    }
}

and my C++ program have got AC..nearly the same as Java
#include <stdio.h>
#include <math.h>
double a[500000];
int main()
{
    int i,n;
    i=0;
    while(scanf("%lf",&a[i++])!=EOF);
    n=i-1;
    for(i=n-1;i>=0;i--)
    printf("%.4lf\n",sqrt(a[i]));
}

pls help me...

what about case when all three points are on line
I think it's impossible to find required position as proper as we can't draw circle throw three points on one line