Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
Hey Guys I just tried the Parade solution , hope you like it , comment if you have any better code .
#include
int main(){
int n,i,a[100000][2],k=0;long int s=0,x,l=0,r=0;
scanf(“%d”,&n);
for(i=0;i
{ k=i+1;s=x;
}
}
printf(“%d”,k);
return 0;
}
📦 Looking for Codeforces Round 378 Div Problem Parade? Check the best deals on Amazon.
🛒 Shop Codeforces Round 378 Div Problem Parade on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
, problem: (B) Parade Solution In C. Hey Guys I just tried the Parade solution , hope you like it , comment if you have any){kind=link}