### AlFlen's blog

By AlFlen, 11 months ago, translation,

Hello, Codeforces!

74TrAkToR and I are glad to invite you to our Codeforces Round #750 (Div. 2), which will be held at Oct/24/2021 13:05 (Moscow time). Notice the unusual time of the round. The round will be rated for all the participants with rating strictly less than 2100. At the time of the round the CheReKOSH olympiad will be held, where the problems from this round will be used!

We would like to thank everyone who helped us a lot with round preparation.

On the round you will be asked to help characters from animated series Luntik and his friends. You will be given 7 problems, one of which has two subtasks. You will have 2 hours 30 minutes to solve them.

UPD: Score distribution: $500-750-1500-1750-2500-(2000+1500)-3250$.

UPD2: Editorial

UPD3: Congratulations to the winners!

Div. 2:

Div. 1 + Div. 2:

We wish everyone good luck!

• +480

 » 11 months ago, # |   -34 hoping for a good contest :)
•  » » 11 months ago, # ^ |   +38 You wrote the exact same comment in the announcement of rounds #748 and #749, but didn't participate in both of them. Will you participate in this one? XD
•  » » » 11 months ago, # ^ | ← Rev. 5 →   +1 Bro actually i participated in div3 round but my solution of D1 concides with 1 participant , i dont have any idea how this happens to me and in round 749 i did not participated due to issuse on codeforces like site is not opening properly . I am new to codeforces and if u want then i will not post such comment from next contest onwards.sorry for my comment .
•  » » » » 11 months ago, # ^ |   +10 I never said there's anything wrong with your comment, I just thought will you participate this time. Chill dude, you can post whatever you want. :)
•  » » » 11 months ago, # ^ |   +4 if he participate he cheats, so better he shouldn't!
•  » » 11 months ago, # ^ |   +3 will see !!
•  » » 11 months ago, # ^ |   +5 why are tou skiped?? you cheated again ?!?!?!
•  » » » 11 months ago, # ^ |   +5 The moment I saw 3 compilation errors, I knew something was fishy.
•  » » » » 11 months ago, # ^ |   0 i wonder why many cheaters comments nicely before they attempt to cheat. Spoiler
•  » » » 11 months ago, # ^ |   0 No boy, he isn't a cheater! I know him personally, and he is a really hard-working (just see his graph) and honest guy.As far as skipping is a concern, it's because he didn't knew that we can't use 2 ids during a contest.
•  » » » » 11 months ago, # ^ |   0 a hard-working honest guy who has been skipped twice in a row?hm.....
 » 11 months ago, # |   +51 As a tester, good luck anyone who participates will have a positive delta!-QuangBui(YT/CP)
•  » » 11 months ago, # ^ |   +23 sum of delta = 0 intensifies
•  » » 11 months ago, # ^ |   0 Thank you.
 » 11 months ago, # |   -60 Anxious for the contest to arrivePS: I take this opportunity to leave a link to a blog with a collection of segment tree problems that I hope will be helpful to someone. https://codeforces.com/blog/entry/22616Thanks to AminAnvari
•  » » 11 months ago, # ^ | ← Rev. 6 →   -65 Meme
•  » » » 11 months ago, # ^ |   +8 Because it's not related to the blog. You could have post this in the segment tree section of codeforces edu instead.
 » 11 months ago, # |   0 Another friendly time for Chinese users! Looking forward to great problems and having fun!
 » 11 months ago, # | ← Rev. 4 →   -6 why cf is organising contest at unusual time these day? By the way hoping for big delta +ve
•  » » 11 months ago, # ^ |   0 At the time of the round the CheReKOSH olympiad will be held, where the problems from this round will be used!
•  » » 11 months ago, # ^ |   +31 At this point I dont know which is the usual time anymore :))
 » 11 months ago, # |   -48 This contest is clashing with Codechef's cookoff contest.
•  » » 11 months ago, # ^ |   0 no
 » 11 months ago, # | ← Rev. 2 →   +6 traktor. Me when I read A
 » 11 months ago, # |   +50 As a tester, GOOD LUCK!
