大疆校招笔试题及参考(一个小编程题).docx

大疆科技的校招笔试题（的一个小编程题）底下的答案仅供参考。//两个小车，走一步能量消耗1，方向为1向右，-1为向左，首先输入路途长度，然后输入两行，每行第一个为小车的能量，第二个位小车起始位置，第三个为方向。求几个小车可以走出去？#include iostream#include vectorusing namespace std;int Many(vectorint ve,int len){if(ve.size() 6 || len = 0)return 0;int end = 0;int power_a = ve[0];int local_a = ve[1];int direc_a = ve[2];int power_b = ve[3];int local_b = ve[4];int direc_b = ve[5];while(power_a 0 || power_b 0){if(direc_a == direc_b){if(direc_a == 1){if(local_a + 1 == local_b power_b == 0){if(power_a 1){local_a++;local_b++;power_a -= 2;}}if(power_a 0){local_a++;power_a--;}if(power_b 0){local_b++;power_b--;}}else{if(local_a + 1 == local_b power_a == 0){if(power_b 1){local_a--;local_b--;power_a -= 2;}}if(power_a 0){local_a--;power_a--;}if(power_b 0){local_b--;power_b--;}}}else{if(local_a 0 || local_a len-1)power_a = 0;if(local_b 0 || local_b len-1)power_b = 0;if(abs(local_a - local_b) == 2 direc_a == 1 direc_b == -1){power_a -= 2;power_b -= 2;}else{if(abs(local_a - local_b) == 1){if(direc_a == 1 direc_b == -1){local_a--;local_b++;power_a -= 2;power_b -= 2;}else{local_a --;local_b++;power_a --;power_b++;}}else{if(direc_a == -1){local_a --;power_a--;}else{local_a++;power_a--;}if(direc_b == -1){local_b --;power_b--;}else{local_b++;power_b--;}}}}}if(local_a 0 || local_a len-1)end++;if(local_b 0 || local_b len-1)end++;return end;}int main(){vectorint ve;int len;cinlen;int tmp;for(int i = 0; i 6; ++i){cintmp;ve.push_back(tmp);}coutMany(ve,len)endl;}//一共N种花，插花需要每次选M种，每种R支。第二行输入每种花个数，求最多有多少种插花方法。#include iostream#include vector#include algorithmusing namespace std;bool fun(vectorint ve,int m){int i = ve.size()-1;int num = 0;for(; i = 0; --i){if(ve[i] != 0)num++;elsebreak;}if(num m)return false;return true;}int Many(vectorint ve,int n,int m,int r,int num){if(ve.size() = 0 || n = 0 || m = 0 || r = 0)return 0;int end = 0;int i = ve.size()-1;while(fun(ve,m)){int size = i;sort(ve.begin(),ve.end());for(int j = 0; j m; ++j){ve[size] --;size--;}end++;num -= m;}return end;}int ma