Pagini recente » Cod sursa (job #1663789) | Monitorul de evaluare | Cod sursa (job #2852790) | Cod sursa (job #39049) | Cod sursa (job #273631)
Cod sursa(job #273631)
#include<stdio.h>
#include<math.h>
#define N 15001
int num,n;
bool fol[N];
struct milk{float x,y;}v[N];
void parcurg()
{
for (int i=1; i<n-1; ++i)
{
for (int j=i+1; j<n; ++j)
{
float modab=(v[i].x-v[j].x)*(v[i].x-v[j].x)+(v[i].y-v[j].y)*(v[i].y-v[j].y);
float ab=sqrt(modab)*1000;
int ab1=ab;
for (int k=j+1; k<=n; ++k)
{
float modac=(v[i].x-v[k].x)*(v[i].x-v[k].x)+(v[i].y-v[k].y)*(v[i].y-v[k].y);
float ac=sqrt(modac)*1000;
int ac1=ac;
float modbc=(v[k].x-v[j].x)*(v[k].x-v[j].x)+(v[k].y-v[j].y)*(v[k].y-v[j].y);
float bc=sqrt(modbc)*1000;
int bc1=bc;
if (ab==bc&& bc==ac)
{
++num;
}
}
}
}
printf("%d",num);
}
void citire()
{
freopen("triang.in","r",stdin);
freopen("triang.out","w",stdout);
scanf("%d",&n);
for (int i=1; i<=n; ++i)
scanf("%f%f",&v[i].x,&v[i].y);
parcurg();
}
int main()
{
citire();
return 0;
}