7051 Linear detection method to resolve hash conflicts

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

int main()
{
    
    
    int m,p,j,h,d=1;
    cin>>m;
    int data[100]={
    
    0};
    for(int i=m;i>0;i--){
    
    
        for(j=2;j<i;j++){
    
    
        if(i%j==0)break;
        }
        if(j==i){
    
    
        p=i;
        break;
        }
    }
cin>>j;
while(j){
    
    
h=j%p;
int qw=h;
while(data[h]!=0){
    
    
h=(qw+d++)%m;
}
d=1;
data[h]=j;
cin>>j;
}
for(int i=0;i<m;i++)
cout<<i<<"  ";
cout<<endl;
for(int i=0;i<m;i++)
cout<<data[i]<<"  ";

    return 0;
}