Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- #define MAX_EL 30
- typedef struct Tacka{
- double x;
- double y;
- } Tacke;
- void unos(Tacke*, int*);
- double najbliza_t(Tacke[],int,int*);
- void main(){
- Tacke t[MAX_EL];
- int n,
- inx = 0;
- unos(t,&n);
- printf("\nNajbliza tacka je: %.2lf. ",najbliza_t(t,n,&inx));
- printf("Index tacke je %d.",inx);
- }
- void unos(Tacke* tacke, int* n){
- int i;
- do{
- printf("Unesite broj tacaka (max %d): ",MAX_EL);
- scanf("%d",n);
- }while(*n < 1 || *n > MAX_EL);
- for(i = 0; i < *n; i++){
- printf("- Unos %d tacke -\n",i);
- printf("Unesite X koordinatu: ");
- scanf("%lf", &(tacke[i].x));
- printf("Unesite Y koordinatu: ");
- scanf("%lf", &(tacke[i].y));
- }
- }
- double najbliza_t(Tacke t[],int n, int* index){
- int i;
- double min;
- min = sqrt(pow(t[0].x,2.)+pow(t[0].y,2.));
- for(i = 1; i < n; i++){
- double tmp = sqrt(pow(t[i].x,2.)+pow(t[i].y,2.));
- if(tmp < min){
- min = tmp;
- *index = i;
- }
- }
- return min;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement