Crash (access violation)

In 24 test precision greater than 18? why?

Always format input is
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
or may be (for example)
2
dd.mm.yyyy
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
?


Edited by author 09.05.2010 02:02

,.'A'..'Z'a'..'z

in this test my program gave "2" and got WA4,
but now I got AC, because the correct answer is "1".

Why does System.exit(1) get WA instead of Crash?

Hello, I tried many times, but do not know where is the problem, I wrote java and run on IDE it seems OK, but every time when I submitted it can not be accepted. Would you please give me some help. Thank you so much!

import java.util.*;
public class SumAllInt1068 {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();
        int f = sc.nextInt();
        int e = a+b+c+d+f;
        System.out.println(e);

    }

}

Tell please something helpful to pass fourth test. Maybe it is  a misunderstanding of statement.

#include <iostream>
long int fibonacci(const int );
int main()
    {
    int N;
    std:: cin>>N;
    const int M=N;
    std::cout << fibonacci(M)*2;;
    return 0;
    }
long int fibonacci(const int n)
     {   const int m = n;
         long int t[m],i;
         int first = 0, second = 1;
         t[first]=0; t[second]=1;
         for (i=second+1; i<m-1; ++i)
         {
             t[i] = t[first] + t[second];
             first = second;
             second = i;
         }

        return t[i];
     }

Edited by author 10.05.2010 18:58

why I get wa on test 39?

Edited by author 30.04.2010 17:12

does anybody knows what is this fucking test 5?
if you know write the answer please:)

type
    point=record x,y:longint; end;
var
    vert:array[1..10000] of point;
    visited:array[1..10000] of byte;
    min:point;
    n,i,k,imin,minvert:integer;
Procedure Search_Min_Polar_Angle;
var
    i:integer;
    min_angle,angle,tg,a,b:real;
begin
    min_angle:=pi;
    for i:=1 to n do
        if (visited[i]=0) then
            begin
                a:=(vert[i].y-vert[imin].y);
                b:=(vert[i].x-vert[imin].x);
                if (b=0) then angle:=pi/2
                         else
                begin
                    tg:=a/b;
                    angle:=arctan(tg);
                end;
                if (angle<min_angle) then
                    begin min_angle:=angle; minvert:=i; end;
            end;
    visited[minvert]:=1;
end;

Begin
    readln(n);
    for i:=1 to n do visited[i]:=0;

    // naxojdenie samoy nijney levoy to4ki
    min.y:=maxlongint;
    for i:=1 to n do
        begin
            readln(vert[i].x,vert[i].y);
            if (vert[i].y<min.y) then
                begin min:=vert[i]; imin:=i; end
            else
            if (vert[i].y=min.y) and (vert[i].x<min.x) then
                begin min:=vert[i]; imin:=i; end;
        end;
    visited[imin]:=1;
    //-----------------------------------

    for k:=1 to n div 2 do Search_Min_Polar_Angle;
    writeln(imin,' ',minvert);
End.

Edited by author 09.05.2010 19:47

It says:
17=2^4+2^0
18=2^4+2^1
20=2^4+2^2

But, since the limit is [15;20], 16 must also be included:
16=2^3+2^3

I do not know why I am wrong, Netbeans works OK, but can not be accepted, below is my code.

public class Main {

    public static void main(String[] args) {
        System.out.println("Addition of Two Numbers(a,b) the sum is c");
        int a = Integer.parseInt(args[0]);
        int b = Integer.parseInt(args[1]);
        int c = a+b;
        System.out.println( "c="+c );
    }

}

thanks.

my program variation:

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

int main()
{
    int nrstones, i, min, w1, w2;
    int *weights;

    scanf("%d", &nrstones);
    weights = new int[nrstones];
    for(i = 0; i < nrstones; i++)
    {
        scanf("%d", &weights[i]);
    }

    min = weights[0];

    int perm = 1 << nrstones;

    for(i = 0; i < perm; i++)
    {
        w1 = 0;
        w2 = 0;
        int j;
        for(j = 0; j < nrstones; j++)
        {
            if((i >> j) % 2 == 0)
                w1 += weights[j];
            else
                w2 += weights[j];
        }

        if(min > abs((double)w1 - w2))
        {
            min = abs((double)w1 - w2);
            if(min == 0)
            {
                printf("%d", min);
                return 0;
            }
        }
    }
    printf("%d", min);
    return 0;
}

Edited by author 09.05.2010 11:37

Nice problem!
To solve it your needto use the topological sort on the graph (DAG).
It can be done with DFS algorithm.

2
10

4
100


14
266095289560

20
187019610394369600


Edited by author 09.05.2010 03:36

{$N+}

var x, y, temp:extended;
    n, l, r, m, sum, res:extended;

function rnd(t:extended):extended;
begin
     if frac(t)>=0.5 then rnd:=trunc(t)+1
                     else rnd:=trunc(t);
end;

begin
     readln(x, y, n);
     l:=10; r:=10*n; x:=x*10; sum:=-1;
     while l<=r do begin
           m:=trunc((l+r)/2);
           temp:=rnd(m/n*10);
           if abs(temp-x)<10e-12 then begin
                                     sum:=m;
                                     l:=m+1;
                                     continue;
                                     end;
           if temp<x then l:=m+1
                     else r:=m-1;
           end;
     {writeln(sum:0:0);}
     if sum=-1 then begin
                    writeln('Impossible');
                    exit;
                    end;
     l:=0; r:=2000000000; res:=-1;
     while l<=r do begin
           m:=trunc((l+r)/2);
           temp:=(sum+m)/(n+m);
           if rnd(temp*10)<=y*10 then begin
                                      res:=m;
                                      r:=m-1;
                                      end
                                 else l:=m+1;
           end;
     if res=-1 then writeln('Impossible')
               else writeln(res:0:0);
end.

Eight times in a row i'm given "compilation error"! The following online C compiler: http://www.delorie.com/djgpp/compile/ says everything it's okay. No errors/warnings there...