排序
水题
AC代码:
//排序
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 16;
int num[N];
int main() {
int i,j,k,cnt;
while (cin >> num[0]) {
if (num[0] == -1) break;
i = 1,cnt=0;
cin >> num[i];
while (num[i])
cin >> num[++i];
sort(num, num + i+1);//从小到大排序
for (j = 1; j <= i; j++) {
for (k = j + 1; k <= i; k++) {
if (num[k] == num[j] * 2)
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}