Openjudge_ 2.1基本算法之枚举_1809 两倍 C++ scratch

http://noi.openjudge.cn/ch0201/solution/21246662/

/*
Openjudge_ 2.1基本算法之枚举_1809 两倍
http://noi.openjudge.cn/ch0201/solution/21246662/

https://blog.csdn.net/qq_31245489/article/details/97616918
https://blog.csdn.net/xcdq_aaa/article/details/114885713
https://blog.csdn.net/A2212583525/article/details/79272707
https://blog.csdn.net/xcdq_aaa/article/details/112629027
https://blog.csdn.net/DavidCai0316/article/details/107137066/
*/
#include<bits/stdc++.h>
using namespace std;
int a[16],n=0,count_=0;
int main(){
    memset(a,1,sizeof(a));
    while(a[n]!=0){
        n+=1;
        cin>>a[n];
    }
    n=n-1; //总数不包括结尾的0
    for(int i=1;i<=n;i++){ //i=1是因为在没有任何输入的时候就已经n+=1过了
        for(int j=1;j<=n;j++){ //j=1同上
            if(a[i]==2*a[j])count_+=1;
        }
    }
    cout<<count_;
    return 0;
}

---

 

 

---