### nskybytskyi's blog

By nskybytskyi, history, 16 months ago,

First of all, apologies for a rather long absence, I was a bit tired after Round #694 (Div. 1) in which I got a significant positive rating change. It is always nice to see your work paying off, but let us get back to business.

Codeforces has an excellent archive of training contests, named gyms!

But it is very well possible that you do not know about the one beginner-friendly gym that I want to cover today, and the reason is that it is only available in Russian :|

I translated the statements to English for you, and recorded a problem walkthrough, in case you ever get stuck.

We will cover more gyms from this old but gold series by Saint Petersburg State University in the future, so stay tuned!

• +70

 » 16 months ago, # |   +11 will you upload same for div 2 and div1 too ?
•  » » 16 months ago, # ^ | ← Rev. 2 →   +3 I'm not sure if this series contains Div. 1 problemsets, but I'll cover Div. 2 DP training problemset in the future.
 » 16 months ago, # |   +11 Thank you very much nskybytskyi
 » 16 months ago, # |   +11 This is great, thanks for doing this! PD: Would be nice if the english PDF can be attached along with the russian one,
•  » » 16 months ago, # ^ |   +6 I agree. I'll contact Mike when I have enough translated problemsets, but I don't want to waste too much of his time asking him to add each time separately.
•  » » » 16 months ago, # ^ |   +8 I added it for you.you could have done it yourself, just turn coach mode on in the gym
•  » » » » 16 months ago, # ^ |   0 Oh, thank you! Maybe I was not around when this feature arrived and did not realize that I have such permissions.
 » 16 months ago, # |   +8 nskybytskyi In problem J's input file format, I think you wanted to write $0 \leq n \leq 22$. BTW, Nice Effort :D
•  » » 16 months ago, # ^ |   0 Thanks, corrected
 » 16 months ago, # |   0 Hi ! Can you please tell me the meaning of this in problem H "if any two of its elements differ at least two times." At least two times with respect to what ?
•  » » 16 months ago, # ^ |   +3 I had some trouble understanding it at first but I wrote a solution to verify my understanding.Here is a better statement: "We call a set of positive integers peaceful, if for every pair of elements in the set, the larger number in the pair is at least twice the value of the smaller one. We call the sum of the elements of the set its strength. Find the number of peaceful sets of a given strength." 
•  » » » 16 months ago, # ^ |   0 Thanks :)
•  » » » 14 months ago, # ^ | ← Rev. 2 →   0 I know it is late but can you help me understand the sample test case? UPD: I got it and solved the problem but I think the problem statement should be "a set of non-negative integers..."
•  » » » » 4 months ago, # ^ |   0 No, why? If we allow 0, then the number of ways gets multiplied by an extra factor of 2. You can check from the samples that this is not the case, i.e. 2 = 2 only, 2+0 is not allowed. Perhaps your confusion arises from the (false) belief that a set needs to have at least two elements. This is not the case either, one-element sets are totally fine.
•  » » » 7 weeks ago, # ^ |   0 Thank u bro. I was confused
 » 16 months ago, # |   +1 Why does your solution to the problem K work ? You said in the video that it is a well known formula. Where can I learn about it ? Code#include using namespace std; int main() { int N, P; cin >> N >> P; int last = 0; for (int i = 1; i <= N; i++) { last = (last + P) % i; } cout << last + 1 << '\n'; return 0; } 
•  » » 16 months ago, # ^ |   0 Didn't know it's a standard problem when I was trying to solve this problem Toys.
•  » » » 16 months ago, # ^ |   0 So can you explain your approach. And what is the significance of % i in the above code ? I mean why does the above code even work.
•  » » » » 16 months ago, # ^ | ← Rev. 2 →   0 I don't know but after watching this video The Josephus Problem — NumberphileI can only solve it for $k <= 2$
•  » » » » » 16 months ago, # ^ |   0 Thanks, I got the logic and understood the code
•  » » » » » » 16 months ago, # ^ |   0 No, Thank you
 » 12 months ago, # |   0 Is anyone getting WA on test case 1? I've tried submitting to A, B, and D but all of them failed TC 1.
•  » » 12 months ago, # ^ |   0 Turns out you have to read and write from and to the specified input and output files. Fixed
 » 12 months ago, # | ← Rev. 4 →   0 Update:Solved.I'm getting wa on 1 in problem J.I tried to run my code on cf's Ide.It worked.Can Anyone help me to find out my error?
 » 9 months ago, # |   0 Problem-E [help] please help what I am doing wrong?? Spoiler#include using namespace std; void solve(){ int n;cin>>n; vector> vec; vector> dp(n,vector(n,-1000000)); for(int i=0;i v; for(int j=0;j<=i;j++){ int k; cin>>k; v.push_back(k); } vec.push_back(v); } dp[0][0] = vec[0][0]; int mx = -100000000; for(int i=1;i0) dp[i][j] = max(dp[i-1][j-1]+vec[i][j],dp[i][j]); if(j>T; while(T--){ solve(); if(T)cout << endl; } return 0; } 
•  » » 9 months ago, # ^ |   0 $n = 1$ fails. Other than that, it seems correct to me.
 » 4 months ago, # |   0 can you please open the permission to see others solution @nskybytskyi (hope this work),it would be very helpful :D
•  » » 4 months ago, # ^ |   +9 First, mentions work like [user:Beginner] : Beginner. Second, the decision not to show solutions is intentional, for educational purposes. Please take your time to solve the problems yourself, and refer to the video if necessary. If you really can't wrap your head around a problem after spending a good chunk of time on it, it may be better to just forget about it and come back after a longer period of time. Otherwise, you are unlikely to learn much from reading the code of others.
•  » » » 4 months ago, # ^ |   0 Sir The submission on J problem bad substrings is getting a Runtime Error on test 1 , I have cross-checked it with ur solution , getting same RE on test 1 ? Any fix..
•  » » » » 4 months ago, # ^ |   0 Problem J has been converted from file I/O to cin/cout, try resubmitting without freopen