Codeforces Round #359 Editorial If you notice typos or errors, please send a private message. <br> <br> [Div2A Free Ice Cream](http://codeforces.me/contest/686/problem/A) <br> Author: [user:cdkrot,2016-06-24] <br> Developer: [user:ch_egor,2016-06-23] <br> You just needed to implement the actions described in statement. <br> If you solution failed, then you probably forgot to use 64-bit integers or made some small mistake. <br> Correct solution: <br> <br> <spoiler summary="C++ code"> ~~~~~ #include <iostream> #include <cstdio> #include <cstdlib> #include <string> #include <cstring> #include <vector> #include <stack> #include <queue> #include <deque> #include <set> #include <map> #include <cassert> #include <algorithm> #include <iomanip> #include <ctime> #include <cmath> #include <bitset> #pragma comment(linker, "/STACK:256000000") using namespace std; typedef long long int int64; typedef long double double80; const int INF = (1 << 29) + 5; const int64 LLINF = (1ll <<...

Full text and comments »

Weekly Training Farm 22 — Editorial Weekly Training Farm 22 is over. Congratulations to the winners : 1. [user:W4yneb0t,2017-01-20] (perfect score in < 1 hour!) 2. [user:aaaaajack,2017-01-20] (perfect score) 3. [user:eddy1021,2017-01-20] Here is the editorial : ### Problem A This problem can be solved by greedy. We list down the positive integers one by one. We keep a pointer that initially points to the first letter of $s$. Whenever the pointed character in the string $s$ matches the corresponding digit of the integer, we move the pointer one step to the right and continue. Repeat this process until the pointer reaches the end. However, we still need to know whether the answer can be large. The key is to note that the answer will never exceed $10^{6}$, because after writing down $10$ consecutive numbers, at least one of them has last digit equals to the current digit, so the pointer will move to the right at least once when we write down $10$ consecutive numbers. Thus, in the worse case, we'll onl...

Full text and comments »

HSE studies Hello team end DONT WORRY))))))))xDDD thx for helping in [user:0icq,2024-01-19] about a can going studi in HSE VERY BIG TY :D (recspect) and super thaks to [user:maxan,2024-01-19] becouse thats very nice pupil in mipt technologies university (call). Maxan is very respectful nice mipt student LOL For starting i can want to say that it was so hardy to me to being student HSE (cool). It was so compressive for my psycho heal because i was thought a big and my brain is so dead and i wanted to going go for a walk with my friends [user:islam_ahmed,2024-01-19] (nice to meet you) and [user:ivan_09090,2024-01-19] (BIG bRO) but I WAS SO STREIGHT AND NEED TO shoes. ok LETS GO to review HSE letsplay xDD its my friend his brain so smart [user:0icq,2024-01-19]  thats a his social network page in HSE internet https://www.hse.ru/staff/bigshishiga like and subscribe him plese is so close well then about HSE is so comfortable place in the ...

Full text and comments »