OJ Board

I saw that the "past contests" section was changed but I couldn't find the problems from those past contests. Am I missing something?

Rostislav

TISARKER maybe you should try backtrack.
But I want to ask people who got AC, is there another way to solve this task?

Rostislav

I meant - gcc -c ... ?
or - g++ ... ?

What optimizations are used when compiling a C++ source in the live-archive.
I am curious because at home on 2Ghz my program runs for ~6 sec. but on the judge it takes more than 30 sec.

Rostislav

Matrix #1
3
2
2
2
2
2
2
1

yes

Is it possible to give me some hints about that problem
http://acmicpc-live-archive.uva.es/nuev ... php?p=3415

Rostislav
P.S. Adrian K

Can you explain me the statment of the problem with a few words.
http://acmicpc-live-archive.uva.es/nuev ... php?p=3409
Thank you in advance!

Rostislav

10 sec

Why there are changes in the time limits in the problemset?

Rostislav

I had the same problem during the contest.
If i use long double -> WA
but if it is only double -> AC.
And for me this is very strange.

Rostislav

Just maintain two 2D arrays the one should contain the minimal amount of matrix ( i don't know the plural :) ) and the other the
minimal cost of multiplying the last few matrix in a given interval.

Rostislav

P.S. read the statment carefully i.e. you cannot use the proccesor like this : A ...

I apologize, my mistake!
I had used inline function and my compilator doesn't give any error about that when compiling like a C source. (ussualy i know than it gives COMPILE ERROR when using inline functions but I thought it was something different because at the contest i submited a lot of things ...

There is no difference, just submiting one and the same code
but once like C and once like C++.

Rostislav

The code is the same and it is written only with C functions.