zoukankan      html  css  js  c++  java
  • 网易校招编程题

    写了个深搜:

    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;
    }
    

    }

  • 相关阅读:
    飞机大战4-我的子弹
    飞机大战3-我的飞机
    飞机大战1-分析设计
    继承
    常见题
    42个例子算法
    心跳
    tomcat
    service
    URI URL
  • 原文地址:https://www.cnblogs.com/yangang92/p/5866483.html
Copyright © 2011-2022 走看看