Beginners Task #2

[Fossil]

Code: Select all

#include <iostream>

int main()
{
    long chx=2,inp=1;                   //set var
    std::cout<<"Please type in a number\n";     
    std::cin>>inp;
  for(;;)                               //loop forever
    {
        if (bool(inp%chx)){chx++;continue;}   //is divisable?     
        std::cout<<chx;
        if (inp==chx)
        {std::cout<<" Prime Factors.";break;} //The end??
        inp=inp/chx;              //if not carry on                       
        std::cout<<"*";
    }     
    std::cin>>inp;     //leave on screen not the best way!!
    return 0;
}


My twopennith,and its not idiot proof