Sorry!
I got Accepted!

Edited by author 06.11.2009 14:11

0
0%                                                                              users ~/timus* ./1023
1
0%                                                                              users ~/timus* ./1023
2
0%                                                                              users ~/timus* ./1023
3
2%                                                                              users ~/timus* ./1023
4
3%                                                                              users ~/timus* ./1023
5
4%                                                                              users ~/timus* ./1023
6
2%                                                                              users ~/timus* ./1023
7
6%                                                                              users ~/timus* ./1023
8
7%                                                                              users ~/timus* ./1023
9
2%                                                                              users ~/timus* ./1023
10
4%                                                                              users ~/timus* ./1023
11
10

i've got WA3

Edited by author 06.11.2009 07:47

I can't catch why the sample output is right.

Edited by author 06.11.2009 02:55

Dear admin's of Timus.
I love Timus very much, but in last time he usually inaccessible via Internet. What is the problem?

Why is answer 0 0 2 1 ?

Hey, guys. Just wanted to share some information about this problem
1. If your program doesnt work on test #4, than probably the problem is - you "travel" only from the top left corner, but you should "travel" from the lower right corner also. (probably the reason why you should do this is that the labyrinth may be unfinished - sometimes the two ends of it are not connected)
2. If your program doesnt work on test #5 you can find on timustests.lx.ro
Hope it will help somebody

Is test#1 the same as in the problem description?

I can't understand Why I got "Wrong Answer" in TEST#18......? Give me some tests !!!!!
This is my code.---
int n = in.nextInt();
boolean f =true;
if((n+1)%4==0){
System.out.print("2");
 f = false;
}
 else
 if(n%4==0)
 {
 System.out.print("0");
 f = false;
}
if(f) System.out.print("1");

Edited by author 03.11.2009 14:05

Edited by author 01.02.2012 14:29

I use __int64 and INFINITY i use enough, why don't work?

my code can pass all my tests :

aaabbbaaa : aaabbbaaa
qwerSOMETEXTrewq : ETE
bfbaaaafbf : bfb
asdaaaafgh : aaa


why i get WA on second test?

Use this
Scanner in = new Scanner(new BufferedInputStream(System.in));
It's enought =)

please give any hint how to solve this problem.
i now that we should use binary searching of height but how write dijkstra with 2 edge-parameters ?

for test:

"- IS IT CORRECT TEST ?"

my AC prog output:

"- is it correct test ?"

but its wrong! because first WORD in SENTENCE is "IS" and it must be changed to "Is"!!!

The correction rules clearly explain this:
!!! Words consist of English letters. !!!
and
!!! The first word of each sentence must start with a capital letter ... !!!

program a;
var s:string;
    i:integer;
    n,k,sum:int64;
begin
  readln(s);
  for i:=1 to length(s) do
   if (ord(s[i])>=48)and(ord(s[i])<=58) then n:=n*10+ord(s[i])-48
   else k:=k+1;
  sum:=1;
  while n>0 do
  begin
    sum:=sum*n;
    n:=n-k;
  end;
writeln(sum);
end.

test 1.

Why is this code crashing on test #3?!
Please give me test 3. My e-mail: muzaffar-17@bk.ru


import java.util.HashSet;
import java.util.Locale;
import java.util.Scanner;
import java.util.Set;

public class m1718 {
    public static void main(String[] args)  {
        Locale.setDefault(Locale.US);
        Scanner sc=new Scanner(System.in);
        int n=Integer.parseInt(sc.nextLine());
        Set<String> set=new HashSet<String>();
        String[][] nick=new String[n][10];
        int[] d=new int[n];
        for (int i = 0; i <n; i++) {
            nick[i]=sc.nextLine().split(" ");
            if(nick[i][1].equals("AC")) d[i]=0;
            else d[i]=Integer.parseInt(nick[i][2]);
        }int min=0;
        for (int i = 0; i <n; i++) {
            if(d[i]==0)set.add(nick[i][0]);
            if(d[i]>=6)set.add(nick[i][0]);
            if(d[i]==7)min++;
        }
        System.out.println(min+" "+set.size());
    }

}