Untitled
unknown
plain_text
9 months ago
731 B
12
Indexable
#include<bits/stdc++.h>
using namespace std;
void prime_factors(long long n)
{
vector<int>prime;
for(int i = 2;i*i<=n;i++)
{
if(n%i == 0)
{
while(n%i == 0)
{
prime.push_back(i);
n/=i;
}
}
}
if(n>1)prime.push_back(n);
for(int i = 0;i<prime.size();i++)
{
cout<<prime[i];
if(i<prime.size()-1)
{
cout<<" x ";
}
}
cout<<endl;
}
int main()
{
long long n;
while(1)
{
cin>>n;
if(n == 0)break;
cout<<n<<" = ";
if(n<0)
{
cout<<"-1 x ";
n*= -1;
}
prime_factors(n);
}
}Editor is loading...
Leave a Comment