Advertisement
Guest User

Untitled

a guest
Jan 26th, 2015
169
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.70 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4. struct Kompleksni {
  5. double Re, Im;
  6. };
  7.  
  8. int funkcija( struct Kompleksni niz[], int n ) {
  9.  
  10. int i, j, kolko = 0;
  11.  
  12. for( i=0; i<n; i++ ) {
  13. for( j=i+1; j<n; j++ ) {
  14. if( niz[i].Re == niz[j].Re && niz[i].Im == -niz[j].Im )
  15. kolko++;
  16. }
  17. }
  18.  
  19. return kolko;
  20.  
  21. }
  22.  
  23. int main() {
  24.  
  25. int i, n, sol;
  26. struct Kompleksni niz[100];
  27.  
  28. printf( "Unesi n:\n" );
  29. scanf( "%d", &n );
  30.  
  31. for( i=0; i<n; i++ )
  32. scanf( "%lf %lf", &niz[i].Re, &niz[i].Im );
  33.  
  34. sol = funkcija( niz, n );
  35.  
  36. printf( "U datom nizu ima %d parova kompleksno konjugovanih brojeva:\n", sol );
  37.  
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement