Pagini recente » Cod sursa (job #916457) | Cod sursa (job #765993) | Cod sursa (job #1396699) | Cod sursa (job #278905) | Cod sursa (job #2539237)
#include <iostream>
#include <fstream>
#include <cmath>
#include <iomanip>
using namespace std;
ifstream fin ("triang.in");
ofstream fout ("triang.out");
double v[3001];
int main()
{
int i,j,k,n,cnt;
float l1,l2,l3;
fin >> n;
for(i=1;i<=n*2;i++)
{
fin >> v[i++];
fin >> v[i];
}
cnt=0;
for(i=1;i<=(n<<1)-1;i+=2)
for(j=i+2;j<=(n<<1)-1;j+=2)
for(k=j+2;k<=(n<<1)-1;k+=2)
{
l1=sqrt((v[i]-v[j])*(v[i]-v[j])+(v[i+1]-v[j+1])*(v[i+1]-v[j+1]));
l2=sqrt((v[i]-v[k])*(v[i]-v[k])+(v[i+1]-v[k+1])*(v[i+1]-v[k+1]));
l3=sqrt((v[j]-v[k])*(v[j]-v[k])+(v[j+1]-v[k+1])*(v[j+1]-v[k+1]));
int a=l1*1000;
float b=a%1000;
b/=1000;
a=l1;
l1=a+b;
a=l2*1000;
b=a%1000;
b/=1000;
a=l2;
l2=a+b;
a=l3*1000;
b=a%1000;
b/=1000;
a=l3;
l3=a+b;
if(l1==l2 && l2==l3 && l1==l3)
cnt++;
}
fout << cnt;
return 0;
}