Pagini recente » Cod sursa (job #3310346) | Cod sursa (job #166874) | Cod sursa (job #3276380) | Cod sursa (job #3353871) | Cod sursa (job #1846540)
#include <bits/stdc++.h>
#define NMAX 405
using namespace std;
map < pair < double , double> , int > Map;
ifstream fin("plagiat.in");
ofstream fout("plagiat.out");
struct point {
int x,y;
}V[NMAX];
int main()
{
ios :: sync_with_stdio(false);
fin.tie(NULL);
int T,n,i,j;
double d,u,x,y;
fin >> T;
while(T--){
fin >> n;
for(int i = 1; i <= n; i++)
fin >> V[i].x >> V[i].y;
for(i = 1; i <= n; i++)
for(j = i; j <= n; j++){
d = sqrt((V[i].x - V[j].x)*(V[i].x - V[j].x) + (V[i].y - V[j].y)*(V[i].y - V[j].y));
u = atan2(V[i].y - V[j].y,V[i].x - V[j].x);
Map[{d,u}] ++;
//fout << V[i].x << " " << V[i].y << "\n";
if(Map[{d,u}] == 3){
fout << "DA" << "\n";
fout << d << " " << u << "\n";
i = n + 2;
j = n + 2;
}
}
if(i != n + 3)
fout << "NU" << "\n";
Map.clear();
}
return 0;
}