Final_2013_3_attempt2

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <string>
#include "set.h"
#include "console.h"
#include "vector.h"
#include "simpio.h"
#include "Lexicon.h"
#include "ResizableArray.h"
#include "MyVector.h"
#include "bst.h"
#include "MyMatrix.h"
#include "random.h"

using namespace std;

void recurs(int n, int &count, Set<int> ints) {
	if (n == 1) {
		count++;
		return;
	}
	recurs(n - 1, count, ints);
	foreach (int k in ints) {
		if (n % k == 0) {
			recurs(n / k, count, ints);
		}
	}
}

int pathCount(int n, int a[2]) {
	Set<int> ints;
	for (int i = 0; i < 2; i++) {
		ints.add(a[i]);
	}
	int count = 0;
	recurs(n, count, ints);
	return count;
}

int main() {
	int n = 6;
	int a[2] = {2, 3};
	int p = pathCount(n, a);
	cout << p << endl;
	return 0;
}