OJ Board

Yep, indeed, the answers are
The maximum and minimum are 4096000000000000 and 4096000000000000.

That problem is from Nothern European Regional, Nothern Subregion 2001. Take a look look at this http://neerc.ifmo.ru/subregions/northern.html

That problem is from Nothern European Regional, Nothern Subregion 2001. Take a look look at this http://neerc.ifmo.ru/subregions/northern.html

However, we all should post here English and only English!
Moreover, you are a member of Algorithmic Team... so you should give good examples

Take a look at http://online-judge.uva.es/board/viewtopic.php?t=3572

Was it Spanish? Or Espaniol

Who or what? Me or the algorithm?

Sorting...

You know, me too

Yep, correct

I think, definitely not Pascal

Why -1? The answer is 1. Everything is clear....

Well, we'll see it very soon

The only one trick is for n=1 the answer is 0, not 1

I happen to know where this problem was originally used,

Cool... I know at least 30% of the origin of the Judge problems

One quick question -- are you the same Howard Cheng form Waterloo?
I think yes... So, can we talk?

The same question...
Nice problem, btw.