i have this and i can not solve it plz l do not have time :(

Write a program that print the prime factorization of all the number n between 2 and 100 .if n is a prime , your program writes that it is so . otherwise it should list all the prime factor of it . Take a look at this output :

2 is a prime .

3 is a prime .

4 is the multiplication of : 2 2.

…

…

100 is the multiplication of : 2 2 5 5.

Your program should include the following functions ;

bool isprime (int n) returns true if the given argument is a prime number. Remember , n is a prime iff if cannot be divided except by 1 and by itself . note that 1 is not prime .

int minfactor (int n) returns the smallest prime number that divides n . if n is a prime minfactor (n) return n .

void printfactors (int n) prints the outputs line for integer n sa shown in the sample above .

the algorithm for determining the prime factorization of an integer n is follows ;

1.while n is not a prime number do :

1.1 let K be the smallest prime that properly divides n.

1.2 K is a prime factor of n .

1.3 let n be n/k.

this is my try ;

```
#include <iostream>
#include <cmath>
using namespace std;
bool isprime (int n)
{
if (n&n==0 && n%1==0)
return true
}
int main() {
int n=2 , k;
while(n<=100){
k= isprime ( n);
n++;
}
```

*Edited 5 Years Ago by __avd*: Added [code] tags.