#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int i,j;
cin>>i;
j=i;
while(i)
{
cin>>i;
if(i>j) j=i;
}
cout<<j<<endl;
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int n;
int i,j,sum=0,flag;
cin>>n;
cout<<2<<' '<<3<<' ';
for(i=2;i<n;i++)
{
for(j=2;j<=n/2;j++)
if(i%j==0) flag=0;
if(flag)
{ sum+=1;
cout<<i<<' ';
}
flag=1;
}
sum+=2;
cout<<"共"<<sum<<"个";
return 0;
}
#include "stdafx.h"
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double n;
double i,t,s=0;
cin>>n;
for(i=1;i<=n;i+=1)
{
t=1/(3*i-2);
s+=t;
}
cout<<s;
return 0;
}
#include "stdafx.h"
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
int i,t=0,s=0,a,m;
for(i=1;i<n;i*=10)
if(n/i!=0) t+=1;
a=pow(10,(double)t-1);
while(a)
{
m=int(n/a);
if(m%2==0) s+=m;
n=n-a*m;
a=a/10;
}
cout<<s;
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int i,top,bottom;
for(i=1000;i<9999;i++)
{
top=i/100;
bottom=i-100*top;
if(pow(top+bottom,(double)2)==i) cout<<i<<' ';
}
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int n;
int i,j,s=0;
cin>>n;
for(i=2;i<=n;i++)
{
for(j=1;j<=i/2;j++)
if(i%j==0) s+=j;
if(i==s) cout<<i<<' ';
s=0;
}
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int m,n;
cin>>m>>n;
int i,t,a;
if(m>n)
{
t=n;
n=m;
m=t;
}
for(i=1;i<=m;i++)
if(m%i==0&&n%i==0) a=i;
cout<<a;
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
cout<<" 进制转换器"<<endl;
cout<<"* 1.将该数转换为二进制 *"<<endl;
cout<<"* 2.将该数转换为八进制 *"<<endl;
cout<<"* 3.将该数转换为十六进制 *"<<endl<<endl;
cout<<"请输入待转化的十进制数:";
int d;
cin>>d;
cout<<"请输入待执行的操作:";
int choice;
cin>>choice;
int j,k;
char b[32];
void convert(int d,char res[],int &k,int j);
if (choice==1) j=2;
else if(choice==2) j=8;
else if(choice==3) j=16;
switch(choice)
{
case 1:convert(d,b,k,j);break;
case 2:convert(d,b,k,j);break;
case 3:convert(d,b,k,j);break;
}
getchar();
getchar();
return 0;
}
void convert(int d,char res[],int &k,int j)
{
int i;
k=0;
while(d)
{
res[k]=d%j+'0';
if(res[k]>'9') res[k]+=7;
d/=j;
k++;
}
for(i=k-1;i>=0;i--)
cout<<res[i];
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int i,j,k;
for(i=1;i<=5;i++)
{
for(k=30-i;k>0;k--) cout<<' ';
for(j=1;j<=(2*i-1);j++)
cout<<i;
cout<<endl;
}
for(i=4;i>0;i--)
{
for(k=30-i;k>0;k--) cout<<' ';
for(j=(2*i-1);j>0;j--)
cout<<i;
cout<<endl;
}
getchar();
getchar();
return 0;
}
#include "stdafx.h"
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int m;
bool huiwen(int);
for(m=11;m<1000;m++)
if(huiwen(m) && huiwen(pow((double)m,2)) && huiwen(pow((double)m,3))) cout<<m<<' ';
getchar();
getchar();
return 0;
}
bool huiwen(int x)
{
int k,t,s=0;
t=x;
while(x)
{
k=x%10;
x=x/10;
s=s*10+k;
}
if(s==t) return 1;
else return 0;
}
#include "stdafx.h"
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int s,a,b,c,d;
for(a=1;a<10;a++)
for(b=1;b<10;b++)
for(c=1;c<10;c++)
for(d=1;d<10;d++)
{
s=a*1000+b*100+c*10+d;
if(sqrt((double)s)==(int)sqrt((double)s)&&a==b&&c==d) cout<<s<<' ';
}
getchar();
getchar();
return 0;
}
#include "stdafx.h"
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n;
for(n=0;n<=1000000;n++)
if(sqrt((double)n+100)==(int)(sqrt((double)n+100))&&sqrt((double)n+268)==(int)sqrt((double)n+268))cout<<n<<' ';
getchar();
getchar();
return 0;
}
#include "stdafx.h"
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int i,t=0,n;
for(i=1;i<100000;i++)
{
n=i;
while(n)
{
n=n/10;
t++;
}
if((i*i-i) % (int)pow(10.0,(int)t)==0) cout<<i<<' ';
t=0;
}
getchar();
getchar();
return 0;
}
#include "stdafx.h"
#include <time.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
int main()
{
int a[20],i,n=0,p,flag=0;
time_t t;
srand((unsigned) time(&t));
while(n<20)
{
p=rand()%31+30;
for(i=0;i<n;i++)
{
if(p==a[i])
flag=1;
}
if(flag==0)
{
a[n]=p;
n++;
}
flag=0;
}
for(i=0;i<20;i++)
cout<<a[i]<<" ";
system("pause");
}
#include "StdAfx.h"
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
vector<string>name(10);
for(int i=0;i<10;i++)
cin>>name[i];
for(int i=0;i<10;i++)
name[i][0]-=32;
for(int i=0;i<10;i++)
cout<<name[i]<<' ';
system("pause");
}
#include "StdAfx.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct student
{
int number;
int course1;
int course2;
int course3;
int allcourse;
};
int main()
{
int n;
cin>>n;
vector<student>stu(n);
for(int i=0;i<n;i++)
{
cin>>stu[i].number>>stu[i].course1>>stu[i].course2>>stu[i].course3;
stu[i].allcourse=stu[i].course1+stu[i].course2+stu[i].course3;
}
for(int i=0;i<n-1;i++)
{
if(stu[i].allcourse>stu[i+1].allcourse)
{
student temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
else if(stu[i].allcourse=stu[i+1].allcourse)
{
if(stu[i].course1>stu[i+1].course1)
{
student temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
else if(stu[i].course1=stu[i+1].course1)
{
if(stu[i].course2>stu[i+1].course2)
{
student temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
else if(stu[i].course2=stu[i+1].course2)
{
if(stu[i].course3>stu[i+1].course3)
{
student temp=stu[i+1];
stu[i+1]=stu[i];
stu[i]=temp;
}
else ;
}
}
}
}
for(int i=0;i<n;i++)
{
cout<<stu[i].number<<' '<<stu[i].course1<<' '<<stu[i].course2<<' '<<stu[i].course3<<' '<<stu[i].allcourse<<endl;
}
system("pause");
}
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
struct point
{
double x;
double y;
double s;
};
bool cmp(const point &p1,const point &p2)
{
if(p1.s != p2.s)
return p1.s > p2.s;
else if(p1.x != p2.x)
return p1.x < p2.x;
else
return p1.y < p2.y;
}
int main()
{ int n;
cin>>n;
vector<point>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i].x>>v[i].y;
v[i].s=sqrt(v[i].x*v[i].x + v[i].y*v[i].y);
}
sort(v.begin(),v.end(),cmp);
for(int i=0;i<n;i++)
{
cout<<'('<<v[i].x<<','<<v[i].y<<')' <<endl;
}
system("pause");
}
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(const int &x1,const int &x2)
{
if(x1%10 != x2%10)
return x1%10 > x2%10;
else
return x1 > x2;
}
int main()
{ int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)
cin>>v[i];
sort(v.begin(),v.end(),cmp);
for(int i=0;i<n;i++)
cout<<v[i];
system("pause");
}
#include "StdAfx.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct student
{
int number;
int course1;
int course2;
int course3;
int allcourse;
bool operator <(const struct student &stu)const
{
if(allcourse != stu.allcourse)
return allcourse < stu.allcourse;
else if(course1 != stu.course1)
return course1 < stu.course1;
else if(course2 != stu.course2)
return course2 < stu.course2;
else
return course3 < stu.course3;
}
};
int main()
{
int n;
cin>>n;
vector<student>stu(n);
for(int i=0;i<n;i++)
{
cin>>stu[i].number>>stu[i].course1>>stu[i].course2>>stu[i].course3;
stu[i].allcourse=stu[i].course1+stu[i].course2+stu[i].course3;
}
sort(stu.begin(),stu.end());
for(int i=0;i<n;i++)
{
cout<<stu[i].number<<' '<<stu[i].course1<<' '<<stu[i].course2<<' '<<stu[i].course3<<' '<<stu[i].allcourse<<endl;
}
system("pause");
}
#include "StdAfx.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct student
{
int number;
int course1;
int course2;
int course3;
int allcourse;
};
bool cmp(const student &st1, const student &st2)
{
if (st1.allcourse != st2.allcourse)
return st1.allcourse < st2.allcourse;
else if (st1.course1 != st2.course1)
return st1.course1 < st2.course1;
else if (st1.course2 != st2.course2)
return st1.course2 < st2.course2;
else
return st1.course3 < st2.course3;
}
int main()
{
int n;
cin>>n;
vector<student>stu(n);
for(int i=0;i<n;i++)
{
cin>>stu[i].number>>stu[i].course1>>stu[i].course2>>stu[i].course3;
stu[i].allcourse=stu[i].course1+stu[i].course2+stu[i].course3;
}
sort(stu.begin(),stu.begin()+n,cmp);
for(int i=0;i<n;i++)
{
cout<<stu[i].number<<' '<<stu[i].course1<<' '<<stu[i].course2<<' '<<stu[i].course3<<' '<<stu[i].allcourse<<endl;
}
system("pause");
}