Pagini recente » Cod sursa (job #464311) | Cod sursa (job #1968662) | Cod sursa (job #468767) | Cod sursa (job #2744662) | Cod sursa (job #2546274)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("triang.in");
ofstream fout ("triang.out");
float x[1501],y[1501];
float m[1501][1501];
int main()
{
int i,j,k,n,cnt;
float l1,l2,l3;
cnt=0;
fin >> n;
for(i=1;i<=n*2;i++)
{
fin >> x[i];
fin >> y[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
m[i][j]=sqrt(((x[i]-x[j])*(x[i]-x[j]))+((y[i]-y[j])*(y[i]-y[j])));
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(j==i)
j++;
k=1;
while(k==j || k==i)
k++;
while(abs(m[i][j]-m[i][k])<0.001 && abs(m[i][j]-m[j][k])<0.001 && k<=n)
{
k++;
while(k==j|| k==i)
k++;
}
if(k<=n)
cnt++;
}
}
fout <<cnt;
return 0;
}