The document describes a C++ program that takes a positive integer N as input and prints a pictogram of the first N^2 numbers. For each number, if it is prime it prints "P", otherwise it prints "." if it has fewer than 2 prime factors or "2" if it has 2 or more prime factors. The program uses functions to check if a number is prime, find all its factors, and count its prime factors.

1. Write C++ program that when given a value N(read from cin), produces a pictogram of the first
N^2 numbers, as follows: for each number, print what is stated below.
Thank you so much!
Solution
#include <iostream>
using namespace std;
int factors[20];
void findFactors(int n)
{
//cout << "Factors of " << n << " are: " << endl;
int j=0;
for(int i=1;i<=n;++i)
{
if(n%i==0)
{
//cout << i << endl;
factors[j]=i;
j=j+1;
}
}
factors[j]=-1;
}
int isPrime(int no)
{
int i, flag=0;
for(i=2;i<=no/2;++i)
{
if(no%i==0)
{
flag=1;

2. break;
}
}
if (flag==1)
return 1;
else
return 0;
}
int main()
{
int n,i;
cout << "Enter a positive integer: ";
cin >> n;
for(int j=1;j<=(n*n);j++)
{
if(j%n==0)
cout<<endl;
if(isPrime(j)==1)
{
cout<<"P";
}
else
{ int count=0;
findFactors(j);
int k=0;
while(factors[k]!=-1)
{
if(isPrime(factors[k])==1)
count=count+1;
k=k+1;
}
if(count>=2)
cout<<'2';
else
cout<<'.';
}
}
return 0;
}