Beecrowd 1015

     #include <stdio.h>

    #include <math.h>

    

    int main()

    {

     double x1, x2, y1, y2, dist;

    

     scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);

    

     dist = sqrt(pow(x2-x1,2)+pow(y2-y1,2));

    

     printf("%.4lf\n", dist);

     return 0;

    }

Comments

Post a Comment

Popular posts from this blog

Beecrowd 1020

 #include<stdio.h> int main() {  int years, months, days;      scanf("%d", &days);      years = days / 365;      months = days % 365 / 30;      days = days % 365 % 30;      printf("%d ano(s)\n%d mes(es)\n%d dia(s)\n", years, months, days);      return 0;     }
Read more

Array variable found /not found

 int main() {     int m[100],i,n,x,f;     scanf("%d",&n);     for(i=0;i<n;i++)     {         scanf("%d",&m[i]);     }     scanf("%d",&x);     f=0;     for(i=0;i<n;i++)     {         if(x==m[i])         {             f=1;         }     }     if(f==1){         printf("Found\n");     }     else         printf("Not Found\n");     return 0; }
Read more

minimum

 int min(int x, int y) {     int m;     if(x<y)         m=x;     else         m=y;     return m; } int main() {    double c = itoc(2);    printf("%lf\n",c);     return 0; }
Read more