•  » » 11 months ago, # ^ |   +10 your comment makes me nervous.
•  » » 11 months ago, # ^ |   0 Should have seen this coming :P
 » 11 months ago, # |   0 IEEE is coming in 2 days!
 » 11 months ago, # | ← Rev. 6 →   -44 nice meme
•  » » 11 months ago, # ^ | ← Rev. 5 →   +9 It's better to put the meme inside a spoiler so it doesn't take so much space :) How to do it:At the beginning put <$spoiler summary = "name for spoiler"$>, in another line the information and then close with "<$/spoiler$>I put \$ because otherwise it becomes recursive XD
•  » » » 11 months ago, # ^ |   0 thanks!
 » 11 months ago, # |   0 does one subtask means that one problem will be divided to easy and hard versions?
•  » » 11 months ago, # ^ |   -28 Probably.
•  » » 11 months ago, # ^ |   -11 Yes, subtask means same problem will have different constrains and one of those can be passed with a easier solution.
•  » » » 11 months ago, # ^ |   0 Not always. Sometimes problem statements are different.
 » 11 months ago, # |   +1 i wish i could creat a contest like this one day :3
 » 11 months ago, # |   0 I hope to be a regular contestant from this contest!! And as a newbie i wish to solve at least 1 problem in this contest!
 » 11 months ago, # |   0 is the score distribution finalized?
 » 11 months ago, # |   -8 Unusual Time
 » 11 months ago, # |   +52 I hope you surprise us with A1 and A2
 » 11 months ago, # |   +3 I hope to become MASTER again through this contest.Good luck!
•  » » 11 months ago, # ^ |   +10 Me too lol hood luck
•  » » 11 months ago, # ^ |   0 lol i think u will be master nice job ! i had a really bad contest however
•  » » » 11 months ago, # ^ |   +1 My dream comes true!Thank you!I sincerely hope that you will get a very nice performance next time.
 » 11 months ago, # |   -8 I want green
•  » » 11 months ago, # ^ |   0 Spoiler
•  » » 11 months ago, # ^ |   0 lesgooo
•  » » 11 months ago, # ^ |   -10 I had achieved
 » 11 months ago, # |   -7 Good time for Chinese participants!I wonder why recent contests take place earlier.
•  » » 11 months ago, # ^ |   0 Maybe today's contest is early because otherwise it would have clash with CodeChef's Cook-Off !!
 » 11 months ago, # |   +3 I don't know whether it is appropriate to post this comment under this blog.If I registered for round #751(Div-1) and I lost candidate master after today's contest, will I be able to participate in tomorrow's Div-1?.
•  » » 11 months ago, # ^ |   +3 No, you won't.
 » 11 months ago, # |   +11 ppl say the unusual time of this round is because its mirroring an olympiad, but we all know the real reason is that it doesn't clash with the T20 World Cup: India vs Pakistan. Thanks Codeforces, appreciate it.
•  » » 11 months ago, # ^ |   0 Are you saying it clashes with Sri Lanka vs Bangladesh out of spite?
 » 11 months ago, # |   0 At least the first question can be easy for newbies!!!
