Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define MAX 100
- int main() {
- int n,k,niz1[MAX],niz2[MAX],brojac, brojacdrugi;
- while (1) {
- printf("uneti br elemenata niza \n");
- scanf("%d", &n);
- if ((n > MAX) || (n <= 0)) {
- break;
- }
- printf("unesi elemente niza 1 \n");
- for (int i = 0; i < n; i++) {
- scanf("%d", &niz1[i]);
- }
- printf("unesi elemente niza 2 \n");
- for (int i = 0; i < n; i++) {
- scanf("%d", &niz2[i]);
- }
- brojac = 0;
- brojacdrugi = 0;
- for (int i = 0; i < n; i++){
- for (int i = 0; i < n; i++) {
- if (niz1[i] == niz2[i]) {
- brojacdrugi = 1;
- }
- }
- if (brojacdrugi == 1) {
- printf("niz 1 moze se dobiti rotacijom niza 2 za %d mesta \n", &brojac);
- break;
- }
- k = niz2[n - 1];
- for (int j = n-1; j > 0; j--) {
- niz2[j] = niz2[j - 1];
- }
- niz2[0] = k;
- brojac++;
- }
- if (brojacdrugi != 1) {
- printf("niz1 ne moze se dobiti rotacijom niza 2 \n");
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement