刷题打卡：HDU2011-2020

直接贴源代码了

2011

#include<iostream>

using namespace std;

int main() {
    int m;
    cin>>m;
    
    while(m--){
        double n;
        double sum=0;
        cin>>n;
        for(double i=1;i<=n;i++){
            double x=1/i;
            if((int)i%2==0) {
                sum-=x;
            }
            else sum+=x;
        }
        printf("%.2lf\n",sum);
    }
    
    return 0;
}

2012

/* HDU2012 素数判定 */

#include <stdio.h>

#define fun(n) ((n) * (n) + (n) + 41)

/* 试除法判断一个整数是否为素数 */
int isnotprime(int n)
{
    if (n % 2 == 0) return 1;
    int i;
    for (i = 3; i *i<= n; i += 2)
        if (n % i == 0) break;
    return i*i > n ? 0 : 1;
}

int main()
{
    int x, y, i;
    while (scanf("%d%d", &x, &y) != EOF) {
        /* 判定结束条件（也可以现在while循环语句的条件中） */
        if (x == 0 && y == 0) break;

        /* 素数判定：对于x和y之间的所以数都进行判定 */
        for (i = x; i <= y; i++)
            if (isnotprime(fun(i))) break;

        /* 输出结果 */
        printf(i > y ? "OK\n" : "Sorry\n");
    }

    return 0;
}

2013

#include<iostream>

using namespace std;

int main() {
    int n;
    while(cin>>n){
        int y=(1+1)*2;
        int m=n-2;
        while(m--){
            y=(y+1)*2;
        }
        cout << y << endl;
        

    }
    return 0;
}

 2014

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int a[101];
int main() {
    int n;
    while(cin>>n){
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        sort(a,a+n);
        double average;
        double sum=0;
        for(int i=1;i<n-1;i++){
            sum+=a[i];
        }
        average=sum/(n-2);
        printf("%.2lf\n",average);
    }
    
    return 0;
}

 2015

#include<iostream>
#include<cstring>
using namespace std;
int average[105];
int main() {
    int n,m;
    while(cin>>n>>m){
        memset(average,0,sizeof(average));
        int a=2;
        int sum=0;
        int ans=0;
        for(int i=1;i<=n;i++){
            sum+=a;
            a+=2;
            
            if(i%m==0) {
                ++ans;
                average[ans]=sum/m;
                
                sum=0;
            }
        }
        if(n%m!=0){
                ++ans;
                average[ans]=sum/(n%m);       
        }
        for(int i=1;i<=ans;i++){
            cout << average[i] <<" ";
        }
        cout<<endl;
    }
    return 0;
}

2016

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[105],b[105];
int main() {
    int n;
    while(cin>>n,n){
        for(int i=0;i<n;i++){
            cin>>a[i];
            b[i]=a[i];
        }
        sort(a,a+n);
        int count=0;
        for(int i=0;i<n;i++){
            if(b[i]==a[0]) {
                count=i;
                break;
            }
        }
        swap(b[0],b[count]);
        for(int i=0;i<n;i++){
            cout <<b[i]  << " ";
        }
        cout<<endl;
    }
    return 0;
}

2017

#include<iostream>
#include<string.h>
//为啥string会报错
using namespace std;
char s[4096];
int main() {
    int n;
    
    while(cin>>n){

        while(n--){
            scanf("%s",s);
            int n=strlen(s);
            int count=0;
            for(int i=0;i<n;i++){
                if(s[i]>='0'&&s[i]<='9') count++;
            }
            cout << count << endl;
        }
    }
    return 0;
}

2018

#include<iostream>

using namespace std;
int f[60];
int main() {
    int n;
    for(int i=1;i<=55;i++){
        if(i<=4) f[i]=i;
        else{
            f[i]=f[i-1]+f[i-3];
        }
    }

    while(cin>>n,n){
        cout << f[n] << endl;
    }
    return 0;
}

2019

#include<iostream>
#include<algorithm>
using namespace std;
int a[106];
int main() {
    int n,m;
    while(cin>>n>>m,n,m){
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        a[n]=m;
        sort(a,a+n+1);
        for(int i=0;i<=n;i++){
            cout << a[i] << " ";
        }
        
    }
    return 0;
}

2020

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct Node{
    int num;
    int abs;
}a[105];
bool cmp(Node a,Node b){
    return a.abs>b.abs;
}
int main() {
    int n;
    while(cin>>n,n){
        for(int i=0;i<n;i++){
            cin>>a[i].num;
            a[i].abs=abs(a[i].num);
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n;i++){
            cout << a[i].num << " ";
        }
        cout<<endl;
    }
    return 0;
}