•  » » 11 months ago, # ^ |   +21 Boruto you are annoying as ever !! First cheating in chunin exams and now this
•  » » » 11 months ago, # ^ |   0 A new chunin exams starts today (3:30 IST)! Hope you are still in the game Kakashi!
•  » » » » 11 months ago, # ^ |   -7 I am Kakashi hatake the copy ninja .. I know a 1000 Jutsu and I will use them all and live up to my name !!
•  » » » » » 11 months ago, # ^ | ← Rev. 2 →   +3 Are you aware that you are under Genjutsu :D
•  » » » » » » 11 months ago, # ^ |   +6 We all are ...
•  » » » » » » » 11 months ago, # ^ |   0 Kakashi, linear diophantine equations?
•  » » » 11 months ago, # ^ | ← Rev. 2 →   0 Kakashi sense(or else I can say stupidgoat) can you teach me the Rasengan! For the current chunin exams so that I won't cheat, please...
•  » » » » 11 months ago, # ^ |   +3 Bro I am a copy ninja just stop kidding
•  » » » » » 11 months ago, # ^ |   0 I wonder about that because you don't have the dear Sharingan anymore Mr.Copyninja!!
•  » » » » » » 11 months ago, # ^ |   +3 Bro codeforces round at 3.30 ... I have sharingan ... Itachi is alive what do you think is happening .... It's INFINITE TSUKUYOMI !!
•  » » » » » » » 11 months ago, # ^ |   0 Let us kill Madara(code forces round) together.
•  » » » » » » » 11 months ago, # ^ |   +25 Those Who Do Not Understand True Pain Can Never Understand True Peace.
•  » » » 11 months ago, # ^ | ← Rev. 2 →   0 Interesting !
•  » » » 11 months ago, # ^ |   0 Mr.Kakashi, I got +84. Anyway, what about you?
 » 11 months ago, # |   0 is there gonna be score distribution?
•  » » 11 months ago, # ^ |   0 Hope you won't cheat this time :)
 » 11 months ago, # |   +6 Yay! Perfect Timing for me. Today is IND vs. PAK World T20 from 7:30 pm (UTC+5.5).
 » 11 months ago, # |   -25 Is it rated?
•  » » 11 months ago, # ^ |   +10 What part of the sentence, "The round will be rated for all the participants with rating strictly less than 2100," do you not get?
•  » » » 11 months ago, # ^ |   0 he's trolling obviously or testing how many downvotes he will get
•  » » » 11 months ago, # ^ |   0 What part of sarcasm you don't understand? Oh, all of it.
•  » » » » 11 months ago, # ^ |   +6 Eh, I thought he was being deadass lol
 » 11 months ago, # |   +1 Todays Contest is Awesome..... I am only able to solve one question but B and C questions solution i know but there time complexity is way too much........ Today gonna learn something new...... Very nice contest Again!!!
 » 11 months ago, # | ← Rev. 3 →   +1 Problem 1: Pretest passed in 7 mins. Problem 2: Pretest passed in 3 mins. Problem 3: Pretest passed in 12 mins. Problem 4: WA on pretest 2 :(
•  » » 11 months ago, # ^ |   +5 there should be no zeroes in array B
•  » » » 11 months ago, # ^ |   0 Dang!!! Sum of 2 elements in the input array can be equal to zero ....
 » 11 months ago, # |   +15 Guys does Codeforces really use Adobe Flash Player? I feel like it is a prank, I can't do hacks. Open
 » 11 months ago, # | ← Rev. 2 →   +12 WTF is happening with me I am solving A in more than 1 hr and B,C in 30 mins is it just me or nowadays problem A is becoming trickier. I suck
•  » » 11 months ago, # ^ |   +1 Not you, todays problem A was tricky af. Not hard, just tricky. Seemed trivial at first but then...
 » 11 months ago, # |   0 I can't solve anything. I've been staring at the problems for 2 hours and 20 minutes already. This is a good opportunity to upsolve. Nice contest!
•  » » 11 months ago, # ^ |   0 i couldn't solve anything too,i was expecting to solve at least the first problem but div 2 is just too hard
 » 11 months ago, # |   +5 Thanks for such a good contest!
 » 11 months ago, # |   0 WHY THE CONSTRAIN sum <= 1e9 is in D there are solutions that cut because of this what the hell is point? you could make it 2e9
•  » » 11 months ago, # ^ |   0 I feel that was the whole point of that qn.. There was a way("we had to think that") to get it within the limits. I couldn't pass my code btw..
•  » » » 11 months ago, # ^ |   0 I don't think we should think to reach the idea of the problemsetter for specific problemespecially constructive problems like this has many many solutionsthis is hole point of creativity
•  » » 11 months ago, # ^ |   +16 That made it interesting for odd sized array.
 » 11 months ago, # |   +2 How to solve E? I tried a O(n^1.5) dp approach but didn't work.
