有事没事切切水题,有益身体健康。心烦意乱切切水题,调节气息。
题目来源:http://acm.hdu.edu.cn/listproblem.php?vol=11
code:
/*2000:ASCII码排序:直接模拟*/
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
char min,str[3];
while(scanf("%c%c%c",&str[0],&str[1],&str[2])!=EOF){
for(int i=0;i<3;i++){
if(str[0]>str[1]){
min=str[1];
str[1]=str[0];
str[0]=min;
}
if(str[0]>str[2]){
min=str[2];
str[2]=str[0];
str[0]=min;
}
if(str[2]<str[1]){
min=str[2];
str[2]=str[1];
str[1]=min;
}
}
printf("%c %c %c\n",str[0],str[1],str[2]);
getchar();
}
return 0;
}
/*2001:计算两点间的距离*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
double a,b,c,d;
int main(){
while(scanf("%lf%lf%lf%lf",&a,&b,&c,&d)!=EOF){
double ans=sqrt((a-c)*(a-c)+(b-d)*(b-d));
printf("%.2f\n",ans);
}
return 0;
}
/*2002:计算球体积*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define PI 3.1415927
const double Pii=4*PI/3;
double r;
int main(){
while(scanf("%lf",&r)!=EOF){
double v=Pii*r*r*r;
printf("%.3f\n",v);
}
return 0;
}
/*2003:求绝对值*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
double num;
double ABS(double x){return x<0.0?-x:x;}
int main(){
while(scanf("%lf",&num)!=EOF){
double ans=ABS(num);
printf("%.2f\n",ans);
}
return 0;
}
/*2004:成绩转换*/
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int t;
while(scanf("%d",&t)!=EOF){
if(t>=0 && t<=59){printf("E\n");}
else if(t>=60 && t<=69){printf("D\n");}
else if(t>=70 && t<=79){printf("C\n");}
else if(t>=80 && t<=89){printf("B\n");}
else if(t>=90 && t<=100){printf("A\n");}
else printf("Score is error!\n");
}
return 0;
}
/*2005:第几天?:switch的用法*/
#include <iostream>
#include <cstdio>
using namespace std;
int year,month,day,ans;
int main(){
while(scanf("%d/%d/%d",&year,&month,&day)!=EOF){
ans=0;
switch(month-1){
case 11: ans+=30;
case 10: ans+=31;
case 9: ans+=30;
case 8: ans+=31;
case 7: ans+=31;
case 6: ans+=30;
case 5: ans+=31;
case 4: ans+=30;
case 3: ans+=31;
case 2: if((year%4==0&&year%100!=0)||(year%400==0)) ans+=29;
else ans+=28;
case 1: ans+=31;
}
ans+=day;
printf("%d\n",ans);
}
return 0;
}
/*2006:求奇数的乘积*/
#include <iostream>
#include <cstdio>
using namespace std;
int n,val,ans;
int main(){
while(scanf("%d",&n)!=EOF){
ans=1;
for(int i=0;i<n;i++){
scanf("%d",&val);
if(val%2!=0) ans*=val;
}
printf("%d\n",ans);
}
return 0;
}
/*2007:平方和与立方和*/
#include <iostream>
#include <cstdio>
using namespace std;
int m,n,x,y;
int main(){
while(scanf("%d%d",&m,&n)!=EOF){
x=0;y=0;
if(m>n){
int temp=m;
m=n;
n=temp;
}
for(int i=m;i<=n;i++){
if(i%2==0)
x+=i*i;
else
y+=i*i*i;
}
printf("%d %d\n",x,y);
}
return 0;
}
/*2008:数值统计:正数、负数、0分别统计*/
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 100+10;
int n,a,b,c;
double val;
int main(){
while(scanf("%d",&n)!=EOF && n){
a=0;b=0;c=0;
for(int i=0;i<n;i++){
scanf("%lf",&val);
if(val<0) a++;
else if(val==0) b++;
else c++;
}
printf("%d %d %d\n",a,b,c);
}
return 0;
}
/*2009:求数列的和*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int n,m;
double ans,tmp;
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
ans=0.0;
tmp=n;
for(int i=0;i<m;i++){
ans+=tmp;
tmp=sqrt(tmp);
}
printf("%.2lf\n",ans);
}
return 0;
}
/*2010:水仙花数*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int MAXN = 1000;
int n,m,k;
bool flag;
int arr[MAXN];
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
k=0;flag=false;
for(int i=n;i<=m;i++){
int a=i/100;
int b=i/10%10;
int c=i%10;
if(i==a*a*a+b*b*b+c*c*c){
arr[k++]=i;
flag=true;
}
}
for(int i=0;i<k-1;i++)
if(arr[i]!=0) printf("%d ",arr[i]);
if(arr[k-1]!=0) printf("%d\n",arr[k-1]);
if(!flag) printf("no\n");
}
return 0;
}
/*2011:多项式求和:模拟*/
#include <iostream>
#include <cstdio>
using namespace std;
int num,m;
double sum;
int main(){
scanf("%d",&m);
while(m--){
sum=0.0;
scanf("%d",&num);
for(double i=1;i<=num;i++){
if((int)i%2==0)
sum-=1/i;
else
sum+=1/i;
}
printf("%.2lf\n",sum);
}
return 0;
}
/*2012:素数判定*/
#include <iostream>
#include <cstdio>
using namespace std;
int x,y,n;
bool flag;
int is_prime(int x){
for(int i=2;i*i<=x;i++)
if(x%i==0) return 0;
return 1;
}
int main(){
while(scanf("%d%d",&x,&y)!=EOF && (x||y)){
flag=false;
for(int i=x;i<=y;i++){
n=i*i+i+41;
if(!is_prime(n)){
printf("Sorry\n");
flag=true;
break;
}
}
if(!flag) printf("OK\n");
}
return 0;
}
/*2013:蟠桃记:反推即可得*/
#include <iostream>
#include <cstdio>
using namespace std;
int n,sum;
int main(){
while(scanf("%d",&n)!=EOF){
sum=1;
for(int i=1;i<n;i++){
sum=(sum+1)*2;
}
printf("%d\n",sum);
}
return 0;
}
/*2014:青年歌手大奖赛_评委会打分:直接模拟*/
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 100+10;
int n,arr[MAXN];
double sum;
int main(){
while(scanf("%d",&n)!=EOF){
sum=0.0;
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
sort(arr,arr+n);
for(int i=1;i<n-1;i++)
sum+=arr[i];
printf("%.2lf\n",sum/(n-2));
}
return 0;
}
/*2015:偶数求和:模拟*/
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 100+10;
int n,m,tmp1,tmp2,sum;
int arr[MAXN];
void doublenum(){
int k=0;
for(int i=2;i<=200;i++){
if(i%2==0) arr[k++]=i;
}
}
int main(){
doublenum();
while(scanf("%d%d",&n,&m)!=EOF){
tmp1=n%m;
tmp2=n/m;
if(tmp1!=0){
for(int i=0;i<tmp2;++i){
sum=0;
for(int j=i*m;j<(i+1)*m;j++)
sum+=arr[j];
printf("%d ",sum/m);
}
sum=0;
for(int i=n-1;i>n-tmp1-1;i--)
sum+=arr[i];
printf("%d\n",sum/tmp1);
}
else{
for(int i=0;i<tmp2-1;i++){
sum=0;
for(int j=i*m;j<(i+1)*m;j++)
sum+=arr[j];
printf("%d ",sum/m);
}
sum=0;
for(int i=n-1;i>n-m-1;i--)
sum+=arr[i];
printf("%d\n",sum/m);
}
}
return 0;
}
/*2016:数据的交换输出*/
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN= 100+5;
const int INF = 0x3fffffff;
int n,arr[MAXN],minn,tmp;
int main(){
while(scanf("%d",&n)!=EOF && n){
minn=INF;
int pos;
for(int i=0;i<n;i++){
scanf("%d",&arr[i]);
if(minn>arr[i]){
minn=arr[pos=i];
}
}
tmp=arr[0];
arr[0]=minn;
arr[pos]=tmp;
for(int i=0;i<n-1;i++)
printf("%d ",arr[i]);
printf("%d\n",arr[n-1]);
}
return 0;
}
/*2017:字符串统计:计数*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
string str;
int n,cnt;
int main(){
scanf("%d",&n);
while(n--){
cnt=0;
cin>>str;
for(int i=0;i<str.size();i++)
if(str[i]>='0' && str[i]<='9')
cnt++;
printf("%d\n",cnt);
}
return 0;
}
/*2018:母牛的故事:找规律*/
#include <iostream>
#include <cstdio>
using namespace std;
int n;
int f(int a){
if(a>0 &&a<5) return a;
else return f(a-1)+f(a-3);
}
int main(){
while(scanf("%d",&n)!=EOF && n)
printf("%d\n",f(n));
return 0;
}
/*2019:数列有序!:优先队列*/
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main(){
int n,m,data;
priority_queue<int,vector<int>,greater<int> > q;
while(scanf("%d%d",&n,&m)!=EOF && (n||m)){
for(int i=0;i<n;i++){
cin>>data;
q.push(data);
}
q.push(m);
while(!q.empty() && q.size()>1){
cout<<q.top()<<' ';
q.pop();
}
cout<<q.top()<<endl;
q.pop();
}
return 0;
}
/*2020:绝对值排序:sort的用法,主要在于cmp()*/
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 100+10;
int n,arr[MAXN];
int cmp(const int a,const int b){return abs(a)>abs(b);}
int main(){
while(scanf("%d",&n)!=EOF && n){
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
sort(arr,arr+n,cmp);
for(int i=0;i<n-1;i++)
printf("%d ",arr[i]);
printf("%d\n",arr[n-1]);
}
return 0;
}