0001质数问题

输入一个数M(0<=M<=100000)，判定是不是质数，如果是，则输出"M is prime"，如果不是，则拆解质因数

#include <iostream>
#include <cmath>
using namespace std;
bool prime(int n){
       if(n<2){
              return 0;
       }
       int a = floor(sqrt(n));
       for(int i=2;i<=a;i++){
              if(n%i==0){
                     return 0;
              }
       }
       return 1;
}
void primenum(int n){
       cout << n << "=";
       int i=2;
       while(1){
              if(n%i==0){
                     n/=i;
                     cout << i;
                     if(n!=1){
                            cout << "*";
                     }
                     else{
                            break;
                     }
              }
              else{
                     i++;
              }
       }
}

int main(){
       int m;
       cin >> m;
       if(prime(m))
       cout << m << " is prime";
       else
       primenum(m);
       return 0;
}