Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- void nhap(int a[], int n);
- void xuat(int a[], int n);
- int dx(int a[], int n);
- void k_tra(int a[], int b[], int n, int m);
- int main()
- {
- int n, m;
- int a[30],b[20];
- printf("Nhap do dai mang: ");
- scanf("%d",&n);
- nhap(a,n);
- if(dx(a,n))
- printf("Mang doi xung!");
- else
- printf("\nMang khong doi xung!");
- printf("\nNhap vao mot mang");
- printf("\nNhap do dai mang: ");
- scanf("%d",&m);
- if (m > n || m < 1)
- printf("\nDo dai mang b lon hon mang a, nen b khong the la con cua a");
- else
- nhap(b,m);
- k_tra(a,b,n,m);
- }
- void nhap(int a[], int n)
- {
- int i;
- for (i = 0; i < n; i++)
- {
- printf("phan tu [%d] : ",i);
- scanf("%d",&a[i]);
- }
- }
- void xuat(int a[], int n)
- {
- int i;
- for (i = 0; i < n; i++)
- {
- printf("%d ",a[i]);
- }
- }
- int dx(int a[], int n)
- {
- int i, k = 1;
- for(i = 0; i < n; i++)
- {
- if(a[i]!= a[n-i-1])
- {
- k = 0;
- break;
- }
- }
- return k;
- }
- void k_tra(int a[], int b[], int n, int m)
- {
- int i, j, l, dem=0, k=0;
- for (i = 0; i < n; i++){
- if(a[i]==b[0]){
- for(j=i,l=0;l<m;j++,l++){
- if(a[j]==b[l]) dem++;
- else dem=0;
- if(dem==m){
- k++;
- dem=0;
- }
- }
- }
- }
- if(k)
- printf("b xuat hien %d lan trong a\n",k);
- else
- printf("b ko la con cua a\n");
- }
Advertisement
Add Comment
Please, Sign In to add comment