Search found 37 matches

by alamgir kabir
Sat May 23, 2009 3:24 pm
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16533

Re: 11526 - H(n)

I have tested more than 10000 test case not so big but the code given in the problem set gives the same result that this code give. I also check the test case that MRH gave me and this also ok now But I am getting WA again and again. I will be mad............. What's wrong with this code. Can any on...
by alamgir kabir
Sat May 23, 2009 7:53 am
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16533

Re: 11526 - H(n)

Thanks MRH for ur reply. I have to check the problem again?
Am I not the right way? if not, Can u just hint me the way.
by alamgir kabir
Fri May 22, 2009 9:37 pm
Forum: Volume 101 (10100-10199)
Topic: 10197 - Learning Portuguese
Replies: 45
Views: 15596

Re: 10197 - Learning Portuguese

I think I am ok. But I am getting WA. can anyone explain why? I will be greatful to him. #include<stdio.h> #include<string.h> int main() { //freopen("input.txt", "r", stdin); //freopen("output.txt","w", stdout); char latin [ 40 ], english [ 40 ], str [ 100 ], *tok; char pronoun [][ 50 ] = {"eu ","tu...
by alamgir kabir
Fri May 22, 2009 12:59 pm
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16533

Re: 11526 - H(n)

Anyone help to find my fault. I am getting WA a lot of time. my code is given below #include<stdio.h> #include<stdlib.h> #include<math.h> int main() { long long res, n, deno, i, temp, sum, test, sq; scanf("%lld", &test); while( test -- ) { scanf("%lld", &n); if( n == 0 ) { printf("0\n"); continue; }...
by alamgir kabir
Fri May 22, 2009 8:29 am
Forum: Volume 105 (10500-10599)
Topic: 10550 - Combination Lock
Replies: 24
Views: 20521

Re: 10550 - Combiantion Lock

please help me to survive from WA anyone help me giving some special I/O I will be greatful #include<stdio.h> int main() { long pos, first, sec, third, temp, sum; while( scanf("%ld %ld %ld %ld", &pos, &first, &sec, &third) == 4 ) { if( pos == 0 && first == 0 && sec == 0 && third == 0 ) break; sum = ...
by alamgir kabir
Sat May 16, 2009 6:09 am
Forum: Volume 5 (500-599)
Topic: 551 - Nesting a Bunch of Brackets
Replies: 56
Views: 11932

Re: 551 Nesting a Bunch of Brackets WA

I am getting WA a huge number of times. Please anyone help me. Give me some special I/O that I find my fault. My code is given below. #include<stdio.h> #include<string.h> #include "alloc.h" #include<stdlib.h> char str [ 4000 ], sp [ 4000 ]; struct stk { char data; struct stk *next; }; void push( str...
by alamgir kabir
Fri May 15, 2009 2:48 pm
Forum: Volume 2 (200-299)
Topic: 227 - Puzzle
Replies: 56
Views: 8954

Re: 227 puzzle

I do not find any fault in my code. Anyone can help me to find fault. I am really keen to know my fault. Please give some special input and output that I get my fault. #include<stdio.h> #include<string.h> int space_i, space_j; char str [ 1000 ], puzzle [ 6 ][ 6 ]; void find_space() { int i, j; for( ...
by alamgir kabir
Fri May 15, 2009 9:28 am
Forum: Volume 2 (200-299)
Topic: 201 - Squares
Replies: 32
Views: 4120

Re: Why WA in 201 !!!!!

Anyone help me to find my fault? I am getting WA a lot of times. Have I done wrong in my algorithm My algorithm. *check unit size square is formed.(means vertically or horizontally connected) a boolean type array is used to flaging for connection. #include<stdio.h> bool flagH [ 10 ] [ 10 ], flagV[ 1...
by alamgir kabir
Sun Apr 26, 2009 10:20 pm
Forum: Volume 106 (10600-10699)
Topic: 10608 - Friends
Replies: 75
Views: 26458

Re: 10608 - Friends

I am getting WA. But I do not find any fault. Please anybody help me #include<stdio.h> #include<string.h> #include<stdlib.h> #include<ctype.h> #define SIZE 50000 int rank [ SIZE ], parent [ SIZE ]; void init( int num ) { for( int i = 0; i <= num; i ++ ) { rank [ i ] = 0; parent [ i ] = i; } return; ...
by alamgir kabir
Tue Apr 21, 2009 9:13 pm
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 30594

793 - Network Connections WA a lot

Code: Select all

code removed after acc
by alamgir kabir
Sat Apr 18, 2009 10:14 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 31801

Re: 902 - Password Search

Please help me. I am getting RE a huge number of time but I didn't find any fault in my code. I am reading all the post here #include<stdio.h> #include<string> #include<vector> #include<iostream> #include <stdlib.h> #include "alloc.h" using namespace std; char str [ 10000000 ], *tok, s [ 10000000 ],...
by alamgir kabir
Thu Feb 26, 2009 9:32 pm
Forum: Volume 115 (11500-11599)
Topic: 11576 - Scrolling Sign
Replies: 9
Views: 4674

Re: 11576 - Scrolling Sign

Very silly mistake. Now I have got it accepted.
Thnx a lot Jan.
by alamgir kabir
Tue Feb 24, 2009 9:02 pm
Forum: Volume 115 (11500-11599)
Topic: 11576 - Scrolling Sign
Replies: 9
Views: 4674

11576 - Scrolling Sign

I am geting WA. Anyone help me why i am getting WA. #include<stdio.h> #include<string.h> #define SIZE 110 bool check( char *s, char *t, int start, int end) { int i, j; for( i = start, j = 0; i < end; i ++, j ++ ) { if( s [ i ] != t [ j ]) { return false; } } return true; } int main() { int i, n, k, ...
by alamgir kabir
Sat Feb 14, 2009 12:43 am
Forum: Bugs and suggestions
Topic: 10391 - Compound Words
Replies: 4
Views: 3176

Re: 10391 - Compound Words

I am getting TLE. please help me. #include<iostream> #include<map> #include<vector> #include<string.h> using namespace std; int main() { //freopen("input.txt", "r", stdin); vector<string> str; char s [ 100 ]; typedef map<string, int> d; long i, j, count = 0; d dir; while( gets( s ) ) { if( dir.find(...
by alamgir kabir
Sun Jul 20, 2008 9:37 pm
Forum: Volume 112 (11200-11299)
Topic: 11292 - Dragon of Loowater
Replies: 10
Views: 6672

Re: 11292 - Dragon of Loowater

Take this input and I think this will be helpful for u. knight or dragon's diameter will be long so use data type long. Input: 2 4 7 2 4 3 1 2 2 4 7 2 2 1 8 5 1 1 2 2 1 1 1 2 3 5 5 6 1 2 3 4 5 1 1 1 2 1 2 10 1234567 2345 12345610 1 123 23564 123456 123 2 3 2 1 0 0 output: Loowater is doomed! 10 2 2 ...

Go to advanced search