I am getting WA for this problem. somebody please check my code & give me some input for which my code fails.
code given below....
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char grid[30][30];
int main()
{
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
long i,j,rmax ...
Search found 17 matches
- Mon Oct 19, 2009 8:10 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11699 - Rooks
- Replies: 2
- Views: 3650
- Sun Oct 18, 2009 8:09 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10196 - Check The Check
- Replies: 77
- Views: 35889
Re: 10196 - Check The Check
dear ThanatosX....
I didn't check your code but my ACC code produces output as same as yours.
you used " char board[8][8]; "
try by increase the size of board[][] >8
Thanks.
I didn't check your code but my ACC code produces output as same as yours.
you used " char board[8][8]; "
try by increase the size of board[][] >8
Thanks.
- Sat Oct 03, 2009 12:38 am
- Forum: Volume 112 (11200-11299)
- Topic: 11247 - Income Tax
- Replies: 50
- Views: 28205
Re: 11247 - Income Tax Hazard
Thanks setu for ur help...Got Acc.
- Fri Oct 02, 2009 11:20 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11508 - Life on Mars?
- Replies: 7
- Views: 4149
Re: 11508 - Life on Mars?
Plz any one help me.... i am getting WA in these problem......
code given below....
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
long cmp(const void *a,const void *b)
{
long *x=(long*)a;
long *y=(long*)b;
return *x-*y;
}
char str;
long data[100100],res[100100];
int main ...
code given below....
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
long cmp(const void *a,const void *b)
{
long *x=(long*)a;
long *y=(long*)b;
return *x-*y;
}
char str;
long data[100100],res[100100];
int main ...
- Mon Feb 23, 2009 8:46 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11321 - Sort! Sort!! and Sort!!!
- Replies: 50
- Views: 29492
Re: 11321 - Sort! Sort!! and Sort!!!
Please somebody help me with this problem. I got WA for many times. my code passes for all test case given. but this got WA for everytime. Please help me....
code given below:
#include <stdio.h>
#include <stdlib.h>
long n,m;
long mod( long a, long b)
{
return a%b;
}
long cmp(long *a,long *b ...
code given below:
#include <stdio.h>
#include <stdlib.h>
long n,m;
long mod( long a, long b)
{
return a%b;
}
long cmp(long *a,long *b ...
- Sun Feb 08, 2009 11:53 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11247 - Income Tax
- Replies: 50
- Views: 28205
Re: 11247 - Income Tax Hazard
Hi... my code passes for all the test cases given in this thread. but i got WA for many time. please give me some more test case for this problem. i post my code below..
Thanks in advance.
Code: Select all
Code removed after ACC...
- Sat Feb 07, 2009 9:09 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 55184
Re: 929 - Number Maze
Thanks newkid for your debugging.
i removed my code.
i removed my code.
- Wed Feb 04, 2009 8:57 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 55184
Re: 929 - Number Maze
sorry
, I bilieved him and i used
but for both the time i got RE.
so i think problem is in another portion.
Is my heapify correct and array size enough?
thanks for urs reply.

Code: Select all
if(j>0 && flag[i][j-1]==0)
and also,
if(j>0)
if(flag[i][j-1]==0)
so i think problem is in another portion.
Is my heapify correct and array size enough?
thanks for urs reply.
- Wed Feb 04, 2009 8:24 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11415 - Count the Factorials
- Replies: 11
- Views: 6564
Re: 11415 - Count the Factorials
Thanks MRH.
- Tue Feb 03, 2009 9:12 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11415 - Count the Factorials
- Replies: 11
- Views: 6564
Re: 11415 - Count the Factorials
Thanks for ur reply MRH.
i am just modifying the sieve. but how can i make the process function more fast. please give me a little hints.
Thanks in advance.
i am just modifying the sieve. but how can i make the process function more fast. please give me a little hints.
Thanks in advance.
- Tue Feb 03, 2009 8:58 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 55184
Re: 929 - Number Maze
Thanks for ur reply.
newkid wrote
"The array index bound checking should be done first before accessing the array element.
you should do"
i think this not the case. i used 'and' operation, and when both the condition returns true then the segment executes.
so this is not standing for RE.
newkid wrote
"The array index bound checking should be done first before accessing the array element.
you should do"
i think this not the case. i used 'and' operation, and when both the condition returns true then the segment executes.
so this is not standing for RE.
- Mon Jan 26, 2009 9:12 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 55184
Re: 929 - Number Maze
I am getting RE error in this problem.
i didn't find the reason... please help me.
here is my code :
Thanks in advance.
i didn't find the reason... please help me.
here is my code :
Code: Select all
Code removed
- Mon Jan 26, 2009 9:03 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11415 - Count the Factorials
- Replies: 11
- Views: 6564
Re: 11415 - Count the Factorials
I am getting TLE in this problem. please anybody help me...
here is my code :
Thanks in advance.
here is my code :
Code: Select all
removed....
- Fri Aug 22, 2008 12:09 am
- Forum: Volume 113 (11300-11399)
- Topic: 11321 - Sort! Sort!! and Sort!!!
- Replies: 50
- Views: 29492
Re: 11321 - Sort! Sort!! and Sort!!!
I got WA for many times. I passed all the test case above.please help me...
Thanks in advance...
Thanks in advance...
- Fri Jul 11, 2008 9:23 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11452 - Dancing the Cheeky-Cheeky
- Replies: 7
- Views: 5066
Re: 11452 - Dancing the Cheeky-Cheeky
Code: Select all
Accepted....