杭电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!=){
         temp1 = a%b;
         a = b;
         b = temp1;
     }
     return b;
 }
 
 int main(){
     int n,s,i;
     long long k;
     while(scanf("%d",&n)!=EOF){
         k=;
         for(i=;i<n;i++){
             scanf("%d",&s);
             k = s*k/gcd(s,k);
         }
 
         printf("%lld\n",k);
     }
 }

2034  人见人爱A-B

#include<stdio.h>
#include<string.h>
 
int main(){
    int n,m,i,j,num,flag,temp,s[],o[],p[];
    while(~scanf("%d %d",&n,&m)){
        if(n==&&m==){break;}
        for(i=;i<n;i++){scanf("%d",&s[i]);}
        for(i=;i<m;i++){scanf("%d",&o[i]);}
        num = ;
        for(i=;i<n;i++){
            flag = ;
            for(j=;j<m;j++){
                if(s[i]==o[j]){flag=;break;}
            }
            if(flag==){p[num]=s[i];num++;}
        }
        if(num==){printf("NULL\n");continue;}
        for(i=;i<num;i++){
            for(j=num-;j>i;j--){
                if(p[i]>p[j]){
                    temp = p[i];
                    p[i] = p[j];
                    p[j] = temp;
                }
            }
        }
        for(i=;i<num;i++){
            printf("%d ",p[i]);
        }
        printf("\n");
 
    }
}

2035  人见人爱A^B

 #include<stdio.h>
 
 int main(){
     int n,m,i,mul;
     while(scanf("%d %d",&n,&m)!=EOF){
         if(n==&&m==){break;}
         mul = ;
         for(i=;i<m;i++){
             mul = mul * n % ;
         }
         printf("%d\n",mul);
     }
 }

2041  超级楼梯

 #include<stdio.h>
 
 int main(){
     int n,m,i,s[];
     while(~scanf("%d",&n)){
         while(n--){
             scanf("%d",&m);
             s[]=;s[]=;s[]=;
             for(i=;i<=m;i++){
                 s[i] = s[i-] + s[i-];
             }
             printf("%d\n",s[m]);
         }
     }
 }

2043  密码

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

2044  一只小蜜蜂...

 #include<stdio.h>
 #include<string.h>
 
 int main(){
     int n,a,b,i;
     _int64 s[];
     while(~scanf("%d",&n)){
         while(n--){
             scanf("%d %d",&a,&b);
             s[]=;s[]=;s[]=;
             for(i=;i<=b;i++){
                 s[i] = s[i-] + s[i-];
             }
             printf("%I64d\n",s[b-a+]);
         }
 
     }
 }

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

 #include<stdio.h>
 
 int main(){
     int n,i;
     _int64 s[];
     while(~scanf("%d",&n)){
         s[]=;s[]=;s[]=;
         for(i=;i<=n;i++){
             s[i] = s[i-] + s[i-]*;
         }
         printf("%I64d\n",s[n]);
     }
 
 }

2046  骨牌铺方格

 #include<stdio.h>
 
 int main(){
     int n,i;
     _int64 s[];
     while(~scanf("%d",&n)){
         s[]=;s[]=;
         for(i=;i<=n;i++){
             s[i] = s[i-] + s[i-];
         }
         printf("%I64d\n",s[n]);
     }
 
 }