Please help me, i don't understand what is wrong with the code below


import java.math.BigInteger;
import java.io.*;
import java.util.*;

public class LuckyTickets
{


    public static void main(String[] args)
    {

        int N,S;
        BigInteger F[][] = new BigInteger[51][];

        for(int i = 0; i <= 50; i++)
            F[i]= new BigInteger[1001];

        Scanner scanner= new Scanner(System.in);
        try
        {
            N= scanner.nextInt();
            S= scanner.nextInt();


            for(int j= 0; j <= N; j++)
                for(int i= 0; i <= S; i++)
                    F[j][i]= new BigInteger("0");

            for(int j= 1; j <= N; j++)
                F[j][0] = BigInteger.ONE;

            for(int i= 1; i < 10; i++)
                F[1][i] = BigInteger.ONE;

            for(int i= 2; i <= N; i++)
                for(int k= 1; k <= S; k++)
                {
                    for(int j= 0; j <= 9 && j <= k; j++)
                        F[i][k]= F[i][k].add(F[i-1][k-j]);
                }

            // there are F[N][S/2] * F[N][S/2] different tickets
            System.out.println(F[N][S/2].multiply(F[N][S/2]));

//            for(int j= 0; j <= N; j++){
//                for(int i= 0; i <= S; i++)
//                    System.out.print(F[j][i]+ " ");
//                System.out.println("");
//            }

        }
        catch(InputMismatchException e)
        {
            System.out.println("Mismatch exception " + e);
        }

    }
}

Use (c>='A'&&c<='z')||(c>='a'&&c<='z') instead c>='A'&&c<='z' very stupid mistake :)
I got AC

Edited by author 17.12.2011 23:32

Edited by author 17.12.2011 23:32

const N=50;
type TChastot=array [1..N] of byte;

var inStr,outStr:string; chast:TChastot;
    i,j:integer;  maxChast,iPos:integer;

begin
  readln(inStr);
  for i:=1 to length(inStr) do
  begin
    chast[i]:=0;
    for j:=i to length(inStr) do
      if inStr[i]=inStr[j] then
        chast[i]:=chast[i]+1;
  end;
  maxChast:=Low(integer); iPos:=0;
  for i:=1 to length(inStr) do
    if maxChast<chast[i] then
    begin
     maxChast:=chast[i];
     iPos:=i;
    end;
  i:=iPos; outStr:='';
  while (i<=length(inStr)) and (chast[i]=chast[iPos]) do
  begin
   outStr:=outStr+inStr[i];
   i:=i+1;
  end;
  if length(outStr)<length(inStr) then
  begin
   i:=pos(outStr,copy(inStr,length(outStr)+1,length(inStr)-length(outStr)));
   while i=0 do
   begin
    delete(outStr,length(outStr),1);
    i:=pos(outStr,copy(inStr,length(outStr)+1,length(inStr)-length(outStr)));
   end;
  end;
  writeln(outStr);
end.

Edited by author 14.12.2011 02:20

Is it mistake in example or bug?(I write on pascal)

Edited by author 13.12.2011 23:41

How get answer 11 for K==3 and S==10
I understand it so:

a b gcd(a,b)
2 4 2
2 6 2
2 8 2
2 10 2
3 6 3
3 9 3
4 2 2
4 6 2
4 8 4
4 10 2
5 10 5
6 2 2
6 3 3
6 4 2
6 8 2
6 9 3
6 10 2
8 2 2
8 4 4
8 6 2
8 10 2
9 3 3
9 6 3
10 2 2
10 4 2
10 5 5
10 6 2
10 8 2
So, cnt = 28 //count of pair a, b

And my answer is 28. Why am wrong? And how use 'K'? =)



Edited by author 11.12.2011 19:36

who can tell me what's the circle is (I have tested 1000,10000...all wrong)
ask for help!!!!
can you help me!!!

usually i don't code in C# but I just found that C# is very good at this kind of problems...

string manipulation is great in C#... you have many handy things such as List, Dictionary etc..

Greetings!
I have just solved this problem with DP on a tree via DFS, but it appeared to be much too slow (0.25s), though I expected a better result. There's a tree in this problem, so totally solution must be O(N).
May any precial tricks be there or I just did something wrong?

1)

/(3;4)(2;0);2

Output: 1710   :) (not 34/20/2)


2)

*3 ===> *3;1
/3 ===> /3;1
+3 ===> +3;0


3)

() ==> (1) ==> 1

4)
all brackets are balanced, and right.
good luck!

please tell me how do you?
I found one algo but it uses memory equal to W_i limitation. if maximum of W_i is 100000 it uses 100000 too. Maybe it use 2 times more.

Edited by author 05.04.2011 22:59

Any sugestions!?
My programme passed 20 tests, so I'm surprised and don't know what to do

why test 10?

I spent two days on tweaking my code for Problem 1532
First I wrote the solution in Pascal, which solves at 0.687 sec.
And I rewrite the same algo in C++/C, it gives 0.32 sec

http://acm.timus.ru/status.aspx?author=46914&status=accepted

So I guess the Free Pascal does not turn on {$Optimization 2}, Please, Admins, could you kindly check?

and if I use "goto" in FreePascal, I will get a "Compiler (Fail)" How do I enable "goto"? I tried "{$GOTO ON}" but it does not work...

anyway.. finally, my ranking for Problem 1532 has reached the second... I am happy...

http://acm.timus.ru/rating.aspx?space=1&num=1532

Edited by author 11.12.2011 20:58

это норм?
http://imglink.ru/show-image.php?id=31a40034440818a18b3821de368a2e5f

Edited by author 11.12.2011 22:29

Can somebody help me.. Whats the 8th test case??

#include <stdio.h>

    int main()
    {
     int N;
     scanf("%d", &N);
     switch(N)
     {
      case 2: printf("10\n"); return 0;
      case 4: printf("670\n"); return 0;
      case 6: printf("55252\n"); return 0;
      case 8: printf("4816030\n"); return 0;
      default: return 0;
     }
     return 0;
    }

This is a simple problem if read some theory of games such this:
http://sps.nus.edu.sg/~limchuwe/cgt/
It helps me very much:)

I feel this is somewhat misleading as Data Structure isn't necessary for this problem.

Edited by author 11.12.2011 07:01

Edited by author 11.12.2011 07:02