Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Provjeriti da li je drugi unijeti niz podniz prvog
- #include <stdio.h>
- #define MAX_SIZE 100
- int main()
- {
- int firstArray[MAX_SIZE], firstN;
- int secondArray[MAX_SIZE], secondN;
- int i;
- scanf("%i", &firstN);
- for (i = 0; i < firstN; i++)
- scanf("%i", &firstArray[i]);
- scanf("%i", &secondN);
- for (i = 0; i < secondN; i++)
- scanf("%i", &secondArray[i]);
- for (i = 0; i <= firstN - secondN; i++)
- if (isEqualivent(&(firstArray[i]), secondArray, secondN)) {
- printf("1");
- return 0;
- }
- printf("0");
- return 0;
- }
- int isEqualivent(int firstArray[MAX_SIZE], int secondArray[MAX_SIZE], int length) {
- int i = 0;
- for (; i < length; i++)
- if (firstArray[i] != secondArray[i])
- return 0;
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement