數(shù)據(jù)結構與算法試驗題答案

本文格式為Word版，下載可任意編輯——數(shù)據(jù)結構與算法試驗題答案A裝箱問題模擬（20）

源碼：

#include#includeusingnamespacestd;

charbox[1010];

intmain(){

memset(box,100,sizeof(box));intN;intt;

intnum=0;cin>>N;

inttemp=N;while(temp--){

cin>>t;

for(inti=0;i=t){

if(a==100)num++;

box[i]-=t;

cout#include#includeusingnamespacestd;

stacksta;

intmain(){

strings;

stringanwser;cin>>s;

inti;

boolnumber=false;boolfirstFlag=true;stringsnum=\

for(i=0;i='0'snum+=s[i];}

elseif(number==true){

number=false;if(firstFlag)

firstFlag=false;else

anwser+=\if(snum[0]=='+')

snum.erase(snum.begin());anwser+=snum;

snum=\}

if(s[i]=='+'||s[i]=='-'){

if(i==0||

s[i-1]=='+'||s[i-1]=='-'||

s[i-1]=='*'||s[i-1]=='/'||s[i-1]=='(')snum+=s[i];else{

while(sta.size()if(firstFlag)

firstFlag=false;else

anwser+=\anwser+=t;sta.pop();}

sta.push(s[i]);}}

elseif(s[i]=='*'||s[i]=='/'){

while(sta.size()

if(t=='-'||t=='+')break;if(firstFlag)

firstFlag=false;else

anwser+=\anwser+=sta.top();sta.pop();}

sta.push(s[i]);}

elseif(s[i]==')'){

while(sta.size()else

anwser+=\anwser+=sta.top();sta.pop();

}

if(sta.size())sta.pop();}

elseif(s[i]=='(')sta.push(s[i]);}

if(snum!=\{

if(firstFlag)

firstFlag=false;else

anwser+=\anwser+=snum;}

while(sta.size()){

if(firstFlag)

firstFlag=false;else

anwser+=\anwser+=sta.top();sta.pop();}

cout#include#includeusingnamespacestd;

structPerson{

stringname;intlevel;};

intmain(){

//freopen(\ios_base::sync_with_stdio(0);//cin.tie(0);

vectorfamily_tree;intn,m;cin>>n>>m;while(n--){

if(cin.get()!='\\n')cin.unget();ints_cnt=0;

while(cin.get()=='')++s_cnt;cin.unget();Personpe_tmp;

pe_tmp.level=s_cnt;cin>>pe_;

family_tree.push_back(pe_tmp);}

//for(vector::iterator

it=family_tree.begin();it!=family_tree.end();++it)//{

//coutnamelevel>name_a;intcount=6;

while(count--)cin.get();charch;cin.get(ch);

if(ch=='c'||ch=='e'){

relation=