closed! AC!

Edited by author 27.03.2007 14:51

Here is my program, you can test it and see. =(
Code (java):

[code deleted]

Edited by moderator 27.03.2007 09:45

We have some technical problems with server, sorry for wrong verdicts and rejudgements.

Java compiler was fixed.
Verdicts "Fail (compiler)" and "Time limit exceeded" with too little time were rejudged.
Sorry for rejudge notification with Fail (compiler) verdict.

There was problem with this task, but now I get AC.

Edited by author 27.03.2007 00:05

Edited by author 27.03.2007 00:36

[code deleted]

Edited by moderator 27.03.2007 09:45

Please, account for me, what if mean?

Your solution of problem 1059 Expression was rejudged. We apologize for wrong verdict.

Wrong verdict: Wrong answer
New verdict: Fail (compiler)
More info you can find on Online Status page http://acm.timus.ru/status.aspx?space=1&pos=1520089

What mean fail??

what's wrong???
I get the 'Crash (stack overflow)';
Help!!

[code deleted]

Edited by moderator 27.03.2007 09:45

[code deleted]



Edited by moderator 27.03.2007 09:45

I was send solution for this problem in Java and receive WA - why?

My solution is equal to example in FAQ:

import java.io.*;
import java.util.*;

public class Sum
{
   public static void main(String[] args)
   {
      Scanner in = new Scanner(System.in);
      PrintWriter out = new PrintWriter(System.out);

      int a = in.nextInt();
      int b = in.nextInt();
      out.println(a + b);

      out.flush();
   }
}

В правилах шашек есть правило побития - типа если уже были над данным полем то туда бить нельзя. Тут это соблюдено или главное прыгать через черную в пустую клетку?

My code works fine with the test cases discussed here ...
But still am getting wrong answer for test case #11
Can anyone give a tricky test case tat would help me ??

i just use bfs!!!can someone tell me why i got wa on #4?

[code deleted]

Edited by moderator 13.02.2007 20:53

Test #18 has numbers greater then 1000000, as mentioned in other thread, so problem's description (or tests) still need to be corrected.

Edited by author 24.03.2007 01:02

Whats wrong???

[code deleted]

Edited by moderator 27.03.2007 09:46

Edited by author 25.03.2007 19:42

Здравствуйте!
Вопрос к организаторам - когда вы узнаете точно, есть ли в использумом вами компиляторе контейнер hash_set??

I know what some people had such verdict, but pass this test later. Can you please reveal the problem?

I can't understand why I get compile error!
I don't see nothing strange in my code and it works perfectly in my computer, so I don't know what to change
here is my code:

#include <stdio.h>
#include <math.h>

int p[15003],ind=5;

is_prime(int n){
int i=3,l=sqrt(n)+1;
while(i<l){
if(n%i==0)
return 0;
i+=2;
}
return 1;
}

init(){
int i;
for(i=11;ind<15002;i+=2){
if(is_prime(i)){
p[ind]=i;
ind++;
}
}
}

int main()
{
p[1]=2;p[2]=3;p[3]=5;p[4]=7;
int n,i,k;
init();
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&k);
printf("%d\n",p[k]);
}
return 0;
}

is someone can help me I would appreciate....
thanks!
bye