STL sort排序
这里写代码片
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[] = {2,5,4,1,3};
sort(a , a+5);
for(int i = 0; i < 5; i++
cout<<a[i]<<" ";
return 0;
}
vector容器
#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int>myv;
vector<int>::iterator it;
myv.push_back(1);
it = myv.begin();
myv.insert(it,2);
myv.push_back(3);
myv.push_back(4);
it = myv.end();
it--;
myv.erase(it);
for (it = myv.begin(); it != myv.end(); ++it)
cout<<*it<<" ";
return 0;
}
递归
#include<iostream>
using namespace std;
int fun(int n);
int main()
{
int n,m;
cin>>n;
fun(n);
cout<<fun(n);
return 0;
}
int fun(int a)
{
if(a < 0)
return 0;
if(a == 0)
return 1;
if(a > 0)
return fun(a-2)+fun(a-4)+fun(a-5);
}