10_9.cpp

湖南大学ACM-OJ的部分题目代码

#include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
using namespace std;
void main()
{
	int iarray[]={0,1,2,3,4,5,6,6,6,7,8};
	vector<int>ivector(iarray,iarray+sizeof(iarray)/sizeof(int));
	int iarray1[]={6,6};
	vector<int>ivector1(iarray1,iarray1+sizeof(iarray1)/sizeof(int));
	int iarray2[]={5,6};
	vector<int>ivector2(iarray2,iarray2+sizeof(iarray2)/sizeof(int));
	int iarray3[]={0,1,2,3,4,5,7,7,7,9,7};
	vector<int>ivector3(iarray3,iarray3+sizeof(iarray3)/sizeof(int));

//	cout<<*adjacent_find(ivector.begin(),ivector.end())<<endl;

//	cout<<count(ivector.begin(),ivector.end(),6)<<endl;

//	cout<<count_if(ivector.begin(),ivector.end(),bind2nd(less<int>(),7))<<endl;

//	cout<<*find(ivector.begin(),ivector.end(),4)<<endl;

//	cout<<*find_if(ivector.begin(),ivector.end(),bind2nd(greater<int>(),2))<<endl;

//	cout<<*(find_end(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)<<endl;

//	cout<<*(find_first_of(ivector.begin(),ivector.end(),ivector1.begin(),ivector1.end())+3)<<endl;

//	cout<<*search(ivector.begin(),ivector.end(),ivector2.begin(),ivector2.end())<<endl;

//  cout<<*search_n(ivector.begin(),ivector.end(),3,6,equal_to<int>())<<endl;

//	cout<<equal(ivector.begin(),ivector.end(),ivector3.begin())<<endl;

	pair<int *,int *>result=mismatch(ivector.begin(),ivector.end(),ivector3.begin());
	cout<<result.first-ivector.begin()<<endl;
}