Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- NIZOVI
- double t[30]; // niz od 30 promijenljivih (t[0],t[1]...t[29])
- scanf("%lf",&t[0])
- printf("%lf",t[3])
- t[3]= 3* t[4] + 5* t[5]
- Pr.
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- double zt;
- double t[30];
- int nt,kt;
- printf("Broj elemenata niza (<=30)");
- do
- {
- scanf("%d",&nt);
- }
- while ((nt<=0) || (nt>30));
- for(kt = 0; kt<nt ; kt++)
- {
- printf("t[%d] = ", kt);
- scanf ("%lf", &t[kt]);
- }
- zt = 0;
- for (kt = 0; kt < nt; kt++)
- zt += t[kt];
- printf("Prosecna temperatura je: %lf\n", zt/nt);
- return 0;
- }
- stdlib.h
- rand ()
- 0 - RAND_MAX // min i max vrijednost rand-a
- rand() % 101
- pr.
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int np,kp;
- int poeni[50];
- printf("np = ");
- srand(0);
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- poeni[kp] = rand() % 101;
- printf("Poeni[%d] = %d\n", kp,poeni[kp]);
- }
- return 0;
- }
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int np,kp;
- int poeni[50];
- printf("np = ");
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- poeni[kp] =(int)((double)rand() / RAND_MAX * 100);
- printf("Poeni[%d] = %d\n", kp,poeni[kp]);
- }
- return 0;
- }
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int np,kp;
- int poeni[50];
- printf("np = ");
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- poeni[kp] =(int)(150.0 * rand() / RAND_MAX )+50;
- printf("Poeni[%d] = %d\n", kp,poeni[kp]);
- }
- return 0;
- }
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int maxkp;
- int np,kp;
- int poeni[50];
- printf("np = ");
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- poeni[kp] =(int)(150.0 * rand() / RAND_MAX )+50;
- printf("Poeni[%d] = %d\n", kp,poeni[kp]);
- }
- maxkp = 0;
- for (kp = 1; kp<np; kp++)
- if (poeni[kp] > poeni[maxkp])
- maxkp = kp;
- printf ("Najveci element ima vrijednost %d\n", poeni[maxkp]);
- printf ("Najveci element se nalazi na poziciji %d\n", maxkp);
- return 0;
- }
- Sortiranje niza
- a[0],a[1],a[2]......a[n-1]
- a[0] <= a[1] <= a[2] <=a [3]......<=a [n-1] // neopadajuci niz(rastuci)
- a[0] >= a[1] >= a[2] >=a [3]......>=a [n-1] // nerastuci niz(opadajuci)
- trazimo rastuci niz
- a[0] a[1] a[2].....a[i].....a[n-1] // a[i] najmanji na poziciji i
- a[i] a[1] a[2].....a[0].....a[n-1] // najmanji mijenja mjesto sa nultim
- a[i] a[1] a[2].........a[j].a[n-1]
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXN 100
- main()
- {
- int b;
- int np, kp, jp, ip;
- int a[MAXN];
- printf("np = ");
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- a[kp] =(int)(150.0 * rand() / RAND_MAX )+50;
- printf("a[%d] = %d\n", kp,a[kp]);
- }
- for(ip = 0 ; ip < np; ip++)
- {
- kp = ip;
- for (jp = ip+1 ; jp < np ; jp++)
- if (a[jp]< a[kp])
- kp = jp;
- b = a[ip];
- a[ip] = a[kp];
- a[kp] = b;
- }
- printf ("Posle sortiranja: \n");
- for (ip = 0; ip < np ; ip++)
- printf ("%4d", a[ip]);
- return 0;
- }
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXN 100
- main()
- {
- int b;
- int np, kp, jp, ip;
- int a[MAXN];
- printf("np = ");
- scanf ("%d", &np);
- for (kp = 0; kp < np; kp++)
- {
- a[kp] =(int)(150.0 * rand() / RAND_MAX )+50;
- printf("a[%d] = %d\n", kp,a[kp]);
- }
- for (ip = np-1 ; ip>0 ; ip--)
- {
- for (jp = 1 ; jp<= ip; jp++)
- if (a[jp-1] < a[jp])
- {
- b = a [jp-1];
- a [jp-1] = a[jp];
- a[jp] = b;
- }
- }
- printf ("Posle sortiranja: \n");
- for (ip = 0; ip < np ; ip++)
- printf ("%4d", a[ip]);
- return 0;
- }
- Matrice
- int a[10][20];
- a[0][0] a[0][1] . . . a[0][19]
- a[1][0] a[1][1] . . . a[1][19]
- .
- .
- .
- a[9][0] a[9][1] . . . a[9][19]
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXA 50
- #define MAXP 15
- main()
- {
- int zo;
- int ns, np, ks, kp;
- int ocena[MAXA][MAXP];
- printf ("ns,np = ");
- scanf ("%d%d",&ns, &np);
- for (ks = 0; ks<ns ; ks++)
- for (kp = 0; kp<np; kp++)
- {
- ocena[ks][kp] = rand () % 6 + 5;
- }
- for (ks = 0; ks < ns; ks++)
- {
- for (kp = 0 ; kp < np ; kp++)
- printf("%6d", ocena[ks][kp]);
- printf("\n");
- }
- for (kp = 0 ; kp < np ; kp++)
- {
- zo = 0;
- for (ks = 0 ; ks < ns ; ks++)
- zo += ocena[ks][kp];
- printf("%6.2lf", (double)zo / ns);
- }
- printf("\n");
- return 0;
- }
- POKAZIVACI
- svaki podatak ima svoju adresu u memoriji
- ind *p ;
- p - adresa memorijske lokacije na kojoj se nalazi podatak tipa int
- *p - podatak koji se nalazi na lokaciji p tipa int
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int a, b;
- int *p;
- a = 5;
- b = 8;
- printf("a = %d\n",a);
- p = &a; // dodijeljujemo p adresu promenljive a
- *p = 10; //
- printf("a = %d\n",a);
- p = &b;
- *p = 20;
- printf("b = %d\n",b);
- return 0;
- }
- #include <stdio.h>
- #include <stdlib.h>
- main()
- {
- int a[] = {16,14,19,21,12,15,18,13};
- int *p;
- p = &a[2];
- printf("*p = %d\n",*p);
- printf("*(p+1) = %d\n",*(p+1));
- printf("*(p-2) = %d\n",*(p-2));
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement