第一题:如果暴力解的话,会超时。这里注意long long,不然long long 转到int会丢数据,导致结果不正确 vector<long> FarmerNN(int n, long long m) { // write code here vector<long> tian(n, 0); long long yushu = m % (2 * (n - 1)); long long sum = (m- yushu )/ (2 * (n - 1)); tian[0] = sum; tian[n-1] = sum; sum = 2 * sum; for (int i =...