奇安信2019校招笔试题（三）

设有递归算法如下：

#include<stido.h>
int f(int x)
{
   int y
   if(x==1)
      y=2
   else
     y=x/2+f(x-1)
     return y
}

NSTimer *myTimer = [NSTimer timerWithTimeInterval:1.0 target:self selector:@selector(doSomeThing:) userInfo:nil repeats:YES] 
[myTimer fire]

NSString *str = @“lanou”
[str retain]
NSLog(@“%lu”,str.retainCount)

<input type="button" value="添加节点" id="btn" />
 <div id="info"></div>
 <script>
 document.getElementById("btn").onclick=function(){
     var obj=document.createElement("img")
     obj.setAttribute("src","1.png")
     obj.setAttribute("width","200px")        
     document.getElementById("info").appendChild(obj)
 }   
  </script>

list:[
     {
      name:'apple',
      price:34
     },{
      name:'banana',
      price:50
     },{
      name:'orange',
      price:70
     }
    ]

有下列程序，则程序运行后，文件date.txt内写入的内容是（）

#include#includeusing namespace stdstruct Date{     char mo, da, yr  }int main(){   Date dt1= {'A','0','C'}ofstream tfile1("date.txt")tfile1.write((char *) &dt1, sizeof dt1)tfile1.close()Date dt2ifstream tfile2("date.txt")tfile2.read ((char *) &dt2, sizeof dt2)cout<<dt2.mo<<dt2.da<<dt2.yr<<endltfile2.close()}

有下列程序，程序运行后，文件test1.txt中写入的内容是**##，请将横线处缺失程序补充完整（）

#include#includeusing namespace stdvoid main(){ofstream file1("test1.txt")file1 << ""
file1.close()
char ch
ifstream file2("test1.txt")
while (file2.get(ch))
cout << ch
file2.close()
file1.open("test1.txt",          )
file1 <<"##"
file1.close()
}

class R
{
public:
R(){i= 5}
R(     ){i= x}
void show()  { cout<<i<<" " }
private:
int i
}
int main()
{
R R1
R R2(10)
R1.show()
R2.show()
return 0
}

class A
{
public:
   virtual void print(){cout<<"A::" <<endl}
}
class C:public A
{
public:
  void print(){cout<<"C::" <<endl}
}   
int main()
{
     A *ptrA
     C *ptrC=new C()
     ptrA= static_cast<A*>(ptrC)
  ptrA->print()
  return 0
}

class B
{
public:
virtual void foo(){cout<<"B::"}
} 
class D:public B
{
public:
virtual void foo(){cout<<"D::"}
}
int main()
{   
   D *pb=new D
         =dynamic_cast<D &>(*pb)
   p2.foo()
 return 0
}

下列程序的运行结果是（）

#includeusing namespace stdclass base {public:int nbase(int x) { n = x}virtual void set(int m) { n = m cout << n <<' '}}class deriveA:public base{public:deriveA(int x):base(x) { }void set(int m) { n += m cout << n <<' '}}class deriveB:public base{public:deriveB(int x):base(x) { }void set(int m) { n +=m cout <<n << ' '}}void f(base p){p.set(0)}int main()
{
     deriveA d1(1)
     deriveB d2(3)
     f(d1)
  f(d2)
     return 0
}

下列程序的运行结果是（）

#includeusing namespace stdclass B{public:void show(){cout<<"B"}}class D:public B{public:void show(){cout<<"D"}}void fun1(B ptr){ptr.show()}void fun2(B &ref){ref.show()}void fun3(B b){b->show()}
int main()
{
B b,int main(){B b,p=new DD dfun1(b)fun2(d)fun3(p)return 0}

下列程序的运行结果是1 2 3 4 3 6 5，请将横线处缺失程序补充完整（）

#include#include#includeusing namespace stdint main()
{
 int iarray[]={1,1,2,7,4,6,5}
 vectorivector(iarray,iarray+sizeof(iarray)/sizeof(int))
 ivector[0]=adjacent_find(ivector.begin(),ivector.end())
 ivector[1]=count(ivector.begin(),ivector.end(),1)
 ivector[2]=count_if(ivector.begin(),ivector.end(),bind2nd(less(),       ))
 ivector[3]=find(ivector.begin(),ivector.end(),4)
 ivector[4]=*find_if(ivector.begin(),ivector.end(),bind2nd(greater(),2))
 for(int i=0i<ivector.size()i++)
  cout<<ivector[i]<<" "
   return 0
}ivector[0]=adjacent_find(ivector.begin(),ivector.end())
 ivector[1]=count(ivector.begin(),ivector.end(),1)
 ivector[2]=count_if(ivector.begin(),ivector.end(),bind2nd(less(),       ))
 ivector[3]=ivector[1]=count(ivector.begin(),ivector.end(),1)ivector[2]=count_if(ivector.begin(),ivector.end(),bind2nd(less(),       ))
 ivector[3]=ivector[3]=find(ivector.begin(),ivector.end(),4)ivector[4]=*find_if(ivector.begin(),ivector.end(),bind2nd(greater(),2))
 for(int i=0i<ivector.size()i++)
  cout<<ivector[i]<<" "
   return 0
}for(int i=0i<ivector.size()i++)cout<<ivector[i]<<" "return 0}

下列程序的运行结果是6641，请将横线处缺失程序补充完整（）

#include#include#includeusing namespace stdint main(){int iarray[]={1,1,2,7,4,6,5}vectorivector(iarray,iarray+sizeof(iarray)/sizeof(int))
 int iarray1[]={2,7}
 vectorivector1(iarray1,iarray1+sizeof(iarray1)/sizeof(int))
 int iarray2[]={4,6}
 vectorivector2(iarray2,iarray2+sizeof(iarray2)/sizeof(int))
 cout<<(find_end(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<(find_first_of(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())
 cout<<search_n(ivector.begin(),ivector.end(),       equal_to())<<endl
   return 0
}int iarray1[]={2,7}vectorivector1(iarray1,iarray1+sizeof(iarray1)/sizeof(int))
 int iarray2[]={4,6}
 vectorivector2(iarray2,iarray2+sizeof(iarray2)/sizeof(int))
 cout<<(find_end(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<(find_first_of(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())
 cout<<search_n(ivector.begin(),ivector.end(),       equal_to())<<endl
   return 0
}int iarray2[]={4,6}vectorivector2(iarray2,iarray2+sizeof(iarray2)/sizeof(int))
 cout<<(find_end(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<(find_first_of(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())
 cout<<search_n(ivector.begin(),ivector.end(),       equal_to())<<endl
   return 0
}cout<<(find_end(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)
 cout<<cout<<(find_first_of(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)cout<<search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())
 cout<<cout<<search_n(ivector.begin(),ivector.end(),       equal_to())<<endl
   return 0
}return 0}