OJ Board

There are too many datacases to solve it like you do.
Try to build answ integer (some candidates) using prime factors of n.

Thanks!!!

What is wrong with solutions of this simple problems?

<cut>

Maybe there are simple bugs, but I can't find it.
Thanks for help.

Yes!
For n=0 I print 0

Hi!
I use dp and I have no idea, why it get WA. (where it could be mistake in my program)
Maybe some tricky inputs?
Please, give me some tests.

Best Regards!

The problem is that libstdc++ doesn't supply hash function for strings. You have to write it yourself, which is preety easy since there is hash function for const char *. For instance you can try this code:
[cpp]template<> struct hash< std::string > {
size_t operator()( const std::string& x ...

CDiMa wrote: OJ uses an old version of gcc... try this:
[cpp]
#include <hash_map.h>
[/cpp]

It doesn't work.. It's still CE
I don't know how to use STL without CE
Please help...

Best Regards

Why this code get Compile Error?
Please help...


#include <stdio.h>
#include <string>
#include <hash_map>

using namespace std;

const int maxn = 11;

int n,test;
hash_map<string,int> person;
char names[maxn][15];
char name[15];



int main()
{

int x,y;

int ile,cash;

while (scanf ("%d",&n ...

I solved this problem by applying repeated Bipartite-Match algorithm. (N+1) of them to be precise.. where N indicates the number of slides.
8)

I have got AC, but my time is not very well - 0.447 s - I do M Bipartite Match algorithm, where M is number of egdes in graph. It can be much more than N ...

Thanks Sohel!

I thought, that all slides must be uniquely determined or in other case answer is "none". Thank you for help with understand.

Best regards!!!

Consider this case:
You have 5 points and slides:
point 1 and 2 are in slides 1 and 2, point 3 lies in slides 1, 2 and 3, points 4 and 5 are in all 5 slides. Then points 1 and 2 must be the numbers of the first two slides, but which number is on slide 1 cannot be determined. But after you remove ...

This links should be helpful

http://www.cs.uku.fi/~kilpelai/BSA04/le ... rint04.pdf
www-sr.informatik.uni-tuebingen.de/~buehler/AC/AC1.html

first one is about Aho-Corasic
second one is simulation of this algo. It helped me to understand.

Sorry

I didn't realize that there is possible to compute answer in O(n) for one-dimensional problem.

Best Regards!

I don't get your complexity n^3
There may be both positive and negative integers.
Is there finally algorithm O(n^3) for this problem?

I use some kind of dynamic programming (with many loops :P ) and get accepted. It finishes in 1.8s.

I think the runtime can be further reduced if I modify the loops, or take care of tubes with the same chemical, ...

I also use DP, but it much less efficienly than your algorithm. My program runs ...