•  » » 11 months ago, # ^ |   +13 Most probably you must have taken the limit as sqrt(n) but it should be sqrt(2*n)
•  » » » 11 months ago, # ^ |   0 No, it took sort(2*n). Got runtime error in pretest 8
•  » » » » 11 months ago, # ^ |   0 I also got RE in pretest 8. After declaring the array globally, my code passed.
•  » » » » » 11 months ago, # ^ |   0 Yeah, mine passes when I use vector instead of array. Any idea why?
•  » » 11 months ago, # ^ | ← Rev. 3 →   0 O(n*sqrt(n)) is well enough.try constant optimization.
•  » » 11 months ago, # ^ |   0 dp[k][n], and kmax = 450
 » 11 months ago, # |   +3 please tell me if i have submitted two pretest passed solutions for the same problem, which one will be judged for main tests??? please some one tell meee pleaseeeee
 » 11 months ago, # |   +6 Are pretests for F1 really weak?
•  » » 11 months ago, # ^ |   0 Unfortunately, it's true. That problem didn't have a multitest testing so it didn't work out to cut off as much solutions as possible using a little number of pretests. A little number of tests was needed to avoid queuing.
•  » » 11 months ago, # ^ |   0 unfortunately yes :(
 » 11 months ago, # |   0 Someone solved the problem F2 with a Gaussian basis?
•  » » 11 months ago, # ^ |   0 I don't think that it is possible to solve this problem with gaussian basis. The expected solution uses the fact that you have at most 5000 different values for $a_i$. You just need to solve $dp[k][xor] =$ minimum position you can reach value xor, using only $a_i <= k$
 » 11 months ago, # |   +1 Can someone give a hint for A? I was trying it case by case but I felt like there were way too many cases with my method. In the end, I was really short on time and couldn't even enumerate all the cases.
•  » » 11 months ago, # ^ |   0 for Problem A : the answer is either 0 or 1 proof : let A , B , C be durations ( 1 min each ) of the 3 musics A + 2B + 3C is the total duration now consider 2 groups : ( B + C ) and ( B + C ) so we remain with A + C duration now if A + C is odd => 1 will be extra or else A + C will be equally distributed
•  » » » 11 months ago, # ^ |   0 How do you split 2B + 3C into 2 groups of B+C? A 3 minute song cant be split and neither can a 2 minute one.And for A=1, B=0, C=1 the answer will be 2. Is my understanding of the problem flawed ot something?
•  » » » » 11 months ago, # ^ |   +3 B can't be zeroa,b,c >= 1
•  » » » » » 11 months ago, # ^ |   0 Oh I missed that. I still don't understand the explanation above though :(
•  » » » » 11 months ago, # ^ |   0 Actually by groups I meant in terms of Mathematical expression (B + C) + ( B + C ) + ( A + C ) . since any duration between 0 to A + 2*B + 3*C is feasible such a split is also feasible . ( I am not splitting the physical music discs )
•  » » 11 months ago, # ^ | ← Rev. 2 →   +3 First of all, it's obvious that answer can't be more than 3. Answer can't be 3, because in that case we can move from the bigger subset 1 or 2 to smaller one (or, if bigger subset consists only from 3's, that means all 1's in 2's in smaller, and we can exchange 3 with 2 or 1 and make answer smaller). Answer can't be 2 using the same logic. Obviously, if bigger subset has at least one 1, we can make the answer 0 easily. If answer is 2, then all 1's in smaller subset. Bigger subset consists only of 3's? Exchange 3's from that subset with 2 and 1 from smaller, afterwards move 1 to smaller. Answer is zero. Bigger subset consists only of 2's? Exchange 2 from bigger with 1 in smaller. Answer is zero. 3's and 2's? Exchange 2 with 1 from smaller. 4.Answer is obviously can be 1, because a + 2b + 3c can be odd. Any natural (and > 0 depending on definiton) numbers a, b, c, such that a + 2b + 3c is even can be divided to equal groups. Proof: answer can't be bigger than 1, proved that in 1. — 3. If cannot be divided, then answer is 1, and that means that sum of bigger subset and smaller subset is odd, which contradicts with what we prove. So the answer is (a + 2b + 3c) % 2.
•  » » 11 months ago, # ^ |   0 You can check the absolute difference ((a*1+b*2)-(c*3)) , If the answer was even print 0 and if it was odd print 1 .
 » 11 months ago, # |   0 It was a nice contest , Thank you .
 » 11 months ago, # |   0 D was nothing but x(+y) + y(-x) = 0 and x(-y) + y(x+z) + z(-y) = 0. One can easily use 1st relation to solve for even arrays but tricky part comes for odd arrays where u need to find x and z such that there sum is not 0.
