Basic exercise decomposing prime factors

Resource constraints

The time limit ：1.0s Memory limit ：512.0MB

---

Problem description

Find the interval [a,b] The prime factorization of all integers in .
　　

---

Input format

Enter two integers a,b.

---

## Output format

Each line outputs a decomposition of numbers , Form like k=a1a2a3…(a1<=a2<=a3…,k From small to large )( See the example for details )
　　

---

The sample input

3 10

---

Sample output

3=3
4=22
5=5
6=23
7=7
8=222
9=33
10=25

---

Tips

Let's sift out all the prime numbers first , And then break it down .

---

Data size and engagement

2<=a<=b<=10000

Code

#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;

int count(int n)// Find each factor 
{
    
	int m = sqrt(n);
	for(int i=2;i<=m;i++)
	{
    
		if(n%i==0)
		{
    
			return i;
		}
	}
	return n;
}

int main()
{
    
	int a,b;
	cin>>a>>b;
	for(int i=a;i<=b;i++)
	{
    
		int j=count(i);
		int k = i/j;// See if it can be decomposed 
		cout<<i<<"="<<j;
		while(k>1)// Decomposable 
		{
    
			j=count(k);// Look for factors 
			cout<<"*"<<j;	
			k=k/j;// Cyclic factor finding   until 1（ It can't be broken down ）
		}
		cout<<endl;
	}
	return 0;
}