Help me in solving NUM239 problem

help
,
1

My issue

I am not getting please help

My code

#include <bits/stdc++.h>
using namespace std;

void prettyNum(int array[],int n){
     int array[];
     for (int i=0;i<n-1;i++){
         cin>>array[i];
     }
     int output=0;
     if (array[i]%10==2||3||9){
         output++;
     }
}



int main() {
	int t;
	cin>>t;
	int array[2];
	for (int i=0;i<t;i++){
	    cout<<prettyNum<<endl;
	}
	return 0;
}

Problem Link: Counting Pretty Numbers Practice Coding Problem - CodeChef

2

@its_anushka
plzz refer the following code

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--)
	{
	    int l,r;
	    cin>>l>>r;
	    int cnt=0;
	    for(int i=l;i<=r;i++)
	    {
	        int d=i%10;
	        if(d==2||d==3||d==9)
	        cnt++;
	    }
	    cout<<cnt<<endl;
	}

}