# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
0
Plus you need to check ((x2 — x1) / x + (y2 — y1) / y ) % 2 == 0 because there are no rules that move only x or y. |
0
remember that we must change a character. first compare s[0.. n/2-1] and s[n-1.. n-1-(n/2-1)] YES : only one difference || ( n % 2 == 1 && every character is equal ) NO : (Actually using 'else') ( n % 2 == 0 && every character is equal ) || more than 1 differences |
-6
How to solve C? I can get gcd using Euclidean Algorithm(if you know any better idea, can I ask you to tell any idea). |
0
Just Programming skills not a specific algorithm (sorry about confusion) |
-6
This contest is good for me to overcome my laziness about studying algorithm. |
0
I just find min, max value of div1, div2. if there is no div2 ==>> Infinity. if a max value of div2 is bigger than a min value of div1 ==>> Impossible. Finally, there is solution = 1899 + position — maxValueDiv2 to find maximum value. Drawing range will be helpful (Sorry Bad English) |
On
MikeMirzayanov →
Codeforces Round 389 Div.2 (and Technocup 2017 — Elimination Round 3), 7 years ago
0
Contest always end up with hacking :( |
0
My solution C simulating statement is accepted. is there any solution without simulating? |
0
I agree with you. I had the same experience before. |
0
I have a question. I wonder how people can solve Div2 B, though they are confused about it... Is it a gap between me and high ranks? |
0
there are two copies. |
0
Div2 B, they said "It is guaranteed that the puzzle pieces are one 4-connected piece." and didn't accept rotate, flip and overlap. ==> only move. Because there are two copies of puzzle, only rectangular input is accepted. no stairs shaped, window shaped... |
0
.XXXX XXXX. XXXX. or .XX XX. XX. .XX XX. XX. It can't be rectangle |
0
I hope this will be helpful :) It seems like binary search. ll recur(int n, ll k) { ll temp = pow(2, (double)n — 1); if (k == temp) return n; else if (k > temp) { k -= temp; } return recur(n — 1, k); } |
+2
Hack Festival!@#(@($*!@(#!@ |
0
Although I missed a mistake as you mentioned, pretest was permitted. I noticed it, corrected immediately and got -50 points :( But I used the information for hacking! and got +100 points :) |
+1
I can feel the power of Alyona's mother |
Name |
---|