20525육세현 by 20525육세현

My Way

mia20525 — 2018-03-09 07:02:22 UTC

업적

mia20525 — 2018-03-23 06:40:11 UTC

글자 '김' 쓰기
import turtle as t
list =[1.1,1,1,9,9,9,9,9,9,9,9,1,1,1,1,1,1,1,9,7,1,1,8,1,1,1,6,1,1,1,6,1,1,6,1,1,1,6,6,7,1,1,1,1,1,1,6,1,1,8,1,1,1,1,1,1,10]
while True:
for a in list:
if a == 1:
t.forward(30)
elif a == 6:
t.left(90)
elif a == 9:
t.left(30)
elif a == 4:
t.right(90)
elif a == 7:
t.up()
elif a == 8:
t.down()
elif a ==10:
break

학습계획

mia20525 — 2018-03-23 06:40:20 UTC

파이썬 해킹(책)
* 홈페이지
http://hack-cracker.tistory.com/41
연습사이트
*컴퓨터
*휴대폰

mia20525 — 2018-04-13 06:39:54 UTC

mia20525 — 2018-04-13 06:40:27 UTC

mia20525 — 2018-04-17 00:46:02 UTC

mia20525 — 2018-04-17 01:28:30 UTC

정보 올림피아드 공모부문 준비물-아두이노 드론, 블루투스-10 포함(126500원)http://daduino.co.kr/product/detail.html?product_no=1237&cate_no=78&display_group=1-esp 8266(wifi)+esp 참고서 (31400원)http://www.eduino.kr/product/detail.html?product_no=48&cate_no=56&display_group=1-hack rf one (395000원)https://www.devicemart.co.kr/1290025

mia20525 — 2018-05-25 06:23:04 UTC

mia20525 — 2018-05-29 00:56:36 UTC

https://m.blog.naver.com/PostView.nhn?blogId=93immm&logNo=220297601793&proxyReferer=https%3A%2F%2Fwww.google.co.kr%2F

mia20525 — 2018-06-01 07:08:18 UTC

from string import ascii_lowercase
import random
a = list(ascii_lowercase) # 1번 회전자
random.shuffle(a)

b = list(ascii_lowercase) # 2번 회전자
random.shuffle(b)

c = list(ascii_lowercase) # 3번 회전자
random.shuffle(c)

#회전자의 속도 a : b : c = 3 : 2 : 1
입력 값 = input()

#회전자1번 3칸 움직임
for n in range(0,26):
a[n+3]=a[n]
if n>22:
a<
#회전자2번 2칸 움직임
for n in range(0,26):

#회전자3번 1칸 움직임

mia20525 — 2018-06-01 07:17:14 UTC

from string import ascii_lowercase
import random
a = list(ascii_lowercase) # 1번 회전자
random.shuffle(a)

b = list(ascii_lowercase) # 2번 회전자
random.shuffle(b)

c = list(ascii_lowercase) # 3번 회전자
random.shuffle(c)

#회전자의 속도 a : b : c = 3 : 2 : 1
input value= input()

#회전자1번 3칸 움직임
for n in range(0,25):
    a[n+3]=a[n]
    if n>22:
        a[-23+n]=a[n]
#회전자2번 2칸 움직임
for n in range(0,25):
    a[n + 2] = a[n]
    if n > 23:
        a[-24 + n] = a[n]
        #
#회전자3번 1칸 움직임
for n in range(0,25):
    a[n + 1] = a[n]
    if n > 24:
        a[-25 + n] = a[n]
        #