Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //1. Zadatak
- #include <stdio.h>
- #include <math.h>
- int main(int argc, char const *argv[])
- {
- double y;
- for (int x = -4; x <= 4; x++) {
- if ( x < 0) {
- y = pow(x, 3) + pow(2, x);
- } else if ( x <= 1) {
- y = sin(pow(x, 3))+ cos(x);
- }
- else {
- y = sqrt(sin(3*x));
- }
- printf("Za vrednost argumenta x = %d funkcija ima vrednost y = %f\n", x, y);
- }
- return 0;
- }
- //2. Zadatak
- #include <stdio.h>
- double povrsina(int r) {
- return 4* 3.14 * r *r;
- }
- double zapremina(int r) {
- return 4/3 * 3.14 * r*r*r;
- }
- int main()
- {
- double s = 0;
- int n;
- scanf("%d", &n);
- for (int i = 0; i < n; i++) {
- printf("Unesite podatke za %d. loptu\n", i+1);
- int r;
- scanf("%d", &r);
- s += povrsina(r);
- printf("Lopta broj %d sa poluprecnikom %d ima zapreminu %0.2f\n", i+1, r, zapremina(r));
- }
- printf("Ukupna pov lopti je %f\n", s);
- return 0;
- }
- //3. Zadatak
- #include <stdio.h>
- #include <time.h>
- #include <stdlib.h>
- int main()
- {
- srand(time(NULL));
- int a1[20], a2[20], a3[20];
- int n1 = 0, n2 = 0, n3 = 0;
- int count = 1;
- int br = rand() % 10001;
- while (br != 100 && count < 20) {
- count ++;
- cJedinica = br % 10;
- cDesetica = (br / 10) br % 10;
- cStotina = (br / 100) br % 10;
- if(cJedinica + cDesetica + cStotina > 25)
- break;
- if(br < 10)
- a1[n1++] = br;
- else if (br < 100)
- a2[n2++] = br;
- else
- a3[n3++] = br;
- br = rand() % 10001;
- }
- printf("A1 = {");
- for (int i= 0; i < n1; i++) {
- printf("%d, ", a1[i]);
- }
- printf("}\n");
- printf("A2 = {");
- for (int i= 0; i < n2; i++) {
- printf("%d, ", a2[i]);
- }
- printf("}\n");
- printf("A3 = {");
- for (int i= 0; i < n3; i++) {
- printf("%d, ", a3[i]);
- }
- printf("}\n");
- return 0;
- }
- //4. Zadatak
- int main()
- {
- int mat[256][256];
- int n;
- printf("Unesite n\n");
- scanf("%d", &n);
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++) {
- if (i == 0 || (i == n-1 && j < n/2)|| j == 0 || j == n-1 || j == n / 2) {
- mat[i][j] = 1;
- }
- else
- mat[i][j] = 0;
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- printf("%d ", mat[i][j]);
- }
- printf("\n");
- }
- return 0;
- }
- //5. Zadatak
- int main(int argc, char const *argv[])
- {
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement