UVa OJ Board

stl is very useful for this problem, though i used Trie as the data structure

but i found a direct link to go to any problem. say for problem 11284
http://icpcres.ecs.baylor.edu/onlinejud ... 11284.html
but this way you cannot submit

the online-judge itself forgot a boundary case and made a wa

it seems now your suggestion is accepted

There is one more thing that might cause WA, it is a small implementation detail, read the problem statement carefully. thanks for the hint , after getting too many wa in contest and online-judge, while reading the description again, i thought about multiple edges between two nodes. after checking ...

did you use void main()? that now gets CE or RE, for the new server use int main(){ return 0; } for C++

most probably online-judge doesn't support clear()

this problem can be solved only by a sorting

correct assumption is (v-v*(x/100))<m-1
using double may give precision error

i did same as sclo using O(n^4), but i got TLE. there must have some better approaches

cannot get rid of PE's. my output format for the sample inputs are MATCHES FOR THE PATTERN: C*AT COMFILE.DAT CAT COAT //one blank line MATCHES FOR THE PATTERN: *A* MOUNTAIN.TXT ALFRED PROG1A PROG1A.PAS //one blank line MATCHES FOR THE PATTERN: B**N* BANANA BNXJ.25 BORN BRANDISH.SRD BITNET Press any ...

it seems there are DEQUEUE even when the queue is empty, what should i print then?

input will terminate with a negative value, not just -1

thanks to DP, but it goes to something like

log(1+x) /log(x) = fractional_constant

now how to get x? there are several methods, but what should be best?

say i have A, B, i have to determine x and y from the two equations:

x^y = A;
(x+1)^y = B

what should be the best approach?