### Neumann's blog

By Neumann, 11 months ago, ,

Greetings Codeforces Community! We bring you the July Long Challenge 2019. Brace yourself for 10 intense days of non-stop coding challenge starting on 5th July.

All programmers across the globe are welcome to participate. Problems are available in English, Hindi, Bengali, Russian, Mandarin and Vietnamese.

If you have some original and interesting problem ideas, and want them to be used in CodeChef's contests, you can share them with our admins here: www.codechef.com/problemsetting/new-ideas

Joining me on the problem setting panel are:

Hope you enjoy the problems!

• +72

 » 11 months ago, # |   +1 As you can see, two problem setters and two testers are from Iran!
 » 11 months ago, # |   0 nice to see all the problems have been added in the starting of the contest.
 » 11 months ago, # | ← Rev. 2 →   -8 Nice setters :-)
 » 11 months ago, # | ← Rev. 2 →   +17 Predictions for this contest — Div 1 and Div 2.You can use ccrate for future predictions. Blog for the same.Does anyone know where we can host Node JS projects for free? Currently, I'm using OpenShift. It's free but they change the project URL every two months.
 » 11 months ago, # |   0 solved A, C, D in but could not solve B :(
•  » » 11 months ago, # ^ |   +45 I solved A, Q and R, then had a hard time with Õ but finally managed to do it! Never could solve & though. :/
 » 11 months ago, # |   +13 Feels like the hardest question in div2 is GUESSPRM, how to prove the solution?
•  » » 11 months ago, # ^ |   0 Which solution? There are many of them.
•  » » » 11 months ago, # ^ |   0 Any solution with a proof that it works is fine :)
•  » » » » 11 months ago, # ^ |   0 There is proved solution in editorial: https://discuss.codechef.com/t/guessprm-editorial/30111
 » 11 months ago, # |   0 Can anyone help me to find out why the first one got the verdict Accepted but the second one got TLE? Acceptedll a[MAX]; ll dp[MAX][MAX]; const ll INF = 1e15; int main(){ int t; scanf("%d",&t); for(int cs=1;cs<=t;cs++){ int n,z; scanf("%d %d",&n,&z); for(int i=1;i<=n;i++) scanf("%lld",&a[i]); sort(a+1,a+n+1); reverse(a+1,a+n+1); dp[0][0] = 0; for(int pos=1; pos<=n; pos++) dp[0][pos] = INF; for(int used=1; used<=z; used++){ dp[used][0] = INF; for(int pos=1; pos<=n; pos++){ ll Curr = INF; for(int last=0; last
 » 11 months ago, # |   +21 For some reason CF hangs when I want to update the post, so I'll write it here.Congrats to the winners!Div 1 ACRush .I. (note that his handle resembles CF logo) RomaWhite FarFromRed Oleg Div 2
•  » » 11 months ago, # ^ |   +24 Hey, first time that I was mentioned for compcoding results anywhere, thanks ;) And thanks for the contest, I liked it.
•  » » 11 months ago, # ^ |   +83 .I. (note that his handle resembles CF logo) Yeah. That's what it resembles.
 » 10 months ago, # |   0 Can anyone tell the approach for "Maximum and Minimum"?
•  » » 10 months ago, # ^ |   0