Hi, everybody!

Welcome to the "Codeforces Beta Round #40 (Div. 2)". Let the weather cloudy (at least in Saratov), and the round began with the unavailability of the server (we apologize for a fail), but I hope the tasks will bring you pleasure.

Wish you high ratings,

MikeMirzayanov

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

yep :)

small mistake.

but what will be the answer for such test:

dotdotatatatatatatatdotdot

?

(Sorry! you did not ask the really ans. My mistake)

dot.@atatatatatat.dot

вот ответ на этот тест

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

I think you have trouble in this part of your code:

<pre>

if(input.Substring(i,2)=="at")

{

input=input.Substring(0,i)+"@"+input.Substring(i+2);

}

</pre>

reread the statement carrefully ;)

http://paste.ubuntu.com/528290/

really nice problems!

thanks to authors and CodeForces!

well done!

I think there will be many pepele died in problem B.

!

Yeah, the problem is simple .Many people make a mistake on what the problem mean.

But finally i got WA...

Does the problem means, i can buy many times, but sell only once?

1 2 1 2 you could get more than 8 using 2 sells and buys. By the way, that's a test, which gave me 3 hacks :P

when greedy, use:

int cas = b / min[i];

int t = b + cas * (data[i] - min[i]);

if (t > max) max = t;

min[i] is the min number in the left side.

Greedy it with the value of you can got with each sub();

you should greedy the value.

value = (b/minPrice)*maxPrice+b%minPrice;

not (maxPrice-minPrice);

Change your loop from single to twice.

for (int i=0; i<n; i++)

for (int j=i+1; j<n; j++)

.......

(bug: commenting seems to not work (comment is blank) from chromium?)

So we have chance to hack it.......

Can there be more than one word in problem Anope

http://paste.ubuntu.com/528284/

Kindly explain the problem.

aa

Is the contr-example.

BTW - it's my first contest on Codeforces, so i think i should say 'hello' to everybody, and thank you for the exciting contest!

my code: http://paste.ubuntu.com/528287/

:)

PE maybe you can get the right value, but the wrong path.

admins answer my questions fast during contest , thanks for that.

If we reply the new comment again and again. Will it only print one charactor each line?

kindly let me knw my mistake......I got wrong answer for pretest 7.....poblem B

this problem (in my opinion) needs to be solved in one(may be two) for loops - thats all.

n-vertex triangle-free graph with the maximum number of edges is a complete bipartite graph in which the numbers of vertices on each side of the bipartition are as equal as possible.Thx

1. The input data: the first line is the top of chessboard and the last line is the bottom.

2. When you got the max peas value is 0, it has a path, shouldn`t be print -1.(Some people WA on 51 maybe this reason)

3. A 3rd_DP alogrithm can work .dp[ i ][ j ][ k ] express the max peas you can get at point ( i, j ) and the

sum%( n+1)==k.

please help me.

in B,What is mean bourles?

and

in C,what is pretest 5?

thanks

Tranlationhttps://github.com/arsalanhub/CodeForces/blob/master/Translation