•  » » 11 months ago, # ^ |   0 +1 i didn't generalize the solution on both conditions, any hint ??
•  » » 11 months ago, # ^ | ← Rev. 2 →   0 the problem guarantees $a_i \ne 0$ for all $i$, so at least one of $a_1+a_2$, $a_1+a_3$, $a_2+a_3$ is not zero. Just find it out and solve $a_4$ to $a_n$.
 » 11 months ago, # |   +10 How to solve A quickly?
•  » » 11 months ago, # ^ |   +55 Just guess the solution.
 » 11 months ago, # | ← Rev. 2 →   0 EDIT: Updated URL: https://ideone.com/y10o7MCan someone check if this will work for D https://ideone.com/y10o7M
 » 11 months ago, # |   0 Great problems!
 » 11 months ago, # | ← Rev. 2 →   0 I don't understand the answer for A from editorial:cout << (a + c) % 2 << '\n';If a=0, b=1, c=0, shouldn't the answer be 2 minutes? (not zero as the editorial suggest)
•  » » 11 months ago, # ^ | ← Rev. 2 →   +1 a,b,c (1≤a,b,c≤10^9) — I didn't see this limitation myself at the beginning and went to solve C.
•  » » » 11 months ago, # ^ |   0 ah, thanks!
•  » » 11 months ago, # ^ |   +1 a,b,c >= 1
•  » » 11 months ago, # ^ |   +1 a and c cannot be 0 from the constraints.
•  » » » 11 months ago, # ^ |   -13 This problem would be much more interesting if 0 <= a, b, c. Writing clean and not bugged solution in this case is a skill. Disrespect to authors or coordinators.
•  » » » » 11 months ago, # ^ |   +4 The problem is an A problem for a reason.
•  » » » » 11 months ago, # ^ |   +4 The solution was already a guess, adding more corner cases is dumb, specially on the first problem.
•  » » » » » 11 months ago, # ^ | ← Rev. 2 →   -36 It can be solved without any corner cases even if 0 <= a, b, c, you just can't see it SpoilerWe may have problems only if a, b and c are very small. So if a, b, or c are too big, subtract 2 from them until they become, say, 6 or 7.Now, then a, b, c <= 7, you can bruteforce with for-for-for. No ifs, no bugs.Seeing such solutions is a skill for beginners, they should learn it, and authors should encourage it instead of giving stupid 1 <= a, b, c.
•  » » » » » » 11 months ago, # ^ |   0 Sure, say your solution then. Me and probably many others would just add ifs and get ac faster then trying to think of a way to implement it without corner cases
 » 11 months ago, # |   0 The question for the experts is, is there really not a single test in A that would reject a solution with an overflow of the int variable? https://codeforces.com/contest/1582/submission/132905404I spent half an hour looking for a hack, for this solution, for me it became a kind of challenge...
 » 11 months ago, # | ← Rev. 2 →   +3 Did anyone else solve F2 with bitset in $O(\dfrac{a_i^3+na_i}{w})$? I think that I will FST(
