UVA 10879 代码重构

数论这部分题，简单题比较少，不容易碰到一个

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <deque>
#include <map>
#include <iomanip>
using namespace std;
///
#define INF 0xffffff7
#define maxn 2000
///
int K;
int A, B, C, D;
int main()
{
	///
	int i, j;
	int ncases, cnt;
	cin >> ncases;
	int nN;
	nN = 1;
	while (ncases--)
	{
		cin >> K;
		cnt = 1;
		for (i = 2; i <= (int)sqrt((double)K); i++)
		{
			if (K % i == 0)
			{
				if (cnt == 1)
				{
					A = i;
					B = K / i;
					cnt++;
					continue;
				}
				C = i;
				D = K / i;
				break;
			}
		}
		printf("Case #%d: %d = %d * %d = %d * %d\n", nN, K, A, B, C, D);
		nN++;
	}
	
    ///
    return 0;
	
}