array(2) { ["docs"]=> array(0) { } ["count"]=> int(0) } 111string(0) "" int(1) int(10) int(70) int(8640000) string(13) "likecs_art_db" array(1) { ["query"]=> array(1) { ["match_all"]=> object(stdClass)#29 (0) { } } } array(1) { ["createtime.keyword"]=> array(1) { ["order"]=> string(4) "desc" } } int(10) int(0) int(8640000) array(2) { ["docs"]=> array(0) { } ["count"]=> int(0) } 网易校招编程题 - 爱码网

网易校招编程题

写了个深搜:

include
include
include
using namespace std;

vector find_num(int n)
{
vector res;
for (int i = n / 2; i >= 2; i--)
{
if (n % i == 0)
{
res.push_back(i);
}
}
return res;
}
struct jump
{
int n;
int step;
};

int visit(jump j, int M)
{
vector nums = find_num(j.n);
for (int i = 0; i < nums.size(); ++i)
{
jump temp;
temp.n = j.n + nums[i];
temp.step = j.step + 1;
if (temp.n == M)
return temp.step;
if (temp.n > M)
continue;
int ret= visit(temp, M);
if (ret == -1)
continue;
else
return ret;
}
return -1;
}
int main()
{
int N, M;
while (cin >> N >> M)
{
jump s;
s.n = N;
s.step = 0;

	cout << visit(s, M) << endl;
}

}

相关文章: