867. Decomposition prime factor

subject ：

Given n A positive integer ai, Decompose each number into prime factors , And output the base and index of each quality factor from small to large .

Input format
The first line contains integers n.

Next n That's ok , Each line contains a positive integer ai.

Output format
For each positive integer ai, Output the decomposition quality factor in the order from small to large , The base and exponent of each prime factor , One line for each base and index .

After all the prime factors of each positive integer are output , Output a blank line .

Data range
1≤n≤100,
2≤ai≤2×109
sample input ：
2
6
8
sample output ：
2 1
3 1

2 3

Code ：

#include <iostream>

using  namespace std;

void divide(int x)
{
    
    for(int i = 2; i <= x / i; i++)// from 2 Start traversing prime and composite numbers 
        if(x % i == 0)// If you can divide   Because from 2 Start traversing from small to large , therefore i It must be prime , Because if it is a composite number , It must have been decomposed into qualitative factors for statistics before 
        {
    
            int cnt = 0;// Count the number of times the current prime factor is divided 
            while(x % i == 0)// Always remove quality factor 
            {
    
                cnt++;
                x/=i;
            }
            cout<<i<<' '<<cnt<<endl;
        }
    if(x != 1)// If the prime factor is removed , that x Finally, it must be 1, Otherwise, it means x Itself is a prime number , Only oneself and 1 Two factors 
        cout<<x<<' '<<1<<endl;

    puts("");// Output blank lines 
}

int main()
{
    
    int n;
    cin>>n;

    while(n --)
    {
    
        int x;
        cin>>x;

        divide(x);
    }

    return 0;
}