문제📖
1086
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2Fd9b24f82-7b8a-4977-b9f8-3116d7077217%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-03%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%206.43.53.png)
1087
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2Fc356b88b-631f-4424-ad9c-da42a1277387%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-03%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%206.53.05.png)
1088
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F6600accf-cb39-488d-b625-cdfd4454d7dc%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.05.32.png)
1089
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F18d93224-72b9-4dc0-87de-880b51fd8505%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.14.01.png)
1090
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2Fd2a7d3cb-1513-4805-b102-82547833df24%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.18.16.png)
풀이🙏
1086
- w,h,b가 공백을 두고 입력된다.
- 필요한 저장 공간을 MB단위로 바꾸어 출력한다.
-> 이전에 포스팅한 문제중의 1085문제와 동일하다.
1087
- 정수 1개를 입력받는다.
- 순서대로 계속 더해가다가 그 합이 입력된 정수보다 커지거나 같아지는 경우,
그 때까지의 합을 출력한다.
-> while 반복문
+ if 조건문
으로 구현
1088
- 정수 1개를 입력받는다.
range(1,100+1)
- 1부터 입력한 정수보다 작거나 같을 때까지 1씩 증가시켜 출력하라
- 단, 3의 배수는 출력하지 않는다.
-> list comprehension
+ if 조건문
으로 구현
-> join
으로 한 줄 출력
1089
- a, d, n이 공백을 두고 입력된다.
- n번째 수를 출력하라
-> 공차수열
: y = a + (d * (n-1))
1090
- a, r, n이 공백을 두고 입력된다.
- n번째 수를 출력하라
-> 공비수열
: y = a * (r^(n-1))
코드💻
1086
import sys
w, h, b = map(int,input().split())
print("%.2f MB"%(w*h*b/1024/1024/8))
1087
import sys
n = int(sys.stdin.readline())
s = 0
cnt = 1
while s < n:
s += cnt
cnt += 1
print(s)
1088
import sys
n = int(sys.stdin.readline())
result = [i for i in range(1,n+1) if i%3 is not 0]
print(" ".join(map(str,result)))
1089
import sys
a, d, n = map(int,sys.stdin.readline().split())
result = a + d*(n-1)
print(result)
1090
import sys
a, r, n = map(int,sys.stdin.readline().split())
result = a * r**(n-1)
print(result)
결과😎
1086
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F8674bcbe-a341-45dd-abc1-704937156a11%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-03%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%206.49.09.png)
1087
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F0e7c4a99-0f24-44df-8af6-ec4174c824f9%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.03.46.png)
1088
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F5416e9e5-7e54-457d-8e15-b73e39a0350e%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.11.15.png)
1089
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F9fd6b5c9-bfa9-4f1a-9be4-fe39adcecfac%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.16.21.png)
1090
![](https://velog.velcdn.com/images%2Fcosmos%2Fpost%2F3a07859a-2ef3-4f36-8a27-a7d8738bcf6b%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-02-04%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%203.19.42.png)
출처📝
https://codeup.kr/problemsetsol.php?psid=23