UVA 10879-Code Refactoring
看题目再看样例输出总觉得不对,看了下别人题解,感觉理解的差不多,但样例输出还是不对。。。就直接提交,结果a了。。。。
题目大意:给你一个数,将它分成A*B和C*D
解题思路:顺序找因数输出前两个组合
#include <stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
long long int s;
cin >> n;
for (int m = 1; m <= n; m++) {
cin >> s;
int count = 0;
printf("Case #%d: %lld", m, s);
for (long long int i = 2; i <= sqrt(s); i++) {
if(s % i == 0) {
printf(" = %lld * %lld", i, s/i);
count++;
}
if(count == 2) {
cout << endl;
break;
}
}
}
return 0;
}