c++程序填空求大佬帮忙

Question

#include
#define itemNum(a) _____________________________
//顺序查找模板函数：在T类型的数组中查找值val
//返回true(找到)或false(没有找到)

---

---

---

---

---

---

---

---

int main() {
int a1[]={12,80,78,62,63,89,5,9,89,23,1,6,33,54,30,97,55};
double a2[]={1.2,8.,7.8,6.2,8.9,0.9,8.9,2.3,.1,3.3,5.4,3.0,9.7};
________________________________________________
________________________________________________
________________________________________________
________________________________________________
________________________________________________
________________________________________________
________________________________________________
________________________________________________

return 0;

}
输入
第1行：一批空格分隔的正整数，用-1结束 第2行：一批空格分隔的双精度数
输出
第1行：0和1组成的串(正整数值在整数数组中存在输出1，否则输出0) 第2行：0和1组成的串(双精度数值在双精度数组中存在输出1，否则输出0)
输入样例 1
12 34 44 56 89 33 -1

1.0 1.2 8.9 0.1 3.0 5.6
输出样例 1
100011

011110

Answer 1

#include <iostream>

#define itemNum(a) sizeof(a)/sizeof(a[0])

template<class T>
bool seqFind(T * arr, size_t n, T lookup)
{
    for (int i = 0; i < n; i++)
        if (lookup == arr[i]) return true;
    return false;
}

int main() {
int a1[]={12,80,78,62,63,89,5,9,89,23,1,6,33,54,30,97,55};
double a2[]={1.2,8.,7.8,6.2,8.9,0.9,8.9,2.3,.1,3.3,5.4,3.0,9.7};
int lookup1;
while(1)
{
std::cin >> lookup1;
if (lookup1 == -1) break;
std::cout << (seqFind(a1, itemNum(a1), lookup1) ? 1 : 0);
}
std::cout << std::endl;
double lookup2;
while(1)
{
std::cin >> lookup2;
if (lookup2 < -0.000001) break;
std::cout << (seqFind(a2, itemNum(a2), lookup2) ? 1 : 0);
}
}