g. surgulaZe, g. janeliZe, i. xuciSvili
g. surgulaZe, g. janeliZe, i. xuciSvili g. surgulaZe, g. janeliZe, i. xuciSvili
do-while ciklSi piroba mowmdeba ciklis operatoris bolos. amitomac mas uwodeben cikls Semdgomi pirobiT. do-while operatoris ZiriTadi formati Semdegia: do { ciklis tani: operatorebis mimdevroba an erTi } while (); 55 operatori Tu while cikli SeiZleba ar Sesruldes arc erTxel (rodesac piroba Tavidanve mcdaria), do-while ciklis tani aucileblad Sesruldeba erTxel mainc. xolo Semdeg ciklis gagrZeleba damokidebulia do-while-is pirobaze. do-while cikli imuSavebs manamde, sanam ciklis bolos mocemuli piroba WeSmaritia. ganvixiloT magaliTi: gamoiTvaleT n ! ( n ≥ 0) #include main() { short int n, i; long int fact=1; printf("SemoitaneT n: "); scanf("%d",&n); i=1; do { fact=fact*i; i++; } while(i
programis muSaobis Sedegebi: 1). SemoiteneT n: 12 n-is faqtoriali=479001600 2). SemoiteneT n: 0 n-is faqtoriali=1 56 3). SemoiteneT n: 1 n-is faqtoriali=1 am programaSi SeiZleboda while ciklis gamoyenebac. magram arsebobs algoriTmebi, romlebSic mizanSewonilia do-while cikli. magaliTad, Tu adre ganxilul amocanaSi – ipoveT mocemuli n naturaluri ricxvis cifrTa namravli – SevcvliT pirobas: ipoveT mocemuli n arauaryofiTi mTeli ricxvis cifrTa namravli, maSin moyvanili programis fragmenti (sadac gamoviyeneT cikli while) mogvcems araswor pasuxs n=0-sTvis. CavweroT programa mTlianad n- is tipis (unsigned int) gaTvaliswinebiT : #include main() { unsigned int n, cifri=0, namravli=1; printf("SemoitaneT mTeli arauaryofiTi ricxvi: "); scanf("%u",&n); return 0; } while(n!=0) { } cifri=n%10; namravli*= cifri; n/=10; printf ("n ricxvis cifrTa namravli=%u",namravli); programis muSaobis Sedegia: SemoitaneT mTeli arauaryofiTi ricxvi: 0 n ricxvis cifrTa namravli=1 araswori Sedegi ukavSirdeba while-is gamoyenebas. marTlac, Tu n-is Semotanili mniSvneloba nulia, n!=0 ciklis piroba mcdaria, cikli ar Sesruldeba da daibeWdeba namravli cvladis mniSvneloba 1.
- Page 5 and 6: 2.3. mimTiTeblebi. mimTiTeblis gamo
- Page 7 and 8: I Tavi. martivi monacemTa tipebi. e
- Page 9 and 10: funqciebze). obieqturi modulis damu
- Page 11 and 12: stilSic da orive stilSi erTdroulad.
- Page 13 and 14: 1.2.4. komentari C-Si C-ze daweril
- Page 15 and 16: signed short int aRwers niSnian mok
- Page 17 and 18: ezervirebuli sityva void ANSI C sta
- Page 19 and 20: operaciis marjvena mxares. magaliTa
- Page 21 and 22: a=b++; Sesrulebis Sedegad a-s mniSv
- Page 23 and 24: int a=3, b=4; float fartobi_1, fart
- Page 25 and 26: } a=a*2; b=b+3; fartobi_2=0.5*a*b;
- Page 27 and 28: urSi misi tipi ar mieTiTeba, maSin
- Page 29 and 30: == - udris; != - ar udris. Sedarebi
- Page 31 and 32: daabrunebs 0-s. rogorc vxedavT, Caw
- Page 33 and 34: mzimiT gamoiyofa gamosaxulebebi, xo
- Page 35 and 36: wesebi gviCvenebs, rom gamosaxulebi
- Page 37 and 38: 1.6. failis CarTva #include saTao f
- Page 39 and 40: 1.7. ganStoebis operatorebi if, if-
- Page 41 and 42: 40 else printf("udidesi= %f", b); u
- Page 43 and 44: a++; aq mocemulia if operatoris Sem
- Page 45 and 46: { d=b; b=c; c=d; } if(a>b) { d=a; a
- Page 47 and 48: { } case 1: z=3*x-y; break; case 2:
- Page 49 and 50: if(nishani=='+') z=x+y; else if(nis
- Page 51 and 52: marTvis gadacemas WdiT moniSnul ope
- Page 53 and 54: ciklis tani ar Sesruldeba, marTva g
- Page 55: #include /* evklides algoriTmi */ m
- Page 59 and 60: Sesruleba (1/0)? "); romlis Semdega
- Page 61 and 62: 3. Tu gamosaxuleba_2-s mniSvneloba
- Page 63 and 64: for( ; ; ) printf("usasrulo cikli\n
- Page 65 and 66: if(b) printf("martivia"); else prin
- Page 67 and 68: 1.11. simboluri Setana-gamotana C-S
- Page 69 and 70: char ch; return 0; } printf("Seitan
- Page 71 and 72: moviyvanoT programa, romelic klavia
- Page 73 and 74: #include #include main() { } char c
- Page 75 and 76: main() { } { char p; while ((p = ge
- Page 77 and 78: II Tavi. monacemTa struqturirebuli
- Page 79 and 80: magaliTad, Tu mocemulia aRwera char
- Page 81 and 82: ganvixiloT masivis gamoyenebis ramd
- Page 83 and 84: max-min=356.65 4. dabeWdeT n-elemen
- Page 85 and 86: #include #include #define n 6 main(
- Page 87 and 88: c masivSi elementebi gaerTianebulia
- Page 89 and 90: 2.3. mimTiTeblebi. mimTiTeblis gamo
- Page 91 and 92: ganvixiloT sailustracio programa: #
- Page 93 and 94: Tu ori mimTiTebeli miuTiTebs erTi d
- Page 95 and 96: if(*(a+i)
- Page 97 and 98: getch(); return 0; } printf("Semoit
- Page 99 and 100: striqonis sigrZe = 16 Tu programaSi
- Page 101 and 102: funqcia strcmp agreTve aRwerilia st
- Page 103 and 104: #include #include int main(void)
- Page 105 and 106: #include #include #include int m
programis muSaobis Sedegebi:<br />
1). SemoiteneT n: 12<br />
n-is faqtoriali=479001600<br />
2). SemoiteneT n: 0<br />
n-is faqtoriali=1<br />
56<br />
3). SemoiteneT n: 1<br />
n-is faqtoriali=1<br />
am programaSi SeiZleboda while ciklis gamoyenebac. magram<br />
arsebobs algoriTmebi, romlebSic mizanSewonilia do-while cikli.<br />
magaliTad, Tu adre ganxilul amocanaSi – ipoveT mocemuli n<br />
naturaluri ricxvis cifrTa namravli – SevcvliT pirobas: ipoveT<br />
mocemuli n arauaryofiTi mTeli ricxvis cifrTa namravli, maSin<br />
moyvanili programis fragmenti (sadac gamoviyeneT cikli while)<br />
mogvcems araswor pasuxs n=0-sTvis. CavweroT programa mTlianad n-<br />
is tipis (unsigned int) gaTvaliswinebiT :<br />
#include <br />
main()<br />
{<br />
unsigned int n, cifri=0, namravli=1;<br />
printf("SemoitaneT mTeli arauaryofiTi ricxvi: "); scanf("%u",&n);<br />
return 0;<br />
}<br />
while(n!=0)<br />
{<br />
}<br />
cifri=n%10;<br />
namravli*= cifri;<br />
n/=10;<br />
printf ("n ricxvis cifrTa namravli=%u",namravli);<br />
programis muSaobis Sedegia: SemoitaneT mTeli arauaryofiTi ricxvi: 0<br />
n ricxvis cifrTa namravli=1<br />
araswori Sedegi ukavSirdeba while-is gamoyenebas. marTlac, Tu<br />
n-is Semotanili mniSvneloba nulia, n!=0 ciklis piroba mcdaria,<br />
cikli ar Sesruldeba da daibeWdeba namravli cvladis mniSvneloba 1.
Change language