Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for (int i = 0; i < n-2; i++){
- vienodi=0;
- for (int j = i + 1; j < n-1; j++){
- for(int z=0;z<51;z++){
- for(int x=0;x<51;x++){
- if(B[i].aut[z]!=0 && B[j].aut[x]!=0)
- if(B[i].aut[z]==B[j].aut[x]) vienodi++;
- }
- }
- cout << vienodi << endl;
- if(maxvnd<vienodi){
- maxvnd=vienodi;
- best_i=i;
- best_j=j;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement