list容器
#include <iostream>
#include <list>
using namespace std;
int main()
{
list<int> list1;
list1.assign(1,13);
cout << *list1.begin() << endl;
cout <<list1.front() << endl;
list1.assign(5,20);
list1.insert(list1.end(),100);
list1.push_back(600);
list1.push_front(900);
cout << list1.size()<< endl;
list<int>::iterator i;
for(i=list1.begin();i!=list1.end();i++){
cout << *i << " ";
}
cout << endl;
list1.reverse();
for(i=list1.begin();i!=list1.end();i++){
cout << *i << " ";
}
cout << endl;
return 0;
}
#include <iostream>
using namespace std;
class Fun{
int a;
public:
Fun():a(0){};
void set(int a)//设置a的值
{
this->a = a;
}
int Sum()//计算1~a的和
{
int sum = 0;
int n=a;
while(n>=1){
sum+=n;
n--;
}
return sum;
}
int Porduct()//计算1~a的积
{
int Xun=1;
int n=a;
while(n>=1){
Xun*=n;
n--;
}
return Xun;
}
void PrimeNumber()//求1~a之间的质数
{
int n=a;
while(n>1){
if(n%2!=0){
cout << n << '\t' ;
}
n--;
}
cout << endl;
}
};
int main()
{
Fun s1;
s1.set(5);
cout << s1.Sum() << endl;
cout << s1.Porduct() << endl;
s1.PrimeNumber();
return 0;
}