•  » » 11 months ago, # ^ | ← Rev. 4 →   0 I solved by assuming that only the first and last occurrence of a number will matter (Not 100% sure that it is correct)Upd: Not Correct
•  » » 11 months ago, # ^ | ← Rev. 2 →   +4 $O(N + A^2 logN)$ passed in 400 ms, god bless g++!
•  » » » 11 months ago, # ^ |   0 If I am not wrong, your solution is $O(N+A^2log(\frac{N}{A}))$.
 » 11 months ago, # | ← Rev. 2 →   0 I needed more 5 minutes to fix my bug for D if I just didn't be like a moron in A and waste 20 min on it pfff I hope my solution is WA after fixing that bug that would actually make me feel less worst lolEdit: Accepted but wasn't gonna make it in time without my stupidity in A anyway that actually feels even more less worst my idea is correct and I wasn't gonna make on time better than the solution is completely wrong or i just needed more 5 min to get Accepted
 » 11 months ago, # | ← Rev. 2 →   -18 Problem — B Left shift#include //#include //using namespace __gnu_pbds; using namespace std; #define fi first #define se second #define ll long long #define pb push_back #define mp make_pair #define mt make_tuple #define pii pair #define vi vector #define mii map #define all(v) v.begin(),v.end() #define ubound(v,val) std::upper_bound(all(v), val) #define pqb priority_queue #define mnheap priority_queue > //mnheap use less for mxheap // push(),top(),pop() // #define setbits(x) __builtin_popcountll(x) #define mod 1000000007 #define inf 1e18 #define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) int main() { FastIO; // #ifndef ONLINE_JUDGE // freopen("inputf.in", "r", stdin); // freopen("outputf.out", "w", stdout); // #endif int t; cin>>t; while(t--) { int n; cin>>n; vector arr(n); ll zc =0; ll oc=0; for(int i=0;i>arr[i]; // sum+=arr[i]; if(arr[i]==0) zc++; if(arr[i]==1) oc++; } ll ans = (1L< //#include //using namespace __gnu_pbds; using namespace std; #define fi first #define se second #define ll long long #define pb push_back #define mp make_pair #define mt make_tuple #define pii pair #define vi vector #define mii map #define all(v) v.begin(),v.end() #define ubound(v,val) std::upper_bound(all(v), val) #define pqb priority_queue #define mnheap priority_queue > //mnheap use less for mxheap // push(),top(),pop() // #define setbits(x) __builtin_popcountll(x) #define mod 1000000007 #define inf 1e18 #define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) ll power(ll a, ll b) //a is base, b is exponent { if(b==0) return 1; if(b==1) return a; if(b%2 == 1) return (power(a,b-1)*a)%mod; ll q = power(a,b/2); return (q*q)%mod; } int main() { FastIO; // #ifndef ONLINE_JUDGE // freopen("inputf.in", "r", stdin); // freopen("outputf.out", "w", stdout); // #endif int t; cin>>t; while(t--) { int n; cin>>n; vector arr(n); ll zc =0; ll oc=0; for(int i=0;i>arr[i]; // sum+=arr[i]; if(arr[i]==0) zc++; if(arr[i]==1) oc++; } ll ans = power(2,zc)*1LL; cout< //#include //using namespace __gnu_pbds; using namespace std; #define fi first #define se second #define ll long long #define pb push_back #define mp make_pair #define mt make_tuple #define pii pair #define vi vector #define mii map #define all(v) v.begin(),v.end() #define ubound(v,val) std::upper_bound(all(v), val) #define pqb priority_queue #define mnheap priority_queue > //mnheap use less for mxheap // push(),top(),pop() // #define setbits(x) __builtin_popcountll(x) #define mod 1000000007 #define inf 1e18 #define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) ll power(ll a, ll b) //a is base, b is exponent { if(b==0) return 1; if(b==1) return a; if(b%2 == 1) return (power(a,b-1)*a)%mod; ll q = power(a,b/2); return (q*q)%mod; } int main() { FastIO; // #ifndef ONLINE_JUDGE // freopen("inputf.in", "r", stdin); // freopen("outputf.out", "w", stdout); // #endif int t; cin>>t; while(t--) { int n; cin>>n; vector arr(n); ll zc =0; ll oc=0; for(int i=0;i>arr[i]; // sum+=arr[i]; if(arr[i]==0) zc++; if(arr[i]==1) oc++; } ll ans = pow(2,zc)*1LL; cout<
