题目链接：https://vjudge.net/contest/355760 password：123
HDU--2010:
#include<cstdio>
int main(void){
int m,n,count,i,t;
while(scanf("%d%d",&m,&n)!=EOF)
count=0;
for(i=m;i<=n;i++){
int sum=0;
t=i;
while(t){
int t2=t%10;
sum+=t2*t2*t2;
t/=10;
}
if(sum==i){
if(count>0)
printf(" ");
printf("%d",i);
count++;
}
}
if(count==0)
printf("no\n");
}
}
/*Sample Input
100 120
300 380
Sample Output
no
370 371*/ HDU--2011:
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
int main(){
int t,n,flag;
scanf("%d",&t);
while(t--){
double sum=0;
flag=-1;
scanf("%d",&n);
for(int i=1;i<=n;i++){
flag=-flag;
sum+=flag*(1.0/i);
}
printf("%.2lf\n",sum);
}
}
/*Sample Input
2
1 2
Sample Output
1.00
0.50*/HDU--2012:
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
bool check(int n){
for(int i=2;i<=sqrt(n);i++){
if(n%i==0)
return false;
}
return true;
}
int main(){
int x,y;
while(scanf("%d%d",&x,&y)){
if(x==0&&y==0) break;
bool flag=true;
for(int i=x;i<=y;i++)
if(check(i*i+i+41)==false){
flag=false;
break;
}
if(flag)
printf("OK\n");
else
printf("Sorry\n");
}
}
/*Sample Input
0 1
0 0
Sample Output
OK*/
HDU--2013:
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n,a[30+10];
void init(){
a[0]=0;
a[1]=1;
for(int i=2;i<=30;i++)
a[i]=2*a[i-1]+2;
}
int main(){
init();
while(scanf("%d",&n)!=EOF){
printf("%d\n",a[n]);
}
}
/*Sample Input
2
4
Sample Output
4
22
*/HDU--2014:
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n,a[100+10];
int main(){
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
double sum=0;
for(int i=1;i<n-1;i++)
sum+=a[i];
printf("%.2lf\n",sum/(n-2));
}
return 10;
}/*Sample Input
3 99 98 97
4 100 99 98 97
Sample Output
98.00
98.50*/ WULIAOWULIAO
