OJ Board

Ok, you got me !!!

Should I treat it as a special case ???

Bye, Aur

Maarten, you're right. I removed that lines, and change fabs(ft) by fabs(a - b) > 1e-15 and now I get Wrong Answer ... Here some sample input/output for my program ... Input: 30 40 10 12.619429 8.163332 3 10 10 3 10 10 1 300 400 100 126.19429 81.63332 30 100 100 30 100 100 10 3000 4000 1000 1261.942...

Hi !!!

fa and fb stores the value of the function, applied to the limits a and b ...

The root is inside this limits.

Hello, can you help me with my code ? I

Hello,

Is there a way to optimize this problem, it's very simple, but I get 0.094 sec.

Thanks, Aur

Is it off ? The last submission from http://acm.uva.es/cgi-bin/OnlineJudge?Status:Valladolid is yesterday ... I've tried to submit, but I can't.

Thanks, Aur

Hi,

First of all, I think you should do ascii check conditon ...

Good luck , Aur

Hi all, I don't understand why I get WA on my code: [c] #include <stdio.h> void main () { int i, j, c = 0, vetor[256], vetor1[256], temp1; char str[1000], temp; while (gets(str) != NULL) { for (i = 0; i < 256; i++) { vetor = vetor1 = 0; } temp1 = 0; str[1000]='\0'; for (i = 1; str != '\0'; i++) { fo...

Here is my code: [c]#include <stdio.h> #include <string.h> int main() { int cases,m,n,i,j,mcopy,flag_right,flag_left; char cobble[100000][10]; scanf("%d",&cases); while(cases) { scanf("%d %d",&m,&n); for(i=0;i<=m;i++) cobble [0] = '\0'; mcopy = m; while(mcopy) { scanf...

Are you getting WA ??? I've tried your code and for the input:
it gives me: instead of: My problem is worst, I'm getting TLE, don't know why !!!

Is there something special about this problem ? I think it's not difficult, and besides there is only one path, right ?? But I don't know why I get TLE !!!

Thanks for any reply !!!

Thanks a lot, I've follow the suggestions and get accepted now

But I have a question ! Why ACM judge doesn't define M_PI ? I tried it and get compiler error !

Aur

What's wrong with my code ? [c] #include <stdio.h> #include <math.h> #define Pi 3.1415926535897932384626433832795029L int main() { long double ang; int r, n; while(scanf("%d %d",&r,&n)==2) { ang = 180 - ((double)180*(n-2)/n); printf("%.3lf\n",(sin(Pi/180*ang)*r*r*n)/2); }...

Hi all,

Could you give me some test cases, I don know why I get wrong answer

Thanks, Aur

I didn't understand this problem ... should I only count the number of operations ??? And for the sample input the output shouldn't be 15 ???

Thanks, Aur