•  » » 11 months ago, # ^ | ← Rev. 2 →   0 (1L< 30 you will get 0 in the answer. Change it to ll ans = (1LL<
 » 11 months ago, # | ← Rev. 3 →   -59 Nice problems! If problem A explanation was correct this contest was one of the great contest in cf
 » 11 months ago, # |   0 Problem D has shaved years off my lifespan.
 » 11 months ago, # |   0 FSTforces
 » 11 months ago, # |   +3 2 minutes silence for those who got FST on F1.
 » 11 months ago, # | ← Rev. 2 →   0 I don't understand one thingWhy does xor of empty subsequence equal to zero?Another interesting thing is that there was no such pretest in the tests.
•  » » 11 months ago, # ^ |   0 0 only as empty sequence was in first sample
•  » » » 11 months ago, # ^ | ← Rev. 2 →   0 But there was a subsequence with xor 0There is no pretest with only empty sequence xor 0
•  » » » » 11 months ago, # ^ |   0 wasn't, only three correct subsequences: {2}, {4} and {2,4}
•  » » » » » 11 months ago, # ^ | ← Rev. 2 →   0 I think he means that if you consider all non-decreasing subsequences (not just increasing), and you don't consider xor 0 as always possible, you will fail only with a test where there is no non-decreasing subsequence with xor 0.
 » 11 months ago, # |   +3 To get F1 accepted it was more important to keep in mind that xor 0 is always possible than the fact that increasing subsequence is different from non-decreasing.
 » 11 months ago, # |   0 why the grade of F1 so high????
 » 11 months ago, # | ← Rev. 2 →   0 .
•  » » 11 months ago, # ^ |   +1 132901810so you submitted your first code in c++ just by studing that link?????haha. another shameless indian lying after being caught.just like the other indians
 » 11 months ago, # | ← Rev. 2 →   +21 After the round 750, I received the message:" Your solution 132867227 for the problem 1582C significantly coincides with solutions vpike/132864849, RefreshedCoder/132867227 "The two solutions can be found here:It's a simple greedy approach and I wrote every character in my IDE. It's a wrong judgement and may I ask the admin of Codeforces to examine the two submissions manually?I personally don't know vpike and it's just a coincidence that our solutions are similar in this simple problem. I solved in total 6 problems in the round and there's no motivation for me to cheat in problem C.Please, could anybody help me to get my rating back?UPD: Ping MikeMirzayanov here
•  » » 11 months ago, # ^ |   +6 I'm sure too, it's a rare coincidence. Why two submissions for simple problem with small amount of code cannot be close to each other? Please examine submissions manually.
•  » » 11 months ago, # ^ |   +1 There is no any feedback on this issue for a long time. Dear AlFlen and 74TrAkToR, could you comment it?
•  » » » 11 months ago, # ^ |   0 It's not our decision, sorry
 » 11 months ago, # | ← Rev. 2 →   0 Can somebody hack my D? I think my submission is wrong, because I dont check this condition the sum of their absolute values cannot exceed 10^9. 132943758 upd: it is correct
 » 11 months ago, # |   -7 Your solution 132914687 for the problem 1582C significantly coincides with solutions cuckmasteramogus/132914655, pranil_19/132914687, nipple/132915851.I have used ideone because I don't have idea that someone can see my solution there that's why my solution has been copied by somebody. For the first time I got to know that using ideone code could be copied through your notification. I never uses these kinds of practices in contests. How can you send such notifications without even checking those two ID's that copied my code using ideone. and you should check the profile picture of id nipple which is so disgusting. You can check my previous submission I have used before this contest that contain same format of code. I request you to look into this matter , and bring my score and rating back Please.... 74TrAkToR AlFlen [user:Mike Mirzayanov]
 » 11 months ago, # |   0 Is F2 solvable with java?
 » 11 months ago, # |   0 Thanks for fast Editorial!
 » 11 months ago, # |   0 can anyone help me to find mistake in my code ? C[submission:133037244]
 » 7 months ago, # |   0 Can anyone tell me why me solution https://codeforces.com/contest/1582/submission/149071151 gives TLE on F2 If I use while loop which I have commented instead of for loop it gives AC.