Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <stdio.h>
- #include <stdlib.h>
- void funkcija_1() {
- printf("Funkcija 1: \n");
- int niz[20], x, brojac;
- int n, konacanBrojClanova = 0;
- printf("Unesite koliko clanova niza zelite da unesete (max 20): ");
- scanf("%d", &n);
- for (int i = 0; i < n; i++)
- {
- printf("Unesite clan niza: ");
- scanf("%d", &x);
- brojac = 0;
- for (int j = 0; j <= konacanBrojClanova; j++)
- {
- if (x == niz[j]) {
- brojac++;
- }
- }
- if (brojac < 2) {
- niz[konacanBrojClanova] = x;
- konacanBrojClanova++;
- }
- }
- printf("Vas niz je: \n");
- for (int i = 0; i < konacanBrojClanova; i++)
- {
- printf("niz[%d] = %d\t", i, niz[i]);
- }
- }
- void funkcija_2() {
- printf("\nFunkcija 2: \n");
- int A[100], B[100], C[100];
- int brojClanova, ukBrojClanovaB = 0, ukBrojClanovaC = 0, brojac;
- printf("Unesite koliko clanova niza zelite da unesete: ");
- scanf("%d", &brojClanova);
- for (int i = 0; i < brojClanova; i++)
- {
- printf("Unesite A[%d]: ", i);
- scanf("%d", &A[i]);
- }
- for (int i = 0; i < brojClanova; i++)
- {
- brojac = 0;
- for (int j = 0; j < brojClanova; j++)
- {
- if (A[i] == A[j] && i != j) {
- brojac++;
- }
- }
- if (brojac < 1) {
- B[ukBrojClanovaB] = A[i];
- ukBrojClanovaB++;
- }
- else {
- int temp = 1;
- for (int k = 0; k < ukBrojClanovaC; k++)
- {
- if (C[k] == A[i]) {
- temp = 0;
- }
- }
- if (temp) {
- C[ukBrojClanovaC] = A[i];
- ukBrojClanovaC++;
- }
- }
- }
- for (int i = 0; i < ukBrojClanovaB; i++) {
- printf("B[%d] = %d\t", i, B[i]);
- }
- printf("\n");
- for (int i = 0; i < ukBrojClanovaC; i++) {
- printf("C[%d] = %d\t", i, C[i]);
- }
- }
- void funkcija_3() {
- int M[10][10], suma[6], zbir = 0, n, x;
- printf("Unesite velicinu vase matrice: ");
- scanf("%d", &n);
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("M[%d][%d] = ", i, j);
- scanf("%d", &M[i][j]);
- }
- }
- printf("Vasa matrica je: \n");
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("M[%d][%d] = %d\t", i, j, M[i][j]);
- }
- printf("\n");
- }
- x = n / 2;
- for (int i = n-x; i < n; i++)
- {
- zbir = 0;
- for (int j = 0; j < n; j++)
- {
- zbir += M[j][i];
- }
- suma[x + i - n] = zbir;
- }
- for (int i = 0; i < x; i++)
- {
- printf("Suma[%d] = %d\t", i, suma[i]);
- }
- } // matrica
- void funkcija_4() {
- int M[5][5] = { 1,2,5,-1,3,
- 4,8,4,1,6,
- 2,4,6,7,8,
- 3,4,7,4,2,
- 8,8,11,9,3 };
- int glavna[5], sporedna[5], n = 5, temp, status = 1;
- printf("Vasa matrica je: \n");
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("M[%d][%d] = %d\t", i, j, M[i][j]);
- }
- printf("\n");
- }
- for (int i = 0; i < n; i++)
- {
- glavna[i] = M[i][i];
- sporedna[i] = M[n - i - 1][i];
- }
- printf("Glavna dijagonala: \n");
- for (int i = 0; i < n; i++)
- {
- printf("g[%d] = %d\t", i, glavna[i]);
- }
- printf("Sporedna dijagonala: \n");
- for (int i = 0; i < n; i++)
- {
- printf("s[%d] = %d\t", i, sporedna[i]);
- }
- for (int i = 0; i < n; i++)
- {
- temp = 0;
- for (int j = 0; j < n; j++)
- {
- if (glavna[i] == sporedna[j]) {
- temp++;
- }
- else if (glavna[i] == glavna[j] && i != j) {
- temp++;
- }
- }
- if (temp != 1) {
- status = 0;
- break;
- }
- }
- if (status==1) {
- printf("DA");
- }
- else {
- printf("NE");
- }
- }
- void funkcija_5() {
- int A[5] = { 2,3,3,6,7 };
- int B[8] = { 0,1,1,3,4,4,9,10 };
- int C[13];
- int n1 = 5, n2 = 8, n3 = 13;
- int curr1 = 0, curr2 = 0;
- for (int i = 0; i < n3; i++)
- {
- if (A[curr1] <= B[curr2] && curr1 < n1 && curr2 < n2) {
- C[i] = A[curr1];
- curr1++;
- }
- else {
- C[i] = B[curr2];
- curr2++;
- }
- }
- for (int i = 0; i < n3; i++)
- {
- printf("C[%d] = %d \n", i, C[i]);
- }
- }
- void bonus() {
- int n;
- printf("Unesite gornju granicu");
- scanf("%d", &n);
- printf("[ ");
- for (int i = 1; i <= n-2; i++)
- {
- if (prost_broj(i) && prost_broj(i + 2)) {
- printf("%d %d, ", i, i + 2);
- }
- }
- printf("]");
- }
- int prost_broj(int n) {
- int status = 1;
- if (n <= 1) {
- status = 0;
- return status;
- }
- for (int i = 2; i < n; i++)
- {
- if (n % i == 0) {
- status = 0;
- }
- }
- return status;
- }
- int main(void) {
- //int niz[3]= {{1,2,3}, {4,5,6}, {7,8,9}}
- int M[3][3] = { 1,2,3,
- 4,5,6,
- 7,8,9 };
- for (int i = 0; i < 3; i++)
- {
- for (int j = 0; j < 3; j++)
- {
- printf("M[%d][%d] = %d\t", i, j, M[i][j]);
- }
- printf("\n");
- }
- int n = 3;
- int glavna = 0, ispodGlavna = 0, iznadGlavna = 0, sporedna = 0, ispodSporedna = 0, iznadSporedna = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i < j) {
- iznadGlavna += M[i][j];
- }
- if (i > j) {
- ispodGlavna += M[i][j];
- }
- if (i == j) {
- glavna += M[i][j];
- }
- if (i + j == n - 1) {
- sporedna += M[i][j];
- }
- if (i + j < n - 1) {
- iznadSporedna += M[i][j];
- }
- if (i + j > n - 1) {
- ispodSporedna += M[i][j];
- }
- }
- }
- printf("Sume:\nGlavna: %d\nSporedna: %d\nIspod glavne: %d\nIznad glavne:%d\nIspod sporedne: %d\nIznad sporedne: %d", glavna, sporedna, ispodGlavna, iznadGlavna, ispodSporedna, iznadSporedna);
- /*
- int a[3], suma;
- int n = 3;
- printf("Glavna dijagonala\n");
- for (int i = 0; i < 3; i++)
- {
- printf("M[%d][%d] = %d\t", i, i, M[i][i]);
- } // stari zadatak...
- printf("\n\nSporedna dijagonala dimenzije kv mat = %d\n", n);
- for (int i = 0; i < n; i++)
- {
- printf("M[%d][%d] = %d\t", i, n - 1 - i, M[i][n - 1 - i]);
- }
- printf("\nZbir elemenata ispod glavne dijagonale: \n");
- suma = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i > j) {
- suma += M[i][j];
- }
- }
- }
- printf("Suma je %d\n", suma);
- printf("Zbir elemenata ispod sporedne dijagonale: \n");
- suma = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i + j >= n) {
- suma += M[i][j];
- }
- }
- }
- printf("Suma je %d\n", suma);
- printf("\n\n");
- */
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement