I don't understand what's wrong in my program. Give me test 9 please

is there something invalid in test cases??

Help! What is in the test 26?

Forgot to sort the updates :)

I am getting WA in 22nd case! I cant find my mistake. Can someone help me ?

Please could anybody give me the test case?

Thanks

If you are using int(s[i]) to get the representation for any alphabet, you may need to enlarge your counting sort table and counting sort iteration limit. I thought 200 was enough for latin alphabets, but actually I tried several times and succeeded at about 1100. I don't even know why...

what is 34 test?

char s[16384] ;
unsigned n = 0;

 //  AC  0.001s with this code.
    for(int c = std::getc(stdin); c != EOF; c = std::getc(stdin))
       s[n++] = c;

// and AC 0.015s with   n = fread(s,1,sizeof(s)-1,stdin);  code.

// I'm wonder that  the std::getc faster than fread!!

System.out.printf("%.6f\n",(t+s+ss[i])/2d);

any one help??  I need help...

I'm sure my source code is perfect. But it never passed test #5. Can anyone help me?

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

int main()
{
        double  cx,cy,cz,nx,ny,nz,r,sx,sy,sz,vx,vy,vz,t;
        double  x,y,z;
        double  a,b,c;
        int     hit;
        scanf("%lf %lf %lf %lf %lf %lf %lf %lf %lf %lf %lf %lf %lf",&cx,&cy,&cz,&nx,&ny,&nz,&r,&sx,&sy,&sz,&vx,&vy,&vz);
        b=nx*vx+ny*vy+nz*vz;
        c=nx*(sx-cx)+ny*(sy-cy)+nz*(sz-cz);
        a=-5*nz;
        if(b*b-4*a*c<-1e-8)
                printf("MISSED\n");
        else if((b+sqrt(b*b-4*a*c))/nz<-1e-8 && (b-sqrt(b*b-4*a*c))/nz<-1e-8)
                printf("MISSED\n");
        else
        {
                hit=0;
                t=(b-sqrt(b*b-4*a*c))/(10*nz);
                if(t>1e-8)
                {
                        x=sx+vx*t;
                        y=sy+vy*t;
                        z=sz+vz*t-5*t*t;
                        if(r-sqrt(pow(x-cx,2)+pow(y-cy,2)+pow(z-cz,2))>1e-8)
                                ++hit;
                }

                t=(b+sqrt(b*b-4*a*c))/(10*nz);
                if(t>1e-8)
                {
                        x=sx+vx*t;
                        y=sy+vy*t;
                        z=sz+vz*t-5*t*t;
                        if(r-sqrt(pow(x-cx,2)+pow(y-cy,2)+pow(z-cz,2))>1e-8)
                                ++hit;
                }
                if(hit)
                        printf("HIT\n");
                else
                        printf("MISSED\n");
        }
        return 0;
}

I solved it in 0.015 with g++, but i can't optimize anymore

Edited by author 22.06.2015 13:32

It's just the array rotation problem asked of a different way.

Please help me with test case 16

Hey guys any hints here? All examples from forum works on my program but this one
exceeds. I guess it's because more than 200 characters are written, but I cannot find any test case that will require less written characters but the output will have more length

Does anyone know some tests to overcome WA 2?

I use a sement tree,  gave tle in test 17 and when I changed the scanf by the following "std :: ios :: sync_with_stdio (false)" I have acepted with time of 0.358 s

Since there can be more than one acceptable solution, I think, it could give a more unambiguous result.