OJ Board

Jan wrote

I think the best solution is O(n^3).

I don't think so, According to Bently there' exists sightly faster algorithm than this, though
i don't know that.

[/quote]
think the one influenced the speed of the program is the algorithm you use to solve that
[quote]

almost true . but there r so many ways to improve effeciency .u have to know ur particular machine architecture. plz look at the programming perls of John bently, one of the most beautiful ...

edit

//

Misof wrote:

One possible source for programming contests performance stats:
http://www.topcoder.com/stat?c=country_avg_rating[/quote]

I don't think so ? more and less i hate programming contest , as
it seems to me a football game , besides i am not a programmar , nor even
a good student ...

One possible source for programming contests performance stats:
http://www.topcoder.com/stat?c=country_avg_rating[/quote]

I don't think so ? more and less i hate programming contest , as
it seems to me a football game , besides i am not a programmar , nor even
a good student .

I don't think ...

go to Donald E. Knuth homepage:

http://www-cs-faculty.stanford.edu/~knuth/news04.html

look at Pre-Fascicle2b: Generating all permutations

u will get more than what u need .

Happy hacking!

Misof wrote:

he intended formulation was "the problem is NP-hard and we don't know whether it is NP-complete".

Sir , i am very poor in English . i don't understand what r u saying ? All
NP-complete problems r NP-hard ,but some NP-hard problems r not
known to be NP-complete .
A problem L is NP ...

Misof wrote:

he intended formulation was "the problem is NP-hard and we don't know whether it is NP-complete".

Sir , i am very poor in English . i don't understand what r u saying ? All
NP-complete problems r NP-hard ,but some NP-hard problems r not
known to be NP-complete .
A problem L is NP ...

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.


[/quote]
Do you mean the packpropagation algorithm which used in neural network?

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.

Do you mean the packpropagation algorithm which used in neural network?[/quote]

Do you mean the packpropagation algorithm which used in neural network?

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.

Dickon wrote:
my code is always time limited,
can someone give me suggestion?

why u r doing the same thing again and again,? u can do lthe following:

for(i =0 ;i<=10000;i++){
n=i*i + i + 41 ;
flag[ i ] = prime ( n) ; // 1 if n is prime ,0 otherwise ;
}
now the rest is trivial ,do ...

Asif wrote:
Thnx misof. Just learned the name of CutVertex from you:). Before i dont know it.

Really ? u shouldn't go too far to know about it, look at Rosen's Discrete book,
section 8.4 , example 7 . BTW, this problem is really easy.

edit