Разбор

how many problems ?

Judging from the name, it seems like a round in honor of people who donated some satisfying amount. Why are such special rounds not held on weekends so that as many people as possible could participate? Also maybe include some more information about the sponsors in the announcements.

My rating is waving on the border of specialist and pupil these days.

And bless everybody and me to get more rating in this contest.

It is raining contests...!!!

Don't worry that your division can change after ratings update after Codeforces Round 482 (Div. 2). I'll fix all the registrations to match your actual division.

Both divisions ? Now we have three in Codeforces ! Thanks Codeforces

I believe if it is a thanks round, then the blog post should include some information and thanking for the supporters in this round. Otherwise it'll be no different from a normal round.

Accidentally downvoted :(

Contests everyday, thank you

what does jngen mean???

Contest of Div1 and ((div2 — div3) union div3) ) :P

These guys will beat tourist :

1. gautam1212
2. __B
3. sarthak0797

Hopefully, (Div. 2) Problems will be interesting like today's one.

Wow, there are real jngen users :) I haven't promoted it for several months, so I'm very happy to see that sort of self-promotion exists.

I would be glad if you could share the problems with me after the round. If I see how the community uses the library I can maybe improve the docs, give you some advice or see new development directions. My polygon login is the same as here.

Wow, nice short description. Hope the description of the problems will be as short as the blog. :)

My semester final exam start from today and I am waiting for Codeforces Round #483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!] :).

My rating is below 2100 but I cannot register at the home page.

Please fix the bug. MikeMirzayanov

Hopefully.

Candidate master still participate in div 1 round.

She: "What would you do alone at home?"

Mobile chimes, " Codeforces Div ..."

He: "I am not alone, anymore."

"Гожусь нашим знакомством", "лично Виктор Шабурову"

you said the round rated for both divisions

is it rated for div3?

or div3 is n't a division

is it rated for DIV-3?

Q. Why did Scarlet witch fell in love with Vision?

A. He was Red. :P

Заиграет ли velheor в Na'Vi?

10 min delay. why?

Problems difficulty is Unbalanced at all A and B**** are extremely easy compared to C and D

No Hacks !!

I solved problem C without the condition of 4 guys in the elevator, and was thinking why I had got WA 4 during all contest.

What's the point in making such a tough TL in div1A? Nice problems btw.

Is Div1 E just finding greedily till lca from both nodes and summing it??

Also is Div1 B using SOS dp or something easy??

How to solve C?

Hack-Free contest !

I realized that the TITLE of the Problem Div2D,Div1B was such a huge hint, but it was too late. no time to debug.

Problem Div.2 C

What is the answer for :

1 1000000000000000000 999999999999999999 10

the calculator shows : 1000000000000000000/999999999999999999 = 1.000000000000000001 which is finite

Thanks Botan Investments for my decreased rating...

For div2d, I thought of some kinda O(N^N) preprocessing but I had no clue how to calculate f() efficiently.. What is the idea behind this problem ?

Может быть, авторы перестанут ставить ограничение по времени 1 секунду в задачах, где много ввода????

how can we solve problem D , i know we need to find max xor pair in given range , but how to optimise it from o(n^2) ?

To be honest, I must appreciate how setters choose cases for pretests in this one — really careful and cover nearly everything one can slip into. Cheers. ;)

too tight time limit on Div.2 C....

Anybody else wants to complain against time limit of div1 A?

solution for Div2. C (Div1. A):

https://math.stackexchange.com/questions/310402/proving-finite-vs-infinite-representation-of-p-q-in-base-b

(i think now there is no violation with codeforces stupid rules)

An interesting game

problem C looks trivial. Does this dp works? dp[i][pos][x1][x2][x3][x4]=minimum cost if the first i people already entered in the elevator, currently we are at floor pos, and the elevator contains people that wants to go to floors x1,x2,x3,x4.

This is the first round when I solved div1 E. I solved div2 E for the first time when Livace was the problem setter too (Codeforces Round #442).

Link: http://mirror.codeforces.com/contest/877/standings

in problem (B. Minesweeper) 1 1 * how test like this can be valid ????

During the contest I wanted to hack leon_ldy's solution(38273146).I had 2 unsuccessful submissions in this problem and after my second submission I noticed in pretests 8 , n=1.but why his submission passed pretest? this is his code:

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;

const int INF = 0x3f3f3f3f;
const int MAXN = 1010;
int a[MAXN];

int main()
{
#ifdef LOCAL
	//freopen("C:/input.txt", "r", stdin);
#endif
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);
	sort(a, a + n);
	int j = n - 1, k = 0;
	while (true)
	{
		j--;
		if (j == k)
			break;
		k++;
		if (j == k)
			break;
	}
	cout << a[j] << endl;

	return 0;
}

but when n=1 so j=0. and in the "while (true)" we had TLE. because at first "j--" and after that j=-1. so always j!=k.

C+E = (Code*Code*Code+Code^2)^Code

For C I check whether the divisors of q are a subset of the divisors of b with gcd but still get TLE on 13.

Any ideas for D?

def gcd(x, y):
   while(y):
       x, y = y, x % y
   return x
a=input()
while(a>0):
    a-=1
    p,q,b=map(int,raw_input().split())
    r=gcd(p,q)
    q=q/r
    r=gcd(q,b)
    while(q!=1 and r!=1):
        while(q%r==0):
            q=q/r
        r=gcd(q,b)
    if(q==1):
        print"Finite"
    else:
        print"Infinite"

even after writing exactly the same code as it is being discussed in the comment section, my solution failed. Time limit for python is too strict. i got tle in 11. Please verify if there is a mistake on my side or this happened because of the language selected. Thanks :)