Help me in solving DIVISORS2 problem

help
,
1

My issue

answer

My code


#include <stdio.h>
int fact(int);

int main() {

    
    int n,m;
    scanf("%d%d",n,m);
    int arr[n],b[n],i,j,count=0;
    
    for(i=0;i<n;i++)
    scanf("%d",&arr[i]);
    
    int z=fact(m);
    printf("%d",m);
    
    for(i=0;i<n;i++)
    {
        b[i]=arr[i]*m;
    }
    
    for (i=0;i<n;i++)
    {
        for(j=1;j<=i;j++)
        {
            if (b[i]%j==0)
            count++;
            
            printf("%d",i);
        }
        
        
    }
    
    return 0;

    
}
int fact(int x)
{
    int i,v=1;
    for (i=x;i>0;i--)
    v=v*i;
    
    return v;
}

Problem Link: Divisors Array (Easy Version) Practice Coding Problem