-
Notifications
You must be signed in to change notification settings - Fork 0
/
Question2.cpp
56 lines (55 loc) · 1.12 KB
/
Question2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
int main()
{
string N;
getline(cin, N);
string edge;
getline(cin, edge);
vector<int> data;
int temp = 0;
for (int i = 0; i < edge.length(); ++i)
{
if (edge[i] != ' ')
{
temp = temp * 10 + edge[i] - '0';
}
else
{
data.push_back(temp);
temp = 0;
}
}
data.push_back(temp);
sort(data.begin(), data.end());
int n = data.size();
int key = 0;
for (int i = n - 1; i >= 2; i--)
{
int p = 0;
int q = i - 1;
while (p < q)
{
if (data[p] * data[p] + data[q] * data[q] > data[i] * data[i])
{
q--;
}
else if (data[p] * data[p] + data[q] * data[q] < data[i] * data[i])
{
p++;
}
else
{
key++;
while (data[--q] == data[q] && q > p)
{
}
p++;
}
}
}
cout << key;
return 0;
}