Question

5. Write a program to read in an integer (long) and display all pairs of factors of the input integer. That is, the output must be given as a list of pairs of factors such that the product of each pair is the input integer. Then, print which of these pairs contains only prime numbers (there can be either 1 such pair or none). Note that a. the Scanner class supports a nextLong method to read a long integer, nextBigInteger to read a BigInteger, and nextBigDecimal to read a BigDecimal. b. the printf method uses %d for int, long, BigInteger; and %f for float, double, and BigDecimal.

Answer 1

use the below code for the above question 
and insure that while executing the code #include <vector> is working in Trubo C++.


#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int k;
    cin >> k;
    int k1;
    for(k1 = 1; k1 <= k; k1++) {
        int  N;
        cin >> N;
        vector result;
        result.push_back(1);
        int temp, carry = 0;
        for(int i = 2; i <= N; i++) {
            for(int j = 0; j < result.size(); j++) {
                temp = carry + result[j] * i;
                carry = temp / 10;
                result[j] = temp % 10;
            }
            while(carry) {
                result.push_back(carry % 10);
                carry /= 10;
            }
        }
        for(int i = result.size() - 1; i >= 0; i--){
            cout << result[i];
        }
        cout << endl;
    }
    return 0;
}