Search found 54 matches

by kolpobilashi
Wed Dec 12, 2007 2:23 am
Forum: Bugs and suggestions
Topic: Previous contest
Replies: 2
Views: 1312

you'll find the last contest here:
http://acmicpc-live-archive.uva.es/nuevoportal/
the contest was actually Asian-Dhaka site regional contest.
by kolpobilashi
Fri Dec 07, 2007 6:24 am
Forum: Volume 113 (11300-11399)
Topic: 11352 - Crazy King
Replies: 32
Views: 12040

can anyone tell me wat is the maximum size of the board/forest??
can't figure out the reason for getting WA :-L
by kolpobilashi
Thu Aug 02, 2007 7:44 pm
Forum: Volume 112 (11200-11299)
Topic: 11241 - Humidex
Replies: 17
Views: 8259

input: T 55.55 D 45.67 H 19.28 D 23.6 T 49.0 D 39.0 D 100 T 100 H 78.8 D 88.98 T 0.0 D 0.0 T -20.0 H -5.0 D 27.4 T -20.08 output: T 55.5 D 45.7 H 108.1 T 8.4 D 23.6 H 19.3 T 49.0 D 39.0 H 83.9 T 100.0 D 100.0 H 784.7 T -359.4 D 89.0 H 78.8 T 0.0 D 0.0 H -2.2 T -20.0 D 27.3 H -5.0 T -20.1 D 27.4 H -4...
by kolpobilashi
Thu Aug 02, 2007 5:36 pm
Forum: Volume 111 (11100-11199)
Topic: 11121 - Base -2
Replies: 23
Views: 14554

check ur code for these input:

Code: Select all

5

8
9
-9
-11
-13
correct output will be:

Code: Select all

11000
11001
1011
110101
110111
best of luck TD! :D
by kolpobilashi
Tue May 01, 2007 10:22 am
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12329

i am getting RE in this problem.....can anyone tell me the correct output for the following input

Code: Select all

3
asd-4/sdfs 3/4 asdad 2
2-3/sdfsdf sefd 1/4
1-szdc/4 abc 3
thanx in advance.
by kolpobilashi
Sat Mar 17, 2007 3:22 pm
Forum: Volume 4 (400-499)
Topic: 429 - Word Transformation
Replies: 82
Views: 17187

That's it !!! :o :o
thanx Jan... :)
by kolpobilashi
Sat Mar 17, 2007 8:09 am
Forum: Volume 4 (400-499)
Topic: 429 - Word Transformation
Replies: 82
Views: 17187

i am getting WA for this problem
http://acm.uva.es/p/v4/429.html
anyone can help...?? :(

Code: Select all

cut..
thanx in advance..
by kolpobilashi
Thu Nov 23, 2006 7:27 pm
Forum: Volume 108 (10800-10899)
Topic: 10815 - Andy's First Dictionary
Replies: 116
Views: 30767

map is a sorted container.so my problem was not this.the mistake was here
your program must be CaSe InSeNsItIvE
i fixed it and got AC.
thanx anyway. :D
by kolpobilashi
Wed Nov 22, 2006 9:13 pm
Forum: Volume 108 (10800-10899)
Topic: 10815 - Andy's First Dictionary
Replies: 116
Views: 30767

checked all previous posts and the code seems ok, but it gives WA. would anyone kindly hav a look... :(

Code: Select all

cut..
btw, i never used set, thats why i use map here...but it seems ok :roll:
thanx in advance.
by kolpobilashi
Sat Nov 11, 2006 6:00 pm
Forum: Volume 107 (10700-10799)
Topic: 10703 - Free spots
Replies: 26
Views: 9005

thanx a lot JAN...didn think abt that input... :D
by kolpobilashi
Sat Nov 11, 2006 12:01 pm
Forum: Volume 107 (10700-10799)
Topic: 10703 - Free spots
Replies: 26
Views: 9005

:( i am getting tired can't find out the bug....i think my outputs are also ok.plz anyone help....

Code: Select all

cut..
by kolpobilashi
Fri Nov 10, 2006 12:05 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31685

thanx a lot.. :D i increased the input string size upto 20000 and got AC
by kolpobilashi
Wed Nov 08, 2006 2:38 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31685

why getting WA???can't find out the mistake

Code: Select all

cut..
thanx in advance...
by kolpobilashi
Wed Nov 01, 2006 9:18 pm
Forum: Volume 7 (700-799)
Topic: 776 - Monkeys in a Regular Forest
Replies: 51
Views: 18559

i am getting WA for this code...anybody knows why?? :roll: #include<stdio.h> #include<string.h> #define M 1000 char input[M][M]; char Grid[M][M]; char Visit[M][M]; int output[M][M],col[M]={0}; int Move[8][2]={1,1,1,0,0,1,-1,-1,-1,0,0,-1,-1,1,1,-1},b=1; char ping; void dfs(int r, int c) { int i; for ...
by kolpobilashi
Mon Oct 23, 2006 10:42 pm
Forum: Volume 103 (10300-10399)
Topic: 10311 - Goldbach and Euler
Replies: 98
Views: 23134

thanx sunny & ayon...this bitwise operation seems much complicated but it really works :)

Go to advanced search