分治与递归-整数因子分解

#include <iostream>
#include<fstream>
using namespace std;
 
int solve(int n)
{
	int i;
	int count = 0;
	if (n == 1)
		return 1;
	else
		for (i = 2; i <= n; i++)
		{
			if (n%i == 0)
				count += solve(n/i);
		}
	return count;
}
int main()
{
	int n;
 	fstream fin;		//文件读取
 	fstream fout;		//文件写入 
	fin.open("D:/term1/temp/input.txt",ios::in);
	fout.open("D:/term1/temp/output.txt",ios::out);
	
	//一直读到文件末尾 
	while(fin>>n)
		fout<<solve(n)<<endl; //写入数据到文件中去 
	fin.close();
	fout.close();
	
	return 0;
}