一区二区三区黄色,久久尤物视频,欧美一区中文字幕

我爱c++ — Thu, 11 May 2006 22:46:00 GMT

#include
using namespace std;

typedef double DATA;

class bstree{
struct bnode{
  DATA d;
  bnode* left;
  bnode* right;
  bnode( const DATA& cd )
  :d(cd), left(NULL), right(NULL)
  {}
};
bnode* root;
int len;
bstree(const bstree& cb){}
bstree& operator=(const bstree& cb){return *this;}
void clear( bnode* & ptree ){
  if( ptree==NULL )
   return;
  clear( ptree->left );
  clear( ptree->right );
  delete ptree;
  ptree = NULL;
  len--;
}
void insert( bnode* & ptree, bnode* np ){
  if( ptree==NULL )
   ptree = np;
  else if( np->d < ptree->d )
   insert( ptree->left, np );
  else
   insert( ptree->right, np );
}
void show( bnode* ptree ){
  if( ptree==NULL )
   return;
  show( ptree->left );
  cout << ptree->d << ' ';
  show( ptree->right );
}
public:
bstree():len(0){ root=NULL; }
~bstree(){ clear(); }
void clear(){clear(root);}
void insert( const DATA& cd ){
  insert( root, new bnode(cd) );
  len++;
}
void show(){
  show( root );
  cout << endl;
}
int size(){ return len; }
bool empty(){ return root==NULL; }
};

int main()
{
bstree bs;
DATA d;
while( cin.peek()!='\n' ){
cin >> d;
bs.insert( d );
}
cout << bs.size() << " data:" << endl;
bs.show();
return 0;
}

我爱c++ 2006-05-12 06:46 发表评论

我爱c++ — Wed, 10 May 2006 15:28:00 GMT

#include using namespace std; typedef int DATA; const unsigned npos=(unsigned)-1; class clink{ struct node{ DATA d; node* next; node( const DATA& cd ) :d(cd), next(NULL) {} }; node* head; int len; public: clink():head(NULL),len(0){} ~clink(){ clear(); } node* & getp( unsigned pos ){ if( pos==0 || head==NULL ) return head; node* p = head; for( int i=1; inext ) p = p->next; else break; } return p->next; } void insert( const DATA& cd, unsigned pos=0 ){ node* & lp = getp( pos ); node* np = new node( cd ); np->next = lp; lp = np; len++; } friend ostream& operator<<( ostream& os, const clink& cc ) { os << "{ "; node* p = cc.head; while( p ){ os << p->d << ' '; p = p->next; } os << "} "; return os; } unsigned find( const DATA& cd ){ node* p = head; unsigned pos=0; while( p ){ if( p->d==cd ) return pos; pos++; p = p->next; } return npos; } bool update( const DATA& d1, const DATA& d2 ){ unsigned pos=find( d1 ); node* p; if( pos==npos ) return false; p = getp( pos ); p->d = d2; return true; } bool erase( const DATA& cd ){ unsigned pos=find( cd ); node* p; if( pos==npos ) return false; node* & lp = getp( pos ); p = lp; lp = lp->next; delete p; len--; return true; } int size(){ return len; } bool empty(){ return head==NULL; } void clear(){ node* p; while( head ){ p = head->next; delete head; head = p; } len = 0; } }; int main() { clink ol; cout << ol << endl; ol.insert( 10 ); ol.insert( 20, npos ); ol.insert( 30, 0 ); ol.insert( 40 ); ol.insert( 50, 1 ); cout << ol << endl; DATA d; cout << "input a DATA for search:" << endl; cin >> d; unsigned pos=ol.find( d ); if( pos==(unsigned)-1 ) cout << "not found!" << endl; else cout << "found at " << pos << endl; DATA nd; for( int i=0; i<3; i++ ){ cout << "input old data and new data:\n"; cin >> d >> nd; ol.update( d, nd ); cout << ol << endl; } for( int i=0; i<3; i++ ){ cout << "input a data to remove:" << endl; cin >> d; ol.erase( d ); cout << ol.size() << ol << endl; } cout << "is empty?" << ol.empty() << endl; ol.clear(); cout << "is empty?" << ol.empty() << endl; cout << ol.size() << ol << endl; return 0; }

我爱c++ 2006-05-10 23:28 发表评论

输入�q�月日得到当日的星期

我爱c++ — Tue, 09 May 2006 23:39:00 GMT

#include
int nian(int year);
int yue(int year,int month);
using namespace std;
//-------------------------------
void main()
{

        int year,month,day,sum,pp;
char x;
cout<<"Please input a day:year/month/day!";
cin>>year>>x>>month>>x>>day;
sum=nian(year)+yue(year,month)+day;
pp=sum%7;

switch(pp)
{
case 0:
    cout<<"Sunday"<    break;
case 1:
    cout<<"Monday"<    break;
case 2:cout<<"Tuesday"<    break;
case 3:cout<<"Wednesday"<    break;
case 4:cout<<"Thursday"<    break;
case 5:cout<<"Fiday"<    break;
case 6:cout<<"Saturday"<    break;

}
}
//-------------------------------------------

int nian(int year)
{
int i,sum_year=0;
for(i=1;i{
if((i%4==0&&i%100!=0)||(i%400==0))
sum_year+=366;
else
sum_year+=365;
}
return (sum_year);
}
//-------------------------------------------
int yue(int year,int month)
{int yue1,day1;
yue1=month-1;
if((year%4==0&&year%100!=0)||(year%400==0))
{
switch(yue1)
{
case 1:day1=31;break;
case 2:day1=31+29;break;
case 3:day1=31+29+31;break;
case 4:day1=31+29+31+30;break;
case 5:day1=31+29+31+30+31;break;
case 6:day1=31+29+31+30+31+30;break;
case 7:day1=31+29+31+30+31+30+31;break;
case 8:day1=31+29+31+30+31+30+31+31;break;
case 9:day1=31+29+31+30+31+30+31+31+30;break;
case 10:day1=31+29+31+30+31+30+31+31+30+31;break;
case 11:day1=31+29+31+30+31+30+31+31+30+31+30;break;
case 12:day1=31+29+31+30+31+30+31+31+30+31+30+31;break;
}
}
else
{
switch(yue1)
{
case 1:day1=31;break;
case 2:day1=31+28;break;
case 3:day1=31+28+31;break;
case 4:day1=31+28+31+30;break;
case 5:day1=31+28+31+30+31;break;
case 6:day1=31+28+31+30+31+30;break;
case 7:day1=31+28+31+30+31+30+31;break;
case 8:day1=31+28+31+30+31+30+31+31;break;
case 9:day1=31+28+31+30+31+30+31+31+30;break;
case 10:day1=31+28+31+30+31+30+31+31+30+31;break;
case 11:day1=31+28+31+30+31+30+31+31+30+31+30;break;
case 12:day1=31+28+31+30+31+30+31+31+30+31+30+31;break;
}
}

return (day1);
}

我爱c++ 2006-05-10 07:39 发表评论