fi is basically phi, which is a single greek letter so I don't see any problems.

Right! I guess the reason it seemed so obvious to me at the moment was that I was thinking the same thing :P

Context. Like, what else could he possibly have meant?

Unfortunately, I have a piano session with Alice at that time.

Definitely. If you start at 9 a.m. or something 12 hours is very doable.

I actually just gave up. To the future me: don't do this again.

percents to what?

what

I'mma use this blog as proof for that.

I think it doesn't include virtual participations.

I'm weirdly happy not to make the cut.

But how?

That's just exaggeration of what we're dealing with here. It's not that common, and the difference in complexities is not so drastic. And I believe it takes some cleverness to make it work.

I see what you're saying. It's really annoying when some constraints are not mentioned when they need to be. In case of FHC, they don't need to be mentioned because they're just solvable nonetheless. In case of those ACM contests, I just assume that as long as my solution works fast on one test case, it should be enough. I hate to have to do that, and sometimes it ends up not working fast enough.

So I'm okay with FHC, because u don't need additional constraints to solve the problems. The fact that people can get away with slower solutions just adds to the strategic side of the contest. You said you think of it as a programming contest where only programming skills should matter. But to me, it's not like that. I like the idea of thinking about what's the best course of action to take, and not just hurriedly solving problems.

Well my understanding is that you always need to assume the worst case scenario. If u want to risk the test cases not being max-tests, that's on you. It's a valid strategy but obviously comes with the risk of your assumption being incorrect

Hmm are you complaining that your deduction that most test cases are not max tests was wrong this time and blaming the staff for it? Sweet.

No problem. They send you a message on Codeforces. It's hard to miss.

Canada, and got the tracking number a few days ago.

Or, you know, calculate which one u need.

U're making it sound like you're willing to debug a code if it's the 2nd one.

Can you elaborate a bit?

nevermind, found it on the page:
"We're also excited to announce that this year's Hacker Cup Finals will be held on October 24-26 at Facebook Dublin!"

Where is the final contest held?

Pfff, no. I'd rather ask it publicly and let somebody else rewrite the proof and explain it to me in a magical way.

hagfGh96@A

Post a blog about it.

You guys had the coolest gifts at IOI! I wish I were a participant so I could return the favor :(

Wrong

He can bring multiple tshirts and distribute them. (Please do this)

Good luck!

Isn't GT going to fund these new students?

Can anybody explain why GT cares this much about ICPC? I've never really understood its importance.

It's not really uncommon either. Personally, whenever I see n <= 5000, I have a doubt whether N^2.log(n) is intended or not.

In MMC, I specifically didn't want K^2.log(k) to pass. In WNDR, I simply was looking for n.k solutions and set the constraint as high as possible. I actually set it to 9000 instead of 1e4 to give a hint that N.K is intended.

They're posted.

I can't believe you're getting more upvotes than I. You're like.. a wizard.

If you're talking about persistent lazy propagation, it's obviously possible. Once you understand the concept, you'll see that it's not really different. You'd just have to use more memory and the implementation would be a bit harder.

You obviously have -1 girlfriends if you promise your buddy to find him one.

What theorem does it use anyway?

If you exceed 100 symbols, you drink.

DP is defined as breaking a problem into some subproblems and then combining the results of the subproblems to solve the main problem. Based on this definition, what I described could be considered as DP.

You said what I described is not only BFS and BFS is just traversing the vertices in some order. The thing is, you can't do that traversal unless you implicitly calculate the distance from 1 to every other node. So what I described is not different from the normal BFS.

Sort the numbers. Calculate the partial sum. At first, set ans = cnt-1. Then, for each i reduce ans by one if a[i] > partial_sum[i-1]*2. This can be done with a segment tree because the number of such cases is at most lg(1e9).

Why do Russians always win the WF?

I'm pretty sure that wouldn't work.

Can you do anything with it without the expiration date and the security code?

What was wrong with the solutions to G that failed on test #4?

Let's say we want to run a BFS to find the distance from 1 to every other vertex. At first, we set dist[1] = 0, which is basically the base case of our DP. Then, what we're really doing is we set dist[u] = min(dist[u], dist[v]+1) for every edge uv. It's essentially solving a problem (what is dist[u]?) By solving a subproblem (what is dist[v]?). It really is a DP approach, isn't it?

Either they are tagged wrongly (note that anyone who has a specified minimum rating can add a tag to a problem), or they really do have a DP solution. Or maybe a solution that doesn't seem DP to you, seems DP to someone else. For example, I consider BFS a DP approach, so I wouldn't say someone is wrong for tagging a BFS problem as DP.

I think you're wrong. They're probably delaying their response because they're trying to figure out how they can improve their system the best. Mike is a great guy after all. There's no way he would just ignore your blog.

Just curious, will you stop if he asks you to?

I've never watched a documentary, but this one I would watch.

Why not ban those with low contribution from "contributing" more?

And how will you decide that?

When does the next season start?

Let's do it.

I won byterace 2k17, but I haven't received the prize yet. Can you help me with that?

Even in CP Messi is better than Ronaldo.

What do the hoodies look like?

Host scientific Committee I think.

Buy Bitcoin.

Was checking how stupid their rating system is. I didn't violate any rules, did I?

Why do you need so much information to give the prizes? How are my publications and projects relevant?

Ask a GM to participate with your account :/

Good luck!

So.. how is the training going? Do you find it useful?

Nevermind!

It's correct

Thanks, I get it now.

Aren't there 2 possible angles if we know the sides?

Wow! Can someone confirm this is correct?

Do you mean we should send you a message?

I feel bad for Marko.. He was so close.

Who are the other participants in the standings?

Is compile error counted against the penalty? Did they mention this anywhere?

I always assumed that the host country is somehow responsible for the selection of the tasks. Does anyone know how it works?

Isn't Atcoder a good place to train for IOI because it's in Japan this year?

That doesn't justify ignoring his emails and messages though.. just saying.

They do say that it takes 6-8 weeks to give the prizes. And they're usually on time.

Painting a level green is like painting that level blue and then red. So you can iterate over the number of levels you're going to paint blue (let's call this I). The number of levels you'll have to paint red will be uniquely determined (let's call this j). Then you add choose(n,i) * choose(n,j) to answer.

Very boring tasks.

Starts in 5 minutes.

Where can I find the problem statements?

Unbelievable!

Can you share the official results?

Do you know any good tutorials for kd-tree?

Any ideas for D?

Yeah but the problem is that the div2 cutoff hasn't changed. So reaching 2250 means reaching 350 over the div1 lower bound. I seriously doubt that someone who is ranked top 5 in div2 deserves that rating.

Losing 100 of your rating after having a bad contest is not something new. Reaching 2250 performing in a div2 contest is.

I actually agree with you. Thanks for posting this.

They can't join div2

So which one do you like better? The books or the TV show? vovuh

I'm willing to give my t-shirt to the second div1 person who messages me.
Update: It's over

Starts in 15 minutes

Thanks!!

How to solve D?

What does "CPU Limit Exceeded" mean?

Actually, a team from Shahid Beheshti university is going to WF based on this link: https://icpc.baylor.edu/regionals/finder/asiakabul-2017/standings

Congrats, man. Keep up the good work.

My solutions were skipped because somehow someone copied my solution for Div1-A.
http://codeforces.com/contest/891/submission/32389480
http://codeforces.com/contest/892/submission/32400911

I have no idea how this happened. And no, I didn't use Ideone. KAN, please fix this!

Anyone interested in playing FIFA on PS4?

LiTi is my Hero