Search found 11 matches
- Sat Dec 02, 2006 8:31 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10200 - Prime Time
- Replies: 202
- Views: 96705
There is an interesting problem of my program in "Prime Time". At first I got accepted and my statistics showed acc. But few days later, I didn't found it in my statistics as solved. Submitted again and got 'wrong answer'. Then I used (1e-10) in my printf() function & got Acc.Couldn't understand ...
- Fri Dec 01, 2006 6:10 pm
- Forum: Volume 6 (600-699)
- Topic: 623 - 500!
- Replies: 187
- Views: 71555
- Sat Oct 28, 2006 10:20 am
- Forum: Off topic (General chit-chat)
- Topic: EID MUBARAK to ALL Muslim brother in this EID
- Replies: 1
- Views: 3878
****EID MUBARAK*****
Thank You DP and all muslims in this very site. Yes it is. Though it's not fair to say about something which is not clear, I think it is(about ROJA)a misunderstanding.
- Sun Oct 22, 2006 8:12 am
- Forum: Volume 111 (11100-11199)
- Topic: 11115 - Uncle Jack
- Replies: 25
- Views: 19661
- Wed Oct 04, 2006 9:01 am
- Forum: Volume 100 (10000-10099)
- Topic: 10042 - Smith Numbers
- Replies: 75
- Views: 33534
Need some I/O
There are some inputs but no corresponding outputs. Pls someone post correct outputs.
Thnx in advance.
Thnx in advance.
- Fri Aug 25, 2006 4:39 pm
- Forum: Volume 6 (600-699)
- Topic: 621 - Secret Research
- Replies: 45
- Views: 27713
- Fri Aug 18, 2006 5:35 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10190 - Divide, But Not Quite Conquer!
- Replies: 105
- Views: 38456
Re: PROBLEM::10190,I'm boring with TLE
removed after AC
[/quote]



- Fri Jul 07, 2006 3:29 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10730 - Antiarithmetic?
- Replies: 21
- Views: 11257
need some critical I/O
Anyone please post some critical inputs and outputs on this topic. It will be very helpful.
- Fri Jul 07, 2006 3:25 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10714 - Ants
- Replies: 20
- Views: 16665
wa on this problem
Pls help me. W.A. is boaring. I used simple searching algo...
minimum value
{
i=last item that is found (and matched) before the mid value.
j=first item that is found (and matched) after the mid value.
if(i>(total length-j))minimum=i;
else minimum=total length-j;
}
maximum value
{
i=the ...
minimum value
{
i=last item that is found (and matched) before the mid value.
j=first item that is found (and matched) after the mid value.
if(i>(total length-j))minimum=i;
else minimum=total length-j;
}
maximum value
{
i=the ...
- Tue Jun 27, 2006 7:36 am
- Forum: Volume 101 (10100-10199)
- Topic: 10190 - Divide, But Not Quite Conquer!
- Replies: 105
- Views: 38456
- Sat Jun 24, 2006 12:32 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10190 - Divide, But Not Quite Conquer!
- Replies: 105
- Views: 38456
10190
I am gettting T.L. E. in this problem. I don't know why? Limit of the input to the problem up to '2000000000'. But my computer support this limit. So, I am not understanding the cause. Please help?
here is the code:
#include<stdio.h>
int main()
{
unsigned long n,j,m;
while(scanf("%lu%lu",&n,&m ...
here is the code:
#include<stdio.h>
int main()
{
unsigned long n,j,m;
while(scanf("%lu%lu",&n,&m ...