Problem Code : CV , I'm not able to find why run time error is happenning.Please somebody help me regarding this

Bas @marksman kripa h sandeep_mageshwari ji ki​:sweat_smile::sweat_smile::sweat_smile:

1 Like

@pandeyy_ji Kya name hi change kr liye Kya …pandey ji😂

Na bhau…wo wala account login ni hota to nya bnaya ta. Sirf forum open hota h us account se…phn nd pc me alg alg account se forum h isliye dono id se rply kr ra mai

ho gya bhai question zra si glti kr rkkhi ti…logic shi ta bt zra si glti ti…tnx to all…:blush:

Dekha kha tha na… Keep doing great things.:blush:

1 Like

How many questions u did???

bro only 1…but i’ll do 1 more very soon

Ya try bro they are easy though , after contest I will also share my editorial in easy language (may be hindi and video also(which I think)) , but try, I did 5 questions completely stuck in 6th one.:upside_down_face:

3 Likes

Lol kinda same here…even i wanna share my editorial for first five questions.
This is my first time solving so many questions in a long challenge!

Congo @pandey246 . Keep trying aur ho jayenge…

1 Like

any1 here? can we use long long to represent 10^19 or more?
can we print our result in form of
cout<<a<<b;
if a=10^18 and b=9;

i know it’s not feasible but wanna know from you guys.

@pandey246 unsigned long long int is biggest integer type in C++.it can hold numbers from 0 to 18 446 744 073 709 551 615.so you could hold 10^19 using this.

Problem Code: SUMAGCD
can any1 tell gcd(7)?
we take gcd of 2 or more no. then how can we do for it?

Google it , don’t ask here. :slight_smile:

i’m not able to find bro

search again bro…

1 Like

greatest number that divded them/it is gcd.

ANY EXAMPLES OF PROXYC TEST CASES

i am getting WA always