Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define DM 40
- void skupa(int a[],int b[],int n,int m);
- void skupb(int a[],int b[],int n,int m);
- int main()
- {
- int a[DM],b[DM],n,i,m;
- printf("Unesite velicinu niza A:");
- do
- {
- scanf("%d",&n);
- }while(n<0 || n>DM);
- printf("Unesite velicinu niza B:");
- do
- {
- scanf("%d",&m);
- }while(m<0 || m>DM);
- for(i=0;i<DM;i++) a[i]=0,b[i]=0;
- printf("\nUnesite elemente niza A:");
- for(i=0;i<n;i++)
- {
- printf("\nA[%d]=",i+1);
- scanf("%d",&a[i]);
- }
- printf("\nUnesite elemente niza B:");
- for(i=0;i<m;i++)
- {
- printf("\nB[%d]=",i+1);
- scanf("%d",&b[i]);
- }
- skupa(a,b,n,m);
- skupb(a,b,n,m);
- return 0;
- }
- void skupa(int a[],int b[],int n,int m)
- {
- int i,j;
- printf("\nBrojevi koji se nalaze samo u nizu A:");
- for(i=0;i<n;i++)
- {
- j=0;
- while(a[i]!=b[j] && j<m) j++;
- if(j==m) printf(" %d",a[i]);
- }
- }
- void skupb(int a[],int b[],int n,int m)
- {
- int i,j;
- printf("\nBrojevi koji se nalaze samo u nizu B:");
- for(i=0;i<m;i++)
- {
- j=0;
- while(b[i]!=a[j] && j<n) j++;
- if(j==n) printf(" %d",b[i]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement