题目
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <algorithm>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <algorithm>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <cstdio>
using namespace std;
int n,ans=0,a[1001],k;
int main() {
int y=1;
while(cin>>a[y]){
if(a[y]==0) break;
y++;
}
--y;
for(int i=1;i<=y;++i){
for(int j=i+1;j<=y;++j){
if(max(a[i],a[j])/min(a[i],a[j])==2){
ans++;
}
}
}
cout<<ans;
return 0;
}