Code. 프로젝트 오일러. KR 12번. C++

소스코드가... 클래스 연습겸 만들다보니 길어졌습니다...

#include <iostream> #include <vector> using namespace std; class Factor { private: int num; int cnt; public: Factor(int n = 1) { num = n; cnt = 1; }; void addCnt() { cnt++; }; int getCnt() { return cnt; }; }; typedef vector<Factor> FactVector; class PrimeDivisor { private : int targetNum; int numOfFactor; FactVector v_pFactor; void FindFactor() { int temp = targetNum; for (int i = 2; temp > 1; i++) { if (temp % i == 0) { temp /= i; v_pFactor.push_back( Factor(i) ); int index = v_pFactor.size() - 1; while (temp % i == 0) { temp /= i; v_pFactor[index].addCnt(); } } } numOfFactor = 1; int limit = v_pFactor.size(); for (int i = 0; i < limit; i++) { numOfFactor *= v_pFactor[i].getCnt() + 1; } }; public : PrimeDivisor(int target) { targetNum = target; FindFactor(); }; int getTheNumOfFactor() { return numOfFactor; }; }; int main() { int i = 1; int sum = 1; while (true) { i++; sum += i; PrimeDivisor pd(sum); cout << sum << "\t" << pd.getTheNumOfFactor() << endl; if (pd.getTheNumOfFactor() >= 500) break; } return 0; }