#include <iostream>
#include <set>
using namespace std;
int main()
{
int num = 0;
int f12 = 479001600;
multiset<unsigned int> s;
int n;
while(cin >> n) {
if(f12 % n == 0) { //n是f12的约数
multiset<unsigned int> ::iterator it = s.find(f12 / n);
if(it != s.end()) {
num ++;
s.erase(it);
}
else s.insert(n);
}
}
cout << num << endl;
return 0;
}
zoj1191配对12!
最新推荐文章于 2019-04-14 16:27:36 发布