0% found this document useful (0 votes)
6 views12 pages

Logic Building in C++

Hijjjjk khoob khoob hugg g khojo hijjijk

Uploaded by

nishurana672006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
6 views12 pages

Logic Building in C++

Hijjjjk khoob khoob hugg g khojo hijjijk

Uploaded by

nishurana672006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 12
Premium Coding Courses by Programiz Programiz net @ Ca LT) ornrtid Cea 2 Using namespace std; aye te ut a) UC) a Ee Ula Um Oke Enter the value of b: 50 a int b; Pee scale Cum acst tie © cin>>b; 10 Slated 12 cin>>c; aC » i else if (b>-a && b>-c){ 19 a mG Greatest ofthreeNo. | 22 cout<<"c is the largest”: rx) + | rea (A | AGNI 2+ By Naveen Rana Se Sep 16, 2024, 09:29 Cosette Premium Coding ww oe Lee Ce Sager ieeale4 Programiz =) one Paro Dec ste oer Gian PSG cH Enter the value of letter:r Eyre SUnole pr GrMeoncus Cri sc Concent SUcrap Beer eis Cueac ea eiesGacd ptretiecis ecsceos re cout<<"It is a vowel "; + Stories eo aI Gane cout<<"It is a vowel "; L eGo en sce am) e cc} } 5 £ ic} 5 ic} ones as SE nes tfeC eee Gaceoa < Seaetiabiay Vowel or Consonant ee tcest oom ie Cac) ce fetiecs (sO aed by rose WMA, | AGNiae8yNayeermRam”: a ery Necro) ——s Cesin Premium Coding Sey eyelets Coca) ne Cd Deceus tee Cs Besta sce Excekah Cae EyeUsrsunexe Donec Psu cos Gotses an ie) Uae == Code Execution Successful === Gtsoy Poets curs Cousesxe rcrseeyd press By Btceeoye erect Seas CIT Ieuan + ESB CeaDye Pe eer Wa eek aa 3 Brae enor eee IE Mousey "i Prime or composite TAGNI 2 = By Naveen Rana Sep 16, 2024, 10:22 a CUP ead oS {esd ects rs ~ BUCA) a RR Ce le aed Enter the elenents of the array: 3 [oes eee . nt oye ea] ee ne ee | mg ee oS See J Re Maer ad 7 rote 8 rs Peer p ee Dm CSUR Li " for Gint i= 0; d< nz it) { 2 cin >> arrlil: eS Pe ton Poser sO mes Creer eto? 7 if (arrLi] < smallest) € cr pte aereeet es 19 > Fr) pCa okt Py pes eeei ts 2 , yo} PC Cesc seo a 25 cout << “Largest elenent: “ << largest < endl; Ps Pay cra LAWA | AGNI 2 - By Naveen Rana Sea Smallest element: 3 Pecan Cay === Code Execution Successful === Smallest & Largest eiTan al AEN ca ‘ e eed Peed ins SES ESS Pee ott ests tig Pe 4> int main) { Seer seh ee ese se rag ee 8 Sees on Cee pect aoe eet e a ry ) é os e ar teases 3 ¥ 4 for Gint i = 0; i = 1; i--) { crea for (int j= 1; j Ld rey cout << endl; LAWA | AGNI 2 - By Naveen Rana p10 PLO PL 8 Pav wy \ 4 : erie COCAINE IE) s @® 8 cory wt ee as Cee eclg race) Output [ee BIZ ZF Ce ee eae cre Fa PRU 3> int factorial(int n) ¢ a Bue ols aes 5 for Gint d= 1; i <= ny ist) { 0 9 6 ‘ort rar] b + Uta CI Pea lod 146, 4 1 slit 10~ int binomialCoeff(int n, int r) { ; " eT R erect MR acer CIO STI (ili ce Cae == re a 13~ int main() { and Bt or cout << “Enter the number of rows for Pascal's Triangle: 16 cot had cto for (int i = 0; i | ke i ar S ey [3% fo mE euro eters Petece ess Peec iT SCC cus teu is re for Gnt i= 0;i rr ? 13} Peet tou ese emet a ie rr ees ee ea coir e a cout << arrfi] << ~ ed ? 18 See Tes 20- int maint) Pay plat Fad ee esc eu bey had Pee ry ee CEL cL for (int i = 0; i

You might also like