pashka's blog

By pashka, history, 8 months ago,

Hello Codeforces!

New lesson in English EDU section. This time I will talk about binary search.

Go to EDU →

Hope it will be helpful, enjoy!

• +710

 » 8 months ago, # |   +21 Finally !!
 » 8 months ago, # |   0 Could by any chance lessons be sorted in increasing order of difficulty? I am feeling like Binary Search should be covered before segment trees. Perhaps it could be easier for beginners to wrap their head around the problems that way.
•  » » 8 months ago, # ^ |   +109 I try to choose topics of different difficulty and from various sections, and I do it on purpose. One of the reasons is that EDU is in beta, and we want to try how it works for different topics. Another reason is to give something interesting for everybody. I don't consider EDU to be a regular online course, it's more like wikipedia. Eventually we will fill it with all interesting topics.
 » 8 months ago, # |   +9 Nice timing .. I was just analysing/practicing binary searchJust Awesome! keep it up sir
 » 8 months ago, # |   0 I think Binary search should have been the first
•  » » 8 months ago, # ^ |   +9 read pashka's reply to one of the comments above yours
 » 8 months ago, # |   +21 Must say, the T-shirt is cool!
 » 8 months ago, # |   +20 Quite confused about Suffix Array and Segment tree comes before binary search.
 » 8 months ago, # |   +6 Thanks for this wonderful course ! Will try to solve all the practice problems.
 » 8 months ago, # |   -6 Thanks pashka. We are really grateful to you. Your lecture is easy to understand.
 » 8 months ago, # |   -33 is this rated for division 3?
 » 8 months ago, # |   +10 Hi, Thanks for these awesome tutorials. I have a suggestion to please make some series on number theory and covering problems on concepts of combinatorics, probability and mathematical deductions.
 » 8 months ago, # |   +39 Stop it! If you reveal the secrets we won't be able to have any interactive problems anymore!
•  » » 8 months ago, # ^ |   +1 You sure don't enjoy contributing in open source projects, do you ?
•  » » » 8 months ago, # ^ |   +3 I enjoy. like and subscribe https://github.com/farmersrice
•  » » » » 8 months ago, # ^ |   0 Will sure do!
 » 8 months ago, # |   0 I More Than A University. Awesome Explained Sir!!
 » 8 months ago, # |   +2 Please do one on Graph algorithms!
 » 8 months ago, # |   +1 I can't hear audio for the section on Binary Search on Answer. I went on YouTube and I could hear audio but not for EDU section. :(
 » 8 months ago, # |   0 Binary search and linear search in Hindi. https://youtu.be/SU0jmz4NqCI
 » 8 months ago, # | ← Rev. 2 →   0 Really helpful, I think it will make me good in implementation of binary search Algo.
»
8 months ago, # |
-16

Hey,can anyone explain where the problem is in the problem(same kinda other problem).The problem looks like that..... https://codeforces.com/gym/102697/problem/014 and my code is............

include <bits/stdc++.h>

using namespace std; int main(){ int n,m; cin>>n>>m; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ string s; cin>>s; int count = 0; for(int i = 0;i < s.size();i++){ if (s[i] == 'x'){ count++; } } cout<<count<<"\n"; } } }

 » 8 months ago, # |   +1 Next should be dp.I am very poor at dp.Thanks pashka .
 » 7 months ago, # |   0 Why is nobody talking about his shirtIT's MOre than a university