Chef and Steps | Codechef

In order to establish dominance amongst his friends, Chef has decided that he will only walk in large steps of length exactly K$K$ feet. However, this has presented many problems in Chef’s life because there are certain distances that he cannot traverse. Eg. If his step length is 5$5$ feet, he cannot travel a distance of 12$12$ feet. Chef has a strict travel plan that he follows on most days, but now he is worried that some of those distances may become impossible to travel. Given N$N$ distances, tell Chef which ones he cannot travel.

Input:

• The first line will contain a single integer T$T$, the number of test cases.
• The first line of each test case will contain two space-separated integers - N$N$, the number of distances, and K$K$, Chef’s step length.
• The second line of each test case will contain N$N$ space-separated integers, the ith$i^{th}$ of which represents Di$D_i$, the distance of the ith$i^{th}$ path.

Output:

For each test case, output a string consisting of N$N$ characters. The ith$i^{th}$ character should be 1$1$ if the distance is traversable, and 0$0$ if not.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤N≤1000$1\le N\le 1000$
• 1≤K≤109$1\le K\le {10}^9$
• 1≤Di≤109

Subtasks

• 100 points: No additional constraints.

Sample Input:

1
5 3
12 13 18 20 27216

Sample Output:

10101

Solution(C++):

#include

using namespace std;

int main() {

// your code goes here

int t;

cin>>t;

while(t--)

{

    int n,k;

    cin>>n>>k;

    vectorv;

    while(n--)

    {

        int x;

        cin>>x;

        if(x%k==0)

        v.push_back(1);

        else

        v.push_back(0);

    }

    for(auto i:v)

    cout<

    cout<

}

return 0;

}