Codeforces Round 865 : Problem- C: Ian and Array Sorting || comp exp + code

#python #india #coding
#python #india #coding
#python #india #hacking
#python #india #hacking
#python #india #hacking
#python #india #hacking
#python #india #hacking
#python #india
#python #india
#python #india #hacking
#python #coders #hacking
#python #coders #hacking
#python #coders #hacking
#coders #programmingmemes #python
#programming #hacking #programmers
##codeforcesround863
#IanandArraySorting
#IanandArraySorting
#div3codeforces
#CodeforcesRound863
#codeforcesround863
#codeforceslatestsolution
#codeforceslatestsolution
#programmer
#codeforcesdiv2
#programmers
#codeforces #programming #programmer
#programmers #programming #python
#programming #python #coding
#india #programmer
#india
#programming
#codeforcessolutions
#div3
#div2
#latestcontestsolutions
#programming #programmer #programmers #developer #coder #programmingmemes #coders #coding #frontenddeveloper #backenddeveloper #html #softwaredeveloper #hacking #python

[@EngineerPrabhatSingh]

Code of this problem:- pls like and subscribe if like the videos. it will motivate me to make more videos.. #include using namespace std; #define int long long int signed main(){ int t;cin>>t; while ( t--) { int n;cin>>n;vectorv(n+1); for ( int i = 0; i >v[i]; } if(n%2){ cout

[@adityatolgekar8357]

Thanks for the solution

[@CristianoRonaldo-ku1uz]

Uff that was great explanation

[@mokshmangal9308]

very nice and short code, and also easy to understand.

[@EngineerPrabhatSingh]

Thanks brother...

[@SreenivasanM-z3l]

Sir very well explained but how did you come with different logic for even and odd value of n. How did you arrive at the conclusion that we have to make last value of array a infinite .

[@EngineerPrabhatSingh]

Brother If you carefully observe both logic is same just small diff for n odd we observe It's always possible to get ans. I think last value to make infinite because there is no limits on number. And I think to be sorted let's make last one infinite. This way I approach the problem.. Ans is always somewhere in the question just we have to observe and find it.

[@pranavshrivastav7233]

In even case, how can you be sure ki koi aur method exist nahi karta jis se array sorted ho jaye . I mean esa bhi to ho sakta hai ki aapke logic ke alawa koi aur logic ho jis se array sorted ho jaye .

[@vaibhavsingh0404]

Very well explained prabhat

[@EngineerPrabhatSingh]

Thank you🙏

[@astroflexx82]

Nice Solution!

[@EngineerPrabhatSingh]

Thanks brother..

[@rishukumarsingh3926]

How to develop thought process like this?

[@astroflexx82]

Practice more questions. If you are not able to solve a question, see the editorial and understand their thought process.

[@EngineerPrabhatSingh]

Practice smartly. Give time to a question. Try to prove your solution..

[@invinishku1542]

bro odd length array mien agar ye given hai {1,5,2,4,3} to aapke logic ke acc agar infinity banate aaenge back se....then first vaala element to -3 ho jaaega.....and agar even ke logic se chalenge...then last vaala -2 ho jaaega....to odd mien hrr kaise mien kaise possible hai....

[@EngineerPrabhatSingh]

-3 hone se kya problem h. Even and odd ka logic alag alag h

[@invinishku1542]

@@EngineerPrabhatSingh i read problem statement again ..i got it...negative values bhi allowed thi...negative infinity to infinity kuch bhi possible tha...we just need to make it sorted

[@EngineerPrabhatSingh]

👍

[@astroflexx82]

@@invinishku1542 Yes negative values are allowed

[@sadiyairin339]

Very impressive! Bro please make a tutorial for codeforces problem 1811B. I am not getting the logic behind that problem.

[@mudrad1930]

"SOMEONE PLEASE HELP ME .. GIVING WRONG ANSWER FOR PRETEST 3" #include using namespace std; typedef long long ll; typedef pair pll; bool isInc(vector &v){ int n = v.size(); for(int i=1 ; in; vector v(n); for(int i=0 ; i>v[i]; if(isInc(v)) return true; if(n==2 && isInc(v)==false) return false; for(int i=n-1 ; i>=2 ; i--){ ll diff = v[i-1]-v[i]; v[i-1]-=diff; v[i-2]-=diff; } if(n%2==1) return true; else if(v[0]>v[1]) return false; else return true; } int main() { ll t; cin >> t; while (t--) { bool ans = solve(); if(ans) cout

[@mudrad1930]

Done it was just due to integer overflow 😞😞