七单元作业

#include<stdio.h>
#include<string.h>
int gcd(int a,int b);
int lcm(int a,int b);
void copy(char a[],char b[]);
void mpsort();
int P(int x,int n);
void shiliu();
int main(){
    //mpsort();
    //printf("%d",P(2,2));
    shiliu();
    return 0;
}


int gcd(int a,int b){
    return b?gcd(b, a%b):a;
}
int lcm(int a,int b){
    return a*b/gcd(a,b);
}
void copy(char a[],char b[]){
    int len,cur;
    len=strlen(a);
    cur=0;
    for(int i=0;i<len;i++){
        if(a[i]>='A'&&a[i]<='Z') b[cur++]=a[i];
    }
    for(int i=0;i<cur;i++)printf("%c",b[i]);
    printf("\n");
}
void mpsort(){
    int a[11],swp;
    for(int i=0;i<10;i++)scanf("%d",&a[i]);
    for(int i=9;i>=1;i--){
        for(int j=0;j<i;j++){
            if(a[j]>a[j+1]){
                swp=a[j];
                a[j]=a[j+1];
                a[j+1]=swp;
            }
        }
    }
    for(int i=0;i<10;i++)printf("%d ",a[i]);
}
int P(int x,int n){
    if(n==0)return 1;
    if(n==1)return x;
    return ((2*n-1)*x-P(x,n-1)-(n-1)*P(x,n-2))/n;
}
void shiliu(){
/*    int i;
    scanf("%x", &i ); 
    printf("%d\n", i ); 
*/
    char a[10];   
    int i=0,cur,sum=0;

    while(scanf("%c",&a[i]) != EOF ){
        if(a[i]>'9')cur=a[i]-55;
        else cur=a[i]-48;
        sum*=16;
        sum+=cur;
    } 
    printf("%d\n",sum);
}