본문 바로가기

알고리즘 문제 풀이

코드업 기초 100제(1078~1091)

1078

a = int(input())
n = 0
for i in range(1,a+1,1) :
    if(i%2 == 0) :
        n += i
print(n)
#include<stdio.h>
int main(void)
{
    int a,sum=0,i;
    scanf("%d",&a);
    for(i=1;i<=a;i++)
    {
        if(i%2==0)
        {
            sum+=i;
        }
    }
    printf("%d",sum);
    return 0;
}

1079 

a = input().split()
for i in a :
    print(i)
    if i == 'q' :
        break
    
#include<stdio.h>
int main(void)
{
    char c;
    while(1)
    {
        scanf("%c",&c);
        printf("%c",c);
        if(c=='q')
        break;
    }
    return 0;
}

1080 

 

a = int(input())
n = 0
for i in range(0,a+1,1) :
    
    n += i
    if n >= a :
        break
print(i)
#include<stdio.h>
int main(void)
{
    int n,i,sum=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
    
        sum+=i;
        if(sum>=n)
        break;
        
    }
    printf("%d",i);
    return 0;
    
}

 

1081

#include<stdio.h>
int main(void)
{
    int n,m,i,j;
    scanf("%d",&n);
    scanf("%d",&m);
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            printf("%d %d\n",i,j);
        }
    }
    return 0;
}
n,m = map(int, input().split())

for i in range(1,n+1,1) :
    for j in range(1,m+1,1) :
        print(i,j)

 

1082

a = input()
b = int(a, 16)
for i in range(1,16,1) :
    print("%s*%X=%X" % (a, i, b*i))
#include<stdio.h>
int main(void)
{
   int a,i;
   scanf("%X",&a);
   for(i=1;i<=15;i++)
   {
       printf("%X*%X=%X\n",a,i,a*i);
   }
   return 0;
}

1083

n = int(input())

for i in range(1,n+1) :
    if i%3 == 0  :
        print('X', end = " ")
        continue
    print(i, end = " ")
#include<stdio.h>
int main(void)
{
    int i,n;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        if(i%3==0||i%6==0||i%9==0)
        printf("X ");
        else
        printf("%d ",i);
    }
    return 0;
}

1084

a,b,c = map(int,input().split())
w = 0
for i in range(0,a) :
    for j in range(0,b) :
        for k in range(0,c) :
            print(i,j,k)
            w += 1

print(w)
#include<stdio.h>
int main(void)
{
    int r,g,b;
    int i,j,k,c=0;
    scanf("%d%d%d",&r,&g,&b);
    for(i=0;i<r;i++)
    {
        for(j=0;j<g;j++)
        {
            for(k=0;k<b;k++)
            {
                printf("%d %d %d\n",i,j,k);
                c++;
            }
        }
    }
    printf("%d",c);
    return 0;
}

1085

h,b,c,s = map(int, input().split())
answer = ((h*b*c*s)/8/1024/1024)
print("%.1f MB" % answer)
#include<stdio.h>
int main(void)
{
    float a,b,c,d,e;
    scanf("%f %f %f %f",&a,&b,&c,&d);
    e = a*b*c*d/8/1024/1024;
    printf("%.1f MB",e);
    return 0;
     
}

1086

w,b,h = map(int,input().split())
answer = ((w*b*h) /8/(2**20))
print("%.2f MB" % answer)
#include<stdio.h>
int main(void)
{
    float r,g,b,c;
    scanf("%f %f %f",&r,&g,&b);
    c = r*g*b/8/1024/1024;
    printf("%.2f MB",c);
}

1087

a = int(input())
sum = 0
for i in range(1,a+1) :
    sum += i
    if sum >= a :
        break;
print(sum)
#include<stdio.h>
int main(void)
{
    int n,i=1,sum = 0;
    scanf("%d",&n);
    while(1)
    {
       sum+=i;
       i++;
       if(sum>=n)
       break;
        
    }
    printf("%d",sum);
}

1088

a = int(input())
for i in range(1,a+1) :
    if i%3 == 0 :
        continue 
    print(i)
    
#include<stdio.h>
int main(void)
{
    int n,i;
    scanf("%d",&n);
    for(i=1; i<=n; i++ )
    {
        if(i%3==0)
        continue;
        printf("%d ",i);
    }
    return 0;
}

1089

a,b,n = map(int, input().split())
for i in range(n-1) :
    a+=b
    

print(a)
#include<stdio.h>
int main(void)
{
    int a,b,c;
    scanf("%d %d %d",&a,&b,&c);
     printf("%d",a+(c-1)*b);
     return 0;
           
    
}

1090

a,r,n = map(int, input().split())
for i in range(n-1) :
    a *= r

print(a)
#include<stdio.h>
 
int main(){
    
    long long int a,b,c;
    scanf("%lld %lld %lld",&a,&b,&c);
    
    for(int j = 1; j <c; j++){
        
        a =a* b; 
        
    }
    printf("%lld",a);
    
    
    return 0;
}

1091

a,m,d,n = map(int, input().split())
for i in range(n-1) :
    a = a*m+d

print(a)
#include<stdio.h>
int main(void)
{
    long long int a,m,d,n,i;
    scanf("%lld %lld %lld %lld",&a,&m,&d,&n);
    for(i=1;i<n;i++)
    {
        a*=m;
        a+=d;
    }
    printf("%lld",a);
    return 0;
}

1092

 

'알고리즘 문제 풀이' 카테고리의 다른 글

백준 2675 - 문자열 반복  (0) 2021.03.21
백준 10809 - 알파벳 찾기  (0) 2021.03.21
코드업 기초 100제 (1071~1076)  (0) 2021.03.01
코드업 기초 100제(1063, 1064)  (0) 2021.03.01
코드업 기초 100제(1047)  (0) 2021.03.01