zoj 3681 E

zoj 3681 E

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <vector>#include <bitset>#include <algorithm>using namespace std;#define rep(i,a,b) for(int i = a; i < b; ++i)typedef long long ll;const int N = 1000000;const int MOD = 1000000007;int n,m;vector<int> fac;void get_fac(int v) { fac.clear(); for(int i = 1; i*i <= v; ++i) { if(v % i == 0) { fac.push_back(i); if(v != i*i) fac.push_back(v/i); } } sort(fac.begin(), fac.end());}ll dp[N];int DP() { rep(i,0,(int)fac.size()) dp[i] = -1; int len = fac.size(); for(int i = 0; i < len; ++i) { dp[i] = fac[i]/2 + 1; int v = fac[i]; for(int j = 0; j < len && fac[j]<= v; ++j) { if(v % fac[j] == 0) { int x = v/fac[j]; ll tmp_value = (x/2 + 1)*dp[j]; dp[i] = min(dp[i], tmp_value); } } } return dp[len-1];}int main() { while(cin >> n >> m) { get_fac(n); int ans = DP(); if(m >= ans) puts("Yes"); else puts("No"); printf("%dn", ans); }}