September Circuits Problem 2

septckt.cpp

#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>height;
int num;
while(n--)
{
    cin>>num;
    height.push_back(num);
}
int q,qry,a=height.size();
int count = 0;
cin>>q;
while(q--)
{
    cin>>qry;
    for(int j=0;j<a;j++)
    {
        if(height[j]%qry==0)
        {
            count = count +  1;
        }
    }
    cout<<count<<endl;
   
    count=0;
    qry=0;
}
    return 0;
}

Optimize this code to reduce the time complexity