zoukankan      html  css  js  c++  java
  • 6月24日代码

     1 #include<iostream>
     2 using namespace std;
     3 template<typename T>
     4 void swap(T &a,T &b)
     5 {
     6     T temp=a;
     7     a=b;
     8     b=temp;
     9 }
    10 int main()
    11 {
    12     double dx=3.5,dy=5.6;
    13     int ix=6,iy=7,ia=303,ib=505;
    14     string s1="good",s2="better";
    15     cout<<"double dx="<<dx<<",     dy="<<dy<<"
    ";
    16     cout<<"int    ix="<<ix<<",     iy="<<iy<<"
    ";
    17     cout<<"string s1=""<<s1<<"",   s2=""<<s2<<""
    ";
    18     swap(dx,dy);
    19     swap(ix,iy);
    20     swap(s1,s2);
    21     swap(ia,ib);
    22     cout<<"
    after swap:
    ";
    23     cout<<"double dx="<<dx<<",    dy="<<dy<<"
    ";
    24     cout<<"int   ix="<<ix<<",      iy="<<iy<<"
    ";
    25     cout<<"string s1=""<<s1<<"",s2=""<<s2<<""
    ";
    26 }
    View Code
     1 template<typename T>
     2 void swap(T &a,T &b)
     3 {
     4     T temp=a;
     5     a=b;
     6     b=temp;
     7 }
     8 int add(double a,double b)
     9 {
    10     return a+b;
    11 }
    12 int main()
    13 {
    14     int ia=3;
    15     double db=5.0;
    16     char s1[]="good",s2[]="better";
    17     int x=add(ia,db);
    18     /*swap(ia,db);
    19     swap(s1,s2);*/
    20 }
    21 //-------------------
    22 template<typename T>
    23 T max(T a,T b)
    24 {
    25     return a<b?b:a;
    26 }
    27 //const T&a与T const&a等价
    28 //----------------------------------------
    29 #include<iostream>
    30 template<typename T>
    31 T const& max(T const& a,T const& b)
    32 {
    33     return a<b?b:a;
    34 }
    35 int main()
    36 {
    37     int ia=3;
    38     double db=5.0;
    39     std::cout<<max<double>(ia,db)<<"
    ";
    40     std::cout<<max(static_cast<double>(ia),db)<<"
    ";
    41 }
    42 //--------------------------------------------
    43 #include<iostream>
    44 template<typename T>
    45 void swap(T &a,T&b)
    46 {
    47     T temp=a;
    48     a=b;
    49     b=temp;
    50 }
    51 int main()
    52 {
    53     int ia=3;
    54     const int cb=5;
    55     swap(ia,7);
    56     swap<int>(ia,7);
    57     swap(cb,7);
    58     swap<const int>(ia,7);
    59 }
    60 //----------------
    61 const char*const& max(const char*const&a,const char* const&b)
    62 {
    63     return std::strcmp(a,b)<0?b:a;
    64 }
    65 //------------------
    66 void f(int *ix,int *iy,double *dx,double *dy)
    67 {
    68     int *ip=max(ix,iy);
    69     double *dp=max(dx,dy);
    70 }
    71 //-----------------------------------
    72 #include<iostream>
    73 template<typename T>
    74 T const& max(T const&a,T const&b)
    75 {
    76     return a<b?b:a;
    77 }
    78 template<typename T>
    79 T*const& max(T*const&a,T*const&b)
    80 {
    81     return *a<*b?b:a;
    82 }
    83 const char*const&max(const char* const&a,const char*const&b)
    84 {
    85     return std::strcmp(a,b)<0?b:a;
    86 }
    87 int main()
    88 {
    89     int ia=3,ib=7;
    90     char*s1="hello";
    91     char*s2="hell";
    92     std::cout<<*max(&ia,&ib)<<"
    ";
    93     std::cout<<max(s1,s2)<<"
    ";
    94     std::cout<<max(ia,ib)<<"
    ";
    95 }
    View Code
     1 #include<iostream>
     2 using namespace std;
     3 int main()
     4 {
     5     int score;
     6     int factor;
     7     char grade;
     8     cout<<"请输入一个0到100之间的整数,-1表示输入结束:"<<endl;
     9     cin>>score;
    10     while(score!=-1)
    11     {
    12         if(score>100||score<0)
    13         {
    14             cout<<"输入错误,请输入一个0到100之间的整数,-1表示输入结束:"<<endl;
    15             cin>>score;
    16         }
    17         else
    18         {
    19             factor=score/10;
    20             switch (factor)
    21             {
    22             case 10:
    23             case 9:grade='A';break;
    24             case 8:grade='B';break;
    25             case 7:grade='C';break;
    26             case 6:grade='D';break;
    27             default:grade='E';
    28                 break;
    29             }
    30             cout<<score<<"对应的分数等级为:"<<grade<<endl;
    31             cout<<"请输入一个0到100之间的整数,-1表示结束:"<<endl;
    32             cin>>score;
    33         }
    34     }
    35     if(score=-1)
    36         cout<<"输入结束!"<<endl;
    37     return 0;
    38 }
    View Code
     1 #include<iostream>
     2 using namespace std;
     3 int main()
     4 {
     5     int peachs=1;
     6     for(int i=1;i<10;i++)
     7     {
     8         peachs=(peachs+1)*2;
     9         cout<<""<<10-i<<"天桃子的个数为"<<peachs<<endl;
    10     }
    11     return 0;
    12 }
    View Code
     1 #include<iostream>
     2 using namespace std;
     3 int main()
     4 {
     5     const int n=8;
     6     int a[n]={0,0,0,0,0,0,0,0};
     7     int b[n]={0,0,0,0,0,0,0,0};
     8     int change;
     9     double average;
    10     int k,temp,sum=0;
    11     cout<<"请输入8个整数
    ";
    12     for(k=0;k<n;k++)
    13     {
    14         cin>>a[k];
    15         sum+=a[k];
    16     }
    17     
    18     cout<<"原始的输入为:
    ";
    19     for(k=0;k<n;k++)
    20         cout<<a[k]<<" ";
    21     cout<<endl;
    22 
    23     average=sum/8;
    24     cout<<"输入的平均值为:"<<average<<endl;
    25 
    26     change=n/2;
    27     for(k=0;k<change;k++)//方法
    28     {
    29         temp=a[k];
    30         a[k]=a[n-1-k];
    31         a[n-1-k]=temp;
    32     }
    33     cout<<"该数组的逆序输出为:
    ";
    34     for(k=0;k<n;k++)
    35         cout<<a[k]<<" ";
    36     cout<<"逆序输出结束:"<<endl;
    37     for(int mm=0;mm<n-1;mm++)
    38     {
    39         for(int nn=mm;nn<=n-1;nn++)
    40         if(a[mm]<a[nn+1])
    41         {
    42             temp=a[mm];
    43             a[mm]=a[nn+1];
    44             a[nn+1]=temp;
    45         }
    46     }
    47     cout<<"该数组从大到小排序后输出:
    ";
    48     for(k=0;k<n;k++)
    49         cout<<a[k]<<" ";
    50     cout<<endl;
    51     int i=0;
    52     int j=0;
    53     cout<<"删除数组中重复元素后的,新数组为:"<<endl;
    54     while(i<n)
    55     {
    56         b[j]=a[i];
    57         cout<<b[j]<<" ";
    58         i++;
    59         j++;
    60         while(a[i-1]==a[i])
    61             i++;
    62     }
    63     cout<<endl;
    64     return 0;
    65 }
    View Code
     1 #include<iostream>
     2 #include<fstream>
     3 #include<iomanip>
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     ifstream in("a.txt");
     9     double a[5][5]={0};
    10     double sum=0;
    11     cout<<"导入的矩阵:
    ";
    12     for(int i=0;i<5;i++)
    13     {
    14         for(int j=0;j<5;j++)
    15         {
    16             in>>a[i][j];
    17             cout<<setw(3)<<a[i][j];
    18             if((i==j)||(i+j==4))
    19             {
    20                 sum+=a[i][j];
    21             }
    22         }
    23         cout<<endl;
    24     }
    25         cout<<"nnj:"<<sum<<endl;
    26         return 0;
    27 }
    View Code
  • 相关阅读:
    程序活动记录&程序调试&多线程编程
    数据结构与算法
    C/C++
    Information Retrieval --- Retrieval Comment
    Information Retrieval --- Clustering
    Information Retrieval --- Classification
    Information Retrieval --- Web Search
    Information Retrieval --- Retrieval Enforce:Relevance Feedback & Query Expansion
    Information Retrieval --- Retrieval Model
    ubuntu server 安装vnc
  • 原文地址:https://www.cnblogs.com/herizai/p/3150702.html
Copyright © 2011-2022 走看看