From efbcb37ef6535ade5a2779b14549f91a07ee52f7 Mon Sep 17 00:00:00 2001 From: swaaz Date: Wed, 14 Aug 2019 23:42:12 +0530 Subject: [PATCH 1/3] 36 added --- C/program-36/program.c | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 C/program-36/program.c diff --git a/C/program-36/program.c b/C/program-36/program.c new file mode 100644 index 00000000..9d823305 --- /dev/null +++ b/C/program-36/program.c @@ -0,0 +1,29 @@ +/* + +You are given a sorted (either in the increasing or in the decreasing order) sequence of numbers, ending with a -1. You can assume that are at least two numbers before the ending -1. + +Let us call the sequence x0 x1 ... xn -1. + +You have to output the number of distinct elements in the sorted sequence. + +Kindly do not use arrays in the code. + +*/ + +#include +#include + +int main() +{ + int count=0,n=0,m; + while(n!=-1) + { + scanf("%d",&n); + if(m!=n) count++; + else continue; + m=n; + + } +printf("%d",count-1); + return 0; +} From bd7e20748c0e6c0d3b8ff88a528ae089a0f1f432 Mon Sep 17 00:00:00 2001 From: Swasthik shetty <42874695+swaaz@users.noreply.github.com> Date: Wed, 14 Aug 2019 23:50:51 +0530 Subject: [PATCH 2/3] Create program.c --- C/program-36/program.c | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 C/program-36/program.c diff --git a/C/program-36/program.c b/C/program-36/program.c new file mode 100644 index 00000000..9d823305 --- /dev/null +++ b/C/program-36/program.c @@ -0,0 +1,29 @@ +/* + +You are given a sorted (either in the increasing or in the decreasing order) sequence of numbers, ending with a -1. You can assume that are at least two numbers before the ending -1. + +Let us call the sequence x0 x1 ... xn -1. + +You have to output the number of distinct elements in the sorted sequence. + +Kindly do not use arrays in the code. + +*/ + +#include +#include + +int main() +{ + int count=0,n=0,m; + while(n!=-1) + { + scanf("%d",&n); + if(m!=n) count++; + else continue; + m=n; + + } +printf("%d",count-1); + return 0; +} From 0c490e0195a1663a2717cb8ab992f14d600d15c3 Mon Sep 17 00:00:00 2001 From: swaaz Date: Tue, 20 Aug 2019 01:27:45 +0530 Subject: [PATCH 3/3] 3 programs added --- C/README.md | 4 ++++ C/program-37/a.out | Bin 0 -> 16664 bytes C/program-37/program.c | 32 ++++++++++++++++++++++++++++++++ C/program-38/a.out | Bin 0 -> 16664 bytes C/program-38/program.c | 32 ++++++++++++++++++++++++++++++++ C/program-39/a.out | Bin 0 -> 16664 bytes C/program-39/program.c | 32 ++++++++++++++++++++++++++++++++ 7 files changed, 100 insertions(+) create mode 100755 C/program-37/a.out create mode 100644 C/program-37/program.c create mode 100755 C/program-38/a.out create mode 100644 C/program-38/program.c create mode 100755 C/program-39/a.out create mode 100644 C/program-39/program.c diff --git a/C/README.md b/C/README.md index d837d3c1..5281951b 100644 --- a/C/README.md +++ b/C/README.md @@ -37,4 +37,8 @@ | Program-33 | Program on Arithematic operation using pointers | | Program-34 | Program to determine whether the matrix is a triangular matrix. First, you will be given N, which is the size of the matrix. Then you will be given N rows of integers, where each row consists of N integers separated by spaces. If the input matrix is triangular, then print yes. Otherwise, print no. | | Program-35 | Program where you are given a sequence of non-negative integers terminated by -1. You have to output 1 if there are atleast 2 distinct elements in the sequence and 0 if the sequence consists of only 1 integer. Note that -1 is not part of the sequence. The sequence is not necessarily sorted. | +| Program-36 | Program to output the number of distinct elements in the sorted sequence | +| Program-37 | Program to find the fibonacci sequnce using recursion | +| Program-38 | Program to find the factorial of a number using recursion | +| Program-39 | Program to find the GCD of a number using recursion | diff --git a/C/program-37/a.out b/C/program-37/a.out new file mode 100755 index 0000000000000000000000000000000000000000..2dff926dac4cbe1b5095ab2200075c08c2831450 GIT binary patch literal 16664 zcmeHOYitzP6~4QR!30foKy&EwrkN6sTwfk|8v4T0&_n*na2EJ?q)= zx=2-iRO%dQ=G^n0$G!K=o!L7(_kJzZ(dKr!1d~TREl3)!HIaZ)T;8q?Z}#i!D47`XOR?Xih)+j@Q1~h+mjPQ)0bel< zzF``?Z5sR);65C7nggIxy{`fH*^MD@!?CggE|B*KrMW@qdLoyJY~QZuBH?sg4CIX* zu$&Q&9M&WKhxK?kkrV^jMB0c0j|_(Ocp@E6CXU1)QW&z$8hR?6NQ+$^?aeLvCjYil zX-lcJ$-hBn zl^R{#`VFXxYmVVuvm$^J$^E3id94UqbA)7?y577fpRIeJAHYjJiNt42dtM#kNRUyZ*5qry2Ux*)y{(RH~Hy8WK(1TIJ2a|g~* z2t=rjYNIpO)X8Rq?rl7S?mg{AJ7N!tMQto}M=M+a6aw@HY{d9c;G>~Ch&f1AkaAr~ z*$JgI(?)ylMYYWfWniOf{0S)DL=TYf;1}Bqe+=$#FWe3G1Pk|rxI%0C*9p<1jnxz1 z*Rht`RXzTb`)I-0`yONY#&>E~h>pTPI|_GO3m*iF3$JJ+=Um$MtNB|rww^l>d_H&} zcrd7=20KZzdg%L=wJSESresnxJwm_dFFqW9Ylj^$&{0 zyB4x-VHC!)Vz%&vvzp{FL)b+-VH%-U9;EM>|F}`W^c9p9(f(^ zQ3iNjA+ICkcLL^fITvanBNj1AI;IwX zenQE-UU9jS`Q3-srxNkHMS9O6V*N)CiWw=>7hDjpMfA-uWnP20LFpecVet#aX&oxj zQj>{AiZfGg;-p$f$ZHV~DFc4r~Z1=CC*+1k{ zLiqA2`+HCI4_{5C%=yM^nUw#e^#4#Y_d|vM*ch+-wg+rb*Sk&e{ffsGx7$BV=Jlw% zT3SBqtLy2_r;WU?(ZAWhp}rw6rHyM%`C*Z0UA3#UuHR}+>u`BpdO7Y9<9y*Q3J=!f zR#!-@2cwY3o5dXU&J;W@%kf!)uU9!F| zVxS`KE$zD~k6$DBelEum#Aij!vPaA>t>?FDJy;PwT+#l~(t74{`-P?FLOH%jR2r8a zvAA>}m)qm64OkJg?7>r^wj$0?tw|rc|7M5}i<5|1qUWDmc*SX3KC#F_;@52Wrxec5 zQ!|RW{@rD157kFR>+W6n*NC5w62yr%15myEd}e$I1(%qb&+h=Q)c)!E^?ey^;4VCM?bquqWzWA0T*Xycm^ywYWSptj_X;}T#%>_{_@4=U0rE4f zeup4RT8x5Em96YmiBBCTn}Ao^$IuGARxFt^ern0yJ@tP1{4{a;romsF2LCQ_s@FcA ze+ax%zkUjQzI%z_=PUR59O0BS<)nU2#P5Jp-h8Ul^1nnl{TxRv#^=%i3Klx4?1$Aj z=l@FI1y1(%`|EvWe@g93kpE>O-rp1+Q+SK2S0tj1;^pK_^XsumB-_^0VIoP4^ZEM>X>ejo1%^e|% zD)+}ka(UV4|G4{w_T2;mynjaSm5D{eMi@cL_u@<%ZBg5DCK2go-;`rlQ&e-84PuvX zxzVG!jNTtkM`=4w`(9W@6KOr4iy70P5M*6gg-ZwGQz#!M%Lv0T*Bt0Sav}8(-|Y??@QpWfJ@-`uj2vjo2X0 zG&Et9kr&P%>sN!ZKZ+nMnXcxjG(EVC8p5eW1Z|@0?ni!wA9q9wqrB2B_TOOio`72) z&vuih+n=e_(w57_SK*+!Is5axkNIjcvJgN27-~Sl>d*5-<~}x5-0t5B{4VC^TtCkv znREU8KEv+=9Ci;1^zOp`Jl|wazlTJ;Z;So;J!3y~G<9Wvo|iJ`_allyM7g%oK?wBj z!TvmdWzO$K+Ba_kS4}<%Hia>8DbX;`|<{P}x>46EEPf`umh0^G>TV%C_+06`McL*O_yB zISk9pzi0CwRuwRJabi^fuAk$*X7lIyKXZPsWqZ0-R{9YH>-{TyN~`z|B{H-7{}>9Z z{|@$3ypv`NPhDhx{(s}-dVruq@;rHBf9AKK zviggFvfW^Eu1BGz`-kNT6et$g&-1ie<?o+lII_ zY*Ya?l{osHc@hV=ho7G`zPatvQJseAhXJ(D7M$xfwKTV`?Em{l)8YXeDsK1xHwi7h A(EtDd literal 0 HcmV?d00001 diff --git a/C/program-37/program.c b/C/program-37/program.c new file mode 100644 index 00000000..4a63c87c --- /dev/null +++ b/C/program-37/program.c @@ -0,0 +1,32 @@ +/* +Program to find the fibonacci sequnce +*/ + +#include +#include + +int fib(int n) +{ +int f; + + if(n==0 || n==1) + { + + return ; + } + else + { + f=fib(n-2)+fib(n-1); + } + + +} + +int main() +{ + int n; + printf("Enter the number of terms\n"); + scanf("%d",&n); + printf("Fibonacci series=%d \n",fib(n)); + return 0; +} diff --git a/C/program-38/a.out b/C/program-38/a.out new file mode 100755 index 0000000000000000000000000000000000000000..0bb435f158fc28c2adbd32172bc810f8fc2a75c8 GIT binary patch literal 16664 zcmeHOeQaA-6~DHdHd|ZA>)JK6V}0uu)BIVwS$uV$fPN=&j_n3ipAN-&v)1@;j9sb8aDV@>`0IP=i3sh3W_S)sRBT zPJUXogE{NV^=ae`(&T5EpCtnjbGsikaN(9PW3nK-jJ_d`e{t*^Rqj zfB*Vl4v*~lLGuIDZfXO?BO4;J=kyc51sCb9etiig3nTt&;uk~2m!c6Uv?|ICz}8g3 zH!Xp0Ujpx30)Ga$hRaDS0aUB^IpCVp81f!mo2%dgd5=+=n}lJc^4VB(vyqQQGf6RA zF!R9jW;Axfhz*`FlF?LJ4ChiAGYLF45;c;kOf;Q3m4HZL$TnvhL(x=5?Cb7oYd3ZV z_moS!%cY&c`-IWeyWfZ>a*2Ud-c00r_qV6BnM7~2KTXjFhO!wI&9F?X8p{57ai6{N zKGPWB`|Sbhfz0D_eJZt@o}eQNTPtOs=vQ)KLkh#gE7FjO_<82%@Az#NepWrNjB5(7 zZMF1_vwUfmOt5~$%6$uxDndQr+bl4(kLbyCWYl1x*{tLLOl z{>i5yOWN`0uHvi5^x_qL?2Xw&z1vfwtNYnBV1bw2W zhgkERxem?uQyI;_r8Hf)X_Nv_DGvLs(*C~9#J0}s=jVNTaaKP+vsd?A&|jT5*CN21 zK`TIQX*wzEVgJ#Vt5Au;wmyBV^aJQ%&$HM zWgmQyXsvkq+Suu99&^KZQQX>j*kQK}i`ZD-%#kGkv^oF0Sud zD+8M~GY>%V@>DWdx9M?;BEp~TD*h&XxT|<0+!rq14C9V8jC@RpK7FE*_=DYBsVlWJ zQ#a9!^EZ9w#vQ+_+a$V+?{^n(bQIqXm)5?fk4<^>=F5e*Xe>Q^H2g^TX!uyzKu!dW zEIH;XMwzVI{ctnjX28vWn*lciZU)>8xEXLW;AX(hfSZB;Vg@|;_a~CUKWv&gn9wqX zp?(xaLtJ!5V`es&il((}Qj4;tr9q2px1v3sjlTP_92fMT&&=DU5-sRMv(_S02R{zE z@tsoXBKX7Lv*4G&16bCF{#q&>p<_{I5Lx>Jo&Ney)vf$|?Wowh;r@^Ax_2|dN z{w-gv(f!+>T(0{=V=MOgTOaj@!v5`H|CTnt*54Dh}}-bcu50_LkY2LY>qO^lLEwfXZyO6L8F8_vTAkDbqi=Al{3pEwg0agScJkX>CaK6N_P=xJC7fuTz|vaua9N zK0@A$cw8CqdXM)Ou2=Y+Y6#;YC3Cwcl^ySS7W||6`2zeLDj-sr%ij_+iD9iaYH;Nap>h``X(-p>65wFJ#Pu z77FePZf|TVNNLAbOa7opw6EGz-q&xprhT})FTE1?i5b4}HiZxSaciq2)`wBZ9-062~a7l6Rk2CA6yeYB5|D_m|IIRK~9p z{5)6U2%^~$tLziEmG|@8wLa_!AFXPCdwD-|rTyCSd!Z6vC#sE0pSYv^99P=oscp3* zR@o=&MW8CqZ>!+C%jb z(Y|{Rel_CvqXh9mhXJTwem^sQ5(SS~oX>9puh#yh`t=0vtGFx+i^tEbjI;RuzJ?BX=`HWb^K#&8ke^}oJp@tG9Vlq3Y-i6( zeDOHh3B1}lh7RBXv3}9`q2CwRco#n}pI#!)z!LalOW@xEPW3v+^Y?&P>(`Hf-{xH} z`2EU#o+6x*rkvE*iTEXO%3DBnTK<*@ryt`AV0_lMqF|#d%08ja8OYx*p+BSWQFUMV zH`G4@r#Q~%?pTifiz`rhYl&+yz`)Y%W5;H&?+$ENAA;LNXbQ ziG|}HhB;)!=)eb^Fo|c4fpoS%nl|G2MLKUp3nLv%+*ZmmPpLT4flWJ>mTkBXXd_z+sb0)3`7? z9y$=--_>5JktbaM;i!=j(NzS!qemF~x(~L6yN!dLoexHOjoxrucZ8zK^D(h}K{ond zo_?WoH?6IFeny^^NyMXO6hSJ_;w%{LR>yJ{5b5STl;c!WRO^%tVpkryG2;2GF&NFn z={Qc;L0H988KaO-AR!BVp{$A|{zw4WpURkYKRV{VrUcH_#kpCf_Nl`FwCnxWB&$5>jXUdc(+@$)cH)M zmbP3beh)61o3lU9`lt1T zaM%MV(AtIldA`Y{~ahh z{htCxIpOsseN{?QoY#R0m2KrR@ggp}zoz_{AF>;x>ryeVRuH^ z>HkxQ|EOj;FyBJKZNzzF=w%dW4$sR!o~QD;VW&OI%zq8vI-5Vw-_JGz1hJhZEy#?& z4h4-puAkRCd@h^MU-S56KfaGN-={9JKmWdQW*b1zarwFM!T!wOg39hMT9xf~i*r2+ zUDTghC@2=!&-1i^^5=Tk-*G#{dr%Oj%-Kw^|2<{IDzLwum&cyXHlzaTDsl8Z^Ko3< m9)5q)_~y3T+{LIGxV?_xTrb +#include + +int fact(int n) +{ +int f; + + if( n==1) + { + + return ; + } + else + { + f=n*fact(n-1); + } + + +} + +int main() +{ + int n; + printf("Enter the number \n"); + scanf("%d",&n); + printf("Factorial of a number =% d \n",fact(n)); + return 0; +} diff --git a/C/program-39/a.out b/C/program-39/a.out new file mode 100755 index 0000000000000000000000000000000000000000..4ebdcb8d352cd6f41737f750185be5ac46a60cb9 GIT binary patch literal 16664 zcmeHOeQaA-6~DHdH2reit{@g4@Dc)$L0x+Lw5Ub$2 zRXi-pL0%>?L+>*fXbp-vi+Kg%F5u{QiS$2XP*8;zU20+Zse%O?YwNfoEHWl*$s&9}u`=N+_m&xxk`7xiR`j~S* zF(>$WjpA8(E9j7zqb<_WTY4DF4GKz&IomU5zt4jorP^?Oz?IW}jOtq|FFn+L=G0xW zD-rLl-?u9fu1&;~*}>YuhWgt2ecnvUyGQnWJ=Bk5s{L@c_*&{)<)iQ3IIC@abMNlQ zx?_*j-1A|(u?-jxZIIBO(~o=wd{A%n>&s9wFyz-GzwSrA6b*txDWTj9*t!yU^%8j9 z5_sDZ_)CB*@UhY=07}*S3gC*>7~})+*;WD<- zMh}M0Xrb5{EgFm`#6UWp)T4lh27_8Oo(v}9XCokD7_?36T7NK}6z!cI%`MsU5B)ABpvCCXY@$A>rhJ~m5g)+dlML~uRoQfXqsVK(oput3HRA4?=y}8 zzTXZ&9U$|#+!T+m!6)b>Ve6&r61^m6H^*UkI7I?vBz~Ux`RiG0;FsumWn3Y=!e{6i zXZekT299G6+ruCoXUk(801a;#k9G?%SUzu=z z2cYhn3CCDA*%`1iU}wP2fSmz519k@N4E%3rKplCfLLDu;xl0K3`ElKuzow47Rxw#< zbbkL=K$WjK57)|SACypzp?+p64^(p&Wt_UsT$6GdWt>vZj7#}xlyNFKb6LvhAH4vw zq}_k*$X!3J=H60A-kv?$)j3vn8)B(rYepn%dIzlX8|uO5PGxl~YMPz|K^-eQhOBW; z-vG^bV;P#iB0p7GJ&b`TiG%%4X}^CPvYqql#Jo$*&8idA2UW)v_4>TN9s=C*8UZTu zQ&CwD`wutGfJ$U{b*m#ySFot&Zt1Jl(Wciyn68B`O~>GJrECIZ$0_z>KJzRnyTJz% z?a7_{FqfShIX5Tt4Woe%zjN>0+-P7f_xs#0r~e3Me-T$F*)*(WMx%d3}^*7X!Nr&2aGkY7y))!9spYosb zpZ05zBY`7Lj=`c)Co8uvb_VPW*cq@hU}wP2fSmz519k@N4A>d4Gw=~+zybgM1d{L% zo1(`eivCPWNoM`XOt%7D}`f=>v33)3;fS#`n`M} z7xWFY#1EpGp4@lDQug{v%_&@7o%%p6+)W@e{Gvdh?yh8AOF2+{~9#6&iO2Ol<7>7|_BJVD-S|}y)HDaJ7 z?k=3WD2`t#_<1hIA&6o|jIv9tE$rtvYhAD-e7L0jLxug!#rEq9?}cJ~gD5pFU1DS5 zIWD$`r`BgijIv8q2~SC!-&zYk`1~ys@8=f~qlE82r*MnQmVClq2Z>Kv@Q)MD?^7d+ zvH#s+Y7f?jg!}Ft@T(EOA0-GEJPd&K^81;b&gIfhoiJz~?M@q@oFu5&JaUOu-(oW3RSXP3ag3pmzm9nU`m zyi~t_3iw**Cc*Dl?(-z#m^5;tuM_bbz%g$Mbz1(G2u?qPj|awQl@AIgx=8lJG|uI3 zm!N+OaJ08RU+iZOHPQkqMNnIh39Y^JNVC6FJJQy6JkX_e`I|cf7*(E+ z31zaf(f{%E3!c02`S|>dJS!6k2lXHXDL#v{V6=~pZ0sDI17geB?$8 zXHr@$m<;1_oQ@-46^thYBChcjjIFhTz2j#@p~ zC!{VG%*2E@Jd}iZ2G`Su=8NzLNj#M-5;V}IBZ(k7P-!5c3$ILq7mD7#6o`6c5Uw~h z!6+qfoHr7q!59le5S9#AV^kU*T!tEg{qYdA3GcfX@+-XXMD)WbFZGE1HyExH;L(S7 zyFp8x&m^_9fZ|ZU6`A5{XCCk z&h_(phSvie_AnISTdmN3o^LY8??WU$x5fUv&Nu-&oVs%TJTGO=>m!VTgt<1;X%KMj z!TvmdWzOp&Za>>GKLh@_mSLIaxy*f3nYH}{i?dL`oU%X9hnbI)A=hv1|9SFnCOe)t zGw(6^Z-lbd|3$zsCxtU^^!T}R{vjE{D&38kogV_ZX(VbLsy}Ib9i3<@jR8!4O{J5X8t?ytu*=b{QXib zfIw_#NDDIKZ-N5H9@o$79X^-M=dXEuvLD|^obO{7*`I&kxVQ^IpdNW$xUfI-+n_T0 z3m@6m8Jz1ObWwk1L4mQjex9d!$e-(Bf6MI=q wlsNpJ`4oJ(J^cQ}@y%_Qj&vEuF9x9Fmf&2kp~bm%Y5(8Sz@KMB;#U8E18sk}(EtDd literal 0 HcmV?d00001 diff --git a/C/program-39/program.c b/C/program-39/program.c new file mode 100644 index 00000000..1d0f60f9 --- /dev/null +++ b/C/program-39/program.c @@ -0,0 +1,32 @@ +/* +Program to find the GCD of a number using recursion +*/ + +#include +#include + +int gcd(int a,int b) +{ +int f; + + if( b!=0) + { + + return gcd(b,a%b);; + } + else + { + return; + } + + +} + +int main() +{ + int a,b; + printf("Enter the two numbers\n"); + scanf("%d%d",&a,&b); + printf("GCD of %d & %d is = %d \n",a,b,gcd(a,b)); + return 0; +}