panda_wx的博客

#includeusing namespace std;void main(){ int sum=0,value=0; //读取数据直到文件尾，计算所有读入的值的和 while(cin>>value)  sum+=value; cout}

#include<iostream>using namespace std;#include<set>struct node{    node(int value = 0):v(value){}    int v;    node *next;};node *find(node *heada,node *headb){    set<node*&...

#include<iostream>using namespace std;#include<queque>class MyStack{public:    void push(int i);    void pop()    {        if(!data.empty())            data.pop();    }    i...

#includeusing namespace std;void Reverse(int ar[], int n){ int low = 0; int high = n-1; while(low  {  int tmp = ar[low];  ar[low] = ar[high];  ar[high] = tmp;  low++;  high--;

#includeusing namespace std;#define ROW 5#define COL 5void Show_Array(int ar[ROW][COL]){for(int i=0;i {  for(int j=0;j  {   cout  }  cout }}void Show_Snake(int ar[ROW][COL]

#includevoid main(){ int i,sum; i=50; sum=0; while(i {  sum+=i;  ++i; } cout}

#includeusing namespace std;int main(){ int value;//正在统计的数 int temp=0;//读入的新值 if(cin>>temp) {  int top=1;  while(cin>>value)   if(value==temp)   {    ++top;   }   else   

#include<iostream>using namespace std;#include<set>struct node{    node(int value = 0):v(value){}    int v;    node *next;};node *find(node *head){    set<node*> ss;    w...