杭电oj2028、2034、2035、2041、2043-2046

2028  Lowest Common Multiple Plus

#include<stdio.h>

int gcd(int a,int b){
    int temp,temp1;
    if(a<b){
        temp = a;
        a = b;
        b = temp;
    }
    while(a%b!=0){
        temp1 = a%b;
        a = b;
        b = temp1;
    }
    return b;
}

int main(){
    int n,s,i;
    long long k;
    while(scanf("%d",&n)!=EOF){
        k=1;
        for(i=0;i<n;i++){
            scanf("%d",&s);
            k = s*k/gcd(s,k);    
        }
        
        printf("%lld
",k);
    }
}

2034  人见人爱A-B

#include<stdio.h>
#include<string.h>

int main(){
    int n,m,i,j,num,flag,temp,s[101],o[101],p[101];
    while(~scanf("%d %d",&n,&m)){
        if(n==0&&m==0){break;}
        for(i=0;i<n;i++){scanf("%d",&s[i]);}
        for(i=0;i<m;i++){scanf("%d",&o[i]);}
        num = 0;
        for(i=0;i<n;i++){
            flag = 0;
            for(j=0;j<m;j++){
                if(s[i]==o[j]){flag=1;break;}
            }
            if(flag==0){p[num]=s[i];num++;}
        }
        if(num==0){printf("NULL
");continue;}
        for(i=0;i<num;i++){
            for(j=num-1;j>i;j--){
                if(p[i]>p[j]){
                    temp = p[i];
                    p[i] = p[j];
                    p[j] = temp;
                }
            }
        }
        for(i=0;i<num;i++){
            printf("%d ",p[i]);
        }
        printf("
");

    }
}

2035  人见人爱A^B

#include<stdio.h>

int main(){
    int n,m,i,mul;
    while(scanf("%d %d",&n,&m)!=EOF){
        if(n==0&&m==0){break;}
        mul = 1;
        for(i=0;i<m;i++){
            mul = mul * n % 1000;
        }
        printf("%d
",mul);
    }
}

2041  超级楼梯

#include<stdio.h>

int main(){
    int n,m,i,s[100];
    while(~scanf("%d",&n)){
        while(n--){
            scanf("%d",&m);
            s[1]=0;s[2]=1;s[3]=2;
            for(i=4;i<=m;i++){
                s[i] = s[i-1] + s[i-2];
            }
            printf("%d
",s[m]);
        }
    }
}

2043  密码

#include<stdio.h>
#include<string.h>


int main(){
    int n,len,i,j,flag1,flag2,flag3,flag4;
    char s[50][50];
    while(~scanf("%d",&n)){
        getchar();
        for(i=0;i<n;i++){
            gets(s[i]);
            len = strlen(s[i]);
            flag1=0;flag2=0;
            flag3=0;flag4=0;
            if(8>len||len>16){
                printf("NO
");
                continue;
            }
            else{
                for(j=0;s[i][j]!='';j++){
                    if(s[i][j]>='A'&&s[i][j]<='Z'){flag1 = 1;}
                    else if(s[i][j]>='a' && s[i][j]<='z'){flag2 = 1;}
                    else if(s[i][j]>='0' && s[i][j]<='9'){flag3 = 1;}
                    else if(s[i][j]=='~'||s[i][j]=='!'||s[i][j]=='@'||s[i][j]=='#'||s[i][j]=='$'||s[i][j]=='%'||s[i][j]=='^'){flag4 = 1;}
                }
                if(flag1+flag2+flag3+flag4>2){printf("YES
");}
                else{printf("NO
");}
            }
        }
    }
}

2044  一只小蜜蜂...

#include<stdio.h>
#include<string.h>


int main(){
    int n,a,b,i;
    _int64 s[51];
    while(~scanf("%d",&n)){
        while(n--){
            scanf("%d %d",&a,&b);
            s[1]=0;s[2]=1;s[3]=2;
            for(i=4;i<=b;i++){
                s[i] = s[i-1] + s[i-2];
            }
            printf("%I64d
",s[b-a+1]);
        }
        
    }
}

2045  不容易系列之(3)—— LELE的RPG难题

#include<stdio.h>


int main(){
    int n,i;
    _int64 s[51];
    while(~scanf("%d",&n)){
        s[1]=3;s[2]=6;s[3]=6;
        for(i=4;i<=n;i++){
            s[i] = s[i-1] + s[i-2]*2;
        }
        printf("%I64d
",s[n]);
    }
        
    
}

2046  骨牌铺方格

#include<stdio.h>


int main(){
    int n,i;
    _int64 s[51];
    while(~scanf("%d",&n)){
        s[1]=1;s[2]=2;
        for(i=3;i<=n;i++){
            s[i] = s[i-1] + s[i-2];
        }
        printf("%I64d
",s[n]);
    }
        
    
}