Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- struct Kompleksni {
- double Re, Im;
- };
- int funkcija( struct Kompleksni niz[], int n ) {
- int i, j, kolko = 0;
- for( i=0; i<n; i++ ) {
- for( j=i+1; j<n; j++ ) {
- if( niz[i].Re == niz[j].Re && niz[i].Im == -niz[j].Im )
- kolko++;
- }
- }
- return kolko;
- }
- int main() {
- int i, n, sol;
- struct Kompleksni niz[100];
- printf( "Unesi n:\n" );
- scanf( "%d", &n );
- for( i=0; i<n; i++ )
- scanf( "%lf %lf", &niz[i].Re, &niz[i].Im );
- sol = funkcija( niz, n );
- printf( "U datom nizu ima %d parova kompleksno konjugovanih brojeva:\n", sol );
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement