├── .gitignore ├── README.md ├── 시즌1 ├── 상 │ ├── .keep │ └── tnsgh9603 │ │ ├── 0502_1_tnsgh9603.cpp │ │ ├── 0503_2_tnsgh9603.py │ │ ├── 0504_3_tnsgh9603.cpp │ │ ├── 0505_4_tnsgh9603.cpp │ │ ├── 0506_5_tnsgh9603.cpp │ │ ├── 0509_6_tnsgh9603.cpp │ │ ├── 0510_7_tnsgh9603.cpp │ │ ├── 0511_8_tnsgh9603.cpp │ │ ├── 0512_9_tnsgh9603.cpp │ │ └── 0513_10_tnsgh9603.cpp ├── 중 │ ├── .keep │ ├── 0502_1_phjppo0918.java │ ├── 0503_1_yeonjy.c │ ├── KKodiac │ │ ├── 0502_1_KKodiac.py │ │ ├── 0503_2_KKodiac.py │ │ ├── 0504_3_KKodiac.py │ │ ├── 0505_4_KKodiac.py │ │ ├── 0506_5_KKodiac.py │ │ ├── 0509_6_KKodiac.py │ │ ├── 0510_7_KKodiac.py │ │ ├── 0511_8_KKodiac.py │ │ ├── 0512_9_KKodiac.py │ │ └── 0513_10_KKodiac.py │ ├── gnu-kenny │ │ ├── 0502_1_gnu-kenny.py │ │ ├── 0503_2_gnu-kenny.py │ │ └── 0504_3_gnu-kenny.py │ ├── pol6463 │ │ ├── 0503_2_pol6463.py │ │ ├── 0503_9_pol6463.py │ │ ├── 0504_3_pol6463.py │ │ ├── 0505_4_pol6364.py │ │ ├── 0506_5_pol6463.py │ │ ├── 0509_6_pol6463.py │ │ ├── 0510_7_pol6463.py │ │ ├── 0511_8_pol6463.py │ │ └── 0513_10_pol6463.py │ └── yeonjy │ │ ├── 0502_2_yeonjy.c │ │ ├── 0503_1_yeonjy.c │ │ └── 0505_3_yeonjy.c └── 하 │ └── .keep ├── 시즌10 ├── 상 │ ├── .keep │ └── Yupdown │ │ ├── 0729_1_Yupdown.cpp │ │ ├── 0730_2_Yupdown.cpp │ │ ├── 0731_3_Yupdown.cpp │ │ ├── 0801_4_Yupdown.cpp │ │ ├── 0802_5_Yupdown.cpp │ │ ├── 0805_6_Yupdown.cpp │ │ ├── 0806_7_Yupdown.cpp │ │ ├── 0807_8_Yupdown.cpp │ │ ├── 0808_9_Yupdown.cpp │ │ └── 0809_10_Yupdown.cpp ├── 중 │ ├── .keep │ ├── EJimin0509 │ │ ├── 0729_1_EJimin0509.py │ │ ├── 0730_2_EJimin0509.py │ │ ├── 0731_3_EJimin0509.py │ │ ├── 0801_4_EJimin0509.py │ │ ├── 0802_5_EJimin0509.py │ │ ├── 0805_6_EJimin0509.py │ │ ├── 0806_7_EJimin0509.py │ │ ├── 0807_8_EJimin0509.py │ │ ├── 0808_9_EJimin0509.py │ │ └── 0809_10_EJimin0509.py │ ├── HongSeokYoung │ │ ├── 240729_1_HongSeokYoung.cpp │ │ ├── 240729_1_HongSeokYoung.exe │ │ ├── 240730_2_HongSeokYoung.exe │ │ ├── 240731_3_HongSeokYoung.cpp │ │ ├── 240731_3_HongSeokYoung.exe │ │ ├── 240801_4_HongSeokYoung.cpp │ │ ├── 240801_4_HongSeokYoung.exe │ │ ├── 240802_5_HongSeokYoung.cpp │ │ ├── 240802_5_HongSeokYoung.exe │ │ ├── 240805_6_HongSeokYoung.cpp │ │ ├── 240805_6_HongSeokYoung.exe │ │ ├── 240806_7_HongSeokYoung.cpp │ │ ├── 240807_8_HongSeokYoung.cpp │ │ ├── 240807_8_HongSeokYoung.exe │ │ ├── 240808_9_HongSeokYoung.cpp │ │ ├── 240808_9_HongSeokYoung.exe │ │ ├── 240809_10_HongSeokYoung.cpp │ │ └── 240809_10_HongSeokYoung.exe │ ├── Jeon-HS4 │ │ ├── 0729_1_Jeon-HS4.py │ │ ├── 0730_2_Jeon-HS4.py │ │ ├── 0731_3_Jeon-HS4.py │ │ ├── 0801_4_Jeon-HS4.py │ │ ├── 0802_5_Jeon-HS4.py │ │ └── 0805_6_Jeon-HS4.py │ ├── Kimryungyo04 │ │ ├── 0729_1_Kimryungyo04.py │ │ ├── 0730_2_Kimryungyo04.py │ │ ├── 0731_3_Kimryungyo04.py │ │ ├── 0801_4_Kimryungyo04.py │ │ ├── 0802_5_Kimryungyo04.py │ │ ├── 0805_6_Kimryungyo04.py │ │ ├── 0806_7_Kimryungyo04.py │ │ ├── 0807_8_Kimryungyo04.py │ │ ├── 0808_9_Kimryungyo04.py │ │ └── 0809_10_Kimryungyo04.py │ ├── SH4316 │ │ ├── 0729_1_SH4316.c │ │ ├── 0730_2_SH4316.c │ │ ├── 0731_3_SH4316.c │ │ ├── 0801_4_SH4316.py │ │ └── 0805_6_SH4316.c │ ├── coom1222 │ │ ├── 0730_2_coom1222.py │ │ ├── 0731_3_coom1222.py │ │ ├── 0801_4_coom1222.py │ │ ├── 0802_5_coom1222.py │ │ ├── 0805_6_coom1222.py │ │ └── 1080.py │ ├── gksgh108 │ │ ├── 0729_1_gksgh108.ipynb │ │ ├── 0730_2_gksgh108.ipynb │ │ ├── 0802_3_gksgh108.ipynb │ │ ├── 0802_4_gksgh108.ipynb │ │ ├── 0802_5_gksgh108.ipynb │ │ ├── 0805_6_gksgh108.ipynb │ │ ├── 0806_7_gksgh108.ipynb │ │ ├── 0807_8_gksgh108.ipynb │ │ ├── 0808_9_gksgh108.ipynb │ │ └── 0809_10_gksgh108.ipynb │ ├── kkanghyun │ │ ├── 0729_1_kkanghyun.cs │ │ ├── 0730_2_kkanghyun.cs │ │ ├── 0731_3_kkanghyun.cs │ │ ├── 0801_4_kkanghyun.cs │ │ ├── 0802_5_kkanghyun.cs │ │ ├── 0805_6_kkanghyun.cpp │ │ ├── 0806_7_kkanghyun.cpp │ │ ├── 0807_8_kkanghyun.cpp │ │ ├── 0808_9_kkanghyun.cpp │ │ └── 0809_10_kkanghyun.cpp │ └── rvbear │ │ ├── 0729_1_rvbear.java │ │ ├── 0730_2_rvbear.java │ │ ├── 0731_3_rvbear.java │ │ ├── 0801_4_rvbear.java │ │ ├── 0802_5_rvbear.java │ │ ├── 0805_6_rvbear.java │ │ ├── 0806_7_rvbear.java │ │ ├── 0807_8_rvbear.java │ │ ├── 0808_9_rvbear.java │ │ └── 0809_10_rvbear.java └── 하 │ ├── .keep │ ├── 0729_1_gayeon11.py │ ├── 0730_2_gayeon11.py │ ├── 0731_3_gayeon11.py │ ├── 0801_4_gayeon11.py │ ├── 0802_5_gayeon11.py │ ├── 0805_6_gayeon11.py │ ├── 0806_7_gayeon11.py │ ├── 0807_8_gayeon11.py │ ├── 0808_9_gayeon11.py │ ├── Dohoon306 │ ├── 0729_1_Dohoon306.c │ ├── 0730_2_Dohoon306.c │ ├── 0731_3_Dohoon306.c │ ├── 0801_4_Dohoon306.c │ ├── 0802_5_Dohoon306.c │ ├── 0805_6_Dohoon306.c │ ├── 0806_7_Dohoon306.c │ ├── 0807_8_Dohoon306.c │ ├── 0808_9_Dohoon306.c │ └── 0809_10_Dohoon306.c │ └── HongSeokYoung │ ├── 240826_1110.py │ ├── 240826_2563.py │ ├── 240827_2605.py │ ├── 240827_2720.py │ ├── 240829_24723.py │ ├── 240829_2857.py │ ├── 240830_1964.py │ ├── 240830_19944.py │ └── 240830_2903.py ├── 시즌11 ├── 상 │ ├── .keep │ └── kimkimgungunwoo │ │ └── 0930_kimkimgungunwoo.py ├── 중 │ ├── .keep │ ├── 24YG │ │ ├── 0930_1_24YG.C │ │ ├── 1003_3_24YG.C │ │ └── 1003_4_24YG.C │ ├── HongSeokYoung │ │ ├── 240930_1_HongSeokYoung.cpp │ │ ├── 240930_1_HongSeokYoung.py │ │ ├── 241001_2_HongSeokYoung.py │ │ ├── 241002_3_HongSeokYoung.py │ │ ├── 241003_4_HongSeokYoung.py │ │ ├── 241004_5_HongSeokYoung.py │ │ ├── 241007_6_HongSeokYoung.py │ │ ├── 241008_7_HongSeokYoung.py │ │ ├── 241009_8_HongSeokYoung.py │ │ ├── 241010_9_HongSeokYoung.py │ │ └── 241011_10_HongSeokYoung.py │ ├── SH4316 │ │ ├── 0930_1_SH4316.java │ │ ├── 1001_2_SH4316.java │ │ ├── 1002_3_SH4316.java │ │ ├── 1003_4_SH4316.java │ │ └── 1004_5_SH4316.java │ ├── dohoon306 │ │ ├── 0930_1_dohoon306.c │ │ ├── 1001_2_dohoon306.c │ │ └── 1002_3_dohoon306.c │ ├── gksgh108 │ │ ├── 1001_1_gksgh108.ipynb │ │ ├── 1001_2_gksgh108.ipynb │ │ ├── 1002_3_gksgh108.ipynb │ │ ├── 1004_4_gksgh108.ipynb │ │ ├── 1004_5_gksgh108.ipynb │ │ ├── 1007_6_gksgh108.ipynb │ │ ├── 1008_7_gksgh108.ipynb │ │ ├── 1010_8_gksgh108.ipynb │ │ ├── 1010_9_gksgh108.ipynb │ │ └── 1011_10_gksgh108.ipynb │ ├── kimryungyo │ │ ├── 0930_1_kimryungyo.py │ │ ├── 1001_2_kimryungyo.py │ │ ├── 1002_3_kimryungyo.py │ │ ├── 1003_4_kimryungyo.py │ │ ├── 1004_5_kimryungyo.py │ │ ├── 1007_6_kimryungyo.py │ │ ├── 1008_7_kimryungyo.py │ │ ├── 1009_8_kimryungyo.py │ │ ├── 1010_9_kimryungyo.py │ │ ├── 1011_10_kimryungyo.py │ │ └── other_languages │ │ │ ├── day_1.c │ │ │ ├── day_1.java │ │ │ ├── day_10.c │ │ │ ├── day_10.java │ │ │ ├── day_2.c │ │ │ ├── day_2.java │ │ │ ├── day_3.c │ │ │ ├── day_3.java │ │ │ ├── day_4.c │ │ │ ├── day_4.java │ │ │ ├── day_5.c │ │ │ ├── day_5.java │ │ │ ├── day_6.c │ │ │ ├── day_6.java │ │ │ ├── day_7.c │ │ │ ├── day_7.java │ │ │ ├── day_8.c │ │ │ ├── day_8.java │ │ │ ├── day_9.c │ │ │ └── day_9.java │ └── kkanghyun │ │ ├── 0930_1_kkanghyun.cpp │ │ ├── 1001_2_kkanghyun.cpp │ │ ├── 1002_3_kkanghyun.cpp │ │ ├── 1003_4_kkanghyun.cpp │ │ ├── 1004_5_kkanghyun.cpp │ │ ├── 1007_6_kkanghyun.cpp │ │ ├── 1008_7_kkanghyun.cpp │ │ ├── 1009_8_kkanghyun.cpp │ │ ├── 1010_9_kkanghyun.cpp │ │ └── 1011_10_kkanghyun.cpp └── 하 │ ├── .keep │ ├── 2024591017오재윤 │ └── dhwodbs.py │ ├── gayeon11 │ ├── 0930_1_gayeon11.c │ ├── 1002_3_gayeon11.c │ ├── 1003_4_gayeon11.c │ ├── 1004_5_gayeon11.c │ ├── 1007_6_gayeon11.c │ ├── 1009_8_gayeon11.c │ ├── 1010_9_gayeon11.c │ └── 1011_10_gayeon11.c │ └── gudals123 │ ├── 0930_1_gudals123.c │ ├── 1001_2_gudals123.c │ ├── 1002_3_gudals123.c │ └── 1004_5_gudals123.c ├── 시즌12 ├── 상 │ ├── .keep │ └── kimryungyo │ │ ├── 0203_1_kimryungyo.py │ │ ├── 0204_2_kimryungyo.py │ │ ├── 0205_3_kimryungyo.py │ │ ├── 0206_4_kimryungyo.py │ │ ├── 0207_5_kimryungyo.py │ │ ├── 0210_6_kimryungyo.py │ │ ├── 0211_7_kimryungyo.py │ │ ├── 0212_8_kimryungyo.py │ │ ├── 0213_9_kimryungyo.py │ │ └── 0214_10_kimryungyo.py ├── 중 │ ├── .keep │ ├── HongSeokYoung │ │ ├── 250203_1_HongSeokYoung.py │ │ ├── 250204_2_HongSeokYoung.py │ │ ├── 250205_3_HongSeokYoung.py │ │ ├── 250206_4_HongSeokYoung.py │ │ ├── 250207_5_HongSeokYoung.py │ │ ├── 250210_6_HongSeokYoung.py │ │ ├── 250211_7_HongSeokYoung.py │ │ ├── 250212_8_HongSeokYoung.py │ │ ├── 250213_9_HongSeokYoung.py │ │ └── 250214_10_HongSeokYoung.py │ ├── dohoon306 │ │ ├── 0203_1_dohoon306.java │ │ └── 0204_2_dohoon306.java │ ├── ming0o │ │ ├── .gitignore │ │ ├── 10일차.js │ │ ├── 1일차.js │ │ ├── 2일차.js │ │ ├── 3일차.js │ │ ├── 4일차.js │ │ ├── 5일차.js │ │ ├── 6일차.js │ │ ├── 7일차.js │ │ └── 8일차.js │ └── vJEKKYv │ │ ├── 0203-1-vJEKKYv.java │ │ ├── 0204-2-vJEKKYv.java │ │ ├── 0205-3-vJEKKYv.java │ │ ├── 0206-4-vJEKKYv.java │ │ ├── 0207-5-vJEKKYv.java │ │ ├── 0210-6-vJEKKYv.java │ │ ├── 0211-7-vJEKKYv.java │ │ ├── 0212-8-vJEKKYv.java │ │ ├── 0213-9-vJEKKYv.java │ │ └── 0214-10-vJEKKYv.java └── 하 │ ├── .keep │ ├── Yoon493 │ ├── 0203_1_Yoon493.py │ ├── 0204_2_Yoon493.py │ ├── 0205_3_Yoon493.py │ ├── 0206_4_Yoon493.py │ ├── 0207_5_Yoon493.py │ ├── 0210_6_Yoon493.py │ ├── 0211_7_Yoon493.py │ ├── 0212_8_Yoon493.py │ ├── 0213_9_Yoon493.py │ └── 0214_10_Yoon493.py │ └── gayeon11 │ ├── 0203_1_gayeon11.c │ ├── 0206_3_gayeon11.c │ ├── 0207_4_gayeon11.c │ ├── 0208_5_gayeon11.py │ ├── 0209_2_gayeon11.c │ ├── 0211_6_gayeon11.c │ ├── 0211_7_gayeon11.c │ ├── 0212_8_gayeon11.c │ └── 0215_9_gayeon11.c ├── 시즌13 ├── 상 │ ├── .keep │ ├── Yupdown │ │ ├── 0331_1_Yupdown.cpp │ │ ├── 0401_2_Yupdown.cpp │ │ ├── 0402_3_Yupdown.cpp │ │ ├── 0403_4_Yupdown.cpp │ │ ├── 0404_5_Yupdown.cpp │ │ ├── 0407_6_Yupdown.cpp │ │ ├── 0408_7_Yupdown.cpp │ │ ├── 0409_8_Yupdown.cpp │ │ ├── 0410_9_Yupdown.cpp │ │ └── 0411_10_Yupdown.cpp │ ├── january2w0 │ │ ├── 0401_1_january2w0.cpp │ │ ├── 0402_2_january2w0.cpp │ │ ├── 0403_3_january2w0.cpp │ │ ├── 0404_4_january2w0.cpp │ │ ├── 0404_5_january2w0.cpp │ │ ├── 0407_6_january2w0.cpp │ │ ├── 0409_7_january2w0.cpp │ │ ├── 0411_8_january2w0.cpp │ │ ├── 0411_9_january2w0.cpp │ │ └── 0412_10_january2w0.cpp │ ├── juseriname │ │ ├── day1_2058.cpp │ │ ├── day3_29760.cpp │ │ ├── day6_3067.cpp │ │ └── day7_1041.cpp │ ├── kimryungyo │ │ ├── 0331_1_kimryungyo.py │ │ ├── 0401_2_kimryungyo.py │ │ ├── 0402_3_kimryungyo.py │ │ ├── 0403_4_kimryungyo.py │ │ ├── 0404_5_kimryungyo.py │ │ ├── 0407_6_kimryungyo.py │ │ ├── 0408_7_kimryungyo.py │ │ ├── 0409_8_kimryungyo.py │ │ ├── 0410_9_kimryungyo.py │ │ └── 0411_10_kimryungyo.py │ └── minthood334 │ │ ├── 0331_1_minthood334.py │ │ ├── 0401_2_minthood334.py │ │ └── 0403_3_minthood334.py ├── 중 │ ├── .keep │ ├── HongSeokYoung │ │ ├── 250331_1_HongSeokYoung.py │ │ ├── 250401_2_HongSeokYoung.py │ │ ├── 250402_3_HongSeokYoung.py │ │ ├── 250403_4_HongSeokYoung.py │ │ ├── 250404_5_HongSeokYoung.py │ │ ├── 250407_6_HongSeokYoung.py │ │ ├── 250408_7_HongSeokYoung.py │ │ ├── 250409_8_HongSeokYoung.py │ │ ├── 250410_9_HongSeokYoung.py │ │ └── 250411_10_HongSeokYoung.py │ ├── coom1222 │ │ ├── 0331_1_coom1222.java │ │ ├── 0401_2_coom1222.java │ │ ├── 0402_3_coom1222.java │ │ ├── 0403_4_coom1222.java │ │ ├── 0404_5_coom1222.java │ │ ├── 0406_7_coom1222.java │ │ ├── 0407_6_coom1222.java │ │ ├── 0409_8_coom1222.java │ │ ├── 0410_9_coom1222.java │ │ └── 0411_10_coom1222.java │ ├── kkanghyun │ │ ├── 0331_1_kkanghyun.cpp │ │ ├── 0401_2_kkanghyun.cpp │ │ ├── 0402_3_kkanghyun.cpp │ │ ├── 0403_4_kkanghyun.cpp │ │ ├── 0404_5_kkanghyun.cpp │ │ ├── 0407_6_kkanghyun.cpp │ │ ├── 0408_7_kkanghyun.cpp │ │ ├── 0409_8_kkanghyun.cpp │ │ ├── 0410_9_kkanghyun.cpp │ │ └── 0411_10_kkanghyun.cpp │ ├── ldc0721 │ │ ├── 0331_1_ldc0721.py │ │ └── 0402_3_ldc0721.py │ ├── mymuseisyou │ │ ├── 0331_1_mymuseisyou.c │ │ ├── 0401_2_mymuseisyou.c │ │ ├── 0402_3_mymuseisyou.c │ │ ├── 0403_4_mymuseisyou.c │ │ ├── 0405_5_mymuseisyou.c │ │ ├── 0407_6_mymuseisyou.c │ │ ├── 0409_7_mymuseisyou.c │ │ ├── 0409_8_mymuseisyou.c │ │ ├── 0410_9_mymuseisyou.c │ │ └── 0412_10_mymuseisyou.c │ ├── rlagusals1102 │ │ ├── 0331_1_rlagusals1102.py │ │ ├── 0401_2_rlagusals1102.py │ │ ├── 0402_3_rlagusals1102.py │ │ ├── 0403_4_rlagusals1102.py │ │ ├── 0404_5_rlagusals1102.py │ │ ├── 0407_6_rlagusals1102.py │ │ └── 0408_7_rlagusals1102.py │ └── toycartoon │ │ ├── 0331_1_toycartoon.py │ │ ├── 0401_2_toycartoon.py │ │ ├── 0402_3_toycartoon.py │ │ ├── 0403_4_toycartoon.py │ │ ├── 0404_5_toycartoon.py │ │ ├── 0407_6_toycartoon.py │ │ ├── 0408_7_toycartoon.py │ │ ├── 0409_8_toycartoon.py │ │ ├── 0410_9_toycartoon.py │ │ └── 0411_10_toycartoon.py └── 하 │ ├── .keep │ ├── gayeon11 │ ├── 0401_1_gayeon11.c │ ├── 0402_2_gayeon11.c │ ├── 0403_3_gayeon11.c │ ├── 0404_4_gayeon11.c │ ├── 0404_5_gayeon11.c │ ├── 0408_7_gayeon11.c │ ├── 0410_8_gayeon11.c │ ├── 0410_9_gayeon11.c │ └── 0411_10_gayeon11.c │ └── 선곤 │ ├── 0331_1_Wattamelon.py │ ├── 0401_2_Wattamelon.py │ ├── 0401_2_Wattamelon_re.py │ ├── 0402_03_Wattamelon.py │ ├── 0403_04_Wattamelon.py │ ├── 0404_05_Wattamelon.py │ ├── 0407_06_Wattamelon.py │ ├── 0408_07_Wattamelon.py │ ├── 0409_08_Wattamelon.py │ ├── 0410_09_Wattamelon.py │ └── 0411_10_Wattamelon.py ├── 시즌2 ├── 상 │ ├── .keep │ ├── dps0340 │ │ ├── 0810_1_dps0340.cpp │ │ ├── 0811_2_dps0340.py │ │ ├── 0812_3_dps0340.cpp │ │ ├── 0815_4_dps0340.py │ │ ├── 0816_5_dps0340.cpp │ │ ├── 0817_6_dps0340.cpp │ │ └── 0818_7_dps0340.cpp │ └── tnsgh9603 │ │ ├── 0810_1_tnsgh9603.cpp │ │ ├── 0811_2_tnsgh9603.cpp │ │ ├── 0812_3_tnsgh9603.cpp │ │ ├── 0815_4_tnsgh9603.cpp │ │ ├── 0816_5_tnsgh9603.cpp │ │ ├── 0817_6_tnsgh9603.cpp │ │ ├── 0818_7_tnsgh9603.cpp │ │ ├── 0819_8_tnsgh9603.cpp │ │ ├── 0822_9_tnsgh9603.cpp │ │ └── 0823_10_tnsgh9603.cpp ├── 중 │ ├── .keep │ ├── Hellcreams │ │ ├── 0810_1_Hellcreams.py │ │ ├── 0812_2_Hellcreams.py │ │ ├── 0812_3_Hellcreams.py │ │ └── 0816_5_Hellcreams.py │ ├── KKodiac │ │ ├── 0810_1_KKodiac.py │ │ ├── 0811_2_KKodiac.py │ │ └── 0812_3_KKodiac.py │ ├── changjun2 │ │ └── day1.c │ ├── junhyeongkim2 │ │ ├── 0810_1_junhyeongkim2.cpp │ │ ├── 0811_2_junhyeongkim2.cpp │ │ ├── 0812_3_junhyeongkim2.cpp │ │ ├── 0815_4_junhyeongkim2.cpp │ │ ├── 0816_5_junhyeongkim2.cpp │ │ ├── 0817_6_junhyeongkim2.cpp │ │ ├── 0818_7_junhyeongkim2.cpp │ │ ├── 0819_8_junhyeongkim2.cpp │ │ ├── 0822_9_junhyeongkim2.cpp │ │ └── 0823_10_junhyeongkim2.cpp │ └── rt3310 │ │ ├── 0810_1_rt3310.py │ │ ├── 0811_2_rt3310.py │ │ ├── 0812_3_rt3310.py │ │ ├── 0816_4_rt3310.py │ │ ├── 0816_5_rt3310.py │ │ ├── 0817_6_rt3310.py │ │ ├── 0819_7_rt3310.py │ │ ├── 0819_8_rt3310.py │ │ ├── 0823_10_rt3310.py │ │ └── 0823_9_rt3310.py ├── 초보 │ ├── .keep │ └── hamin924 │ │ ├── 0815_4_hamin924.py │ │ ├── 0816_5_hamin924.py │ │ ├── 0818_7_hamin924.py │ │ └── 0819_8_hamin924.py └── 하 │ ├── .keep │ ├── asyooniverse │ ├── 0810_1_asyooniverse.py │ ├── 0811_2_asyooniverse.py │ ├── 0812_3_asyooniverse.py │ ├── 0815_4_asyooniverse.py │ ├── 0817_6_asyooniverse.py │ ├── 0818_7_asyooniverse.py │ ├── 0820_5_asyooniverse.py │ ├── 0822_9_asyooniverse.py │ └── 0824_10_asyooniverse.py │ ├── eunb6 │ └── 0810_1_eunb6.py │ ├── hamin924 │ ├── 0810_1_hamin924.py │ └── 0811_2_hamin924.py │ ├── homebdy │ ├── 0810_1_homebdy.java │ ├── 0811_2_homebdy.java │ ├── 0812_3_homebdy.java │ ├── 0815_4_homebdy.java │ ├── 0816_5_homebdy.java │ ├── 0817_6_homebdy.java │ ├── 0818_7_homebdy.java │ ├── 0819_8_homebdy.java │ ├── 0822_9_homebdy.java │ └── 0823_10_homebdy.java │ └── kimhalin │ ├── 0810_1_kimhalin.java │ ├── 0811_2_kimhalin.java │ └── 0814_3_kimhalin.java ├── 시즌3 ├── 상 │ └── .keep ├── 중 │ ├── .keep │ ├── rt3310 │ │ ├── 1114_1_rt3310.py │ │ ├── 1115_2_rt3310.py │ │ ├── 1117_3_rt3310.py │ │ ├── 1117_4_rt3310.py │ │ ├── 1118_5_rt3310.py │ │ ├── 1123_6_rt3310.py │ │ ├── 1123_7_rt3310.py │ │ ├── 1123_8_rt3310.py │ │ ├── 1125_10_rt3310.py │ │ └── 1125_9_rt3310.py │ └── teawon │ │ ├── 1114_1_teawon.java │ │ ├── 1115_1_teawon.java │ │ ├── 1116_1_teawon.java │ │ ├── 1117_1_teawon.java │ │ ├── 1118_1_teawon.java │ │ ├── 1121_1_teawon.java │ │ ├── 1122_1_teawon.java │ │ ├── 1123_1_teawon.java │ │ ├── 1124_1_teawon.java │ │ └── 1125_1_teawon.java └── 하 │ ├── .keep │ ├── asyooniverse │ ├── 1115_1_asyooniverse.py │ ├── 1115_2_asyooniverse.py │ ├── 1116_3_asyooniverse.py │ ├── 1117_4_asyooniverse.py │ ├── 1118_5_asyooniverse.py │ ├── 1121_6_asyooniverse.py │ ├── 1122_7_asyooniverse.py │ ├── 1123_8_asyooniverse.py │ ├── 1125_10_asyooniverse.py │ └── 1125_9_asyooniverse.py │ ├── hamin924 │ ├── 1114_1_hamin924.py │ ├── 1115_2_hamin924.py │ ├── 1116_3_hamin924.py │ ├── 1118_4_hamin924.py │ ├── 1118_5_hamin924.py │ ├── 1121_6_hamin924.py │ ├── 1123_7_hamin924 │ ├── 1123_8_hamin924.py │ └── 1127_9_hamin924.py │ ├── hyeonjin9819 │ ├── 1114_1_hyeonjin9819.py │ ├── 1115_2_hyeonjin9819.py │ ├── 1116_3_hyeonjin9819.py │ ├── 1117_4_hyeonjin9819.py │ ├── 1118_5_hyeonjin9819.py │ ├── 1121_6_hyeonjin9819.py │ ├── 1122_7_hyeonjin9819.py │ ├── 1123_8_hyeonjin9819.py │ ├── 1124_9_hyeonjin9819.py │ └── 1125_10_hyeonjin9819.py │ ├── suhyeon3484 │ ├── 1114_1_suhyeon3484.py │ ├── 1116_2_suhyeon3494.py │ ├── 1116_3_suhyeon3484.py │ ├── 1117_4_suhyeon3484.py │ ├── 1118_5_suhyeon3484.py │ ├── 1121_6_suhyeon3484.py │ ├── 1122_7_suhyeon3484.py │ ├── 1124_8_suhyeon3484.py │ ├── 1124_9_suhyeon3484.py │ └── 1125_10_suhyeon3484.py │ ├── 강재혁 │ ├── Day01.java │ ├── Day02.java │ ├── Day03.java │ ├── Day04.java │ ├── Day05.java │ ├── Day06.java │ ├── Day07.java │ ├── Day08.java │ ├── Day09.java │ └── Day10.java │ └── 김민석 │ ├── minseok_1114_1.java │ ├── minseok_1115_2.java │ ├── minseok_1116_3.java │ ├── minseok_1117_4.java │ ├── minseok_1118_5.java │ ├── minseok_1121_6.java │ ├── minseok_1122_7.java │ ├── minseok_1123_8.java │ ├── minseok_1124_9.java │ └── minseok_1125_10.java ├── 시즌4 ├── 상 │ ├── .keep │ └── phjppo0918 │ │ ├── 0206_1_phjppo0918.java │ │ ├── 0207_1_phjppo0918.java │ │ ├── 0208_1_phjppo0918.java │ │ ├── 0209_1_phjppo0918.java │ │ ├── 0214_1_phjppo0918.java │ │ ├── 0215_1_phjppo0918.java │ │ ├── 0216_1_phjppo0918.java │ │ ├── 2010_1_phjppo0918.java │ │ ├── 2011_1_phjppo0918.java │ │ └── 2013_1_phjppo0918.java ├── 중 │ ├── .keep │ ├── asyooniverse │ │ ├── Day1 asyooniverse.py │ │ ├── Day2 asyooniverse.py │ │ ├── Day4 asyooniverse.py │ │ └── Day5 asyooniverse.py │ ├── homebdy │ │ ├── 0206_1_homebdy.py │ │ ├── 0207_2_homebdy.py │ │ ├── 0208_3_homebdy.py │ │ ├── 0209_4_homebdy.py │ │ ├── 0210_5_homebdy.py │ │ ├── 0211_6_homebdy.py │ │ ├── 0213_7_homebdy.py │ │ ├── 0214_8_homebdy.py │ │ ├── 0215_9_homebdy.py │ │ └── 0216_10_homebdy.py │ └── shay0454 │ │ ├── 0215_1M_shay0454.c │ │ ├── 0217_2M_shay0454.c │ │ └── 0218_3M_shay0454.c └── 하 │ ├── .keep │ ├── 0217_11_Jeon-HS4.py │ ├── Jeon-HS4 │ ├── 0206_1_Jeon-HS4.py │ ├── 0207_2_Jeon-HS4.py │ ├── 0208_3_Jeon-HS4.py │ ├── 0209_4_Jeon-HS4.py │ ├── 0210_5_Jeon-HS4.py │ ├── 0211_6_Jeon-HS4.py │ ├── 0213_7_Jeon-HS4.py │ ├── 0214_8_Jeon-HS4.py │ ├── 0215_9_Jeon-HS4.py │ └── 0216_10_Jeon-HS4.py │ ├── gksgh108 │ ├── 0206_10_gksgh108.py │ ├── 0206_1_gksgh108.py │ ├── 0206_2_gksgh108.py │ ├── 0206_3_gksgh108.py │ ├── 0206_4_gksgh108.py │ ├── 0206_5_gksgh108.py │ ├── 0206_6_gksgh108.py │ ├── 0206_7_gksgh108.py │ ├── 0206_8_gksgh108.py │ ├── 0206_9_gksgh108.py │ └── 0217_11_gksgh108.py │ ├── realhsb │ └── 0206_1_realhsb.swift │ ├── shay0454 │ ├── 0205_1_shay0454.c │ ├── 0206_2_shay0454.c │ ├── 0207_2_shay0454.c │ ├── 0209_4_shay054.c │ ├── 0210_5_shay0454.c │ ├── 0212_3_shay0454.c │ ├── 0212_6_shay0454.c │ ├── 0213_7_shay0454.c │ ├── 0214_8_shay0454.c │ ├── 0215_9_shay0454.c │ ├── 0216_10_shay0454.c │ └── 0217_11_shay0454.c │ └── suhyeon3484 │ ├── 0206_1_suhyeon3484.py │ ├── 0208_2_suhyeon3484.py │ ├── 0208_3_suhyeon3484.py │ ├── 0210_10_suhyeon3484.py │ ├── 0210_4_suhyeon3484.py │ ├── 0210_5_suhyeon3484.py │ ├── 0213_6_suhyeon3484.py │ ├── 0213_7_suhyeon3484.py │ └── 0215_9_suhyeon3484.py ├── 시즌5 ├── 상 │ ├── .keep │ ├── phjppo0918 │ │ └── 0404_2_phjppo0918.kt │ └── tnsgh9603 │ │ ├── 0403_1_tnsgh9603.cpp │ │ ├── 0404_2_tnsgh9603.cpp │ │ ├── 0405_3_tnsgh9603.cpp │ │ ├── 0406_4_tnsgh9603.cpp │ │ ├── 0407_5_tnsgh9603.cpp │ │ ├── 0410_6_tnsgh9603.cpp │ │ ├── 0411_7_tnsgh9603.cpp │ │ ├── 0412_8_tnsgh9603.cpp │ │ ├── 0413_9_tnsgh9603.cpp │ │ └── 0414_10_tnsgh9603.cpp ├── 중 │ ├── .keep │ ├── CreateYJ │ │ ├── 0404_2_송영재.ipynb │ │ ├── 0405_3_CreateYJ.ipynb │ │ └── 0406_4_CreateYJ.ipynb │ ├── Haron1248 │ │ ├── 0403_1_Haron1248.c │ │ ├── 0404_2_Haron1248.c │ │ ├── 0406_3_Haron1248.c │ │ ├── 0406_4_Haron1248.c │ │ ├── 0408_5_Haron1248.c │ │ ├── 0410_6_Haron1248.c │ │ ├── 0412_7_Haron1248.c │ │ ├── 0412_8_Haron1248.c │ │ ├── 0413_9_Haron1248.c │ │ └── 0415_10_Haron1248.c │ ├── asyooniverse │ │ ├── Day1 asyooniverse.py │ │ ├── Day2 asyooniverse.py │ │ ├── Day3 asyooniverse.py │ │ ├── Day4 asyooniverse.py │ │ ├── Day5 asyooniverse.py │ │ ├── Day6 asyooniverse.py │ │ └── Day7 asyooniverse.py │ └── juhyuni99 │ │ ├── 0403_1_juhyuni99.cc │ │ ├── 0404_2_juhyuni99.cc │ │ ├── 0405_3_juhyuni99.cc │ │ ├── 0406_4_juhyuni99.cc │ │ ├── 0407_5_juhyuni99.cc │ │ ├── 0410_6_juhyuni99.cc │ │ ├── 0411_7_juhyuni99.cc │ │ ├── 0412_8_juhyuni99.cc │ │ ├── 0413_9_juhyuni99.cc │ │ └── 0414_10_juhyuni99.cc └── 하 │ ├── .keep │ ├── 김선재 │ ├── 0404_day1_sunjae94.java │ ├── 0404_day2_sunjae98.java │ ├── 0405_day3_sunjae98.java │ ├── 0406_day4_sunjae98.java │ ├── 0407_day5_sunjae98.java │ └── 0410_day6_sunjae98.java │ └── 홍석영 │ ├── 0403_1_Seokyoung-Hong.py │ ├── 0404_2_Seokyoung-Hong.py │ ├── 0405_3_Seokyoung-Hong.py │ ├── 0406_4_Seokyoung-Hong.py │ ├── 0407_5_Seokyoung-Hong.py │ ├── 0410_6_Seokyoung-Hong.py │ ├── 0411_7_Seokyoung-Hong.py │ ├── 0412_8_Seokyoung-Hong.py │ ├── 0413_9_Seokyoung-Hong.py │ └── 0414_10_Seokyoung-Hong.py ├── 시즌6 ├── 상 │ └── .keep ├── 중 │ ├── .keep │ ├── Haron1248 │ │ ├── 0807_1_Haron1248.c │ │ ├── 0808_2_Haron1248.cpp │ │ ├── 0809_3_Haron1248.py │ │ ├── 0810_4_Haron1248.py │ │ ├── 0814_6_Haron1248.py │ │ └── 0815_7_Haron1248.c │ ├── Hj1218 │ │ ├── 0807_1_Hj1218.java │ │ ├── 0808_2_Hj1218.java │ │ ├── 0809_3_Hj1218.java │ │ ├── 0810_4_Hj1218.java │ │ ├── 0811_5_Hj1218.java │ │ ├── 0814_6_Hj1218.java │ │ ├── 0815_7_Hj1218.java │ │ ├── 0816_8_Hj1218.java │ │ ├── 0817_9_Hj1218.java │ │ └── 0818_10_Hj1218.java │ ├── Jeon-HS4 │ │ ├── 0807_1_Jeon-HS4.py │ │ ├── 0808_2_Jeon-HS4.py │ │ ├── 0809_3_Jeon-HS4.py │ │ ├── 0810_4_Jeon-HS4.py │ │ ├── 0811_5_Jeon-HS4.py │ │ ├── 0814_6_Jeon-HS4.py │ │ ├── 0815_7_Jeon-HS4.py │ │ ├── 0816_8_Jeon-HS4.py │ │ ├── 0817_9_Jeon-HS4.py │ │ └── 0818_10_Jeon-HS4.py │ ├── SangWoon123 │ │ ├── 0807_1_SangWoon123.java │ │ ├── 0808_2_SangWoon123.java │ │ ├── 0809_3_SangWoon123.java │ │ ├── 0810_4_SangWoon123.java │ │ ├── 0811_5_SangWoon123.java │ │ ├── 0814_6_SangWoon123.java │ │ ├── 0815_7_SangWoon123.java │ │ ├── 0816_8_SangWoon123.java │ │ ├── 0817_9_SangWoon123.java │ │ └── 0819_10_SangWoon123.java │ ├── SsongYJ61 │ │ ├── 0808_2_SsongYj.py │ │ ├── 0809_3_SsongYj.py │ │ ├── 0810_4_SsongYj.py │ │ ├── 0811_5_SsongYj .py │ │ ├── 0815_7_SsongYj .py │ │ ├── 0816_8_SsongYj .py │ │ ├── 0817_9_SsongYj .py │ │ └── 0818_10_SsongYj .py │ ├── asyooniverse │ │ └── 0807_1_asyooniverse.py │ ├── gksgh108 │ │ ├── 0807_1_gksgh108.ipynb │ │ ├── 0808_2_gksgh108.ipynb │ │ ├── 0809_3_gksgh108.ipynb │ │ ├── 0811_4_gksgh108.ipynb │ │ ├── 0815_5_gksgh108.ipynb │ │ ├── 0815_6_gksgh108.ipynb │ │ ├── 0815_7_gksgh108.ipynb │ │ ├── 0816_8_gksgh108.ipynb │ │ └── 0817_9_gksgh108.ipynb │ ├── gs0428 │ │ ├── 0807_1_gs0428.js │ │ ├── 0808_2_gs0428.js │ │ ├── 0809_3_gs0428.js │ │ ├── 0810_4_gs0428.js │ │ ├── 0811_5_gs0428.js │ │ ├── 0814_6_gs0428.cpp │ │ ├── 0815_7_gs0428.js │ │ ├── 0816_8_gs0428.cpp │ │ ├── 0817_9_gs0428.js │ │ └── 0818_10_gs0428.js │ ├── hamin924 │ │ ├── 0807_1_hamin924.py │ │ └── 0808_2_hamin924.py │ ├── kimkimgungunwoo │ │ ├── 0807_1_kimkimgungunwoo.py │ │ ├── 0808_2_kimkimgungunwoo.py │ │ ├── 0809_2_kimkimgungunwoo.py │ │ ├── 0810_4_kimkimgungunwoo.py │ │ ├── 0811_5_kimkimgungunwoo.py │ │ ├── 0814_6_kimkimgungunwoo.py │ │ ├── 0815_7_kimkimgungunwoo.java │ │ ├── 0816_8_kimkimgungunwoo.java │ │ ├── 0817_9_kimkimgungunwoo.java │ │ └── 0818_10_kimkimgungunwoo.py │ ├── lhh2020 │ │ └── 0807_1_lhh2020.java │ ├── rvbear │ │ ├── 0807_1_rvbear.java │ │ ├── 0808_2_rvbear.java │ │ ├── 0809_3_rvbear.java │ │ ├── 0810_4_rvbear.java │ │ ├── 0811_5_rvbear.java │ │ ├── 0814_6_rvbear.java │ │ ├── 0815_7_rvbear.java │ │ ├── 0816_8_rvbear.java │ │ ├── 0817_9_rvbear.java │ │ └── 0818_10_rvbear.java │ ├── shay0454 │ │ ├── 0807_1_shay0454.cpp │ │ ├── 0808_2_proto_shay0454.cpp │ │ ├── 0808_2_shay0454.cpp │ │ ├── 0809_3_shay0454.cpp │ │ ├── 0810_4_proto_shay0454.cpp │ │ ├── 0810_4_shay0454.cpp │ │ ├── 0811_5_proto_shay0454.cpp │ │ ├── 0811_5_shay0454.cpp │ │ ├── 0814_6_proto_shay0454.cpp │ │ ├── 0814_6_shay0454.cpp │ │ ├── 0815_7_proto_shay0454.cpp │ │ ├── 0815_7_shay0454.cpp │ │ ├── 0816_8_proto_shay0454.cpp │ │ ├── 0816_8_shay0454.cpp │ │ ├── 0817_9_proto_shay0454.cpp │ │ ├── 0817_9_shay0454.cpp │ │ ├── 0818_10_proto_shay0454.cpp │ │ └── 0818_10_shay0454.cpp │ ├── sua1897 │ │ ├── 0807_1_sua1897.py │ │ ├── 0809_3_sua1897.c │ │ └── 0811_4_sua1897.py │ └── 홍석영 │ │ ├── 0807_1_Seokyoung-Hong.py │ │ ├── 0808_2_Seokyoung-Hong.py │ │ ├── 0809_3_Seokyoung-Hong.py │ │ ├── 0810_4_Seokyoung-Hong.py │ │ ├── 0811_5_Seokyoung-Hong.py │ │ ├── 0814_6_Seokyoung-Hong.py │ │ ├── 0816_7_Seokyoung-Hong.py │ │ ├── 0816_8_Seokyoung-Hong.py │ │ ├── 0818_10_Seokyoung-Hong.py │ │ └── 0818_9_Seokyoung-Hong.py └── 하 │ ├── .keep │ ├── golapaduck │ ├── 0807_1_golapaduck.py │ ├── 0808_2_golapaduck.py │ ├── 0809_3_golapaduck.py │ ├── 0810_4_golapaduck.py │ ├── 0811_5_golapaduck.py │ ├── 0814_6_golapaduck.py │ ├── 0815_7_golapaduck.py │ ├── 0816_8_golapaduck.py │ ├── 0817_9_golapaduck.py │ └── 0818_10_golapaduck.py │ ├── lhh2020 │ ├── 0807_1_lhh2020.java │ ├── 0810_4_lhh2020.java │ ├── 0811_5_lhh2020.java │ ├── 0815_6_lhh2020.java │ ├── 0815_7_lhh2020.java │ ├── 0817_8_lhh2020.java │ ├── 0818_9_lhh2020.java │ ├── 0819_10_lhh2020.java │ ├── 8080_2_lhh2020.java │ └── 8090_3_lhh2020.cpp │ └── mr6208 │ ├── 0807_1_mr6208.java │ ├── 0808_2_mr6208.java │ ├── 0809_3_mr6208.java │ ├── 0810_4_mr6208.java │ ├── 0811_5_mr6208.java │ ├── 0814_6_mr6208.java │ ├── 0815_7_mr6208.java │ ├── 0816_8_mr6208.java │ ├── 0817_9_mr6208.java │ └── 0818_10_mr6208.java ├── 시즌7 ├── 상 │ ├── .keep │ ├── cycrypto │ │ ├── 1002_1_cycrypto.py │ │ ├── 1003_2_cycrypto.py │ │ ├── 1005_3_cycrypto.py │ │ ├── 1006_5_cycrypto.py │ │ ├── 1009_6_cycrypto.cc │ │ ├── 1009_6_cycrypto.py │ │ ├── 1011_7_cycrypto.py │ │ └── 1011_8_cycrypto.py │ └── homebdy │ │ ├── 1002_1_homebdy.java │ │ ├── 1003_2_homebdy.java │ │ ├── 1004_3_homebdy.java │ │ ├── 1006_5_homebdy.java │ │ ├── 1009_6_homebdy.java │ │ ├── 1010_7_homebdy.java │ │ └── 1011_8_homebdy.java ├── 중 │ ├── .keep │ ├── Haron1248 │ │ ├── 1002_1_Haron1248.c │ │ ├── 1004_2_Haron1248.c │ │ ├── 1004_3_Haron1248.c │ │ ├── 1006_4_Haron1248.cpp │ │ ├── 1006_5_Haron1248.cpp │ │ ├── 1010_6_Haron1248.c │ │ ├── 1010_7_Haron1248.c │ │ ├── 1011_8_Haron1248.c │ │ ├── 1013_9_Haron1248.cpp │ │ └── 1014_10_Haron1248.c │ ├── Hj1218 │ │ ├── 1002_1_Hj1218.js │ │ ├── 1003_2_Hj1218.js │ │ ├── 1004_3_Hj1218.js │ │ ├── 1005_4_Hj1218.js │ │ ├── 1006_5_Hj1218.js │ │ ├── 1009_6_Hj1218.js │ │ ├── 1010_7_Hj1218.js │ │ ├── 1011_8_Hj1218.js │ │ ├── 1012_9_Hj1218.js │ │ └── 1013_10_Hj1218.js │ ├── Jeon-HS4 │ │ ├── 1002_1_Jeon-HS4.py │ │ ├── 1003_2_Jeon-HS4.py │ │ ├── 1004_3_Jeon-HS4.py │ │ ├── 1005_4_Jeon-HS4.py │ │ ├── 1006_5_Jeon-HS4.py │ │ ├── 1009_6_Jeon-HS4.py │ │ ├── 1010_7_Jeon-HS4.py │ │ ├── 1011_8_Jeon-HS4.py │ │ ├── 1012_9_Jeon-HS4.py │ │ └── 1013_10_Jeon-HS4.py │ ├── SH4316 │ │ ├── 1002_1_SH4316.java │ │ ├── 1003_2_SH4316.py │ │ ├── 1004_3_SH4316.c │ │ ├── 1006_5_SH4316.py │ │ └── 1009_6_SH4316.py │ ├── SangWoon123 │ │ ├── 1002_1_SangWoon123.java │ │ ├── 1003_2_SangWoon123.java │ │ ├── 1004_3_SangWoon123.java │ │ ├── 1005_4_SangWoon123.java │ │ ├── 1005_5_SangWoon123.java │ │ ├── 1009_6_SangWoon123.java │ │ ├── 1010_7_SangWoon123.java │ │ ├── 1011_8_SangWoon123.java │ │ ├── 1012_9_SangWoon123.java │ │ └── 1013_10_SangWoon123.java │ ├── Seokyounh_Hong │ │ ├── 1003_1_Seokyoung-Hong.py │ │ ├── 1003_2_Seokyoung-Hong.py │ │ ├── 1005_3_Seokyoung-Hong.c │ │ ├── 1006_4_Seokyoung-Hong.py │ │ ├── 1006_5_Seokyoung-Hong.py │ │ ├── 1010_6_Seokyoung-Hong.py │ │ ├── 1010_7_Seokyoung-Hong.py │ │ ├── 1013_10_Seokyoung-Hong.py │ │ └── 1013_9_Seokyoung-Hong.py │ ├── Tojaman │ │ ├── 1002_1_Tojaman.java │ │ ├── 1003_2_Tojaman.java │ │ ├── 1004_3_Tojaman.java │ │ ├── 1005_4_Tojaman.java │ │ ├── 1007_6_Tojaman.java │ │ └── 1008_7_Tojaman.java │ ├── gksgh108 │ │ ├── 1002_1_gksgh108.ipynb │ │ ├── 1003_2_gksgh108.ipynb │ │ ├── 1004_3_gksgh108.ipynb │ │ ├── 1005_4_gksgh108.ipynb │ │ ├── 1006_5_gksgh108.ipynb │ │ ├── 1009_6_gksgh108.ipynb │ │ ├── 1010_7_gksgh108.ipynb │ │ ├── 1012_8_gksgh108.ipynb │ │ └── 1012_9_gksgh108.ipynb │ ├── gs0428 │ │ ├── 1002_1_gs0428.cpp │ │ ├── 1003_2_gs0428.js │ │ └── 1004_3_gs0428.js │ ├── hamin924 │ │ ├── 1004_3_hamin924.py │ │ ├── 1005_4_hamin924.py │ │ ├── 1006_2_hamin924.py │ │ ├── 1006_5_hamin924.py │ │ ├── 1009_6_hamin924.py │ │ ├── 1010_7_hamin924.py │ │ ├── 1011_8_hamin924.py │ │ ├── 1012_9_hamin924.py │ │ └── 1013_10_hamin924.py │ ├── reval04 │ │ ├── 1003_2_reval04.py │ │ ├── 1004_3_reval04.py │ │ ├── 1005_4_reval04.py │ │ ├── 1006_5_reval04.py │ │ ├── 1009_6_reval04.py │ │ ├── 1010_7_reval04 │ │ ├── 1011_8_reval04.py │ │ ├── 1012_9_reval04.py │ │ └── 1013_10_reval04.py │ └── rvbear │ │ ├── 1002_1_rvbear.java │ │ ├── 1003_2_rvbear.java │ │ ├── 1004_3_rvbear.java │ │ ├── 1005_4_rvbear.java │ │ ├── 1006_5_rvbear.java │ │ ├── 1009_6_rvbear.java │ │ ├── 1010_7_rvbear.java │ │ ├── 1011_8_rvbear.java │ │ ├── 1012_9_rvbear.java │ │ └── 1013_10_rvbear.java └── 하 │ ├── .keep │ ├── EJimin0509 │ ├── 1002_1_EJimin0509.py │ ├── 1003_2_EJimin0509.py │ ├── 1004_3_EJimin0509.py │ ├── 1005_4_EJimin0509.py │ ├── 1006_5_EJimin0509.py │ ├── 1009_6_EJimin0509.py │ ├── 1010_7_EJimin0509.py │ ├── 1011_8_EJimin0509.py │ ├── 1012_9_EJimin0509.py │ └── 1013_10_EJimin0509.py │ ├── JEKKY │ ├── 1002_1_JEKKY.java │ ├── 1003_2_JEKKY.java │ ├── 1004_3_JEKKY.java │ ├── 1005_4_JEKKY.java │ ├── 1006_5_JEKKY.java │ ├── 1009_6_JEKKY.java │ ├── 1010_7_JEKKY.java │ ├── 1011_8_JEKKY.ipynb │ ├── 1012_9_JEKKY.java │ └── 1013_10_JEKKY.ipynb │ ├── golapaduck │ ├── 1002_1_golapaduck.py │ ├── 1003_2_golapaduck.py │ ├── 1004_3_golapaduck.py │ ├── 1005_4_golapaduck.py │ ├── 1006_5_golapaduck.py │ ├── 1007_6_golapaduck.py │ ├── 1010_7_golapaduck.py │ ├── 1011_8_golapaduck.py │ ├── 1012_9_golapaduck.py │ └── 1013_10_golapaduck.py │ └── seolvin21 │ ├── 1002_1_seolvin21.cpp │ ├── 1003_2_seolvin21.cpp │ ├── 1004_3_seolvin21.cpp │ ├── 1005_4_seolvin21.cpp │ ├── 1006_5_seolvin21.cpp │ ├── 1009_6_seolvin21.cpp │ ├── 1010_7_seolvin21.cpp │ ├── 1011_8_seolvin21.cpp │ ├── 1012_9_seolvin21.cpp │ └── 1013_10_seolvin21.cpp ├── 시즌8 ├── 상 │ └── .keep ├── 중 │ ├── .keep │ ├── D4LGONA │ │ ├── 0213_1_D4LGONA.cpp │ │ ├── 0214_2_D4LGONA.cpp │ │ ├── 0215_3_D4LGONA.cpp │ │ ├── 0216_4_D4LGONA.cpp │ │ ├── 0217_5_D4LGONA.cpp │ │ ├── 0220_6_D4LGONA.cpp │ │ ├── 0221_7_D4LGONA.cpp │ │ ├── 0223_8_D4LGONA.cpp │ │ ├── 0223_9_D4LGONA.cpp │ │ └── 0224_10_D4LGONA.cpp │ ├── EJimin0509 │ │ ├── 0213_1_EJimin0509.py │ │ ├── 0214_2_EJimin0509.py │ │ ├── 0215_3_Ejimin0509.py │ │ ├── 0216_4_EJimin0509.py │ │ ├── 0217_5_Ejimin0509.py │ │ ├── 0220_6_EJimin0509.py │ │ ├── 0221_7_EJimin0509.py │ │ ├── 0222_8_EJimin0509.py │ │ ├── 0223_9_EJimin0509.py │ │ └── 0224_10_EJimin0509.py │ ├── HongSeokYoung │ │ ├── 240213_1_HongSeokYoung.cpp │ │ ├── 240214_2_HongSeokYoung.cpp │ │ ├── 240215_3_HongSeokYoung.cpp │ │ ├── 240216_4_HongSeokYoung.cpp │ │ ├── 240217_5_HongSeokYoung.cpp │ │ ├── 240220_6_HongSeokYoung.cpp │ │ ├── 240221_7_HongSeokYoung.cpp │ │ ├── 240222_8_HongSeokYoung.cpp │ │ ├── 240223_9_HongSeokYoung.cpp │ │ └── 240224_10_HongSeokYoung.cpp │ ├── JEKKY │ │ ├── 0213_1_JEKKY.java │ │ ├── 0214_2_JEKKY.java │ │ ├── 0215_3_JEKKY.java │ │ ├── 0216_4_JEKKY.java │ │ ├── 0217_5_JEKKY.java │ │ ├── 0220_6_JEKKY.java │ │ ├── 0221_7_JEKKY.java │ │ ├── 0222_8_JEKKY.java │ │ ├── 0223_9_JEKKY.java │ │ └── 0224_10_JEKKY.java │ ├── Jeon-HS4 │ │ ├── 0213_1_Jeon-HS4.py │ │ ├── 0214_2_Jeon-HS4.py │ │ ├── 0215_3_Jeon-HS4.py │ │ ├── 0216_4_Jeon-HS4.py │ │ ├── 0217_5_Jeon-HS4.py │ │ ├── 0220_6_Jeon-HS4.py │ │ ├── 0221_7_Jeon-HS4.py │ │ ├── 0222_8_Jeon-HS4.py │ │ ├── 0223_9_Jeon-HS4.py │ │ └── 0224_10_Jeon-HS4.py │ ├── SH4316 │ │ ├── 0213_1_SH4316.py │ │ ├── 0214_2_SH4316.py │ │ ├── 0215_3_SH4316.py │ │ ├── 0216_4_SH4316.py │ │ └── 0217_5_SH4316.py │ ├── SangWoon123 │ │ ├── 0215_3_SangWoon123.java │ │ ├── 0217_4_SangWoon123.java │ │ └── 0218_5_SangWoon123.java │ ├── YounYoung3141592 │ │ └── 1_younyoung3141592.c │ ├── ggamD00 │ │ ├── 0213_1_ggamD00.py │ │ ├── 0214_2_ggamD00.py │ │ ├── 0215_3_ggamD00.py │ │ └── 0216_4_ggamD00.py │ ├── gksgh108 │ │ ├── 0213_1_gksgh108.ipynb │ │ ├── 0214_2_gksgh108.ipynb │ │ ├── 0215_3_gksgh108.ipynb │ │ ├── 0216_4_gksgh108.ipynb │ │ ├── 0217_5_gksgh108.ipynb │ │ ├── 0221_7_gksgh108.ipynb │ │ ├── 0222_8_gksgh108.ipynb │ │ ├── 0223_9_gksgh108.ipynb │ │ └── 0225_10_gksgh108_ipynb │ ├── kkanghyun │ │ ├── 0213_1_kkanghyun.cpp │ │ ├── 0214_2_kkanghyun.cpp │ │ ├── 0215_3_kkanghyun.cpp │ │ ├── 0216_4_kkanghyun.cpp │ │ ├── 0217_5_kkanghyun.cpp │ │ ├── 0220_6_kkanghyun.cpp │ │ ├── 0221_7_kkanghyun.cpp │ │ ├── 0222_8_kkanghyun.cpp │ │ ├── 0223_9_kkanghyun.cpp │ │ └── 0224_10_kkanghyun.cpp │ ├── noodlechoi │ │ ├── 0214_1_noodlechoi.cpp │ │ ├── 0214_2_noodlechoi.cpp │ │ ├── 0215_3_noodlechoi.cpp │ │ ├── 0217_4_noodlechoi.cpp │ │ ├── 0217_5_noodlechoi.cpp │ │ ├── 0220_6_noodlechoi.cpp │ │ ├── 0222_7_noodlechoi.cpp │ │ ├── 0222_8_noodlechoi.cpp │ │ ├── 0224_10_noodlechoi.cpp │ │ └── 0224_9_noodlechoi.cpp │ ├── reval04 │ │ ├── 0214_1_reval04.py │ │ ├── 0215_2_reval04.py │ │ ├── 0216_3_reval04.py │ │ ├── 0216_4_reval04.py │ │ ├── 0217_5_reval04.py │ │ ├── 0221_6_reval04.py │ │ ├── 0221_7_reval04.py │ │ ├── 0223_8_reval04.py │ │ └── 0224_9_reval04.py │ ├── rvbear │ │ ├── 0213_1_rvbear.java │ │ ├── 0214_2_rvbear.java │ │ ├── 0215_3_rvbear.java │ │ ├── 0216_4_rvbear.java │ │ ├── 0217_5_rvbear.java │ │ ├── 0220_6_rvbear.java │ │ ├── 0221_7_rvbear.java │ │ ├── 0222_8_rvbear.java │ │ ├── 0223_9_rvbear.java │ │ └── 0224_10_rvbear.java │ ├── shay0454 │ │ ├── 0213_1_shay0454.cpp │ │ ├── 0214_2_shay0454.cpp │ │ ├── 0215_3_shay0454.cpp │ │ ├── 0217_5_shay0454.cpp │ │ ├── 0218_4_shay0454.cpp │ │ ├── 0221_6_shay0454.cpp │ │ ├── 0222_7_shay0454.cpp │ │ ├── 0222_8_1_shay0454.cpp │ │ ├── 0222_8_shay0454.cpp │ │ ├── 0223_9_shay0454.cpp │ │ └── 0224_10_shay0454.cpp │ └── wonjun0120 │ │ ├── 0213_1_wonjun0120.java │ │ ├── 0214_2_wonjun0120.java │ │ ├── 0215_3_wonjun0120.java │ │ ├── 0216_4_wonjun0120.java │ │ ├── 0217_5_wonjun0120.java │ │ ├── 0220_6_wonjun0120.java │ │ ├── 0221_7_wonjun0120.java │ │ ├── 0222_8_wonjun0120.java │ │ ├── 0223_9_wonjun0120.java │ │ └── 0224_10_wonjun0120.java └── 하 │ ├── .keep │ ├── HaeunKim01 │ ├── 0213_1_HaeunKim01.py │ ├── 0214_2_HaeunKim01.py │ ├── 0215_3_HaeunKim01.py │ ├── 0216_4_HaeunKim01.py │ ├── 0217_5_HaeunKim01.py │ ├── 0220_6_HaeunKim01.py │ ├── 0222_07_HaeunKim01 │ ├── 0222_8_HaeunKim01 │ ├── 0224_10_HaeunKim01 │ └── 0224_9_HaeunKim01 │ ├── hamin924 │ ├── 0213_1_hamin924.py │ ├── 0214_2_hamin924.py │ ├── 0215_3_hamin924.py │ ├── 0216_4_hamin924.py │ ├── 0217_5_hamin924.py │ ├── 0220_6_hamin924.py │ ├── 0221_7_hamin924.py │ ├── 0222_8_hamin924.py │ ├── 0223_9_hamin924.py │ ├── 0224_10_hamin924.py │ └── 2022_8_hamin924.py │ └── syxxnjeong │ ├── 0213_1_syxxnjeong.py │ ├── 0214_2_syxxnjeong.py │ ├── 0215_3_syxxnjeong.py │ ├── 0216_4_syxxnejeong.py │ ├── 0220_6_syxxnjeong.py │ ├── 0221_7_syxxnjeong.py │ ├── 0222_8_syxxnjeong.py │ ├── 0224_10_syxxnjeong.py │ ├── 2017_5_syxxnjeong.py │ └── 2023_9_syxxnjeong.py └── 시즌9 ├── 상 ├── .keep ├── hsun05 │ └── 0401_1_hsun05.py └── kimkimgungunwoo │ ├── )411_kimkimgungunwoo.py │ ├── 0401_kimkimgungunwoo.py │ ├── 0402_kimkimgungunwoo.py │ ├── 0403_kimkimgungunwoo.py │ ├── 0404_kimkimgungunwoo.py │ ├── 0405_kimkimgungunwoo.py │ ├── 0408_kimkimgungunwoo.py │ └── 0410_kimkimgungunwoo.py ├── 중 ├── .keep ├── EJimin0509 │ ├── 0401_1_EJimin0509.py │ ├── 0402_2_EJimin0509.py │ ├── 0403_3_EJimin0509.py │ ├── 0404_4_EJimin0509.py │ ├── 0405_5_EJimin0509.py │ ├── 0406_6_EJimin0509.py │ ├── 0409_7_EJimin0509.py │ ├── 0410_8_EJimin0509.py │ ├── 0411_9_EJimin0509.py │ └── 0412_10_EJimin0509.py ├── HongSeokYoung │ ├── 240401_1_HongSeokYoung.cpp │ ├── 240402_2_HongSeokYoung.cpp │ ├── 240403_3_HongSeokYoung.cpp │ ├── 240404_4_HongSeokYoung.cpp │ ├── 240405_5_HongSeokYoung.cpp │ ├── 240406_6_HongSeokYoung.cpp │ ├── 240407_7_HongSeokYoung.cpp │ ├── 240410_8_HongSeokYoung.cpp │ ├── 240411_9_HongSeokYoung.cpp │ └── 240412_10_HongSeokYoung.cpp ├── JEKKY │ ├── 0401_1_JEKKY.py │ ├── 0402_2_JEKKY.py │ ├── 0403_3_JEKKY.py │ ├── 0404_4_JEKKY.py │ ├── 0405_5_JEKKY.py │ ├── 0408_6_JEKKY.py │ ├── 0409_7_JEKKY.py │ ├── 0410_8_JEKKY.py │ ├── 0411_9_JEKKY.py │ └── 4012_10_JEKKY.py ├── Kimryungyo04 │ ├── 0401_1_Kimryungyo04.py │ ├── 0402_2_Kimryungyo04.py │ ├── 0403_3_Kimryungyo04.py │ ├── 0404_4_Kimryungyo04.py │ ├── 0405_5_Kimryungyo04.py │ ├── 0406_6_Kimryungyo04.py │ ├── 0409_7_Kimryungyo04.py │ ├── 0410_8_Kimryungyo04.py │ ├── 0411_9_Kimryungyo04.py │ └── 0412_10_Kimryungyo04.py ├── gksgh108 │ ├── 0401_1_gksgh108.ipynb │ ├── 0402_2_gksgh108.ipynb │ ├── 0403_3_gksgh108.ipynb │ ├── 0404_4_gksgh108.ipynb │ ├── 0405_5_gksgh108.ipynb │ ├── 0406_6_gksgh108.ipynb │ ├── 0409_7_gksgh108.ipynb │ ├── 0410_8_gksgh108.ipynb │ ├── 0411_9_gksgh108.ipynb │ └── 0413_10_gksgh108.ipynb ├── golapaduck │ ├── 0401_1_golapaduck.py │ ├── 0402_2_golapaduck.py │ ├── 0403_3_golapaduck.py │ ├── 0404_4_golapaduck.c │ ├── 0405_5_golapaduck.py │ ├── 0408_6_golapaduck.py │ ├── 0409_7_golapaduck.py │ ├── 0410_8_golapaduck.py │ ├── 0411_9_golapaduck.py │ └── 0412_10_golapaduck.py └── rvbear │ ├── 0401_1_rvbear.java │ ├── 0402_2_rvbear.java │ ├── 0403_3_rvbear.java │ ├── 0404_4_rvbear.java │ ├── 0405_5_rvbear.java │ ├── 0406_6_rvbear.java │ ├── 0409_7_rvbear.java │ ├── 0410_8_rvbear.java │ ├── 0411_9_rvbear.java │ └── 0412_10_rvbear.java └── 하 ├── .keep └── kkanghyun ├── 0401_1_kkanghyun.cpp ├── 0402_2_kkanghyun.cpp ├── 0403_3_kkanghyun.cpp ├── 0404_4_kkanghyun.cpp ├── 0405_5_kkanghyun.cpp ├── 0406_6_kkanghyun.cpp ├── 0407_7_kkanghyun.cpp ├── 0408_8_kkanghyun.cpp ├── 0409_9_kkanghyun.cpp └── 0410_10_kkanghyun.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | 2 | .DS_Store 3 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # algorithm_challenge 2 | 알고리즘 챌린지 행사용 3 | -------------------------------------------------------------------------------- /시즌1/상/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌1/상/tnsgh9603/0503_2_tnsgh9603.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | N = int(sys.stdin.readline()) 4 | arr = list(range(10)) 5 | 6 | for i in arr: 7 | n = i % 10 8 | y = i * 10 9 | for x in range(n): 10 | arr.append(x + y) 11 | print(arr[N] if N < len(arr) else -1) 12 | -------------------------------------------------------------------------------- /시즌1/중/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌1/중/0503_1_yeonjy.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌1/중/0503_1_yeonjy.c -------------------------------------------------------------------------------- /시즌1/중/KKodiac/0502_1_KKodiac.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | def solution(): 4 | N = int(sys.stdin.readline()) 5 | # 1 - 7 - 19 - 37 - 61 - ... 6 | 7 | answer, location = 1, 1 8 | while N > location: 9 | location += (answer*6) 10 | answer += 1 11 | 12 | print(answer) 13 | if __name__ == "__main__": 14 | solution() 15 | -------------------------------------------------------------------------------- /시즌1/중/KKodiac/0509_6_KKodiac.py: -------------------------------------------------------------------------------- 1 | def solution(): 2 | N = int(input()) 3 | 4 | def TowerOfHanoi(n , from_rod, to_rod, aux_rod): 5 | if n == 0: 6 | return 7 | TowerOfHanoi(n-1, from_rod, aux_rod, to_rod) 8 | print(from_rod, to_rod) 9 | TowerOfHanoi(n-1, aux_rod, to_rod, from_rod) 10 | print(N**2-2) 11 | TowerOfHanoi(N, 1, 3, 2) 12 | 13 | 14 | if '__main__' == __name__: 15 | solution() 16 | -------------------------------------------------------------------------------- /시즌1/중/KKodiac/0512_9_KKodiac.py: -------------------------------------------------------------------------------- 1 | def solution(): 2 | # table[n, k] = table[n, k-1] + table[n-1, k] 3 | N, K = map(int, input().split()) 4 | table = [0] * (N+1) 5 | table[0] = 1 6 | for _ in range(K): 7 | for i in range(1, N+1): 8 | table[i] = (table[i] + table[i-1]) 9 | print(table[N]%1000000000) 10 | 11 | if '__main__' == __name__: 12 | solution() -------------------------------------------------------------------------------- /시즌1/중/gnu-kenny/0502_1_gnu-kenny.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | 5 | def main(): 6 | goal = int(input()) - 1 7 | 8 | i = 0 9 | while True: 10 | if goal <= i*6: 11 | print(i+1) 12 | break 13 | 14 | goal -= i*6 15 | i += 1 16 | 17 | 18 | if __name__ == "__main__": 19 | main() 20 | -------------------------------------------------------------------------------- /시즌1/중/pol6463/0503_2_pol6463.py: -------------------------------------------------------------------------------- 1 | future, now = map(int, input().split()) 2 | 3 | n = int(input()) 4 | array = list(map(int, input().split())) 5 | 6 | totalNum = 0 7 | for i in range(n): 8 | totalNum += array[n-1-i] * pow(future, i) 9 | 10 | res = [] 11 | 12 | while(totalNum > 0): 13 | y = totalNum % now 14 | res.insert(0, y) 15 | totalNum //= now 16 | 17 | 18 | for i in res: 19 | print(i, end=" ") 20 | -------------------------------------------------------------------------------- /시즌1/중/pol6463/0503_9_pol6463.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n, k = map(int, input().split()) 5 | 6 | dp=[[0]*201 for _ in range(201)] 7 | 8 | for i in range(201): 9 | dp[1][i]=1 10 | dp[2][i]=i+1 11 | 12 | for i in range(2, 201): 13 | dp[i][1]=i 14 | for j in range(2, 201): 15 | dp[i][j]=(dp[i][j-1]+dp[i-1][j]) % 1000000000 16 | 17 | print(dp[k][n]) 18 | -------------------------------------------------------------------------------- /시즌1/중/pol6463/0505_4_pol6364.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | data = list(map(int, input().split())) 3 | 4 | dp = [0] * len(data) 5 | dp[0] = data[0] 6 | 7 | for i in range(1, len(data)): 8 | dp[i] = max(data[i], dp[i-1] + data[i]) 9 | 10 | print(max(dp)) 11 | -------------------------------------------------------------------------------- /시즌1/중/pol6463/0509_6_pol6463.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | count = 1 4 | 5 | def hanoi(n, x, y, z): 6 | if n == 1: 7 | print(x, z) 8 | else: 9 | hanoi(n-1, x, z, y) 10 | print(x, z) 11 | hanoi(n-1, y, x, z) 12 | 13 | for i in range(n-1): 14 | count = count * 2 + 1 15 | 16 | print(count) 17 | hanoi(n, 1, 2, 3) -------------------------------------------------------------------------------- /시즌1/중/pol6463/0513_10_pol6463.py: -------------------------------------------------------------------------------- 1 | from math import gcd 2 | 3 | n = int(input()) 4 | x = list(map(int, input().split())) 5 | N = 1 6 | for i in x: 7 | N = N * i 8 | 9 | m = int(input()) 10 | y = list(map(int, input().split())) 11 | M = 1 12 | for i in y: 13 | M = M * i 14 | 15 | res = gcd(N, M) 16 | if (res) >= 1000000000: 17 | print('%09d' %(res%1000000000)) 18 | else: 19 | print(res) -------------------------------------------------------------------------------- /시즌1/중/yeonjy/0503_1_yeonjy.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌1/중/yeonjy/0503_1_yeonjy.c -------------------------------------------------------------------------------- /시즌1/하/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌10/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/상/.keep -------------------------------------------------------------------------------- /시즌10/상/Yupdown/0805_6_Yupdown.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int memo[1000001]; 5 | 6 | int main() 7 | { 8 | int n; 9 | cin >> n; 10 | queue q; 11 | q.push(0); 12 | while (!memo[n]) 13 | { 14 | int i = q.front(); 15 | q.pop(); 16 | for (int j = i + 1, k = 1; j <= n; j = j + k++ * 4 + 1) 17 | { 18 | if (memo[j]) 19 | continue; 20 | memo[j] = memo[i] + 1; 21 | q.push(j); 22 | } 23 | } 24 | cout << memo[n]; 25 | } -------------------------------------------------------------------------------- /시즌10/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/.keep -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0731_3_EJimin0509.py: -------------------------------------------------------------------------------- 1 | num = int(input()) 2 | 3 | hansu = 0 4 | for i in range(1, num+1): 5 | num_list = list(map(int, str(i))) 6 | if i < 100: 7 | hansu += 1 8 | elif num_list[0]-num_list[1] == num_list[1]-num_list[2]: 9 | hansu += 1 10 | print(hansu) -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0801_4_EJimin0509.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | for _ in range(T): 3 | N = int(input()) 4 | a, b = 1, 0 5 | for i in range(N): 6 | a,b = b, a+b 7 | print(a,b) -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0802_5_EJimin0509.py: -------------------------------------------------------------------------------- 1 | def ladder_length(W, H, N): 2 | result = 0 3 | 4 | if (N % 2) == 0: 5 | result = (N-2) / 4 6 | else: 7 | result = (N-1)*(N-1) / (4*N) 8 | 9 | return result*2*H 10 | 11 | W, H, N = map(int, input().split()) 12 | 13 | result = ladder_length(W, H, N) 14 | 15 | print(f"{result:.6f}") 16 | -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0806_7_EJimin0509.py: -------------------------------------------------------------------------------- 1 | from collections import Counter 2 | 3 | n = int(input()) 4 | a = list(map(int, input().split())) 5 | b = list(map(int, input().split())) 6 | 7 | count_a = Counter(a) 8 | 9 | result = 0 10 | for num in b: 11 | if count_a[num] > 0: 12 | count_a[num] -= 1 13 | else: 14 | result += 1 15 | 16 | print(result) 17 | -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0808_9_EJimin0509.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | def main(): 4 | input = sys.stdin.read 5 | data = input().split() 6 | 7 | n = int(data[0]) 8 | k = int(data[1]) 9 | v = list(map(int, data[2:2+n])) 10 | 11 | v.sort() 12 | 13 | sum_val = 0 14 | i = 0 15 | for j in range(n): 16 | sum_val += v[j] * i 17 | if i < k: 18 | i += 1 19 | 20 | print(sum_val) 21 | 22 | if __name__ == "__main__": 23 | main() 24 | -------------------------------------------------------------------------------- /시즌10/중/EJimin0509/0809_10_EJimin0509.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | num = list(map(int, input().split())) 3 | 4 | result = max((i for i in range(n+1) if num.count(i) == i), default=-1) 5 | 6 | print(result) -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240729_1_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240729_1_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240730_2_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240730_2_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240731_3_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240731_3_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240801_4_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240801_4_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240802_5_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240802_5_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240805_6_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240805_6_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240807_8_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240807_8_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240808_9_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240808_9_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/HongSeokYoung/240809_10_HongSeokYoung.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/HongSeokYoung/240809_10_HongSeokYoung.exe -------------------------------------------------------------------------------- /시즌10/중/Jeon-HS4/0731_3_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | def arithmeticSequence(N): 2 | n=0 3 | for i in range(1,N+1): 4 | if ((i<100)or((i%100)//10)*2 == (i//100 + i%10)): 5 | n += 1 6 | return n 7 | 8 | N = int(input()) 9 | print(arithmeticSequence(N)) 10 | -------------------------------------------------------------------------------- /시즌10/중/Jeon-HS4/0801_4_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | t = int(input()) 2 | for _ in range(t): 3 | n = int(input()) 4 | fib0 = [1,0] 5 | fib1 = [0,1] 6 | if(n >=2): 7 | for i in range(2,n+1): 8 | fib0.append(fib0[i-2]+fib0[i-1]) 9 | fib1.append(fib1[i-2]+fib1[i-1]) 10 | print(f'{fib0[n]} {fib1[n]}') 11 | -------------------------------------------------------------------------------- /시즌10/중/Jeon-HS4/0802_5_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | w, h, n = map(int, input().split()) 2 | 3 | if n % 2 == 0: 4 | result = (n - 2) / 4.0 5 | else: 6 | result = ((n - 1) * (n - 1)) / (4.0 * n) 7 | 8 | result *= 2 * h 9 | 10 | print(f"{result:.6f}") 11 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0731_3_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # 브루트포스로 체크 2 | 3 | n = int(input()) 4 | if n < 100: print(n); quit() 5 | count = 99 6 | 7 | for num in range(100, n + 1): 8 | nums = list(map(int, str(num))) 9 | 10 | if nums[0] - nums[1] == nums[1] - nums[2]: 11 | count += 1 12 | 13 | print(count) 14 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0801_4_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # 다이나믹 프로그래밍 2 | 3 | dp = [[1, 0], [0, 1]] 4 | 5 | def fibonacci(n): 6 | for _ in range(n - len(dp) + 1): 7 | dp.append([dp[-1][0] + dp[-2][0], dp[-1][1] + dp[-2][1]]) 8 | return dp[n] 9 | 10 | for _ in range(int(input())): 11 | print(*fibonacci(int(input()))) 12 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0802_5_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # 등차수열의 합 공식 활용 2 | # An = n * (H / N) (1 ≤ n ≤ N-1) 3 | # N / 2 보다 왼쪽에 있는 값은 빼고 오른쪽에 있는 값은 더한 후 x2 를 해준다. 4 | 5 | from math import ceil 6 | W, H, N = map(int, input().split()) 7 | 8 | mid = ceil(N / 2) - 1 9 | sum_left = mid / 2 * (2 * (H / N) + (mid - 1) * (H / N)) 10 | sum_right = (H * mid) - sum_left 11 | length = (sum_right - sum_left) * 2 12 | print(f"{length:.6f}") 13 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0806_7_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # 들을 수 있는 수업의 수를 배열에 저장해두고 수업의 수가 부족한 경우 듣지 못하는 학생 수를 1 늘린다 2 | 3 | class_list = [ 0 ] * 1000001 4 | n = int(input()) 5 | 6 | absent_students = 0 7 | 8 | for class_num in map(int, input().split()): 9 | class_list[class_num] += 1 10 | 11 | for class_num in map(int, input().split()): 12 | if class_list[class_num] == 0: 13 | absent_students += 1 14 | else: 15 | class_list[class_num] -= 1 16 | 17 | print(absent_students) 18 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0808_9_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # 아케인 스톤의 경험치 제한이 없으므로 그냥 경험치가 작은 순서대로 경험치를 더해주면 된다. 2 | # 전체 경험치 = 해당 퀘스트의 경험치 * 활성화 된 아케인 스톤의 수 3 | 4 | n, k = map(int, input().split()) 5 | quests = list(map(int, input().split())) 6 | quests.sort() 7 | 8 | exps = 0 9 | stones = 0 10 | for exp in quests: 11 | exps += exp * stones 12 | if stones < k: stones += 1 13 | 14 | print(exps) 15 | -------------------------------------------------------------------------------- /시즌10/중/Kimryungyo04/0809_10_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # N개가 참이라는 말이 N개 존재하면 참이다. 2 | # or 참의 개수가 0~N개일 때를 모두 확인해도 된다. 3 | 4 | from collections import Counter 5 | n, *nums = map(int, open(0).read().split()) 6 | 7 | counts = dict(Counter(nums)) 8 | result = 0 if counts.get(0, 0) == 0 else -1 9 | 10 | for answer, count in counts.items(): 11 | if answer == count: 12 | result = max(result, count) 13 | 14 | print(result) 15 | -------------------------------------------------------------------------------- /시즌10/중/SH4316/0801_4_SH4316.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | v = [] 3 | 4 | for i in range(n): 5 | v.append(int(input())) 6 | # v.sort() 7 | 8 | value = {0: [1, 0], 1: [0, 1]} 9 | def get(n): 10 | val = value.get(n) 11 | if (val == None): 12 | v1 = get(n-1) 13 | v2 = get(n-2) 14 | result = [v1[0] + v2[0], v1[1] + v2[1]] 15 | value[n] = result 16 | return result 17 | return val 18 | 19 | for i in range(n): 20 | val = get(v[i]) 21 | print(val[0], val[1]) 22 | -------------------------------------------------------------------------------- /시즌10/중/coom1222/0730_2_coom1222.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/coom1222/0730_2_coom1222.py -------------------------------------------------------------------------------- /시즌10/중/gksgh108/0802_4_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | for _ in range(N): 3 | M = int(input()) 4 | a, b = 1, 0 5 | for i in range(M): # 0은 1이 호출된 횟수, 1은 0과 1이 호출된 합 6 | a,b = b, a+b 7 | print(a,b) 8 | -------------------------------------------------------------------------------- /시즌10/중/gksgh108/0802_5_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | def result_value(W, H, N): 2 | # N이 홀수일 때와 짝수일 때 각각의 경우를 처리 3 | if N % 2 == 0: 4 | result = (N - 2) / 4.0 5 | else: 6 | result = ((N - 1) * (N - 1)) / (4.0 * N) 7 | 8 | result *= 2 * H 9 | 10 | return result 11 | 12 | # 사용자 입력 받기 13 | W, H, N = map(int, input().split()) 14 | 15 | # 결과 계산 및 출력 16 | print(f"{result_value(W, H, N):.6f}") 17 | -------------------------------------------------------------------------------- /시즌10/중/gksgh108/0806_7_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | a = [0] * 1000001 3 | 4 | for i in map(int, input().split()): 5 | a[i] += 1 6 | 7 | b = 0 8 | for i in map(int, input().split()): 9 | if a[i] >= 1: 10 | a[i] -= 1 11 | else: 12 | b += 1 13 | 14 | print(b) 15 | -------------------------------------------------------------------------------- /시즌10/중/gksgh108/0808_9_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | inp = list(map(int, input().split())) 2 | N, K = inp[0], inp[1] 3 | 4 | # 리스트 입력 받고 정렬 5 | lst = sorted(list(map(int, input().split()))) 6 | answer = 0 7 | 8 | # 계산 9 | for i in range(1, N): 10 | answer += (i - (i - K if i - K > 0 else 0)) * lst[i] 11 | 12 | print(answer) 13 | -------------------------------------------------------------------------------- /시즌10/중/gksgh108/0809_10_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | nums = list(map(int, input().split())) 3 | 4 | result = -1 5 | frequency = [0] * (n + 1) 6 | 7 | for num in nums: 8 | if num <= n: 9 | frequency[num] += 1 10 | 11 | for i in range(n + 1): 12 | if frequency[i] == i: 13 | result = i 14 | 15 | print(result) 16 | -------------------------------------------------------------------------------- /시즌10/중/kkanghyun/0802_5_kkanghyun.cs: -------------------------------------------------------------------------------- 1 |  2 | string[] input = Console.ReadLine()!.Split(); 3 | double W = double.Parse(input[0]); 4 | double H = double.Parse(input[1]); 5 | int N = int.Parse(input[2]); 6 | 7 | double length = 0.0; 8 | if (N % 2 == 0) 9 | length = H * ((N - 2) / 2); 10 | else 11 | length = H * (Math.Pow((N - 1), 2) / (2 * N)); 12 | 13 | Console.WriteLine(length.ToString("F6")); -------------------------------------------------------------------------------- /시즌10/중/kkanghyun/0806_7_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int N; 8 | cin >> N; 9 | 10 | unordered_map m; 11 | for (int i = 0; i < N; ++i) 12 | { 13 | int cls; 14 | cin >> cls; 15 | ++m[cls]; 16 | } 17 | 18 | int ans = 0; 19 | for (int i = 0; i < N; ++i) 20 | { 21 | int cls; 22 | cin >> cls; 23 | m[cls] == 0 ? ++ans : --m[cls]; 24 | } 25 | 26 | cout << ans; 27 | } -------------------------------------------------------------------------------- /시즌10/중/kkanghyun/0807_8_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/중/kkanghyun/0807_8_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌10/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌10/하/.keep -------------------------------------------------------------------------------- /시즌10/하/0729_1_gayeon11.py: -------------------------------------------------------------------------------- 1 | N=int(input()) 2 | re_N = N 3 | cycle = 0 4 | while True: 5 | a = re_N//10 #정수 앞자리 6 | b = re_N%10 #정수 뒷자리 7 | c = (a+b)%10 #더한 수의 뒷자리 8 | re_N = (b*10)+c #정수 뒷자리와 더한 수의 뒷자리 연결 9 | cycle+=1 #사이클 길이 +1 10 | if(re_N == N): 11 | break 12 | print(cycle) -------------------------------------------------------------------------------- /시즌10/하/0730_2_gayeon11.py: -------------------------------------------------------------------------------- 1 | #set: 중복을 허용하지 않음, 순서가 없음 2 | 3 | N=int(input()) 4 | li=[] 5 | 6 | for _ in range(N): 7 | x, y = map(int,input().split()) 8 | for i in range(y, y+10): 9 | for j in range(x, x+10): 10 | li.append(i*100 + j) 11 | 12 | print(len(list(set(li)))) -------------------------------------------------------------------------------- /시즌10/하/0731_3_gayeon11.py: -------------------------------------------------------------------------------- 1 | stu = int(input()) 2 | number = input().split() 3 | number = list(map(int, number)) 4 | li=[] 5 | for i in range(stu): 6 | li.insert(number[i], i+1) 7 | li.reverse() 8 | print(*li) -------------------------------------------------------------------------------- /시즌10/하/0802_5_gayeon11.py: -------------------------------------------------------------------------------- 1 | li = [] 2 | for i in range(5): 3 | agent = input() 4 | if 'FBI' in agent: 5 | li.append(i+1) 6 | 7 | if len(li) > 0: 8 | print(*li) 9 | else: 10 | print("HE GOT AWAY!") -------------------------------------------------------------------------------- /시즌10/하/0805_6_gayeon11.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | # N이 1일 때 = 경우 2 3 | # N이 2일 때 = 경우 4 4 | # N이 3일 때 = 경우 8 5 | # ... N이 n일 때 = 경우 2**n 6 | print(2**N) -------------------------------------------------------------------------------- /시즌10/하/0806_7_gayeon11.py: -------------------------------------------------------------------------------- 1 | N, M = map(int, input().split()) 2 | while True: 3 | if(M == 1 or M == 2): 4 | print("NEWBIE!") 5 | break 6 | elif(M <= N): 7 | print("OLDBIE!") 8 | break 9 | else: 10 | print("TLE!") 11 | break -------------------------------------------------------------------------------- /시즌10/하/0808_9_gayeon11.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | 3 | number = 2**N+1 #한 변 4 | print(number**2) #한 변의 제곱 -------------------------------------------------------------------------------- /시즌10/하/Dohoon306/0729_1_Dohoon306.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num, n, circle = 1, first, second; 4 | scanf("%d", &num); 5 | n = num; 6 | do{ 7 | first = num / 10; 8 | second = num % 10; 9 | num = second * 10 + (first + second) % 10; 10 | circle++; 11 | } while (num != n); 12 | printf("%d\n", circle - 1); 13 | } 14 | -------------------------------------------------------------------------------- /시즌10/하/Dohoon306/0805_6_Dohoon306.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int N, total = 2;//1 2 | int main() { 3 | int N, M; 4 | scanf("%d %d", &N, &M); 5 | if (M == 1 || M == 2) { 6 | printf("NEWBIE!"); 7 | } 8 | else if (M != 1 && M != 2 && M <= N) { 9 | printf("OLDBIE!"); 10 | } 11 | else { 12 | printf("TLE!"); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /시즌10/하/Dohoon306/0808_9_Dohoon306.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int N, side = 2, spot; 4 | scanf("%d", &N); 5 | for (int i = 0; i < N; i++) { 6 | side = side * 2 - 1; 7 | } 8 | printf("%d\n", side * side); 9 | } 10 | -------------------------------------------------------------------------------- /시즌10/하/Dohoon306/0809_10_Dohoon306.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int N, side = 2, pentagon = 5; 5 | scanf("%d", &N); 6 | 7 | for (int i = 1; i < N; i++) { 8 | side++; 9 | pentagon = (pentagon + (side * 3 - 2)) % 45678; 10 | } 11 | 12 | printf("%d\n", pentagon); 13 | } 14 | -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240826_1110.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 1110 '더하기 사이클' 2 | 3 | number = int(input()) 4 | first = number 5 | count = 0 6 | 7 | while(True): 8 | ten = number // 10 % 10 9 | one = number % 10 10 | sumA = (ten + one) % 10 11 | 12 | newnumber = one * 10 + sumA 13 | 14 | count +=1 15 | 16 | number = newnumber 17 | 18 | if first == number: 19 | break 20 | 21 | print(count) -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240826_2563.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 2563 색종이 문제 2 | 3 | canvas = [[0] * 100 for _ in range(100)] 4 | 5 | n = int(input()) 6 | 7 | for _ in range(n): 8 | x, y = map(int, input().split()) 9 | for i in range(x, x + 10): 10 | for j in range(y, y + 10): 11 | canvas[i][j] = 1 12 | 13 | area = 0 14 | for row in canvas: 15 | area += sum(row) 16 | 17 | print(area) 18 | -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240827_2605.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 2605 줄 세우기 문제 2 | 3 | N = int(input()) 4 | 5 | pickNumber = list(map(int, input().split())) 6 | 7 | student_list = [] 8 | 9 | for i in range(N): 10 | index = i - pickNumber[i] 11 | student_list.insert(index, i + 1) 12 | 13 | print(' '.join(map(str, student_list))) -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240829_24723.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 24723 녹색거탑 문제 2 | 3 | N = int(input()) 4 | 5 | print(2**N) -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240829_2857.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 2857 FBI 문제 2 | 3 | count = 0 4 | check = 0 5 | 6 | for i in range(5): 7 | name = input() 8 | count+=1 9 | if 'FBI' in name: 10 | check = 1 11 | print(count) 12 | 13 | if check == 0: 14 | print("HE GOT AWAY!") -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240830_1964.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 1964 오각형, 오각형, 오각형… 문제 2 | 3 | # def solve(n): 4 | # result = (3 * n * n + 5 * n + 2) // 2 5 | # return result % 45678 6 | 7 | # n = int(input()) 8 | # print(solve(n)) 9 | 10 | n = 1 11 | 12 | N = int(input()) 13 | 14 | for i in range(N): 15 | 16 | n = n + 1 + 3*(i+1) 17 | 18 | n = n % 45678 19 | 20 | print(n) -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240830_19944.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 19944 뉴비의 기준은 뭘까? 문제 2 | 3 | N, M = map(int, input().split()) 4 | 5 | if(M == 1 or M == 2): 6 | print("NEWBIE!") 7 | 8 | elif(M <= N): 9 | print("OLDBIE!") 10 | 11 | else: 12 | print("TLE!") -------------------------------------------------------------------------------- /시즌10/하/HongSeokYoung/240830_2903.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 2903 중앙 이동 알고리즘 문제 2 | 3 | N = int(input()) 4 | 5 | number = 2 6 | count = 1 7 | 8 | for i in range(N): 9 | number = number + count 10 | count = count*2 11 | 12 | total = number * number 13 | 14 | print(total) -------------------------------------------------------------------------------- /시즌11/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/상/.keep -------------------------------------------------------------------------------- /시즌11/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/.keep -------------------------------------------------------------------------------- /시즌11/중/24YG/1003_4_24YG.C: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a, b; 5 | long long sum=0; 6 | scanf("%d %d",&a,&b); 7 | if (b>=4) { 8 | if (a<4) { 9 | a=4; 10 | } 11 | for (int i=a; i<=b; i++) { 12 | if (i%2==0) { 13 | sum+=i; 14 | } 15 | } 16 | } 17 | printf("%lld",sum); 18 | } 19 | -------------------------------------------------------------------------------- /시즌11/중/HongSeokYoung/240930_1_HongSeokYoung.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/HongSeokYoung/240930_1_HongSeokYoung.cpp -------------------------------------------------------------------------------- /시즌11/중/HongSeokYoung/241003_4_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 11896 다각형 문제 2 | 3 | def sum_of_even_polygons(a, b): 4 | if a < 3: 5 | a = 3 6 | 7 | if a % 2 != 0: 8 | a += 1 9 | 10 | if b < 3: 11 | return 0 12 | 13 | if b % 2 != 0: 14 | b -= 1 15 | 16 | if a > b: 17 | return 0 18 | 19 | n = (b - a) // 2 + 1 20 | return (a + b) * n // 2 21 | 22 | a, b = map(int, input().split()) 23 | 24 | print(sum_of_even_polygons(a, b)) -------------------------------------------------------------------------------- /시즌11/중/HongSeokYoung/241004_5_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 20937 떡국 문제 2 | 3 | from collections import Counter 4 | 5 | # 입력 받기 6 | N = int(input()) # 그릇의 개수 7 | sizes = list(map(int, input().split())) # 각 그릇의 크기 8 | 9 | # 각 그릇 크기의 빈도 계산 10 | size_counts = Counter(sizes) 11 | 12 | # 가장 많이 등장한 그릇 크기의 빈도를 찾기 13 | max_count = max(size_counts.values()) 14 | 15 | # 결과 출력 16 | print(max_count) 17 | -------------------------------------------------------------------------------- /시즌11/중/gksgh108/1002_3_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n, k, a, b = map(int, input().split()) 2 | arr = [k] * n 3 | 4 | day = 0 5 | while 0 not in arr: 6 | # A개의 화분에 B씩 물주기 7 | for i in range(a): 8 | arr[i] += b 9 | 10 | # 모든 화분의 수분이 1씩 감소 11 | for i in range(len(arr)): 12 | arr[i] -= 1 13 | 14 | # 수분이 적은 순으로 재 정렬 15 | arr.sort() 16 | day += 1 17 | 18 | print(day) 19 | -------------------------------------------------------------------------------- /시즌11/중/gksgh108/1004_4_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | a, b = map(int, input().split()) 2 | 3 | A = ((a + 1) // 2) * 2 4 | B = (b // 2) * 2 5 | 6 | if A <= 2: 7 | A = 4 8 | 9 | if B < A: 10 | print(0) 11 | else: 12 | num = ((B - A) // 2) + 1 13 | print(num * (A + B) // 2) 14 | -------------------------------------------------------------------------------- /시즌11/중/gksgh108/1004_5_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | tteok = list(map(int, input().split())) 3 | 4 | # 정렬 5 | tteok.sort() 6 | 7 | # 최대 중복 개수 찾기 8 | max_count = current_count = 1 9 | 10 | for i in range(1, N): 11 | if tteok[i] == tteok[i - 1]: 12 | current_count += 1 13 | else: 14 | max_count = max(max_count, current_count) 15 | current_count = 1 16 | 17 | max_count = max(max_count, current_count) # 마지막 그룹 체크 18 | 19 | print(max_count) 20 | -------------------------------------------------------------------------------- /시즌11/중/gksgh108/1008_7_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n,m = list(map(int,input().split())) 2 | 3 | s = [] 4 | 5 | def dfs(): 6 | if len(s)==m: 7 | print(' '.join(map(str,s))) 8 | return 9 | 10 | for i in range(1,n+1): 11 | if i not in s: 12 | s.append(i) 13 | dfs() 14 | s.pop() 15 | 16 | dfs() 17 | -------------------------------------------------------------------------------- /시즌11/중/kimryungyo/1003_4_kimryungyo.py: -------------------------------------------------------------------------------- 1 | # 놓칠만한 부분이 은근 많다.. 2 | # 풀이 : 각이 짝수개인 경우에만 모든 선분을 자를 수 있다. 3 | 4 | A, B = map(int, input().split()) 5 | if B < 4: result = 0 6 | else: 7 | if A < 4: A = 4 8 | if A % 2 == 1: A += 1 9 | if B % 2 == 1: B -= 1 10 | result = ((B // 2) - (A // 2) + 1) * ((A // 2) + (B // 2)) 11 | print(result) 12 | -------------------------------------------------------------------------------- /시즌11/중/kimryungyo/1004_5_kimryungyo.py: -------------------------------------------------------------------------------- 1 | # 역시 에드혹은 어렵다.. 2 | # 풀이 : 크기가 같은 그릇이 가장 많은 그릇의 수가 답이다. 3 | 4 | from collections import Counter 5 | N, *nums = map(int, open(0).read().split()) 6 | print(max(Counter(nums).values())) 7 | -------------------------------------------------------------------------------- /시즌11/중/kkanghyun/0930_1_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/kkanghyun/0930_1_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌11/중/kkanghyun/1001_2_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/kkanghyun/1001_2_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌11/중/kkanghyun/1002_3_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/kkanghyun/1002_3_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌11/중/kkanghyun/1003_4_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | size_t a, b; 7 | cin >> a >> b; 8 | 9 | size_t sum = 0; 10 | for (int i = a + (a & 1); i <= b; i += 2) 11 | { 12 | if (i == 2) 13 | continue; 14 | 15 | sum += i; 16 | } 17 | 18 | cout << sum; 19 | } -------------------------------------------------------------------------------- /시즌11/중/kkanghyun/1011_10_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/중/kkanghyun/1011_10_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌11/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/.keep -------------------------------------------------------------------------------- /시즌11/하/2024591017오재윤/dhwodbs.py: -------------------------------------------------------------------------------- 1 | menu_count = int(input()) 2 | menu_price = [int(input()) for _ in range(menu_count)] 3 | M = int(input()) 4 | buy_menu = [int(input()) for _ in range(M)] 5 | sum = 0 6 | 7 | for i in range(M): 8 | sum += menu_price[int(buy_menu[i]) - 1] 9 | 10 | 11 | print(sum) 12 | -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1002_3_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1002_3_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1003_4_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1003_4_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1004_5_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1004_5_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1007_6_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1007_6_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1009_8_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1009_8_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1010_9_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1010_9_gayeon11.c -------------------------------------------------------------------------------- /시즌11/하/gayeon11/1011_10_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌11/하/gayeon11/1011_10_gayeon11.c -------------------------------------------------------------------------------- /시즌12/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/상/.keep -------------------------------------------------------------------------------- /시즌12/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/중/.keep -------------------------------------------------------------------------------- /시즌12/중/HongSeokYoung/250206_4_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 13699 '점화식' 문제 2 | n = int(input()) 3 | dp = [0] * (n + 1) 4 | dp[0] = 1 # 초기 조건 5 | 6 | for i in range(1, n + 1): 7 | for j in range(i): 8 | dp[i] += dp[j] * dp[i - 1 - j] 9 | 10 | print(dp[n]) -------------------------------------------------------------------------------- /시즌12/중/HongSeokYoung/250210_6_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 1193 '분수찾기' 문제 2 | X = int(input()) 3 | 4 | # 몇 번째 대각선인지 찾기 5 | n = 1 6 | while n * (n + 1) // 2 < X: 7 | n += 1 8 | 9 | # 해당 대각선에서 몇 번째인지 계산 10 | start = n * (n - 1) // 2 + 1 11 | index = X - start 12 | 13 | # 분수 찾기 14 | if n % 2 == 0: # 짝수 대각선 15 | numerator = 1 + index 16 | denominator = n - index 17 | else: # 홀수 대각선 18 | numerator = n - index 19 | denominator = 1 + index 20 | 21 | print(f"{numerator}/{denominator}") -------------------------------------------------------------------------------- /시즌12/중/HongSeokYoung/250212_8_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | #백준 알고리즘 1463 '1로 만들기' 문제 2 | N = int(input()) 3 | 4 | dp = [0] * (N + 1) 5 | 6 | for i in range(2, N + 1): 7 | dp[i] = dp[i - 1] + 1 # 기본적으로 1 빼는 연산 8 | if i % 2 == 0: 9 | dp[i] = min(dp[i], dp[i // 2] + 1) 10 | if i % 3 == 0: 11 | dp[i] = min(dp[i], dp[i // 3] + 1) 12 | 13 | print(dp[N]) 14 | -------------------------------------------------------------------------------- /시즌12/중/HongSeokYoung/250213_9_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | #백준 알고리즘 1254 '팰린드롬 만들기' 문제 2 | def is_palindrome(s): 3 | return s == s[::-1] 4 | 5 | def min_palindrome_length(S): 6 | for i in range(len(S)): 7 | if is_palindrome(S[i:]): 8 | return len(S) + i # 앞부분을 뒤집어서 추가하면 됨 9 | return 2 * len(S) - 1 # 모든 문자가 다 달라서 최악의 경우 10 | 11 | S = input().strip() 12 | print(min_palindrome_length(S)) -------------------------------------------------------------------------------- /시즌12/중/ming0o/.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | -------------------------------------------------------------------------------- /시즌12/중/ming0o/6일차.js: -------------------------------------------------------------------------------- 1 | const fs = require("fs"); 2 | const X = Number(fs.readFileSync("/dev/stdin").toString().trim()); 3 | 4 | let limit = 1, n = 1; 5 | 6 | while (limit < X) { 7 | limit += ++n; 8 | } 9 | 10 | const a = n - (limit - X); 11 | 12 | if (n % 2 === 0) { 13 | console.log(`${a}/${n - a + 1}`); 14 | } else { 15 | console.log(`${n - a + 1}/${a}`); 16 | } 17 | -------------------------------------------------------------------------------- /시즌12/중/ming0o/8일차.js: -------------------------------------------------------------------------------- 1 | let input = require('fs').readFileSync('/dev/stdin').toString().trim(); 2 | 3 | let n = parseInt(input); 4 | const dp = new Array(n + 1).fill(0); 5 | for (let i = 2; i <= n; i++) { 6 | dp[i] = dp[i - 1] + 1; 7 | if (i % 2 === 0) dp[i] = Math.min(dp[i], dp[i / 2] + 1); 8 | if (i % 3 === 0) dp[i] = Math.min(dp[i], dp[i / 3] + 1); 9 | } 10 | console.log(dp[n]); -------------------------------------------------------------------------------- /시즌12/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/하/.keep -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0203_1_Yoon493.py: -------------------------------------------------------------------------------- 1 | N = int(input()) # 동호가 저번 달에 이용한 통화의 개수 2 | N_list = list(map(int, input().split())) # 통화시간 N개 3 | 4 | Y = 0 # 영식 요금제 5 | M = 0 # 민식 요금제 6 | 7 | # 요금제 계산 8 | for n in N_list: 9 | Y += (n//30 + 1)* 10 # 영식 요금제 계산 10 | M += (n//60 + 1)* 15 # 민식 요금제 계산 11 | 12 | # 출력 13 | if Y < M: 14 | print("Y", Y) # 영식 요금제가 더 쌀 때 15 | elif M < Y: 16 | print("M", M) # 민식 요금제가 더 쌀 때 17 | else: 18 | print("Y M", Y) # 두 요금제의 요금이 모두 같을때 -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0204_2_Yoon493.py: -------------------------------------------------------------------------------- 1 | long_name = input().split('-') 2 | 3 | for short_name in long_name: 4 | print(short_name[0], end="") -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0205_3_Yoon493.py: -------------------------------------------------------------------------------- 1 | word1 = list(input()) 2 | word2 = list(input()) 3 | 4 | i = 0 5 | while i < len(word1): 6 | if word1[i] in word2: # word1의 요소가 word2에 있을 때 7 | word2.remove(word1[i]) # 먼저 word2에 있는 요소를 지운 8 | word1.remove(word1[i]) # 후에 word1에 있는 요소를 지운다. 9 | i -= 1 # 길이가 1만큼 짧아졌으므로 10 | i += 1 11 | 12 | print(len(word1) + len(word2)) # 같은 것을 지웠으므로 나머지 철자를 지우면 애너그램 관계에 있음. -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0206_4_Yoon493.py: -------------------------------------------------------------------------------- 1 | while True: 2 | n = int(input()) 3 | divisor_list = [] 4 | total = 0 5 | 6 | for i in range(1, n): 7 | if n % i == 0: 8 | divisor_list.append(i) 9 | total += i 10 | 11 | if n == -1: 12 | break 13 | elif n == total: 14 | print(f"{n} = {" + ".join(str(i) for i in divisor_list)}") 15 | else: 16 | print(f"{n} is NOT perfect.") -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0207_5_Yoon493.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | f = [0, 1, 1] 3 | 4 | for i in range (3, n + 1): 5 | f.append(f[i - 1] + f[i - 2]) 6 | i += 1 7 | 8 | print(f[n]) -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0210_6_Yoon493.py: -------------------------------------------------------------------------------- 1 | N = int(input()) # 메뉴의 개수 N 2 | list_A = [] # 메뉴의 가격을 저장할 리스트 3 | total = 0 # 결제해야 하는 금액의 총액 4 | 5 | for i in range (0, N): 6 | A = int(input()) 7 | list_A.append(A) 8 | i += 1 9 | 10 | M = int(input()) 11 | 12 | for j in range (0, M): 13 | B = int(input()) 14 | total += list_A[B - 1] # B-1번째 줄에는 B-1번째 코너에서 판매하는 메뉴의 가격 15 | j += 1 16 | 17 | print(total) -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0211_7_Yoon493.py: -------------------------------------------------------------------------------- 1 | num1 = int(input()) 2 | num2 = str(input()) 3 | 4 | print (num1 * int(num2[2])) 5 | print (num1 * int(num2[1])) 6 | print (num1 * int(num2[0])) 7 | print (num1 * int(num2)) -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0212_8_Yoon493.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | numbers = list(map(int, input().split())) 3 | print(min(numbers), max(numbers)) -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0213_9_Yoon493.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | numbers = list(map(int, input().split())) 3 | total = 0 4 | 5 | for num in numbers: 6 | if num == 1: 7 | continue 8 | 9 | for i in range(2, num + 1): 10 | if num % i == 0: 11 | if num == i: 12 | total += 1 13 | break 14 | 15 | print(total) -------------------------------------------------------------------------------- /시즌12/하/Yoon493/0214_10_Yoon493.py: -------------------------------------------------------------------------------- 1 | S = str(input()) 2 | 3 | CHOSUNG_LIST = ["ㄱ", "ㄲ", "ㄴ", "ㄷ", "ㄸ", "ㄹ", "ㅁ", "ㅂ", "ㅃ", "ㅅ", "ㅆ", "ㅇ", "ㅈ", "ㅉ", "ㅊ", "ㅋ", "ㅌ", "ㅍ", "ㅎ"] 4 | 5 | chosung = "" 6 | for char in S: 7 | if "가" <= char <= "힣": # 한글 범위 확인 8 | unicode_val = ord(char) - 0xAC00 9 | chosung_idx = unicode_val // (21 * 28) # 초성 인덱스 계산 10 | chosung += CHOSUNG_LIST[chosung_idx] 11 | 12 | print(chosung) -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0206_3_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/하/gayeon11/0206_3_gayeon11.c -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0207_4_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/하/gayeon11/0207_4_gayeon11.c -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0209_2_gayeon11.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | char kmp[101]; 6 | scanf("%100s", kmp); 7 | 8 | printf("%c", kmp[0]); 9 | 10 | for (int i = 1; kmp[i] != '\0'; i++) { 11 | if (kmp[i] == '-') { 12 | printf("%c", kmp[i + 1]); 13 | } 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0211_7_gayeon11.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int a, b; 6 | 7 | scanf("%d", &a); 8 | scanf("%d", &b); 9 | 10 | printf("%d\n", a * (b % 10)); 11 | 12 | printf("%d\n", a * ((b/10)%10)); 13 | 14 | printf("%d\n", a * ((b/100)%10)); 15 | 16 | printf("%d", a * b); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0212_8_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/하/gayeon11/0212_8_gayeon11.c -------------------------------------------------------------------------------- /시즌12/하/gayeon11/0215_9_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌12/하/gayeon11/0215_9_gayeon11.c -------------------------------------------------------------------------------- /시즌13/상/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌13/상/kimryungyo/0407_6_kimryungyo.py: -------------------------------------------------------------------------------- 1 | # 기초 DP 2 | 3 | T = int(input()) 4 | for _ in range(T): 5 | n = int(input()) 6 | coins = list(map(int, input().split())) 7 | target = int(input()) 8 | 9 | dp = [0] * (target + 1) 10 | dp[0] = 1 11 | 12 | for coin in coins: 13 | for j in range(coin, target + 1): 14 | dp[j] += dp[j - coin] 15 | 16 | print(dp[target]) -------------------------------------------------------------------------------- /시즌13/중/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌13/중/HongSeokYoung/250331_1_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | 3 | dp = [0] * (N + 1) 4 | 5 | for i in range(2, N + 1): 6 | dp[i] = dp[i - 1] + 1 # 기본적으로 1 빼는 연산 7 | if i % 2 == 0: 8 | dp[i] = min(dp[i], dp[i // 2] + 1) 9 | if i % 3 == 0: 10 | dp[i] = min(dp[i], dp[i // 3] + 1) 11 | 12 | print(dp[N]) -------------------------------------------------------------------------------- /시즌13/중/HongSeokYoung/250403_4_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 1614번 '영식이의 손가락' https://www.acmicpc.net/problem/1614 2 | 3 | Hurt_Finger = int(input()) 4 | Value = int(input()) 5 | 6 | if Hurt_Finger == 1: 7 | result = 8 * Value 8 | 9 | elif Hurt_Finger == 5: 10 | result = 8 * Value + 4 11 | 12 | elif Value % 2 == 0: 13 | result = 4 * (Value + 1) - (5 - Hurt_Finger) 14 | 15 | else: 16 | result = 4 * (Value + 1) - Hurt_Finger + 1 17 | 18 | print(result) -------------------------------------------------------------------------------- /시즌13/중/HongSeokYoung/250404_5_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 14888번 '연산자 끼워넣기' https://www.acmicpc.net/problem/14888 2 | 3 | N = int(input()) 4 | 5 | Nsum, Nminus, Nmul, Ndiv = map(int, input().split()) 6 | 7 | print(Nsum) -------------------------------------------------------------------------------- /시즌13/중/HongSeokYoung/250408_7_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | # 백준 알고리즘 1359번 '복권' https://www.acmicpc.net/problem/1359 2 | 3 | import math 4 | 5 | def comb(n, r): 6 | if r > n: 7 | return 0 8 | return math.comb(n, r) 9 | 10 | N, M, K = map(int, input().split()) 11 | 12 | total_cases = comb(N, M) 13 | win_cases = 0 14 | 15 | for i in range(K, M + 1): 16 | win_cases += comb(M, i) * comb(N - M, M - i) 17 | 18 | probability = win_cases / total_cases 19 | 20 | print(f"{probability:.10f}") -------------------------------------------------------------------------------- /시즌13/중/HongSeokYoung/250411_10_HongSeokYoung.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | N = int(input()) 5 | dp = [0] + [i for i in range(1, N + 1)] # dp[0] = 0, 나머지는 최대 i개로 초기화 6 | 7 | for i in range(1, N + 1): 8 | j = 1 9 | while j * j <= i: 10 | if dp[i] > dp[i - j * j] + 1: 11 | dp[i] = dp[i - j * j] + 1 12 | j += 1 13 | 14 | print(dp[N]) -------------------------------------------------------------------------------- /시즌13/중/kkanghyun/0331_1_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int dp[1'000'001]; 5 | 6 | int main() 7 | { 8 | int N; 9 | cin >> N; 10 | 11 | dp[1] = 0; 12 | for (int i = 2; i <= N; ++i) 13 | { 14 | dp[i] = dp[i - 1] + 1; 15 | 16 | if (i % 3 == 0) 17 | dp[i] = min(dp[i], dp[i / 3] + 1); 18 | 19 | if (i % 2 == 0) 20 | dp[i] = min(dp[i], dp[i / 2] + 1); 21 | } 22 | 23 | cout << dp[N]; 24 | } 25 | 26 | // https://danidani-de.tistory.com/4 -------------------------------------------------------------------------------- /시즌13/중/kkanghyun/0404_5_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/중/kkanghyun/0404_5_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌13/중/kkanghyun/0407_6_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/중/kkanghyun/0407_6_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌13/중/kkanghyun/0408_7_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/중/kkanghyun/0408_7_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌13/중/kkanghyun/0411_10_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int dp[100001]; 5 | 6 | int main() 7 | { 8 | ios::sync_with_stdio(false); 9 | cin.tie(NULL); 10 | 11 | int N; 12 | cin >> N; 13 | 14 | for (int i = 1; i <= N; ++i) 15 | { 16 | dp[i] = i; 17 | 18 | for (int j = 1; j * j <= i; ++j) 19 | { 20 | dp[i] = min(dp[i], dp[i - j * j] + 1); 21 | } 22 | } 23 | 24 | cout << dp[N]; 25 | } -------------------------------------------------------------------------------- /시즌13/중/ldc0721/0331_1_ldc0721.py: -------------------------------------------------------------------------------- 1 | d = [0] * 1000003 2 | 3 | n = int(input()) 4 | 5 | for i in range(2, n+1): 6 | d[i]= d[i-1]+1 7 | if i%2 == 0: 8 | d[i]= min(d[i],d[i//2]+1) 9 | if i%3 == 0: 10 | d[i]= min(d[i],d[i//3]+1) 11 | 12 | print(d[n]) 13 | -------------------------------------------------------------------------------- /시즌13/중/ldc0721/0402_3_ldc0721.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | d = [[0]*100 for _ in range(100)] 3 | a = 0 4 | #색종이 크기 입력 5 | for i in range(n) : 6 | x,y = map(int, input().split()) 7 | for m in range(y,y+10): 8 | for n in range(x,x+10) : 9 | d[n][m] = d[n][m] + 1 10 | 11 | for i in range(100): 12 | for j in range(100): 13 | if d[j][i] >=1 : 14 | a += 1 15 | else : 16 | continue 17 | 18 | print(a) 19 | -------------------------------------------------------------------------------- /시즌13/중/mymuseisyou/0331_1_mymuseisyou.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int n, i; 5 | scanf("%d", &n); 6 | 7 | int dp[n + 1]; 8 | dp[1] = 0; 9 | 10 | for(i=2;i<=n;i++){ 11 | dp[i] = dp[i-1]+1; 12 | if(i%2 == 0 && dp[i/2]+1 < dp[i]) dp[i] = dp[i/2]+1; 13 | if(i%3 == 0 && dp[i/3]+1 < dp[i]) dp[i] = dp[i/3]+1; 14 | } 15 | 16 | printf("%d", dp[n]); 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /시즌13/중/mymuseisyou/0410_9_mymuseisyou.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int n, t1, t2, i; 5 | scanf("%d", &n); 6 | int timeC = 0, timeP = 0; 7 | 8 | for(i=0;i 2 | 3 | int main() { 4 | int n; 5 | int i, j; 6 | scanf("%d", &n); 7 | 8 | int dp[n+1]; 9 | dp[0] = 0; 10 | 11 | for(i=1;i<=n;i++){ 12 | dp[i] = dp[i-1] + 1; 13 | 14 | for(j=1;j*j<=i;j++){ 15 | if (dp[i-j*j] + 1 < dp[i]){ 16 | dp[i] = dp[i-j*j] + 1; 17 | } 18 | } 19 | } 20 | 21 | printf("%d", dp[n]); 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /시즌13/중/rlagusals1102/0331_1_rlagusals1102.py: -------------------------------------------------------------------------------- 1 | def solve(n: int) -> int: 2 | dp: list[int] = [0] * (n+1) 3 | 4 | for i in range(2, n+1): 5 | dp[i] = min([dp[i-1]] + [dp[i//j] for j in(2,3) if i%j == 0]) +1 6 | 7 | return dp[n] 8 | 9 | print(solve(int(input()))) 10 | -------------------------------------------------------------------------------- /시즌13/중/rlagusals1102/0402_3_rlagusals1102.py: -------------------------------------------------------------------------------- 1 | arr: list[list[int]] = [[0] * 100 for _ in range(100)] 2 | cnt = 0 3 | 4 | 5 | for _ in range(int(input())): 6 | n, m = map(int, input().split()) 7 | 8 | for i in range(m, m + 10): 9 | for j in range(n, n + 10): 10 | if not arr[i][j]: 11 | cnt += 1 12 | arr[i][j] = 1 13 | 14 | print(cnt) 15 | -------------------------------------------------------------------------------- /시즌13/중/rlagusals1102/0403_4_rlagusals1102.py: -------------------------------------------------------------------------------- 1 | def solve(n: int, d: int) -> int | None: 2 | if n == 1: 3 | return 8 * d 4 | if n == 5: 5 | return 4 + 8 * d 6 | if n == 3: 7 | return 2 + 4 * d 8 | if n == 2: 9 | return (1 + 8 * (d // 2)) if d % 2 == 0 else (3 + 4 * d) 10 | if n == 4: 11 | return (3 + 4 * d) if d % 2 == 0 else (5 + 8 * (d // 2)) 12 | 13 | n,d = int(input()), int(input()) 14 | print(solve(n, d)) -------------------------------------------------------------------------------- /시즌13/중/rlagusals1102/0407_6_rlagusals1102.py: -------------------------------------------------------------------------------- 1 | map(int, input().split()) 2 | g1,g2 = input(), input() 3 | 4 | ants = [(i, 'L') for i in reversed(g1)] + [(i, 'R') for i in g2] 5 | 6 | for _ in range(int(input())): 7 | i = 0 8 | while i < len(ants) - 1: 9 | if ants[i][1] == 'L' and ants[i+1][1] == 'R': 10 | ants[i], ants[i+1] = ants[i+1], ants[i] 11 | i += 2 12 | else: 13 | i += 1 14 | 15 | print(''.join([i for i, _ in ants])) 16 | -------------------------------------------------------------------------------- /시즌13/중/rlagusals1102/0408_7_rlagusals1102.py: -------------------------------------------------------------------------------- 1 | from itertools import combinations 2 | 3 | n, m, k = map(int, input().split()) 4 | 5 | c = [set(i) for i in combinations(range(1, n + 1), m)] 6 | total = len(c) 7 | 8 | win = sum( 9 | 1 for i in c for j in c if len(i & j) >= k 10 | ) 11 | 12 | print(win / (total * total)) 13 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0331_1_toycartoon.py: -------------------------------------------------------------------------------- 1 | from math import inf 2 | 3 | n = int(input()) 4 | dp = [inf for _ in range(n+1)] 5 | 6 | dp[1] = 0 7 | for i in range(1, n+1): 8 | if i * 3 <= n: 9 | dp[i*3] = min(dp[i] + 1, dp[i*3]) 10 | if i * 2 <= n: 11 | dp[i*2] = min(dp[i] + 1, dp[i*2]) 12 | if i + 1 <= n: 13 | dp[i+1] = min(dp[i] + 1, dp[i+1]) 14 | 15 | 16 | print(dp[n]) 17 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0402_3_toycartoon.py: -------------------------------------------------------------------------------- 1 | p = [[0 for _ in range(100)] for __ in range(100)] 2 | for _ in range(int(input())): 3 | x, y = map(int, input().split()) 4 | 5 | for i in range(y - 1, y + 9): 6 | for j in range(x - 1, x + 9): 7 | p[i][j] = 1 8 | 9 | a = 0 10 | for l in p: 11 | a += l.count(1) 12 | 13 | print(a) 14 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0403_4_toycartoon.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | d = int(input()) 3 | 4 | if n == 1: 5 | print(8 * d) 6 | elif n == 5: 7 | print(4 + 8 * d) 8 | elif n == 3: 9 | print(2 + 4 * d) 10 | elif n == 2: 11 | if d % 2 == 0: 12 | print(1 + 8 * (d // 2)) 13 | else: 14 | print(3 + 4 * d) 15 | elif n == 4: 16 | if d % 2 == 0: 17 | print(3 + 4 * d) 18 | else: 19 | print(5 + 8 * (d // 2)) 20 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0407_6_toycartoon.py: -------------------------------------------------------------------------------- 1 | n1, n2 = map(int, input().split()) 2 | a = [*input()] 3 | b = [*input()] 4 | t = int(input()) 5 | 6 | ans = a[::-1] + b 7 | for i in range(t): 8 | for j in range(len(ans)-1): 9 | if ans[j] in a and ans[j+1] in b: 10 | ans[j], ans[j+1] = ans[j+1], ans[j] 11 | if ans[j+1] in a[0]: 12 | break 13 | 14 | 15 | print("".join(ans)) 16 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0408_7_toycartoon.py: -------------------------------------------------------------------------------- 1 | from itertools import combinations as c 2 | 3 | n, m, k = map(int, input().split()) 4 | a = c(range(n), m) 5 | b = c(range(n), m) 6 | 7 | deno, num = 0, 0 8 | for i in a: 9 | for j in b: 10 | deno += 1 11 | if len(set(i) & set(j)) >= k: 12 | num += 1 13 | 14 | 15 | print(num / deno) 16 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0409_8_toycartoon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | input = sys.stdin.readline 4 | 5 | s = set() 6 | n = int(input()) 7 | a, b = map(int, input().split()) 8 | for i in range(n): 9 | x, y = map(int, input().split()) 10 | s.add((x, y)) 11 | 12 | ans = 0 13 | for v in s: 14 | if (v[0]+a, v[1]+b) in s and (v[0], v[1]+b) in s and (v[0]+a, v[1]) in s: 15 | ans += 1 16 | 17 | print(ans) 18 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0410_9_toycartoon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | input = sys.stdin.readline 4 | 5 | ans = 0 6 | b = 0 7 | for n in range(int(input())): 8 | d, v = map(int, input().split()) 9 | ans += max(0, v - b) 10 | if v - b < 0: 11 | b = d - (v - b) 12 | else: 13 | b = d 14 | 15 | print(ans) 16 | -------------------------------------------------------------------------------- /시즌13/중/toycartoon/0411_10_toycartoon.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | dp = [0 for _ in range(n+1)] 3 | dp[1] = 1 4 | 5 | for i in range(2, n+1): 6 | j = 1 7 | x = 5 8 | while j ** 2 <= i: 9 | x = min(x, dp[i - j ** 2]) 10 | j += 1 11 | 12 | dp[i] = x + 1 13 | 14 | 15 | print(dp[n]) 16 | -------------------------------------------------------------------------------- /시즌13/하/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0402_2_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/하/gayeon11/0402_2_gayeon11.c -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0403_3_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/하/gayeon11/0403_3_gayeon11.c -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0404_4_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/하/gayeon11/0404_4_gayeon11.c -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0404_5_gayeon11.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int a, b, N, a_win = 0, b_win = 0; 6 | 7 | scanf("%d", &N); 8 | 9 | for (int i = 0; i < N; i++) { 10 | scanf("%d %d", &a, &b); 11 | 12 | if (a > b) a_win += 1; 13 | else if (a < b) b_win += 1; 14 | } 15 | 16 | printf("%d %d", a_win, b_win); 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0408_7_gayeon11.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | #include 4 | 5 | int main() { 6 | int T, l = 0; 7 | char li[1000]; 8 | 9 | scanf("%d", &T); 10 | for (int i = 0; i < T; i++) { 11 | scanf("%s\n", li); 12 | l = strlen(li); 13 | 14 | printf("%c%c\n", li[0], li[l - 1]); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0410_8_gayeon11.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int all, sum = 0; 6 | int book[10]; 7 | 8 | scanf("%d", &all); 9 | 10 | for (int i = 0; i < 9; i++) { 11 | scanf("%d", &book[i]); 12 | sum += book[i]; 13 | } 14 | 15 | printf("%d", all - sum); 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0410_9_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/하/gayeon11/0410_9_gayeon11.c -------------------------------------------------------------------------------- /시즌13/하/gayeon11/0411_10_gayeon11.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌13/하/gayeon11/0411_10_gayeon11.c -------------------------------------------------------------------------------- /시즌13/하/선곤/0331_1_Wattamelon.py: -------------------------------------------------------------------------------- 1 | list = [] 2 | 3 | while True: 4 | a = int(input()) 5 | if a == 0 : 6 | break 7 | else: 8 | list.append(a) 9 | 10 | 11 | for i in list: 12 | 13 | while i >= 10: 14 | sum = 0 15 | for j in str(i): 16 | sum += int(j) 17 | i = sum 18 | print(i) 19 | 20 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0403_04_Wattamelon.py: -------------------------------------------------------------------------------- 1 | 2 | while 1: 3 | try: 4 | s , t = map(str, input().split()) 5 | first = list(s) 6 | for i in t : 7 | if first and i == first[0]: 8 | first.pop(0) 9 | if not first : 10 | print("Yes") 11 | else: 12 | print("No") 13 | except: 14 | break 15 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0404_05_Wattamelon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n = int(input()) 5 | first , sec = 0, 0 6 | 7 | 8 | for _ in range(n): 9 | a , b = input().split() 10 | a , b = int(a) , int(b) 11 | 12 | if a > b: 13 | first += 1 14 | elif a < b: 15 | sec += 1 16 | 17 | print(f"{first} {sec}") 18 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0407_06_Wattamelon.py: -------------------------------------------------------------------------------- 1 | 2 | 3 | n , m = input().split() 4 | 5 | n , m = int(n) , int(m) 6 | 7 | print(n//m) 8 | print(n%m) 9 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0408_07_Wattamelon.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | letters = [] 3 | for _ in range(n): 4 | letters.append(input()) 5 | 6 | for letter in letters: 7 | print(f"{letter[0]}{letter[-1]}") 8 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0409_08_Wattamelon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | nums = [] 5 | for _ in range(10): 6 | nums.append(int(input())) 7 | 8 | print(nums[0] - sum(nums[1:])) 9 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0410_09_Wattamelon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | a, b = map(int, input().split()) 5 | 6 | cnt = 0 7 | 8 | 9 | 10 | for i in range(1,a+1): 11 | if a%i == 0: 12 | cnt += 1 13 | if cnt == b and cnt != 0: 14 | print(i) 15 | break 16 | 17 | if cnt < b: 18 | print("0") 19 | -------------------------------------------------------------------------------- /시즌13/하/선곤/0411_10_Wattamelon.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | cnt = 0 5 | cnt_i = 0 6 | n = input().strip() 7 | m = input().strip() 8 | 9 | while cnt_i < len(n): 10 | if n[cnt_i] == m[0]: 11 | if n[cnt_i:cnt_i+len(m)] == m: 12 | cnt += 1 13 | cnt_i += len(m) 14 | else: 15 | cnt_i += 1 16 | else: 17 | cnt_i += 1 18 | 19 | print(cnt) 20 | -------------------------------------------------------------------------------- /시즌2/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌2/상/.keep -------------------------------------------------------------------------------- /시즌2/상/tnsgh9603/0818_7_tnsgh9603.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int p[100001][31],n[100001],N,K,M; 3 | int main(){ 4 | scanf("%d%d%d",&N,&K,&M);--M; 5 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int arr[1500*1500]; 6 | int n; 7 | 8 | 9 | int main(){ 10 | 11 | ios_base::sync_with_stdio(false); 12 | cout.tie(NULL); 13 | cin.tie(NULL); 14 | 15 | cin >> n; 16 | 17 | for(int i = 0 ; i < n*n;i++){ 18 | cin >> arr[i]; 19 | } 20 | sort(arr,arr+n*n); 21 | cout << arr[n*n-n]; 22 | 23 | 24 | 25 | } -------------------------------------------------------------------------------- /시즌2/중/rt3310/0810_1_rt3310.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | arr = list(map(int, input().split())) 3 | 4 | sorted_arr = sorted(arr) 5 | 6 | matching = {} 7 | count = 0 8 | for i in sorted_arr: 9 | if matching.get(i) is None: 10 | matching[i] = count 11 | count += 1 12 | 13 | matched = list(map(lambda x: str(matching.get(x)), arr)) 14 | 15 | print(' '.join(matched)) -------------------------------------------------------------------------------- /시즌2/중/rt3310/0811_2_rt3310.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | result = 0 4 | table = [] 5 | for i in range(n): 6 | table.extend(list(map(int, input().split()))) 7 | table.sort(reverse=True) 8 | while len(table) > n: 9 | table.pop() 10 | 11 | print(table[-1]) -------------------------------------------------------------------------------- /시즌2/중/rt3310/0817_6_rt3310.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | dp = [[0] * n, [0] * n, [0] * n] 4 | 5 | dp[0][0], dp[1][0], dp[2][0] = list(map(int, input().split())) 6 | 7 | for i in range(1, n): 8 | row = list(map(int, input().split())) 9 | dp[0][i] = min(dp[1][i-1] + row[0], dp[2][i-1] + row[0]) 10 | dp[1][i] = min(dp[0][i-1] + row[1], dp[2][i-1] + row[1]) 11 | dp[2][i] = min(dp[0][i-1] + row[2], dp[1][i-1] + row[2]) 12 | 13 | print(min(dp[0][-1], dp[1][-1], dp[2][-1])) -------------------------------------------------------------------------------- /시즌2/초보/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌2/초보/hamin924/0815_4_hamin924.py: -------------------------------------------------------------------------------- 1 | D, H, W = map(int, input().split()) 2 | a=D/((W**2+H**2)**0.5) 3 | print(int(H*a), int(W*a)) -------------------------------------------------------------------------------- /시즌2/초보/hamin924/0816_5_hamin924.py: -------------------------------------------------------------------------------- 1 | R=input() 2 | print(int(R,16)) -------------------------------------------------------------------------------- /시즌2/초보/hamin924/0818_7_hamin924.py: -------------------------------------------------------------------------------- 1 | for i in range(int(input())): 2 | N, M, k, D = map(int, input().split()) 3 | b = 2*D//(k*N*M*(M-1) + M*M*N*(N-1)) 4 | if b: 5 | print(M*(M-1)*N*k*b//2 + M*M*N*(N-1)*b//2) 6 | else: 7 | print(-1) -------------------------------------------------------------------------------- /시즌2/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌2/하/.keep -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0810_1_asyooniverse.py: -------------------------------------------------------------------------------- 1 | line_number = int(input()) 2 | 3 | array_number = [] 4 | 5 | for i in range(line_number): 6 | array_number.append(int(input())) 7 | 8 | array_number.sort() 9 | for i in range(line_number): 10 | print(f"{array_number[i]}") -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0811_2_asyooniverse.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | M = 0 3 | 4 | for i in range(1, N+1): 5 | NL = list(map(int, str(i))) 6 | s = i + sum(NL) 7 | if(s == N): 8 | M = i 9 | break 10 | 11 | print(M) -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0812_3_asyooniverse.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | result = 1 3 | if N>0: 4 | for i in range(1, N+1): 5 | result = result*i 6 | print(result) 7 | 8 | # 16173번 9 | # bfs, deque 써서 다시 풀어보기 -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0815_4_asyooniverse.py: -------------------------------------------------------------------------------- 1 | import math 2 | DHW = input().split() 3 | y = (math.sqrt((math.pow(int(DHW[0]), 2))/(math.pow(int(DHW[2])/int(DHW[1]), 2) + 1))) 4 | x = (int(DHW[2])/int(DHW[1])*y) 5 | print(math.floor(y),math.floor(x)) -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0817_6_asyooniverse.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | N = int(input()) 4 | card=deque() 5 | 6 | for i in range(1,N+1): 7 | card.append(i) 8 | 9 | while len(card)>1: 10 | card.popleft() 11 | card.append(card.popleft()) 12 | 13 | print(card[0]) -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0818_7_asyooniverse.py: -------------------------------------------------------------------------------- 1 | for _ in range(int(input())): 2 | N, M = map(int, input().split()) 3 | for _ in range(M): 4 | a, b = map(int, input().split()) 5 | print(N-1) -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0822_9_asyooniverse.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | arr = list(float(input()) for _ in range(N)) 3 | for i in range(1, N): 4 | arr[i] = max(arr[i], arr[i] * arr[i - 1]) 5 | print('%0.3f' % max(arr)) -------------------------------------------------------------------------------- /시즌2/하/asyooniverse/0824_10_asyooniverse.py: -------------------------------------------------------------------------------- 1 | com = int(input()) 2 | vertex = int(input()) 3 | array = [[] for _ in range(com+1)] 4 | result = 0 5 | visited = [False]*(com+1) 6 | 7 | for _ in range(vertex): 8 | x, y = map(int, input().split()) 9 | array[x].append(y) 10 | array[y].append(x) 11 | 12 | def dfs(i): 13 | global result 14 | result += 1 15 | visited[i] = True 16 | for j in array[i]: 17 | if not visited[j]: 18 | dfs(j) 19 | dfs(1) 20 | print(result-1) -------------------------------------------------------------------------------- /시즌2/하/eunb6/0810_1_eunb6.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | """ 3 | Created on Wed Aug 10 22:30:34 2022 4 | 5 | @author: a0060 6 | """ 7 | 8 | list = [] 9 | n = int(input()) 10 | 11 | for _ in range (n): 12 | list.append(int(input())) 13 | for i in sorted(list): 14 | print(i) -------------------------------------------------------------------------------- /시즌2/하/hamin924/0810_1_hamin924.py: -------------------------------------------------------------------------------- 1 | N=int(input()) 2 | list=[] 3 | 4 | for i in range(N): 5 | list.append(int(input())) 6 | 7 | list=sorted(list) 8 | 9 | print("결과값") 10 | for i in range(len(list)): 11 | 12 | print(list[i]) 13 | 14 | -------------------------------------------------------------------------------- /시즌2/하/hamin924/0811_2_hamin924.py: -------------------------------------------------------------------------------- 1 | N=int(input()) 2 | result = 0 3 | 4 | for i in range(1,N+1): 5 | A=list(map(int, str(i))) 6 | result = i+sum(A) 7 | if result == N: 8 | print(i) 9 | break 10 | if i == N: 11 | print(0) 12 | -------------------------------------------------------------------------------- /시즌3/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌3/상/.keep -------------------------------------------------------------------------------- /시즌3/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌3/중/.keep -------------------------------------------------------------------------------- /시즌3/중/rt3310/1114_1_rt3310.py: -------------------------------------------------------------------------------- 1 | import sys 2 | from collections import defaultdict 3 | 4 | input = sys.stdin.readline 5 | 6 | names = defaultdict(int) 7 | n, m = list(map(int, input().split())) 8 | 9 | for _ in range(n): 10 | names[input().strip()] += 1 11 | 12 | for _ in range(m): 13 | names[input().strip()] += 1 14 | 15 | names = sorted(list(filter(lambda x: names[x] == 2, names))) 16 | print(len(names)) 17 | for i in names: 18 | print(i) -------------------------------------------------------------------------------- /시즌3/중/rt3310/1115_2_rt3310.py: -------------------------------------------------------------------------------- 1 | t = int(input()) 2 | 3 | for _ in range(t): 4 | n = int(input()) 5 | 6 | if n == 0: 7 | print(1, 0) 8 | continue 9 | if n == 1: 10 | print(0, 1) 11 | continue 12 | 13 | dp = [[0] * (n+1), [0] * (n+1)] 14 | dp[0][0] = 1 15 | dp[1][1] = 1 16 | 17 | for i in range(2, n+1): 18 | dp[0][i] = dp[0][i-1] + dp[0][i-2] 19 | dp[1][i] = dp[1][i-1] + dp[1][i-2] 20 | 21 | print(dp[0][-1], dp[1][-1]) -------------------------------------------------------------------------------- /시즌3/중/rt3310/1123_7_rt3310.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | input = sys.stdin.readline 4 | 5 | n, l = map(int, input().split()) 6 | arr = sorted(list(map(int, input().split()))) 7 | 8 | stand = arr[0] 9 | idx = 1 10 | result = 1 11 | while idx < n: 12 | if arr[idx] < stand + l: 13 | idx += 1 14 | continue 15 | 16 | stand = arr[idx] 17 | result += 1 18 | 19 | print(result) -------------------------------------------------------------------------------- /시즌3/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌3/하/.keep -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1115_2_asyooniverse.py: -------------------------------------------------------------------------------- 1 | size = int(input()) 2 | arr = list(map(int, input().split())) 3 | 4 | # 정렬 5 | arr = (list(set(arr))) 6 | arr.sort() 7 | 8 | for i in arr: 9 | print(i,end=' ') -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1116_3_asyooniverse.py: -------------------------------------------------------------------------------- 1 | # Rev(Rev(X) + Rev(Y)) 2 | 3 | def Rev(number): 4 | reverse = int(''.join(list(map(str, number))[::-1])) 5 | return reverse 6 | 7 | number = list(map(str, input().split())) 8 | result = str(Rev((number[0]))+Rev((number[1]))) 9 | 10 | print(Rev(result)) -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1117_4_asyooniverse.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | l = list(map(int, input().split())) 3 | 4 | result = [1] 5 | for i in range(1, n): 6 | result = result[:i-l[i]] + [i+1] + result[i-l[i]:] 7 | 8 | for i in result: 9 | print(i, end = ' ') -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1118_5_asyooniverse.py: -------------------------------------------------------------------------------- 1 | n = input() 2 | 3 | count = {'0':0, '1':0, '2':0, '3':0, '4':0, '5':0, '6':0, '7':0, '8':0} 4 | 5 | for i in range(len(n)) : 6 | if n[i] in ['6', '9'] : 7 | count['6'] += 1 8 | else : 9 | count[n[i]] += 1 10 | 11 | if count['6'] % 2 == 0: 12 | count['6'] = count['6'] // 2 13 | else : 14 | count['6'] = count['6'] // 2 + 1 15 | 16 | print(max(count.values())) -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1122_7_asyooniverse.py: -------------------------------------------------------------------------------- 1 | # 맨 처음에는 딸기우유를 한 팩 마신다. 2 | # 딸기우유를 한 팩 마신 후에는 초코우유를 한 팩 마신다. 3 | # 초코우유를 한 팩 마신 후에는 바나나우유를 한 팩 마신다. 4 | # 바나나우유를 한 팩 마신 후에는 딸기우유를 한 팩 마신다. 5 | 6 | # 0 딸기, 1 초코, 3 바나나 7 | 8 | n = int(input()) 9 | milk = list(map(int,input().split())) 10 | 11 | count = 0 12 | 13 | for i in range(n): 14 | if milk[i] == count % 3: 15 | count += 1 16 | 17 | print(count) -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1123_8_asyooniverse.py: -------------------------------------------------------------------------------- 1 | import math 2 | 3 | for i in range(int(input())): 4 | a, b = map(int, input().split()) 5 | print(math.lcm(a,b), math.gcd(a,b)) -------------------------------------------------------------------------------- /시즌3/하/asyooniverse/1125_9_asyooniverse.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | score = list(map(int, input().split())) 3 | m = max(score) 4 | new_score = [] 5 | 6 | for i in score: 7 | new_score.append(i/m*100) 8 | 9 | print(sum(new_score)/n) -------------------------------------------------------------------------------- /시즌3/하/hamin924/1115_2_hamin924.py: -------------------------------------------------------------------------------- 1 | #입력 2 | N = int(input()) 3 | 4 | num_list = list(map(int, input().split())) 5 | 6 | #출력 7 | for i in sorted(list(set(num_list))): #set으로 중복 방지, sorted로 정렬 8 | print(i, end = ' ') 9 | -------------------------------------------------------------------------------- /시즌3/하/hamin924/1116_3_hamin924.py: -------------------------------------------------------------------------------- 1 | X,Y = input().split() 2 | X = int(X[::-1]) 3 | Y = int(Y[::-1]) 4 | print(int(str(X+Y)[::-1])) -------------------------------------------------------------------------------- /시즌3/하/hamin924/1118_4_hamin924.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | 3 | num = list(map(int,input().split())) 4 | lst= [] 5 | 6 | for i in range(N) : 7 | lst.insert(i-num[i],i+1) 8 | 9 | for k in lst: 10 | print(k,end=' ') -------------------------------------------------------------------------------- /시즌3/하/hamin924/1118_5_hamin924.py: -------------------------------------------------------------------------------- 1 | N = input() 2 | 3 | lst = [0]*10 4 | 5 | for i in range(len(N)): 6 | num = int(N[i]) 7 | if num == 6 or num == 9: 8 | if lst[6] <= lst[9]: 9 | lst[6] += 1 10 | else: 11 | lst[9] += 1 12 | else: 13 | lst[num] += 1 14 | 15 | print(max(lst)) 16 | -------------------------------------------------------------------------------- /시즌3/하/hamin924/1123_7_hamin924: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | a = list(map(int, input().split())) 3 | 4 | count = 0 5 | 6 | for i in range(N): 7 | if a[i] == count % 3: #3을 나누었을 때 나머지 8 | count = count + 1 9 | 10 | print(count) -------------------------------------------------------------------------------- /시즌3/하/hamin924/1123_8_hamin924.py: -------------------------------------------------------------------------------- 1 | def lcm(a, b) : #최소 공배수 2 | return int((a*b) / gcd(a, b)) 3 | 4 | def gcd(a, b) : #최대 공약수 5 | if a == 0 : 6 | return b 7 | else : 8 | return gcd(b % a, a) 9 | 10 | T = int(input()) 11 | 12 | for _ in range(T) : 13 | a, b = map(int, input().split()) 14 | print(lcm(a, b), gcd(a, b)) -------------------------------------------------------------------------------- /시즌3/하/hamin924/1127_9_hamin924.py: -------------------------------------------------------------------------------- 1 | N = int(input()) # 과목 수 2 | test_list = list(map(int, input().split())) 3 | max_score = max(test_list) 4 | 5 | new_list = [] 6 | for score in test_list : 7 | new_list.append(score/max_score *100) # 새로운 점수 생성 8 | test_avg = sum(new_list)/N 9 | print(test_avg) -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1114_1_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | one = [] 2 | sec = [] 3 | 4 | for i in range(3): 5 | data = list(map(int, input().split())) 6 | if i == 1: 7 | one.append(data[1]) 8 | sec.append(data[0]) 9 | else: 10 | one.append(data[0]) 11 | sec.append(data[1]) 12 | 13 | value = min(one) - min(sec) 14 | 15 | if abs(value) >= 2: 16 | print(min(min(one), min(sec))*2 +1) 17 | else: 18 | print(min(one) + min(sec)) 19 | -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1115_2_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | 3 | data = list(map(int, input().split())) 4 | data = list(set(data)) 5 | data.sort() 6 | 7 | for i in data: 8 | print(i, end = ' ') -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1116_3_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | data = list(map(int, input().split())) 2 | 3 | first = int(str(data[0])[::-1]) 4 | sec = int(str(data[1])[::-1]) 5 | pre = first + sec 6 | ans = int(str(pre)[::-1]) 7 | print(ans) -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1117_4_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | ans = [] 2 | T = int(input()) 3 | li = list(map(int,input().split())) 4 | 5 | for i in range(T): 6 | ans.insert(li[i],i+1) 7 | print(*ans[::-1]) -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1118_5_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | T = input() 2 | li = [0] * 9 3 | for x in T: 4 | num = int(x) 5 | if num == 9: 6 | num = 6 7 | li[num] += 1 8 | li[6] = (li[6]+1) // 2 9 | print(max(li)) -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1121_6_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | while True: 2 | data = input() 3 | if data == 'end': 4 | break 5 | case1 = len(re.findall('[aeiou]', data)) != 0 6 | case2 = len(re.findall('[aeiou]{3}|[^aeiou]{3}', data)) == 0 7 | case3 = len(re.findall('([a-df-np-z])\\1', data)) == 0 8 | 9 | if case1 and case2 and case3: 10 | print(f'<{data}> is acceptable.') 11 | else: 12 | print(f'<{data}> is not acceptable.') 13 | -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1122_7_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | data = list(map(int, input().split(" "))) 3 | cnt = 0 4 | 5 | for i in range(T): 6 | if data[i] == cnt % 3: 7 | cnt += 1 8 | 9 | print(cnt) 10 | 11 | -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1123_8_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | 3 | for i in range(T): 4 | data = list(map(int, input().split())) 5 | def GCD(x,y): 6 | while(y): 7 | x,y = y, x%y 8 | return(x) 9 | 10 | def LCM(x,y): 11 | result = (x*y) // GCD(x,y) 12 | return result 13 | print(LCM(data[0], data[1]),GCD(data[0], data[1])) 14 | 15 | -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1124_9_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | 3 | data = list(map(int, input().split())) 4 | cnt = 0 5 | 6 | for i in range(T): 7 | a = data[i]/max(data) * 100 8 | cnt += a 9 | print(cnt / T) 10 | -------------------------------------------------------------------------------- /시즌3/하/hyeonjin9819/1125_10_hyeonjin9819.py: -------------------------------------------------------------------------------- 1 | ax, ay, bx, by, cx, cy = map(int, input().split()) 2 | 3 | if (ax-bx)*(ay-cy) == (ay-by)*(ax-cx): 4 | print(-1.0) 5 | 6 | ab = ((ax-bx)**2 + (ay-by)**2)**0.5 7 | ac = ((ax-cx)**2 + (ay-cy)**2)**0.5 8 | bc = ((bx-cx)**2 + (by-cy)**2)**0.5 9 | 10 | length = [ab+ac, ab+bc, ac+bc] 11 | ans = max(length) - min(length) 12 | print(2*ans) -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1114_1_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 25551 멋쟁이 포닉스 2 | 3 | mask_white, mask_black = map(int, input().split()) 4 | t_white, t_black = map(int, input().split()) 5 | pants_white, pants_black = map(int, input().split()) 6 | 7 | list1 = [mask_white, t_black, pants_white] 8 | list2 = [mask_black, t_white, pants_black] 9 | 10 | min1 = min(list1) 11 | min2 = min(list2) 12 | 13 | if min1 == min2: 14 | other = 0 15 | else: 16 | other = 1 17 | 18 | result = min(min1, min2) * 2 + other 19 | 20 | print(result) -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1116_2_suhyeon3494.py: -------------------------------------------------------------------------------- 1 | # 10867 : 중복 뺴고 정렬하기 2 | 3 | import sys 4 | 5 | input = sys.stdin.readline 6 | n = input() 7 | 8 | num = list(map(int, input().split())) 9 | 10 | for i in sorted(list(set(num))): 11 | print(i, end = ' ') -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1116_3_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 1357 : 뒤집힌 덧셈 2 | 3 | import sys 4 | input = sys.stdin.readline 5 | 6 | a, b = input().rstrip().split() 7 | 8 | rev_a = a[::-1] 9 | rev_b = b[::-1] 10 | 11 | sum = str(int(rev_a) + int(rev_b)) 12 | print(int(sum[::-1])) -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1117_4_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 2605 : 줄 세우기 2 | 3 | import sys 4 | input = sys.stdin.readline 5 | 6 | n = int(input()) 7 | seq = list(map(int, input().rstrip().split())) 8 | 9 | idx = [1] 10 | for i in range(1, n): 11 | idx.insert(i - seq[i], i + 1) 12 | 13 | for i in idx: 14 | print(i, end = ' ') -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1118_5_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 1475 : 방 번호 2 | 3 | n = input() 4 | 5 | ans = [0] * 10 6 | 7 | for i in n: 8 | i = int(i) 9 | n = int(n) 10 | 11 | if i == 6 or i == 9: 12 | if ans[6] < ans[9]: 13 | ans[6] += 1 14 | else: 15 | ans[9] += 1 16 | else: 17 | ans[i] += 1 18 | 19 | print(max(ans)) -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1122_7_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 14720 : 우유 축제 2 | 3 | n = int(input()) 4 | milk = list(map(int, input().split())) 5 | 6 | count = 0 7 | for i in range(n): 8 | if milk[i] == count % 3: 9 | count += 1 10 | print(count) -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1124_8_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 2702 : 초 6 수학 2 | 3 | t = int(input()) 4 | 5 | for _ in range(t): 6 | a, b = map(int, input().split()) 7 | 8 | min_val = min(a, b) 9 | for i in range(min_val + 1, -1, -1): 10 | if a % i == 0 and b % i == 0: 11 | print(a * b // i, i, end = ' ') 12 | print() 13 | break -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1124_9_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 1546 : 평균 2 | import sys 3 | input = sys.stdin.readline 4 | 5 | n = int(input()) 6 | score = list(map(int, input().split())) 7 | 8 | max = max(score) 9 | sum = 0 10 | 11 | for i in range(n): 12 | score[i] = score[i] / max * 100 13 | sum += score[i] 14 | 15 | print(sum / n) 16 | -------------------------------------------------------------------------------- /시즌3/하/suhyeon3484/1125_10_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 1064 : 평행사변형 2 | 3 | ax, ay, bx, by, cx, cy = map(int, input().split()) 4 | 5 | if ((ax - bx) * (ay - cy)==(ay - by) * (ax - cx)): 6 | print(-1.0) 7 | exit(0) 8 | 9 | ab_length = ((ax - bx)**2 + (ay - by)**2)**0.5 10 | ac_length = ((ax - cx)**2 + (ay - cy)**2)**0.5 11 | bc_length = ((bx - cx)**2 + (by - cy)**2)**0.5 12 | 13 | length = [ab_length + ac_length, ab_length + bc_length, ac_length + bc_length] 14 | result = max(length) - min(length) 15 | print(2 * result) -------------------------------------------------------------------------------- /시즌4/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌4/상/.keep -------------------------------------------------------------------------------- /시즌4/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌4/중/.keep -------------------------------------------------------------------------------- /시즌4/중/asyooniverse/Day2 asyooniverse.py: -------------------------------------------------------------------------------- 1 | dp = [0]*11 2 | dp[1]=1 3 | dp[2]=2 4 | dp[3]=4 5 | 6 | for i in range(4,11): 7 | dp[i]=dp[i-1]+dp[i-2]+dp[i-3] 8 | 9 | f=int(input()) 10 | for _ in range(f): 11 | n=int(input()) 12 | print(dp[n]) -------------------------------------------------------------------------------- /시즌4/중/asyooniverse/Day5 asyooniverse.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | s1 = set(input().split()) 3 | 4 | m = int(input()) 5 | s2 = list(input().split()) 6 | result = [] 7 | 8 | for i in s2: 9 | if i in s1: 10 | result.append("1") 11 | else: 12 | result.append("0") 13 | 14 | print(*result) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0207_2_homebdy.py: -------------------------------------------------------------------------------- 1 | def sum(n): 2 | if n == 1: 3 | return 1 4 | elif n == 2: 5 | return 2 6 | elif n == 3: 7 | return 4 8 | return sum(n-3) + sum(n-2) + sum(n-1) 9 | 10 | n = int(input()) 11 | 12 | for i in range(n): 13 | t = int(input()) 14 | print(sum(t)) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0208_3_homebdy.py: -------------------------------------------------------------------------------- 1 | n, l = map(int, input().split()) 2 | 3 | for i in range(l, 101): 4 | x = n / i - (i-1) / 2 5 | if int(x) == x: 6 | x = int(x) 7 | if x > -1: 8 | for i in range(x, x+i): 9 | print(i, end=" ") 10 | break 11 | else: 12 | print(-1) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0209_4_homebdy.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | 3 | n, k = map(int,input().split()) 4 | visited = [-1 for _ in range(100001)] 5 | 6 | q = deque() 7 | q.append(n) 8 | visited[n] = 0 9 | 10 | while q: 11 | x = q.popleft() 12 | if x == k: 13 | print(visited[x]) 14 | break 15 | for nextP in (x-1, x+1 ,2*x): 16 | if 0 <= nextP <= 100000 and visited[nextP] == -1 : 17 | visited[nextP] = visited[x] + 1 18 | q.append(nextP) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0211_6_homebdy.py: -------------------------------------------------------------------------------- 1 | import sys 2 | n, k = map(int, sys.stdin.readline().split()) 3 | stone = list(map(int, sys.stdin.readline().split())) 4 | 5 | dp = [float('inf')] * n 6 | 7 | for i in range(1, n): 8 | for j in range(0, i): 9 | if(j != 0 and dp[j] > k): 10 | continue 11 | power = (i-j) * (abs(stone[j] - stone[i]) + 1) 12 | dp[i] = min(dp[i], power) 13 | 14 | if dp[-1] > k: 15 | print("NO") 16 | 17 | else: 18 | print("YES") -------------------------------------------------------------------------------- /시즌4/중/homebdy/0213_7_homebdy.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | for i in range(int(sys.stdin.readline())): 4 | a, b = map(int, sys.stdin.readline().split()) 5 | if (b % a == 0) and (b // a != 1): 6 | print(1) 7 | else: 8 | print(0) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0215_9_homebdy.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | firecrackers = list(map(int, input().split())) 3 | 4 | for i in range(n-2): 5 | if i == n-3: 6 | firecrackers[-1] -= 1 7 | firecrackers[0] -= 1 8 | break 9 | if firecrackers[-1] >= firecrackers[0]: 10 | firecrackers[-1] -= 1 11 | continue 12 | firecrackers[0] -= 1 13 | 14 | print(max(firecrackers[0], firecrackers[-1])) -------------------------------------------------------------------------------- /시즌4/중/homebdy/0216_10_homebdy.py: -------------------------------------------------------------------------------- 1 | n, k = map(int, input().split()) 2 | coins = [] 3 | dp = [0] * (k+1) 4 | dp[0]= 1 5 | 6 | for _ in range(n): 7 | coins.append(int(input())) 8 | 9 | for coin in coins: 10 | for j in range(coin, k+1): 11 | if j-coin >= 0: 12 | dp[j] += dp[j-coin] 13 | 14 | print(dp[k]) -------------------------------------------------------------------------------- /시즌4/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌4/하/.keep -------------------------------------------------------------------------------- /시즌4/하/0217_11_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | # 1312번: 소수 2 | 3 | A,B,N = map(int, input().split()) 4 | 5 | for i in range(N): # A를 B로 나눈 나머지를 N번 반복하여 구한다. 6 | A = (A%B)*10 # A*10을 B로 나눴을때 몫이 A/B의 소수 첫째자리이다. 7 | 8 | result = A//B 9 | print(result) 10 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0207_2_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | Angles=[] # 입력값들을 배열에 저장 2 | 3 | for i in range(3): 4 | Angles.append(int(input())) 5 | 6 | if(sum(Angles)==180): 7 | if(len(set(Angles))==1): # 모두 60이면 set적용 시 Angle에는 60만 남음 8 | print("Equilateral") 9 | elif(len(set(Angles))==2): # 이등변 삼각형은 같은 각 하나가 제거되어 len == 2가 됨 10 | print("Isosceles") 11 | else: 12 | print("Scalene") 13 | else: 14 | print("Error") 15 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0209_4_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | #1085번: 직사각형에서 탈출 2 | 3 | x,y,w,h = map(int,input().split()) 4 | 5 | # 경계선까지 가장 짧은 거리는 현재 좌표로부터 모서리까지의 직선 거리이므로 6 | # x,y,w-x,h-y의 최솟값만큼 이동하면 된다. 7 | print(min([x,y,w-x,h-y])) 8 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0210_5_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | # 1152번: 단어의 개수 2 | 3 | words = input().split() # 입력값을 공백 기준으로 나누어 리스트에 저장 4 | 5 | print(len(words)) # 단어들이 저장된 리스트의 길이를 출력 6 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0211_6_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | # 1252번: 이진수 덧셈 2 | 3 | a,b = input().split() # 이진수를 입력받을때 int범위를 초과할 수 있으므로 우선 str형태로 입력받음 4 | result = int(a, 2) + int(b, 2) # 10진수 형태로 변형하여 계산 실행 5 | result = bin(result) 6 | print(result[2:]) # 0b~~ 형태로 나오고 있기 때문에 앞 2자리를 제외하고 출력함 7 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0213_7_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | # 13311번 : 행운의 편지 2 | 3 | # 이 문제는 입력이 없고 항상 같은 출력만이 나오기 때문에 결과값이 출력문 한줄이다. 4 | 5 | # n ≡ a-1 (mod a) 에서, n mod a == (a-1) mod a 이므로 6 | # n은 a-1과 a만큼의 차이가 나는 수가 되어야 한다. 7 | # 따라서 n = a-1-a = -1 이 출력되어야 한다. 8 | 9 | print(-1) 10 | -------------------------------------------------------------------------------- /시즌4/하/Jeon-HS4/0214_8_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | # 13221번: Manhattan 2 | 3 | x,y = map(int, input().split()) #처음 손님의 위치를 입력 4 | N = int(input()) 5 | 6 | d = 201 # 그리드의 최대 거리는 200이므로 그 이상으로 설정 7 | dx, dy = 0, 0 # 택시의 기본 위치는 임의의 값으로 설정 8 | 9 | for _ in range(N): 10 | tx, ty = map(int, input().split()) 11 | td = abs(x-tx) + abs(y-ty) #x축으로의 거리와 y축으로의 거리의 합을 구함 12 | if(td security : 10 | print('bigdata?') 11 | elif bigdata < security : 12 | print('security!') 13 | else : 14 | print('bigdata? security!') 15 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_1_gksgh108.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | cnt = 0 3 | start = N 4 | while 1: 5 | a = start//10 6 | b = start%10 7 | c = (a+b)%10 8 | start = (b*10) + c 9 | cnt += 1 10 | 11 | if(start == N): 12 | break 13 | 14 | print(cnt) -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_2_gksgh108.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | c = int(input()) 4 | 5 | if a == b == c == 60: 6 | print("Equilateral") 7 | elif a + b + c == 180: 8 | if a == b or b == c or c == a: 9 | print("Isosceles") 10 | else: 11 | print("Scalene") 12 | else: 13 | print("Error") 14 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_3_gksgh108.py: -------------------------------------------------------------------------------- 1 | n = [] 2 | char = "" 3 | varchar = "" 4 | 5 | while 1: 6 | n = input() 7 | cnt = 0 8 | 9 | if n == '#': 10 | break 11 | else: 12 | char = n[0] 13 | varchar = n[2:] 14 | 15 | for i in range(0, len(varchar)): 16 | if(varchar[i] == char): 17 | cnt += 1 18 | 19 | print('{0} {1}'.format(char, cnt)) 20 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_4_gksgh108.py: -------------------------------------------------------------------------------- 1 | x,y,w,h = map(int,input().split()) 2 | 3 | print(min([x,y,w-x,h-y])) # 0,0에서 x,y랑 현재 위치인 x,y에서 w, h까지의 거리를 비교 4 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_5_gksgh108.py: -------------------------------------------------------------------------------- 1 | n = input().split() # n에 각각 띄어쓰기를 기준으로 분할되어서 들어간다. 2 | 3 | result = len(n) # 개수 체크 4 | print(result) 5 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_6_gksgh108.py: -------------------------------------------------------------------------------- 1 | a,b = map(str, input().split()) 2 | result = bin(int(a, 2) + int(b, 2)) 3 | print(result[2:]) 4 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_7_gksgh108.py: -------------------------------------------------------------------------------- 1 | # import math 2 | # lcm = 1 3 | # for n in range(2,1001): 4 | # lcm = n*lcm//math.gcd(n,lcm) 5 | # print(lcm - 1) 6 | 7 | # 1. 입력이 없고 항상 일정한 출력이 나온다. 8 | # 2. 2 ~ 1000까지 어떠한 정수 N로 나누었을때 항상 똑같은 나머지가 나와야한다. 9 | # 3. 자연스럽게 똑같은 나머지가 나올려면 0이 N가 되어야함을 알 수 있다. 10 | # 4. 즉, 답은 n ≡ a-1 이므로 -1이다. 11 | print(-1) 12 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0206_8_gksgh108.py: -------------------------------------------------------------------------------- 1 | x, y = map(int, input().split()) 2 | N= int(input()) 3 | result = 200 4 | rx, ry = 0, 0 5 | 6 | for i in range(N): 7 | a, b = map(int, input().split()) 8 | dis = pow(pow((x-a),2) + pow((y-b),2), 1/2) # 거리 계산 9 | if (dis0: 14 | print("security!") 15 | elif data<0: 16 | print("bigdata?") 17 | else: 18 | print("bigdata? security!") 19 | -------------------------------------------------------------------------------- /시즌4/하/gksgh108/0217_11_gksgh108.py: -------------------------------------------------------------------------------- 1 | A,B,N = map(int, input().split()) 2 | 3 | for i in range(N): 4 | A = (A%B)*10 5 | result = A//B 6 | 7 | print(result) 8 | -------------------------------------------------------------------------------- /시즌4/하/realhsb/0206_1_realhsb.swift: -------------------------------------------------------------------------------- 1 | // BOJ_1110_더하기사이클 2 | // 3 | // Created by 한수빈 on 2023/02/06. 4 | // 5 | 6 | import Foundation 7 | 8 | var input = readLine() 9 | var num: Int = Int(input!)! 10 | var count: Int = 0 11 | var temp: Int = num 12 | 13 | while(true){ 14 | temp = (temp % 10) * 10 + (((temp / 10) + (temp % 10)) % 10) 15 | count += 1 16 | if temp == num { 17 | break 18 | } 19 | } 20 | 21 | print(count) 22 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0205_1_shay0454.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | int main() { 4 | int l=0,a=0, num = 0; 5 | scanf("%d", &a); 6 | num = a; 7 | num = 10 * (num % 10) + ((num / 10 + num % 10) % 10); 8 | l++; 9 | while (a != num) { 10 | num = 10*(num%10)+((num / 10 + num % 10)%10); 11 | l++; 12 | } 13 | printf("%d", l); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0206_2_shay0454.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | int main() { 4 | int angle[3],i=0; 5 | for (int i = 0; i < 3; i++) { 6 | scanf("%d", angle + i); 7 | } 8 | if (angle[0] + angle[1] + angle[2] != 180) printf("Error"); 9 | else { 10 | if (angle[0] == angle[1]&& angle[1]==angle[2]) printf("Equilateral"); 11 | else if (angle[1] == angle[2]||angle[2]==angle[0]||angle[0]==angle[1]) printf("Isosceles"); 12 | else printf("Scalene"); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0207_2_shay0454.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | int main() { 4 | int angle[3],i=0; 5 | for (int i = 0; i < 3; i++) { 6 | scanf("%d", angle + i); 7 | } 8 | if (angle[0] + angle[1] + angle[2] != 180) printf("Error"); 9 | else { 10 | if (angle[0] == angle[1]&& angle[1]==angle[2]) printf("Equilateral"); 11 | else if (angle[1] == angle[2]||angle[2]==angle[0]||angle[0]==angle[1]) printf("Isosceles"); 12 | else printf("Scalene"); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0209_4_shay054.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int x,y,tx, ty,a,b; 6 | scanf("%d %d %d %d", &x, &y, &tx, &ty); 7 | if (tx - x > ty - y) a = ty - y; 8 | else a = tx - x; 9 | if (x > y) b = y; 10 | else b = x; 11 | if (a > b) printf("%d", b); 12 | else printf("%d", a); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0210_5_shay0454.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | #include 4 | #include 5 | int main() { 6 | char *a= (char*)malloc(1000001),*x; 7 | gets(a); 8 | int count = 0; 9 | while (a!=NULL) { 10 | if (a[0] != ' '&&a[0]!='\0') count++; 11 | a = strstr(a, " "); 12 | if (a == NULL) break; 13 | else if (a[0] == ' ') a++; 14 | } 15 | printf("%d", count); 16 | free(a); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0213_7_shay0454.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | printf("%d",-1); //계산상 음수를 어떤 수로 나눴을 때의 나머지는 양수로 나와야한다, a는 2이상에서 a-1을 a로 나눴을 경우의 나머지는 a-1로 나온다. 4 | return 0; //이때 n이 -1일 경우 2이상의 정수 a로 나눴을때의 나머지는 a-1이 나으므로 -1을 출력하면 된다. 5 | } 6 | -------------------------------------------------------------------------------- /시즌4/하/shay0454/0217_11_shay0454.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | int main() { 4 | int a, b, n,answer; 5 | scanf("%d %d %d", &a, &b, &n); 6 | for (int i = 0; i <= n; i++) { 7 | answer = a / b; 8 | a = 10*(a % b); 9 | } 10 | printf("%d", answer); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0206_1_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 더하기 사이클 2 | 3 | n = int(input()) 4 | num = n 5 | count = 0 6 | 7 | while True: 8 | count += 1 9 | plus = num // 10 + num % 10 10 | num = num % 10 * 10 + plus % 10 11 | if num == n: 12 | break 13 | 14 | print(count) 15 | -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0208_2_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 삼각형 외우기 2 | 3 | a = int(input()) 4 | b = int(input()) 5 | c = int(input()) 6 | 7 | if a == b == c == 60: 8 | print('Equilateral') 9 | elif a + b + c == 180: 10 | if a == b or b == c or a == c: 11 | print('Isosceles') 12 | else: 13 | print('Scalene') 14 | else: 15 | print('Error') 16 | -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0208_3_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 도비의 영어공부 2 | 3 | while True: 4 | n = input() 5 | if n == '#': 6 | break 7 | alphabet = n[0] 8 | sentence = n[2:] 9 | print(alphabet, sentence.count(alphabet) + sentence.count(alphabet.upper())) -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0210_4_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 직사각형에서 탈출 2 | 3 | x, y, w, h = map(int, input().split()) 4 | print(min(x, y, w - x, h - y)) -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0210_5_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 단어의 개수 2 | 3 | sentence = list(input().split()) 4 | print(len(sentence)) -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0213_6_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 이진수 뎃셈 2 | 3 | a, b = map(str, input().split()) 4 | a, b = int(a, 2), int(b, 2) 5 | result = bin(a + b) 6 | print(result[2:]) -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0213_7_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 행운의 편지 2 | 3 | # 2부터 1000까지의 정수를 어떤 수로 나눴을 때, 나머지가 모두 같은 수 구하기 4 | # -1로 나눴을 때 나머지 -1 5 | print(-1) -------------------------------------------------------------------------------- /시즌4/하/suhyeon3484/0215_9_suhyeon3484.py: -------------------------------------------------------------------------------- 1 | # 빅데이터? 정보보호! 2 | 3 | n = int(input()) 4 | memo = input() 5 | bigdata = memo.count('bigdata') 6 | security = memo.count('security') 7 | 8 | if bigdata < security: 9 | print("security!") 10 | elif bigdata > security: 11 | print("bigdata?") 12 | else: 13 | print("bigdata? security!") -------------------------------------------------------------------------------- /시즌5/상/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌5/중/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌5/중/CreateYJ/0404_2_송영재.ipynb: -------------------------------------------------------------------------------- 1 | # 2일차 2 | n = int(input()) 3 | num = sorted(list(map(int,input().split()))) 4 | m = int(input()) 5 | mum = list(map(int,input().split())) 6 | 7 | count = {} 8 | 9 | for i in num : 10 | if i in count : 11 | count[i] += 1 12 | else : 13 | count[i] = 1 14 | 15 | for j in mum : 16 | if j in count : 17 | print(count[j], end =' ') 18 | else : 19 | print(0, end = ' ') 20 | -------------------------------------------------------------------------------- /시즌5/중/CreateYJ/0406_4_CreateYJ.ipynb: -------------------------------------------------------------------------------- 1 | #4일차 2 | 3 | #집의 수 n 4 | n = int(input()) 5 | # 거리라는 선분을 배열로 설정 6 | street = [] 7 | 8 | for _ in range(n) : 9 | street.append(list(map(int,input().split()))) 10 | 11 | for i in range(1, len(street)) : 12 | street[i][0]+=min(street[i-1][1],street[i-1][2]) 13 | street[i][1]+=min(street[i-1][0],street[i-1][2]) 14 | street[i][2]+=min(street[i-1][0],street[i-1][1]) 15 | 16 | print(min(street[n-1])) 17 | 18 | -------------------------------------------------------------------------------- /시즌5/중/Haron1248/0403_1_Haron1248.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int n, count = 0, p; 5 | scanf("%d",&n); 6 | for(int i = 0; i < n; i++){ 7 | int state = 1; 8 | scanf("%d", &p); 9 | if((p%2==0 && p!=2) || p==1) continue; 10 | for (int j = 3; j <= p/3; j+=2){ 11 | if(p%j==0) state = 0; 12 | } 13 | if(state) count++; 14 | } 15 | printf("%d\n", count); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /시즌5/중/Haron1248/0404_2_Haron1248.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() { 4 | int n, m, max_size = 20000001, num; 5 | scanf("%d", &n); 6 | int* cards = (int*)calloc(max_size, sizeof(int)); 7 | for (int i = 0; i < n; i++) { 8 | scanf("%d", &num); 9 | cards[max_size - ((max_size + 1) / 2) + num]++; 10 | } 11 | 12 | scanf("%d", &m); 13 | for (int i = 0; i < m; i++) { 14 | scanf("%d", &num); 15 | printf("%d ", cards[max_size - ((max_size + 1) / 2) + num]); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /시즌5/중/Haron1248/0412_8_Haron1248.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() { 4 | int n, i, j, pre; 5 | scanf("%d", &n); 6 | int min_move = n - 1; 7 | int* arr = (int*)calloc(n, sizeof(int)); 8 | for (i = 0; i < n; i++) { 9 | scanf("%d", &arr[i]); 10 | if (arr[i] == n) break; 11 | } 12 | pre = arr[i] - 1; 13 | for (j = i; j > 0; j--) { 14 | if (arr[j - 1] == pre) { 15 | min_move--; 16 | pre--; 17 | } 18 | } 19 | printf("%d\n", min_move); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /시즌5/중/asyooniverse/Day1 asyooniverse.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n = int(input()) 5 | l = list(map(int, input().split())) 6 | result = 0 7 | 8 | for x in l: 9 | count = 0 10 | if x == 1: 11 | continue 12 | for j in range(2, x): 13 | if x % j == 0: 14 | count += 1 15 | if count == 0: 16 | result += 1 17 | 18 | print(result) -------------------------------------------------------------------------------- /시즌5/중/asyooniverse/Day2 asyooniverse.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n = int(input()) 5 | cards = list(input().split()) 6 | m = int(input()) 7 | set_ = list(input().split()) 8 | result = {} 9 | 10 | for i in set_: 11 | result[i] = 0 12 | 13 | for i in cards: 14 | if i not in result: 15 | continue 16 | result[i] += 1 17 | 18 | for i in set_: 19 | print(result[i], end=' ') -------------------------------------------------------------------------------- /시즌5/중/asyooniverse/Day3 asyooniverse.py: -------------------------------------------------------------------------------- 1 | import sys, math 2 | from collections import Counter 3 | input = sys.stdin.readline 4 | 5 | n = int(input()) 6 | l = [] 7 | for i in range(n): 8 | input_ = int(input()) 9 | l.append(input_) 10 | 11 | l.sort() 12 | count = Counter(l).most_common(2) 13 | 14 | print(math.floor(sum(l)/len(l)+0.5)) 15 | print(l[len(l)//2]) 16 | if len(count) == 1 or count[0][1] != count[1][1]: 17 | print(count[0][0]) 18 | else: 19 | print(count[1][0]) 20 | print(max(l) - min(l)) -------------------------------------------------------------------------------- /시즌5/하/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0403_1_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | resistance_colour_list = ['black','brown','red','orange','yellow','green','blue','violet','grey','white'] 2 | 3 | col_1 = input() 4 | col_2 = input() 5 | col_3 = input() 6 | 7 | value = int(str(resistance_colour_list.index(col_1))+str(resistance_colour_list.index(col_2))) 8 | print(value * (10**resistance_colour_list.index(col_3))) 9 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0404_2_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | def Fibonacci(n): 4 | if n == 0: 5 | return 0 6 | if n == 1: 7 | return 1 8 | 9 | 10 | return Fibonacci(n-1) + Fibonacci(n-2) 11 | 12 | print(Fibonacci(n)) 13 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0405_3_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | 4 | def check_line(n): 5 | if n == 1: 6 | return 1 7 | i,j,c = 1,6,1 8 | while True: 9 | c += 1 10 | i += j 11 | if i >= n: 12 | return c 13 | j+=6 14 | 15 | print(check_line(n)) 16 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0406_4_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | n = input() 2 | count = [n.count(str(i)) for i in range(10)] 3 | count[6] = sum(divmod(count[6]+count[9],2)) 4 | print(max(count[:-1])) 5 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0407_5_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | n, k = map(int, input().split()) 2 | A = list(map(int, input().split(','))) 3 | for i in range(k): 4 | t = [] 5 | for j in range(len(A)-1): 6 | t.append(A[j+1]-A[j]) 7 | A = t.copy() 8 | print(','.join(list(map(str, A)))) 9 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0410_6_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | k, l = map(int, input().split()) 2 | 3 | 4 | def is_good_pw(k, l): 5 | min = l+1 6 | if k > l: 7 | for i in range(l, 1, -1): 8 | if k % i == 0: 9 | min = i 10 | 11 | return "GOOD" if min >= l else f"BAD {min}" 12 | 13 | 14 | print(is_good_pw(k, l)) 15 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0411_7_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | num_list = [] 2 | for i in range(10): 3 | num_list.append(int(input())) 4 | 5 | distance = 100 6 | sum = 0 7 | num = 0 8 | for n in num_list: 9 | sum += n 10 | if distance >= abs(100-sum): 11 | distance = abs(100-sum) 12 | num = sum 13 | 14 | print(num) 15 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0413_9_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | x,y = map(int,input().split()) 2 | 3 | days = 0 4 | for i in range(1,x): 5 | if i == 2: 6 | days += 28 7 | 8 | elif i in [1,3,5,7,8,10,12]: 9 | days += 31 10 | 11 | else : 12 | days += 30 13 | 14 | 15 | days += y 16 | 17 | DOW = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"] 18 | 19 | print(DOW[days%7]) 20 | -------------------------------------------------------------------------------- /시즌5/하/홍석영/0414_10_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | h, y= map(int,input().split()) 2 | 3 | DP = [h] 4 | funds = [1.05,1.2,1.35] 5 | year_length = [1,3,5] 6 | 7 | for i in range(1,y+1): 8 | maxs = [] 9 | for j in range(3): 10 | if len(DP) >= year_length[j]: 11 | t = DP[i-year_length[j]]*funds[j] 12 | maxs.append(t) 13 | else: 14 | break 15 | DP.append(int(max(maxs))) 16 | 17 | print(max(DP)) 18 | -------------------------------------------------------------------------------- /시즌6/상/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌6/중/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌6/중/Haron1248/0809_3_Haron1248.py: -------------------------------------------------------------------------------- 1 | from sys import stdin 2 | 3 | n = int(input()) 4 | stw = [0]*n 5 | max_len = -1 6 | 7 | for i in range(n): # 입력 8 | stw[i] = int(stdin.readline()) 9 | stw.sort(reverse=1) # 정렬 10 | 11 | for i in range(n-2): # 가장 긴 둘레의 삼각형 탐색 12 | if stw[i] < stw[i+1] + stw[i+2]: 13 | max_len = stw[i] + stw[i+1] + stw[i+2] 14 | break # 발견 했으니 퇴장 15 | 16 | print(max_len) 17 | -------------------------------------------------------------------------------- /시즌6/중/Haron1248/0814_6_Haron1248.py: -------------------------------------------------------------------------------- 1 | r={} 2 | for i in range(int(input())): 3 | x,y,z=map(int,input().split()) 4 | r[i+1]=(x**2+y**2)**.5/z 5 | for i,j in sorted(r.items(),key=lambda x:x[1]): 6 | print(i) 7 | -------------------------------------------------------------------------------- /시즌6/중/Hj1218/0817_9_Hj1218.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner in = new Scanner(System.in); 6 | long x = in.nextLong(); 7 | long y = in.nextLong(); 8 | System.out.println(x+y-gcd(x,y)); 9 | } 10 | static long gcd(long x, long y){ 11 | if(y==0){ 12 | return x; 13 | } 14 | return gcd(y,x%y); 15 | } 16 | } -------------------------------------------------------------------------------- /시즌6/중/Jeon-HS4/0814_6_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | # 걸리는 시간과 로봇의 번호를 같이 저장 4 | robots = {} 5 | for i in range(n): 6 | a, b, v = map(int, input().split()) 7 | robots[i+1] = ((a**2 + b**2)**0.5)/v 8 | 9 | # 터지는데 걸리는 시간을 기준으로 로봇의 번호를 정렬 10 | distroy_robots = dict(sorted(robots.items(), key=lambda item: item[1])) 11 | distroy_time = list(distroy_robots.keys()) 12 | 13 | for sequence in distroy_time: 14 | print(sequence) 15 | -------------------------------------------------------------------------------- /시즌6/중/Jeon-HS4/0815_7_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n, l = map(int,input().split()) 2 | 3 | spots = list(map(int,input().split())) 4 | taping = [-1] 5 | 6 | # 구멍들을 위치 순서대로 정렬한다. 7 | spots.sort() 8 | 9 | # 구멍들을 확인하면서 구멍이 있을 경우, 테이프의 길이만큼 덮은 후 taping 배열에 덮인 위치를 기록한다. 10 | for i in range(len(spots)): 11 | if(taping[-1] <= spots[i]): 12 | taping.append(spots[i]+l) 13 | 14 | print(len(taping)-1) 15 | -------------------------------------------------------------------------------- /시즌6/중/Jeon-HS4/0816_8_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | a, b = map(int, input().split()) 3 | 4 | answer = 0 5 | dots = set() 6 | 7 | for i in range(n): 8 | x, y = map(int, input().split()) 9 | dots.add((x, y)) 10 | 11 | for x, y in dots: 12 | if (x + a, y + b) in dots and (x + a, y) in dots and (x, y + b) in dots: 13 | answer += 1 14 | print(answer) 15 | -------------------------------------------------------------------------------- /시즌6/중/Jeon-HS4/0817_9_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | x, y = map(int, input().split()) 2 | 3 | answer = x + y 4 | 5 | while(x != y): 6 | if(x >= y): 7 | x -= y 8 | else: 9 | y -= x 10 | 11 | answer -= x 12 | 13 | print(answer) 14 | -------------------------------------------------------------------------------- /시즌6/중/Jeon-HS4/0818_10_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n, s = map(int, input().split()) 2 | arr = list(map(int, input().split())) 3 | 4 | start, end = 0, 0 5 | sum = arr[0] 6 | answer = 100001 7 | 8 | while True: 9 | if sum < s: 10 | end += 1 11 | if end == n: 12 | break 13 | sum += arr[end] 14 | else: 15 | sum -= arr[start] 16 | answer = min(answer, end - start + 1) 17 | start += 1 18 | 19 | print(answer if answer != 100001 else 0) 20 | -------------------------------------------------------------------------------- /시즌6/중/SsongYJ61/0808_2_SsongYj.py: -------------------------------------------------------------------------------- 1 | hurt = int(input()) 2 | cnt = int(input()) 3 | 4 | if hurt == 1 : 5 | print(cnt * 8) 6 | 7 | elif hurt == 5 : 8 | print((cnt * 8) + (hurt - 1)) 9 | 10 | else : 11 | if cnt % 2 == 0 : 12 | cnt //= 2 13 | print((cnt * 8) + (hurt - 1)) 14 | else : 15 | print((cnt * 8) + (1 - hurt)) 16 | -------------------------------------------------------------------------------- /시즌6/중/SsongYJ61/0809_3_SsongYj.py: -------------------------------------------------------------------------------- 1 | straw = int(input()) 2 | length = [] 3 | 4 | for i in range(straw) : 5 | length.append(int(input())) 6 | 7 | length.sort(reverse = True) 8 | 9 | result = 0 10 | for i in range(len(length)-2) : 11 | if length[i] < length[i+1] + length[i+2] : 12 | result = length[i] + length[i+1] + length[i+2] 13 | break 14 | else : 15 | result = -1 16 | 17 | print(result) 18 | -------------------------------------------------------------------------------- /시즌6/중/SsongYJ61/0815_7_SsongYj .py: -------------------------------------------------------------------------------- 1 | n, l = map(int, input().split()) 2 | data = list(map(int, input().split())) 3 | 4 | # 정렬 5 | data.sort() 6 | 7 | cnt = 1 8 | start = data[0] - 0.5 9 | end = start + l 10 | 11 | for i in range(n) : 12 | if start < data[i] < end : 13 | continue 14 | else : 15 | cnt += 1 16 | start = data[i] - 0.5 17 | end = start + l 18 | 19 | print(cnt) 20 | 21 | -------------------------------------------------------------------------------- /시즌6/중/SsongYJ61/0817_9_SsongYj .py: -------------------------------------------------------------------------------- 1 | x,y = map(int,input().split()) 2 | 3 | def gcd(x,y) : 4 | if y == 0 : 5 | return x 6 | else : 7 | return gcd(y, x % y) 8 | print(x + y - gcd(x,y)) 9 | -------------------------------------------------------------------------------- /시즌6/중/SsongYJ61/0818_10_SsongYj .py: -------------------------------------------------------------------------------- 1 | n,s = map(int,input().split()) 2 | arr = list(map(int, input().split())) 3 | 4 | start, end = 0, 0 5 | sum = arr[0] 6 | ans = 100001 7 | 8 | while True : 9 | if sum < s : 10 | end += 1 11 | if end == n : 12 | break 13 | sum += arr[end] 14 | else : 15 | sum -= arr[start] 16 | ans = min(ans, end - start + 1) 17 | start += 1 18 | 19 | print(ans if ans != 100001 else 0) 20 | -------------------------------------------------------------------------------- /시즌6/중/asyooniverse/0807_1_asyooniverse.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | x, y, w, s = map(int, input().split()) 5 | 6 | only_straight = (x+y) * w 7 | 8 | if (x+y) % 2 == 0: 9 | only_diagonal = max(x, y) * s 10 | else: 11 | only_diagonal = (max(x, y) - 1) * s + w 12 | 13 | straight_and_diagonal = (min(x, y) * s) + (abs(x-y) * w) 14 | 15 | print(min(only_diagonal, only_straight, straight_and_diagonal)) -------------------------------------------------------------------------------- /시즌6/중/gksgh108/0808_2_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | def main(): 2 | a = int(input()) 3 | b = int(input()) 4 | print(finger(a, b)) 5 | 6 | def finger(a, b): 7 | if a == 1: 8 | return 8 * b 9 | elif a == 5: 10 | return 8 * b + 4 11 | else: 12 | return 4 * b + 1 + (4 - a if b % 2 == 1 else a - 2) 13 | 14 | main() 15 | -------------------------------------------------------------------------------- /시즌6/중/gksgh108/0809_3_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n = int(input()) 5 | nList = [] 6 | for i in range(n): 7 | nList.append(int(input())) 8 | 9 | nList.sort(reverse=True) 10 | 11 | for i in range(n-2): 12 | if nList[i] < nList[i+1] + nList[i+2]: 13 | print(nList[i] + nList[i+1] + nList[i+2]) 14 | exit() 15 | print(-1) 16 | -------------------------------------------------------------------------------- /시즌6/중/gksgh108/0815_7_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n, m = map(int, input().split()) 2 | leaked = list(map(int, input().split())) 3 | 4 | leaked.sort() # 물이 새는 곳의 위치를 정렬 5 | 6 | tapes = 0 7 | tape_end = 0 8 | 9 | for leak in leaked: 10 | if tape_end < leak: 11 | tapes += 1 12 | tape_end = leak + m - 0.5 # 새로운 테이프로 덮을 때, 현재 위치의 0.5만큼 덮도록 종료 위치 설정 13 | 14 | print(int(tapes)) 15 | -------------------------------------------------------------------------------- /시즌6/중/gksgh108/0816_8_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | input = sys.stdin.readline 4 | 5 | N = int(input()) 6 | A, B = map(int, input().split()) 7 | spot = [tuple(map(int, input().split())) for _ in range(N)] 8 | 9 | xy_set = set(spot) 10 | 11 | cnt = 0 12 | 13 | for x, y in spot: 14 | p1 = (x + A, y) 15 | p2 = (x, y + B) 16 | p3 = (x + A, y + B) 17 | 18 | if p1 in xy_set and p2 in xy_set and p3 in xy_set: 19 | cnt += 1 20 | 21 | print(cnt) 22 | -------------------------------------------------------------------------------- /시즌6/중/gksgh108/0817_9_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | from math import gcd 3 | 4 | input = sys.stdin.readline 5 | x, y = map(int, input().split()) 6 | 7 | tile_count = x + y - gcd(x, y) 8 | print(tile_count) 9 | -------------------------------------------------------------------------------- /시즌6/중/gs0428/0817_9_gs0428.js: -------------------------------------------------------------------------------- 1 | const fs = require("fs"); 2 | const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt"; 3 | const input = fs.readFileSync(filePath).toString().trim().split("\n"); 4 | const num = input[0].split(' ').map((n) => Number(n)); 5 | let x = num[0]; 6 | let y = num[1]; 7 | const divisor = (x, y) => { 8 | if(y === 0) 9 | return x; 10 | else 11 | return divisor(y, x % y) 12 | } 13 | const div = divisor(x, y); 14 | console.log(x + y - div); -------------------------------------------------------------------------------- /시즌6/중/gs0428/0818_10_gs0428.js: -------------------------------------------------------------------------------- 1 | const fs = require("fs"); 2 | const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt"; 3 | const input = fs.readFileSync(filePath).toString().trim().split("\n"); 4 | let tmp = input[0].split(' ').map((n) => Number(n)); 5 | const repeat = tmp[0] 6 | for (let i = 1; i <= repeat; i++) { 7 | console.log(input[i].split('').reverse().join('')) 8 | } -------------------------------------------------------------------------------- /시즌6/중/hamin924/0807_1_hamin924.py: -------------------------------------------------------------------------------- 1 | x, y, w, s = map(int, input().split()) 2 | 3 | #평행으로만 이동 4 | min1 = (x+y) * w 5 | 6 | #대각선으로만 이동 7 | if (x + y) % 2 == 0: 8 | min2 = max(x, y) * s 9 | #대각선이동 + 평행이동 1번 10 | else: 11 | min2 = (max(x, y) - 1) * s + w 12 | 13 | #평행이동 + 대각선이동 14 | m3 = (min(x, y) * s) + (abs(x-y) * w) 15 | 16 | print(min(min1, min2, m3)) -------------------------------------------------------------------------------- /시즌6/중/hamin924/0808_2_hamin924.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | finger = int(input()) # 다친 손가락 위치 5 | count = int(input()) # 다친 손가락의 최대 사용 횟수 6 | 7 | result = 0 8 | 9 | if finger==1: 10 | result = 8 * count 11 | 12 | elif finger==5: 13 | result = 8 * count +4 14 | 15 | else: 16 | if count % 2 == 0 : 17 | result = 4 * count + (finger-1) 18 | else: 19 | result = 4 * count + (5-finger) 20 | 21 | print(result) -------------------------------------------------------------------------------- /시즌6/중/kimkimgungunwoo/0807_1_kimkimgungunwoo.py: -------------------------------------------------------------------------------- 1 | x,y,w,s=map(int,input().split()) 2 | sm=min(x,y) 3 | bg=max(x,y) 4 | answer=0 5 | if 2*w<=s: 6 | answer+=2*w*sm 7 | else: 8 | answer+=sm*s 9 | if (bg-sm)%2==0: 10 | if w1: 9 | if dlist[i] 2 | using namespace std; 3 | int main() { 4 | long long finger,sum,useLimit; 5 | cin >> finger>>useLimit; 6 | if (finger != 1 && finger != 5) { 7 | sum = 8 * (useLimit / 2); 8 | sum += 10 * (useLimit % 2) + (useLimit % 2 ? -1 : 1) * finger - 1; 9 | } 10 | else { 11 | sum = 8 * useLimit + finger - 1; 12 | } 13 | cout << sum; 14 | } 15 | -------------------------------------------------------------------------------- /시즌6/중/shay0454/0815_7_proto_shay0454.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | bool truth_table[2000]; 4 | int main() { 5 | int N, L, num, count_ = 0; fill_n(truth_table, 1000, true); 6 | cin >> N >> L; 7 | for (int i = 0; i < N; i++) { cin >> num; truth_table[num - 1] = false; } 8 | for (int i = 0; i < 1000; i++) { 9 | if (truth_table[i] == false) { fill_n(truth_table + i, L,true); count_++; } 10 | } 11 | cout << count_; 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /시즌6/중/shay0454/0817_9_proto_shay0454.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int GCD(int a, int b) { 4 | if (b == 0)return a; 5 | else return GCD(b, a % b); 6 | } 7 | int main() { 8 | int x, y; cin >> x >> y; 9 | int a = ((x > y) ? GCD(x, y) : GCD(y, x)); 10 | cout << x + y - a; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /시즌6/중/sua1897/0807_1_sua1897.py: -------------------------------------------------------------------------------- 1 | x,y,w,s=map(int, input().split()) 2 | l=min(x,y) 3 | times=[] 4 | times.append(l*s+(x+y-2*l)*w) 5 | times.append((x+y)*w) 6 | if (((x+y)%2)==0): 7 | times.append(max(x,y)*s) 8 | else : times.append((max(x,y)-1)*s+w) 9 | print(min(times)) 10 | ''' 11 | if (l==0): 12 | times.append((x+y)*min(w,s)) 13 | else: 14 | for a in range(0,l+1): 15 | l=a 16 | sum=x+y-2*l 17 | if (sum<0): break 18 | times.append(sum*w+l*s) 19 | ''' 20 | 21 | -------------------------------------------------------------------------------- /시즌6/중/홍석영/0807_1_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | X, Y, W, S = map(int, input().split()) 2 | 3 | # 1. 한 블록을 가로지르는 시간이 한 블록 가는데 걸리는 시간보다 짧은 경우 4 | if S < W: 5 | better = (abs(X - Y) // 2) * S * 2 6 | ans = min(X, Y) * S + better + (abs(X - Y) % 2) * W 7 | # 2. 한 블록을 가로지르는 시간이 두 블록 가는데 걸리는 시간보다 짧은 경우 8 | elif S <= W*2: 9 | ans = min(X, Y)*S + abs(X-Y)*W 10 | # 3. 한 블록을 가로지르는 시간이 두 블록 가는데 걸리는 시간보다 긴 경우 11 | else: 12 | ans = (X+Y)*W 13 | 14 | print(ans) 15 | -------------------------------------------------------------------------------- /시즌6/중/홍석영/0808_2_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | broken_finger = int(input()) 2 | max_uses_of_bf = int(input()) 3 | 4 | ans = 0 5 | if broken_finger == 1 or broken_finger == 5: 6 | ans = (max_uses_of_bf * 8) + (broken_finger - 1) 7 | elif max_uses_of_bf % 2 == 1: 8 | ans = ((max_uses_of_bf//2) * 8) + (9 - broken_finger) 9 | else: 10 | ans = ((max_uses_of_bf//2) * 8) + (broken_finger - 1) 11 | 12 | print(ans) 13 | -------------------------------------------------------------------------------- /시즌6/중/홍석영/0809_3_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | N = int(sys.stdin.readline()) 4 | straw_list = [] 5 | for i in range(N): 6 | straw_list.append(int(sys.stdin.readline())) 7 | 8 | straw_list.sort(reverse=True) 9 | ans = -1 10 | 11 | for t in range(N - 2): 12 | if straw_list[t] < straw_list[t + 1] + straw_list[t + 2]: 13 | ans = straw_list[t] + straw_list[t + 1] + straw_list[t + 2] 14 | break 15 | 16 | print(ans) 17 | -------------------------------------------------------------------------------- /시즌6/중/홍석영/0818_9_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | import math 2 | import sys 3 | 4 | x, y = map(int, sys.stdin.readline().rstrip().split()) 5 | 6 | sys.stdout.write(str(x+y-math.gcd(x, y))) 7 | -------------------------------------------------------------------------------- /시즌6/하/.keep: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0807_1_golapaduck.py: -------------------------------------------------------------------------------- 1 | print(sum(int(i)**2 for i in input().split())%10) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0808_2_golapaduck.py: -------------------------------------------------------------------------------- 1 | x,y,w,h = map(int,input().split()) 2 | print(min(x,w-x,y,h-y)) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0809_3_golapaduck.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = input() 3 | print(f'{a * int(b[2])}\n{a * int(b[1])}\n{a * int(b[0])}\n{a * int(b)}') -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0810_4_golapaduck.py: -------------------------------------------------------------------------------- 1 | print(len(input().split())) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0811_5_golapaduck.py: -------------------------------------------------------------------------------- 1 | number = list(map(int, input().split())) 2 | i=0 3 | while sorted(number) != number: 4 | if number[i] > number[i+1]: 5 | number[i], number[i+1] = number[i+1], number[i] 6 | print(*number) 7 | i = (i+1)%4 -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0814_6_golapaduck.py: -------------------------------------------------------------------------------- 1 | count = int(input()) 2 | numList = list(map(int, input().split())) 3 | print(f'{min(numList)} {max(numList)}') -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0815_7_golapaduck.py: -------------------------------------------------------------------------------- 1 | a = list(input().split(maxsplit=1)) 2 | while( a[0] != "#"): 3 | print(a[0],a[1].lower().count(a[0])) 4 | a = list(input().split(maxsplit=1)) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0816_8_golapaduck.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | a= map(int,input().split()) 3 | count=0 4 | for num in a: 5 | for i in range(2,num+1): 6 | if num==i: 7 | count+=1 8 | if num%i==0: 9 | break 10 | print(count) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0817_9_golapaduck.py: -------------------------------------------------------------------------------- 1 | s=list(map(int,input().split())) 2 | a=s[0] 3 | b=s[1] 4 | c=s[2] 5 | 6 | if(b>=c): 7 | print(-1) 8 | else: 9 | print(int(a/(c-b)+1)) -------------------------------------------------------------------------------- /시즌6/하/golapaduck/0818_10_golapaduck.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | l = list(map(int, input().split())) 3 | 4 | print(round((sum(l)/(max(l)*n))*100,6)) -------------------------------------------------------------------------------- /시즌6/하/lhh2020/8090_3_lhh2020.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | int b1 = b - (b / 10) * 10; 10 | int b2 = (b - b / 100 * 100) / 10; 11 | int b3 = b / 100; 12 | cout << a * b1 << endl << a * b2 << endl << a * b3 << endl << a * b; 13 | } -------------------------------------------------------------------------------- /시즌7/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌7/상/.keep -------------------------------------------------------------------------------- /시즌7/상/cycrypto/1003_2_cycrypto.py: -------------------------------------------------------------------------------- 1 | l, w, h = map(int, input().split()) 2 | n = int(input()) 3 | 4 | cube = sorted([list(map(int, input().split())) for _ in range(n)], reverse=True) 5 | 6 | now, ans = 0, 0 7 | for exp, cnt in cube: 8 | now *= 8 9 | cur_len = 2 ** exp 10 | 11 | fill = min((l // cur_len) * (w // cur_len) * (h // cur_len) - now, cnt) 12 | 13 | ans += fill 14 | now += fill 15 | 16 | print(ans if now == l * w * h else -1) -------------------------------------------------------------------------------- /시즌7/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌7/중/.keep -------------------------------------------------------------------------------- /시즌7/중/Haron1248/1004_2_Haron1248.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | int n, m; 6 | scanf("%d %d", &m, &n); 7 | int* not_prime = (int*)calloc(n + 1, sizeof(int)); 8 | 9 | not_prime[1] = 1; 10 | for (int i = 2; i * i <= n; i++) { 11 | if (!not_prime[i]) { 12 | for (int j = i * i; j <= n; j += i) not_prime[j] = 1; 13 | } 14 | } 15 | 16 | for (int i = m; i <= n; i++) if (not_prime[i] == 0) printf("%d\n", i); 17 | } 18 | -------------------------------------------------------------------------------- /시즌7/중/Haron1248/1006_5_Haron1248.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | struct Point { 5 | int x, y; 6 | }; 7 | 8 | int main() { 9 | Point p[3]; 10 | 11 | for (int i = 0; i < 3; i++) 12 | cin >> p[i].x >> p[i].y; 13 | 14 | int ccw = (p[1].x - p[0].x) * (p[2].y - p[0].y) - (p[1].y - p[0].y) * (p[2].x - p[0].x); 15 | if (ccw != 0) ccw = ccw / abs(ccw); 16 | 17 | cout << ccw << endl; 18 | } 19 | -------------------------------------------------------------------------------- /시즌7/중/Jeon-HS4/1006_5_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | p1 = list(map(int, input().split())) 2 | p2 = list(map(int, input().split())) 3 | p3 = list(map(int, input().split())) 4 | 5 | S = (p2[0] - p1[0]) * (p3[1] - p1[1]) - (p2[1] - p1[1]) * (p3[0] - p1[0]) 6 | 7 | if(S > 0): 8 | print(1) 9 | elif(S < 0): 10 | print(-1) 11 | else: 12 | print(0) 13 | -------------------------------------------------------------------------------- /시즌7/중/Jeon-HS4/1011_8_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n, k = map(int, input().split()) 2 | s = list(map(int, input().split())) 3 | 4 | start = 0 5 | end = max(s) 6 | while start != end: 7 | sum = 0 8 | mid = int((start + end) /2) 9 | if mid == start: 10 | break 11 | for i in s: 12 | if (i-mid) >0: 13 | sum += (i-mid) 14 | if sum > k: 15 | start = mid 16 | elif sum < k: 17 | end = mid 18 | elif sum == k: 19 | break 20 | print(mid) 21 | -------------------------------------------------------------------------------- /시즌7/중/SH4316/1003_2_SH4316.py: -------------------------------------------------------------------------------- 1 | m, n = map(lambda value: int(value), input().split(" ")) 2 | 3 | if m <= 1: 4 | m = 2 5 | if n <= 1: 6 | exit() 7 | 8 | def isPrime(num): 9 | j = 2 10 | while num >= j**2: 11 | if num % j == 0: 12 | return False 13 | j += 1 14 | 15 | return True 16 | 17 | for i in range(m, n+1): 18 | if isPrime(i): 19 | print(i) 20 | -------------------------------------------------------------------------------- /시즌7/중/SH4316/1006_5_SH4316.py: -------------------------------------------------------------------------------- 1 | def ccd(x1, y1, x2, y2): 2 | return x1*y2-x2*y1 3 | 4 | points = [] 5 | for i in range(3): 6 | points.append(list(map(lambda value: int(value), input().split(" ")))) 7 | 8 | for point in points[1:]: 9 | point[0] -= points[0][0] 10 | point[1] -= points[0][1] 11 | 12 | value = ccd(points[1][0], points[1][1], points[2][0], points[2][1]) 13 | if value > 0: 14 | value = 1 15 | elif value < 0: 16 | value = -1 17 | 18 | print(value) 19 | -------------------------------------------------------------------------------- /시즌7/중/Seokyounh_Hong/1003_2_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | import math 2 | m, n = map(int, input().split()) 3 | 4 | numbers = [True for i in range(n + 1)] 5 | 6 | for i in range(2, int(math.sqrt(n)) + 1): 7 | if numbers[i]: 8 | j = 2 9 | while i * j <= n: 10 | numbers[i * j] = False 11 | j += 1 12 | 13 | for i in range(m, n + 1): 14 | if numbers[i]: 15 | if i != 1: 16 | print(i) 17 | -------------------------------------------------------------------------------- /시즌7/중/Seokyounh_Hong/1006_4_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | graph = [list(map(int, input().split())) for _ in range(n)] 3 | 4 | for i in range(n): 5 | for j in range(n): 6 | for k in range(n): 7 | if graph[j][i] and graph[i][k]: 8 | graph[j][k] = 1 9 | 10 | for g in graph: 11 | print(*g) 12 | -------------------------------------------------------------------------------- /시즌7/중/Seokyounh_Hong/1013_10_Seokyoung-Hong.py: -------------------------------------------------------------------------------- 1 | import heapq 2 | n = int(input()) 3 | subject = sorted([list(map(int, input().split())) for _ in range(n)]) 4 | classroom = [] 5 | heapq.heappush(classroom, subject[0][1]) 6 | 7 | for i in range(1, n): 8 | if subject[i][0] < classroom[0]: 9 | heapq.heappush(classroom, subject[i][1]) 10 | else: 11 | heapq.heappop(classroom) 12 | heapq.heappush(classroom, subject[i][1]) 13 | 14 | print(len(classroom)) 15 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1003_2_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | m,n=map(int,input().split()) 2 | 3 | for i in range(m,n+1): 4 | if i==1:#1은 소수가 아니므로 제외 5 | continue 6 | for j in range(2,int(i**0.5)+1): 7 | if i%j==0: #약수가 존재하므로 소수가 아님 8 | break #더이상 검사할 필요가 없으므로 멈춤 9 | else: 10 | print(i) 11 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1005_4_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | N = int(sys.stdin.readline().rstrip()) 4 | 5 | graph = [] 6 | for _ in range(N): 7 | graph.append(list(map(int, sys.stdin.readline().rstrip().split()))) 8 | 9 | 10 | for k in range(N): 11 | for i in range(N): 12 | for j in range(N): 13 | if graph[i][k] and graph[k][j]: 14 | graph[i][j] = 1 15 | 16 | for row in graph: 17 | print(' '.join(map(str, row))) 18 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1006_5_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | p1 = list(map(int, input().split())) 2 | p2 = list(map(int, input().split())) 3 | p3 = list(map(int, input().split())) 4 | 5 | temp = (p2[0] - p1[0]) * (p3[1] - p1[1]) - (p2[1] - p1[1]) * (p3[0] - p1[0]) 6 | 7 | if temp > 0: # 반시계 방향 8 | print(1) 9 | elif temp < 0: # 시계 방향 10 | print(-1) 11 | else: # 일직선 12 | print(0) 13 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1010_7_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import math 2 | 3 | T = int(input()) 4 | 5 | for _ in range(T): 6 | x1,y1,r1,x2,y2,r2 = map(int,input().split()) 7 | d = math.sqrt((x2-x1)**2 + (y2-y1)**2) #두 점 사이의 거리 계산 8 | if d == 0 and r1 == r2 : #두 점사이거리와 각각에서 측정된 걸림돌과의 거리가 같으면 9 | print(-1) 10 | elif abs(r1-r2) == d or r1+r2 == d : #내접, 외접인경우 11 | print(1) 12 | elif abs(r1-r2) < d < (r1+r2) : #두 접접선 그릴수있음 13 | print(2) 14 | else: 15 | print(0) 16 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1012_8_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | N, M = map(int, input().split()) 2 | trees = list(map(int, input().split())) 3 | 4 | start, end = 1, max(trees) 5 | 6 | while start <= end: 7 | mid = (start+end)//2 8 | 9 | logs = sum([tree-mid if tree-mid > 0 else 0 for tree in trees]) 10 | 11 | if logs >= M: 12 | start = mid + 1 13 | else: 14 | end = mid - 1 15 | 16 | print(end) 17 | -------------------------------------------------------------------------------- /시즌7/중/gksgh108/1012_9_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | MAX = 100001 2 | n, k = map(int, input().split()) 3 | array = [0]*MAX 4 | 5 | def bfs(): 6 | q = [n] 7 | while q: 8 | now_pos = q.pop(0) 9 | if now_pos == k: 10 | return array[now_pos] 11 | for next_pos in (now_pos-1, now_pos+1, now_pos*2): 12 | if 0 <= next_pos < MAX and not array[next_pos]: 13 | array[next_pos] = array[now_pos] + 1 14 | q.append(next_pos) 15 | 16 | print(bfs()) 17 | -------------------------------------------------------------------------------- /시즌7/중/hamin924/1004_3_hamin924.py: -------------------------------------------------------------------------------- 1 | h,w = map(int, input().split()) 2 | m = [list(input()) for _ in range(h)] 3 | result = 0 4 | for i in range(h): 5 | line = 0 6 | for j in m[i]: 7 | if j == '/' or j == '\\': line += 1 8 | #line이 홀수개일때 .이 도형안에, 짝수개일때 도형밖에(도형이 닫힌거니까) 있다고 생각 9 | if line % 2 == 1 and j == '.': result += 1 10 | result += (line // 2) 11 | print(result) -------------------------------------------------------------------------------- /시즌7/중/hamin924/1005_4_hamin924.py: -------------------------------------------------------------------------------- 1 | import sys 2 | N = int(input()) 3 | 4 | adj_matrix = [] 5 | for _ in range(N): 6 | adj_matrix.append([int(x) for x in sys.stdin.readline().rstrip().split()]) 7 | 8 | for k in range(N): 9 | for i in range(N): 10 | for j in range(N): 11 | if adj_matrix[i][k] == 1 and adj_matrix[k][j] == 1: 12 | adj_matrix[i][j] = 1 13 | 14 | for row in adj_matrix: 15 | print(' '.join(map(str,row))) -------------------------------------------------------------------------------- /시즌7/중/hamin924/1006_2_hamin924.py: -------------------------------------------------------------------------------- 1 | m,n=map(int,input().split()) 2 | 3 | for i in range(m,n+1): 4 | if i ==1 : #1은 소수가 아님 5 | continue 6 | for j in range(2,int(i**0.5)+1): 7 | if i%j==0: #약수가 존재하므로 소수가 아님 8 | break 9 | else: 10 | print(i) -------------------------------------------------------------------------------- /시즌7/중/hamin924/1006_5_hamin924.py: -------------------------------------------------------------------------------- 1 | x1, y1 = map(int, input().split()) 2 | x2, y2 = map(int, input().split()) 3 | x3, y3 = map(int, input().split()) 4 | 5 | result = (x1 * y2 + x2 * y3 + x3 * y1) - (x2 * y1 + x3 * y2 + x1 * y3) 6 | 7 | if result > 0: 8 | print(1) 9 | elif result < 0: 10 | print(-1) 11 | else: 12 | print(0) -------------------------------------------------------------------------------- /시즌7/중/hamin924/1011_8_hamin924.py: -------------------------------------------------------------------------------- 1 | #이진탐색 문제 2 | 3 | N, M = map(int, input().split()) 4 | tree = list(map(int, input().split())) 5 | start, end = 1, max(tree) #이분탐색 검색 범위 설정 6 | 7 | while start <= end: 8 | mid = (start+end) // 2 9 | 10 | log = 0 #벌목된 나무 총합 11 | for i in tree: 12 | if i >= mid: 13 | log += i - mid 14 | 15 | #벌목 높이를 이분탐색 16 | if log >= M: 17 | start = mid + 1 18 | else: 19 | end = mid - 1 20 | 21 | print(end) -------------------------------------------------------------------------------- /시즌7/중/hamin924/1013_10_hamin924.py: -------------------------------------------------------------------------------- 1 | # 백준 11000번 2 | # 그리드 알고리즘, 우선순위 큐 3 | 4 | import sys 5 | import heapq 6 | input = sys.stdin.readline 7 | 8 | N = int(input()) 9 | time = [] 10 | 11 | for _ in range(N): 12 | time.append(list(map(int,input().split(' ')))) 13 | time.sort(key=lambda x : (x[0],x[1])) 14 | 15 | heap = [time[0][1]] 16 | for i in range(1,N): 17 | if heap[0] <= time[i][0]: 18 | heapq.heappop(heap) 19 | heapq.heappush(heap,time[i][1]) 20 | 21 | print(len(heap)) -------------------------------------------------------------------------------- /시즌7/중/reval04/1003_2_reval04.py: -------------------------------------------------------------------------------- 1 | m,n=map(int,input().split()) 2 | 3 | for i in range(m,n+1): 4 | if i==1: 5 | continue 6 | for j in range(2,int(i**0.5)+1): 7 | if i%j==0: 8 | break 9 | else: 10 | print(i) 11 | -------------------------------------------------------------------------------- /시즌7/중/reval04/1004_3_reval04.py: -------------------------------------------------------------------------------- 1 | H, W = map(int, input().split()) 2 | M = [list(input()) for _ in range(H)] 3 | result = 0 4 | for i in range(H): 5 | line = 0 6 | for j in M[i]: 7 | if j == '/' or j == '\\': line += 1 8 | #line이 홀수개일때 .이 도형안에, 짝수개일때 도형밖에(도형이 닫힌거니까) 있다고 생각 9 | if line % 2 == 1 and j == '.': result += 1 10 | result += (line // 2) 11 | print(result) 12 | -------------------------------------------------------------------------------- /시즌7/중/reval04/1005_4_reval04.py: -------------------------------------------------------------------------------- 1 | a = int(input(),8) 2 | b = str(bin(a)) 3 | print(b[2:]) 4 | 5 | #print(bin(int(input,8))[2:]) 6 | -------------------------------------------------------------------------------- /시즌7/중/reval04/1006_5_reval04.py: -------------------------------------------------------------------------------- 1 | box = [] 2 | for _ in range(3): 3 | box.append(list(map(int,input().split()))) 4 | 5 | def ccw(p1,p2,p3): 6 | return (p1[0]*p2[1] + p2[0]*p3[1] + p3[0]*p1[1] - (p2[0]*p1[1] + p3[0]*p2[1] + p1[0]*p3[1])) 7 | 8 | ans = ccw(box[0],box[1],box[2]) 9 | 10 | if ans > 0: 11 | print(1) 12 | elif ans == 0: 13 | print(0) 14 | else: 15 | print(-1) 16 | -------------------------------------------------------------------------------- /시즌7/중/reval04/1011_8_reval04.py: -------------------------------------------------------------------------------- 1 | N, M = map(int, input().split()) 2 | tree = list(map(int, input().split())) 3 | start, end = 1, max(tree) #이분탐색 검색 범위 설정 4 | 5 | while start <= end: #적절한 벌목 높이를 찾는 알고리즘 6 | mid = (start+end) // 2 7 | 8 | log = 0 #벌목된 나무 총합 9 | for i in tree: 10 | if i >= mid: 11 | log += i - mid 12 | 13 | #벌목 높이를 이분탐색 14 | if log >= M: 15 | start = mid + 1 16 | else: 17 | end = mid - 1 18 | print(end) 19 | -------------------------------------------------------------------------------- /시즌7/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌7/하/.keep -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1002_1_EJimin0509.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | c = int(input()) 4 | 5 | if a == 60 and b == 60 and c == 60: 6 | print("Equilateral") 7 | elif a + b + c == 180: 8 | if a == b or b == c or c == a: 9 | print("Isosceles") 10 | else: 11 | print("Scalene") 12 | else: 13 | print("Error") -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1003_2_EJimin0509.py: -------------------------------------------------------------------------------- 1 | X = int(input()) 2 | N = int(input()) 3 | 4 | total = [] 5 | 6 | for i in range(N): 7 | a, b = map(int, input().split()) 8 | total.append(a*b) 9 | 10 | total_price = sum(total) 11 | 12 | if total_price == X: 13 | print("Yes") 14 | else: 15 | print("No") 16 | -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1004_3_EJimin0509.py: -------------------------------------------------------------------------------- 1 | a = 300 2 | b = 60 3 | c = 10 4 | t = int(input()) 5 | 6 | if t % 10 != 0: 7 | print(-1) 8 | else: 9 | print(t // a, (t % a) // b, ((t % a) % b) // c) -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1006_5_EJimin0509.py: -------------------------------------------------------------------------------- 1 | def gcd(a, b): 2 | if a < b: 3 | a, b = b, a 4 | if a % b == 0: 5 | return b 6 | else: 7 | return gcd(b, a % b) 8 | 9 | def lcm(a, b): 10 | return a * b // gcd(a, b) 11 | 12 | a, b = map(int, input().split()) 13 | print(f"{gcd(a, b)}\n{lcm(a,b)}") -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1009_6_EJimin0509.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | if n == 1: 4 | print(1) 5 | else: 6 | length = 1 7 | spiral = 1 8 | while n > length: 9 | length += 6*spiral 10 | spiral += 1 11 | print(spiral) -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1010_7_EJimin0509.py: -------------------------------------------------------------------------------- 1 | num_str = input() 2 | num = [int(nums) for nums in num_str.split()] 3 | print(abs((num[0]+num[3])-(num[1]+num[2]))) -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1011_8_EJimin0509.py: -------------------------------------------------------------------------------- 1 | length = int(input()) 2 | star = '*' 3 | space = ' ' 4 | 5 | for i in range(2*(length)-1): 6 | if i < length: 7 | print(space*(length-i-1)+star*((i+1)*2-1)) 8 | else: 9 | print(space*(i-length+1)+star*((2*(length)-1)-2*(i-length+1))) -------------------------------------------------------------------------------- /시즌7/하/EJimin0509/1013_10_EJimin0509.py: -------------------------------------------------------------------------------- 1 | num = int(input()) 2 | card = [i for i in range(1, num+1)] 3 | 4 | for i in range(len(card)): 5 | if len(card) == 1: 6 | print(card[0]) 7 | else : 8 | print(card.pop(0), end=' ') 9 | back = card.pop(0) 10 | card.append(back) -------------------------------------------------------------------------------- /시즌7/하/JEKKY/1009_6_JEKKY.java: -------------------------------------------------------------------------------- 1 | package Main; 2 | import java.util.Scanner; 3 | 4 | public class Main { 5 | public static void main(String[] args) { 6 | Scanner input = new Scanner(System.in); 7 | int num = input.nextInt(), n = 1, add = 0, times = 1; 8 | while(true) { 9 | if(num<=n) { 10 | System.out.println(times); 11 | break; 12 | } 13 | else { 14 | add += 6; 15 | n +=add; 16 | times += 1; 17 | } 18 | } 19 | input.close(); 20 | } 21 | } -------------------------------------------------------------------------------- /시즌7/하/JEKKY/1010_7_JEKKY.java: -------------------------------------------------------------------------------- 1 | package Main; 2 | import java.util.Scanner; 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner input=new Scanner(System.in); 6 | int a=input.nextInt(),b=input.nextInt(),c=input.nextInt(),d=input.nextInt(); 7 | if(a+d>b+c)System.out.println(a+d-b-c); 8 | else System.out.println(b+c-a-d); 9 | input.close(); 10 | } 11 | } -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1002_1_golapaduck.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | c = int(input()) 4 | 5 | if(a+b+c == 180): 6 | if(a==b==c==60): 7 | print("Equilateral") 8 | elif(a==b or b==c or c==a): 9 | print("Isosceles") 10 | else: 11 | print("Scalene") 12 | else: 13 | print("Error") -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1003_2_golapaduck.py: -------------------------------------------------------------------------------- 1 | price = int(input()) 2 | count = int(input()) 3 | for i in range(count): 4 | a,b = map(int,input().split()) 5 | price -= a*b 6 | if(price==0): 7 | print("Yes") 8 | else: 9 | print("No") -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1004_3_golapaduck.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | if( T%10 != 0 ): 3 | print(-1) 4 | else: 5 | a=T//300 6 | T=T%300 7 | b=T//60 8 | T=T%60 9 | c=T//10 10 | print(f"{a} {b} {c}") -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1005_4_golapaduck.py: -------------------------------------------------------------------------------- 1 | a = list(bin(int(i))[2:] for i in input()) 2 | count=0 3 | for j in a: 4 | if(count>0): 5 | if(len(j)<3): 6 | print(0,end='') 7 | if(len(j)<2): 8 | print(0,end='') 9 | print(j,end='') 10 | count += 1 -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1006_5_golapaduck.py: -------------------------------------------------------------------------------- 1 | a, b = map(int,input().split()) 2 | x,y = a,b 3 | while(y): 4 | x,y=y,x%y 5 | print(x) 6 | print((a*b)//x) 7 | -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1007_6_golapaduck.py: -------------------------------------------------------------------------------- 1 | a=int(input()) 2 | total=1 3 | n=1 4 | while(a>total): 5 | n+=1 6 | total+=(n-1)*6 7 | print(n) -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1010_7_golapaduck.py: -------------------------------------------------------------------------------- 1 | a,b,c,d = map(int,input().split()) 2 | print(abs(a+d-b-c)) -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1011_8_golapaduck.py: -------------------------------------------------------------------------------- 1 | count = int(input()) 2 | for i in range(1,2*count): 3 | print(' ' * abs(i-count),end='') 4 | print('*' * (2*count-1-2*abs(i-count))) -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1012_9_golapaduck.py: -------------------------------------------------------------------------------- 1 | import sys 2 | text = sys.stdin.read() 3 | stack = list(0 for i in range(0,27)) 4 | for char in text: 5 | char = ord(char) - 97 6 | if(char>=0): 7 | stack[char] += 1 8 | for count in range(0,stack.count(max(stack))): 9 | print(chr(stack.index(max(stack))+97),end="") 10 | stack[stack.index(max(stack))] = 0 -------------------------------------------------------------------------------- /시즌7/하/golapaduck/1013_10_golapaduck.py: -------------------------------------------------------------------------------- 1 | count = int(input()) 2 | stack = list(i for i in range(1,count+1)) 3 | for i in range(0,count): 4 | print(stack.pop(0), end=" ") 5 | if(i < count-1): 6 | stack.append(stack.pop(0)) -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1003_2_seolvin21.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌7/하/seolvin21/1003_2_seolvin21.cpp -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1004_3_seolvin21.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int t; 6 | int a = 0, b = 0, c = 0; 7 | 8 | std::cin >> t; 9 | 10 | if (t % 10 != 0) 11 | std::cout << -1; 12 | 13 | else { 14 | a = t / 300; 15 | t = t % 300; 16 | 17 | b = t / 60; 18 | t = t % 60; 19 | 20 | c = t / 10; 21 | 22 | std::cout << a << " " << b << " " << c << std::endl; 23 | } 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1006_5_seolvin21.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌7/하/seolvin21/1006_5_seolvin21.cpp -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1009_6_seolvin21.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n; 6 | int hexa = 1, cnt = 1; 7 | 8 | std::cin >> n; 9 | 10 | if (n == 1) 11 | std::cout << 1 << std::endl; 12 | 13 | else { 14 | while (n > hexa) { 15 | hexa += (cnt * 6); 16 | cnt++; 17 | } 18 | std::cout << cnt << std::endl; 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1010_7_seolvin21.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d; 6 | 7 | std::cin >> a >> b >> c >> d; 8 | std::cout << abs((a + d) - (b + c)) << std::endl; 9 | 10 | return 0; 11 | } -------------------------------------------------------------------------------- /시즌7/하/seolvin21/1012_9_seolvin21.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char l; 6 | int max = 0; 7 | int alphabet[26] = { NULL }; 8 | 9 | while (std::cin >> l) { 10 | if ('a' <= l && l <= 'z') 11 | alphabet[l - 'a']++; 12 | } 13 | 14 | for (int i = 0; i < 26; ++i) { 15 | if (max < alphabet[i]) 16 | max = alphabet[i]; 17 | } 18 | for (int i = 0; i < 26; ++i) { 19 | if (alphabet[i] == max) 20 | std::cout << char(i + 'a'); 21 | } 22 | } -------------------------------------------------------------------------------- /시즌8/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/상/.keep -------------------------------------------------------------------------------- /시즌8/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/.keep -------------------------------------------------------------------------------- /시즌8/중/D4LGONA/0213_1_D4LGONA.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/D4LGONA/0213_1_D4LGONA.cpp -------------------------------------------------------------------------------- /시즌8/중/D4LGONA/0223_8_D4LGONA.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/D4LGONA/0223_8_D4LGONA.cpp -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0213_1_EJimin0509.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | for _ in range(T): 3 | N = int(input()) 4 | a, b = 1, 0 5 | for _ in range(N): 6 | a,b = b, a+b 7 | print(a,b) -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0214_2_EJimin0509.py: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | 3 | answer = [] 4 | for i in range(len(b) - len(a) + 1): 5 | count = 0 6 | for j in range(len(a)): 7 | if a[j] != b[i + j]: 8 | count += 1 9 | answer.append(count) 10 | 11 | print(min(answer)) -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0215_3_Ejimin0509.py: -------------------------------------------------------------------------------- 1 | x = int(input()) 2 | 3 | d = [0] * 1000001 4 | 5 | for i in range(2, x + 1): 6 | d[i] = d[i - 1] + 1 7 | if i % 2 == 0: 8 | d[i] = min(d[i], d[i // 2] + 1) 9 | if i % 3 == 0: 10 | d[i] = min(d[i], d[i // 3] + 1) 11 | 12 | print(d[x]) -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0216_4_EJimin0509.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | sub = [] 3 | 4 | for i in range(n): 5 | a, b = map(int, input().split()) 6 | sub.append(a-b) 7 | 8 | sub.sort() 9 | 10 | if n%2 == 1: 11 | print(1) 12 | else: 13 | print(abs(sub[n//2] - sub[n//2-1]) + 1) -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0217_5_Ejimin0509.py: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | n = int(input()) 5 | rgb = [list(map(int, input().split())) for _ in range(n)] 6 | 7 | for i in range(1, n): 8 | rgb[i][0] += min(rgb[i-1][1], rgb[i-1][2]) 9 | rgb[i][1] += min(rgb[i-1][0], rgb[i-1][2]) 10 | rgb[i][2] += min(rgb[i-1][0], rgb[i-1][1]) 11 | 12 | print(min(rgb[n-1])) -------------------------------------------------------------------------------- /시즌8/중/EJimin0509/0223_9_EJimin0509.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/EJimin0509/0223_9_EJimin0509.py -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0213_1_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | t = int(input()) 2 | for _ in range(t): 3 | n = int(input()) 4 | fib0 = [1,0] 5 | fib1 = [0,1] 6 | if(n >=2): 7 | for i in range(2,n+1): 8 | fib0.append(fib0[i-2]+fib0[i-1]) 9 | fib1.append(fib1[i-2]+fib1[i-1]) 10 | print(f'{fib0[n]} {fib1[n]}') 11 | -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0214_2_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | A, B = input().split() # len(A) <= len(B) 2 | distance = len(B) - len(A) 3 | distance_list = [] 4 | for i in range(distance+1): 5 | diff = 0 6 | for j in range(len(A)): 7 | index_ = i+j 8 | if(B[index_] != A[j]): 9 | diff += 1 10 | distance_list.append(diff) 11 | print(min(distance_list)) 12 | -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0215_3_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | calc_counts = [0] * n+1 4 | for i in range(2, n+1): 5 | calc_counts[i] = calc_counts[i-1] + 1 6 | if(i%2 == 0): 7 | calc_counts[i] = min(calc_counts[i], calc_counts[i//2] + 1) 8 | if(i%3 == 0): 9 | calc_counts[i] = min(calc_counts[i], calc_counts[i//3] + 1) 10 | 11 | print(calc_counts[n]) 12 | -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0216_4_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | schedule = [] 3 | 4 | for i in range(n): 5 | a, b = map(int, input().split()) 6 | schedule.append(a-b) 7 | 8 | schedule.sort() 9 | 10 | if(n%2 == 1): 11 | print(1) 12 | else: 13 | print(abs(schedule[n//2] - schedule[(n//2)-1]) + 1) 14 | -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0217_5_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | house = [] 3 | 4 | for _ in range(n): 5 | house.append(list(map(int, input().split()))) 6 | 7 | for i in range(1, n): 8 | house[i][0] = min(house[i-1][1], house[i-1][2]) + house[i][0] 9 | house[i][1] = min(house[i-1][0], house[i-1][2]) + house[i][1] 10 | house[i][2] = min(house[i-1][0], house[i-1][1]) + house[i][2] 11 | 12 | print(min(house[-1])) 13 | -------------------------------------------------------------------------------- /시즌8/중/Jeon-HS4/0222_8_Jeon-HS4.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | crane = list(map(int, input().split())) 3 | m = int(input()) 4 | box = list(map(int, input().split())) 5 | 6 | crane.sort(reverse=True) 7 | box.sort(reverse=True) 8 | 9 | count = 0 10 | if crane[0] < box[0]: 11 | print('-1') 12 | else: 13 | while len(box)>0: 14 | for i in crane: 15 | for j in box: 16 | if i >= j: 17 | box.remove(j) 18 | break 19 | count+=1 20 | 21 | print(count) 22 | -------------------------------------------------------------------------------- /시즌8/중/SH4316/0213_1_SH4316.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | v = [] 3 | 4 | for i in range(n): 5 | v.append(int(input())) 6 | # v.sort() 7 | 8 | value = {0: [1, 0], 1: [0, 1]} 9 | def get(n): 10 | val = value.get(n) 11 | if (val == None): 12 | v1 = get(n-1) 13 | v2 = get(n-2) 14 | result = [v1[0] + v2[0], v1[1] + v2[1]] 15 | value[n] = result 16 | return result 17 | return val 18 | 19 | for i in range(n): 20 | val = get(v[i]) 21 | print(val[0], val[1]) -------------------------------------------------------------------------------- /시즌8/중/SH4316/0214_2_SH4316.py: -------------------------------------------------------------------------------- 1 | s1, s2 = input().split(" ") 2 | 3 | def diff(s1, s2): 4 | c = 0 5 | for n in zip(list(s1), list(s2)): 6 | if (n[0] != n[1]): 7 | c += 1 8 | return c 9 | min = 100 10 | for i in range(len(s2) - len(s1) + 1): 11 | min_ = diff(s1, s2[i:len(s1)+i]) 12 | if (min_ < min): 13 | min = min_ 14 | print(min) 15 | -------------------------------------------------------------------------------- /시즌8/중/SH4316/0215_3_SH4316.py: -------------------------------------------------------------------------------- 1 | v = int(input()) 2 | # c = 0 3 | m = {1: 0} 4 | for i in range(2, v+1): 5 | min = 1000000 6 | if i % 3 == 0: 7 | min = m[i // 3] 8 | if i % 2 == 0: 9 | if min > m[i // 2]: 10 | min = m[i // 2] 11 | if min > m[i-1]: 12 | min = m[i-1] 13 | m[i] = min + 1 14 | 15 | print(m[v]) 16 | -------------------------------------------------------------------------------- /시즌8/중/SH4316/0216_4_SH4316.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | if n % 2 == 1: 4 | print(1) 5 | exit() 6 | 7 | diff = [] 8 | 9 | for i in range(n): 10 | s = input().split(" ") 11 | diff.append(int(s[0]) - int(s[1])) 12 | 13 | diff.sort() 14 | print(diff[n//2] - diff[n//2-1] + 1) 15 | -------------------------------------------------------------------------------- /시즌8/중/YounYoung3141592/1_younyoung3141592.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int aray[41][2]; 5 | aray[0][0] = 1; 6 | aray[0][1] = 0; 7 | aray[1][0] = 0; 8 | aray[1][1] = 1; 9 | for (int i = 2; i < 41; i++) { 10 | aray[i][0] = aray[i - 1][0] + aray[i - 2][0]; 11 | aray[i][1] = aray[i - 1][1] + aray[i - 2][1]; 12 | } 13 | int n, a; 14 | scanf("%d", &n); 15 | for (int i = 0; i < n; i++) { 16 | scanf("%d", &a); 17 | printf("%d %d\n", aray[a][0], aray[a][1]); 18 | } 19 | } -------------------------------------------------------------------------------- /시즌8/중/ggamD00/0213_1_ggamD00.py: -------------------------------------------------------------------------------- 1 | T = int(input()) 2 | for _ in range(T): 3 | N = int(input()) 4 | zero,one=1,0 5 | for i in range(N): 6 | zero,one = one,zero+one 7 | print(zero,one) 8 | -------------------------------------------------------------------------------- /시즌8/중/ggamD00/0214_2_ggamD00.py: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | 3 | answer = [] 4 | for i in range(len(b) - len(a) + 1): 5 | count = 0 6 | for j in range(len(a)): 7 | if a[j] != b[i + j]: 8 | count += 1 9 | answer.append(count) 10 | 11 | print(min(answer)) -------------------------------------------------------------------------------- /시즌8/중/ggamD00/0215_3_ggamD00.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | d = [0] * 1000001 4 | 5 | for i in range(2, n+1): 6 | d[i] = d[i-1] + 1 7 | if i%2 == 0: 8 | d[i] = min(d[i], d[i//2] + 1) 9 | if i%3 == 0: 10 | d[i] = min(d[i], d[i//3] + 1) 11 | 12 | print(d[n]) 13 | -------------------------------------------------------------------------------- /시즌8/중/ggamD00/0216_4_ggamD00.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | l = [] 3 | 4 | for i in range(n): 5 | a, b = map(int, input().split()) 6 | l.append(a-b) 7 | 8 | l.sort() 9 | 10 | if n%2 == 1: 11 | print(1) 12 | else: 13 | print(abs(l[n//2] - l[n//2-1]) + 1) 14 | -------------------------------------------------------------------------------- /시즌8/중/gksgh108/0213_1_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | for _ in range(N): 3 | M = int(input()) 4 | a, b = 1, 0 5 | for i in range(M): # 0은 1이 호출된 횟수, 1은 0과 1이 호출된 합 6 | a,b = b, a+b 7 | print(a,b) 8 | -------------------------------------------------------------------------------- /시즌8/중/gksgh108/0214_2_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | min_value = 50 3 | 4 | for i in range(len(b) - len(a) + 1): 5 | cnt = 0 6 | for j in range(len(a)): 7 | if a[j] != b[i + j]: 8 | cnt += 1 9 | min_value = min(min_value, cnt) 10 | 11 | print(min_value) 12 | -------------------------------------------------------------------------------- /시즌8/중/gksgh108/0215_3_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | dp = [0] * (n+1) 4 | 5 | for i in range(2, n+1): 6 | dp[i] = dp[i-1] + 1 7 | 8 | if i % 2 == 0: 9 | dp[i] = min(dp[i], dp[i//2]+1) 10 | if i % 3 == 0: 11 | dp[i] = min(dp[i], dp[i//3] + 1) 12 | 13 | print(dp[n]) 14 | -------------------------------------------------------------------------------- /시즌8/중/gksgh108/0216_4_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | lst = [] 3 | 4 | for i in range(n): 5 | a, b = map(int, input().split()) 6 | lst.append(a-b) 7 | 8 | lst.sort() 9 | 10 | if n%2 == 1: 11 | print(1) 12 | else: 13 | print(abs(lst[n//2] - lst[n//2-1]) + 1) 14 | -------------------------------------------------------------------------------- /시즌8/중/gksgh108/0223_9_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | input = sys.stdin.readline 3 | 4 | def dfs(num, arr): 5 | arr[num] = -2 6 | for i in range(len(arr)): 7 | if num == arr[i]: 8 | dfs(i, arr) 9 | 10 | n = int(input()) 11 | arr = list(map(int, input().split())) 12 | k = int(input()) 13 | count = 0 14 | 15 | dfs(k, arr) 16 | count = 0 17 | for i in range(len(arr)): 18 | if arr[i] != -2 and i not in arr: 19 | count += 1 20 | print(count) 21 | -------------------------------------------------------------------------------- /시즌8/중/kkanghyun/0216_4_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int N; 10 | cin >> N; 11 | 12 | vector v; 13 | for (int i = 0; i < N; i++) { 14 | int start, end; 15 | cin >> start >> end; 16 | v.push_back(start - end); 17 | } 18 | 19 | sort(v.begin(), v.end()); 20 | 21 | if (N % 2 == 1) { 22 | cout << 1; 23 | } 24 | else 25 | { 26 | cout << v[N / 2] - v[N / 2 - 1] + 1; 27 | } 28 | } -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0214_1_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0214_1_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0214_2_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0214_2_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0215_3_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0215_3_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0217_4_noodlechoi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | 8 | int main() { 9 | 10 | int N; 11 | cin >> N; 12 | 13 | vector arr; 14 | for (int i = 0; i < N; i++) { 15 | int A, B; 16 | cin >> A >> B; 17 | arr.push_back(A - B); 18 | } 19 | 20 | sort(arr.begin(), arr.end()); 21 | if (N % 2 == 1) 22 | cout << 1; 23 | else 24 | cout << arr[N / 2] - arr[N / 2 - 1] + 1; 25 | } -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0217_5_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0217_5_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0220_6_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0220_6_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0222_7_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0222_7_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0222_8_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0222_8_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0224_10_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0224_10_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/noodlechoi/0224_9_noodlechoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/중/noodlechoi/0224_9_noodlechoi.cpp -------------------------------------------------------------------------------- /시즌8/중/reval04/0214_1_reval04.py: -------------------------------------------------------------------------------- 1 | z = [1,0,1] 2 | o = [0,1,1] 3 | 4 | def fibo(n): 5 | num = len(z) 6 | if n >= num: 7 | for i in range(num,n+1): 8 | z.append(z[i-1]+z[i-2]) 9 | o.append(o[i-1]+o[i-2]) 10 | print(z[n], o[n]) 11 | 12 | a = int(input()) 13 | for i in range(a): 14 | b = int(input()) 15 | fibo(b) 16 | -------------------------------------------------------------------------------- /시즌8/중/reval04/0215_2_reval04.py: -------------------------------------------------------------------------------- 1 | a,b = list(input().split()) 2 | min = 51 3 | for i in range(len(b) - len(a) +1): 4 | c = 0 5 | for j in range(len(a)): 6 | if a[j] != b[j + i]: 7 | c += 1 8 | if min >= c: 9 | min = c 10 | print(min) 11 | -------------------------------------------------------------------------------- /시즌8/중/reval04/0216_3_reval04.py: -------------------------------------------------------------------------------- 1 | x=int(input()) 2 | d=[0]*(x+1) 3 | for i in range(2,x+1): 4 | d[i]=d[i-1]+1 5 | if i%2==0: 6 | d[i]=min(d[i],d[i//2]+1) 7 | if i%3==0: 8 | d[i]=min(d[i],d[i//3]+1) 9 | print(d[x]) 10 | print(d) 11 | -------------------------------------------------------------------------------- /시즌8/중/reval04/0216_4_reval04.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | numbers = list() 3 | for _ in range(n): 4 | a, b = map(int, input().split()) 5 | numbers.append(b - a) 6 | 7 | numbers = sorted(numbers) 8 | 9 | answer = 0 10 | if len(numbers) % 2 == 0: 11 | start = len(numbers) // 2 - 1 12 | answer = numbers[start + 1] - numbers[start] + 1 13 | else: 14 | answer = 1 15 | 16 | print(answer) 17 | -------------------------------------------------------------------------------- /시즌8/중/reval04/0224_9_reval04.py: -------------------------------------------------------------------------------- 1 | 2 | N=int(input()) 3 | 4 | arr=list(map(int,input().split())) 5 | 6 | erase=int(input()) 7 | 8 | def dfs(index): 9 | arr[index]=-2 10 | for i in range(N): 11 | if arr[i]==index: 12 | dfs(i) 13 | 14 | dfs(erase) 15 | answer=0 16 | 17 | for i in range(N): 18 | if not arr[i]==-2 and i not in arr: 19 | answer+=1 20 | 21 | print(answer) 22 | -------------------------------------------------------------------------------- /시즌8/중/shay0454/0218_4_shay0454.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | int main() { 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | int N, A, B, arr[50]; cin >> N; 8 | for (int i = 0; i < N; i++) { cin >> A >> B; arr[i] = A - B; } 9 | sort(arr, arr + N); 10 | cout << ((N % 2) ? 1 : abs(arr[N / 2] - arr[N / 2 - 1])+1); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /시즌8/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌8/하/.keep -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0213_1_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | 2 | num_list = [] 3 | for i in range(9) : 4 | num_list.append(int(input())) 5 | 6 | print(max(num_list)) 7 | print(num_list.index(max(num_list))+1) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0214_2_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | 2 | word = list(str(input())) 3 | 4 | if list(reversed(word)) == word: 5 | print(1) 6 | else: 7 | print(0) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0215_3_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | 2 | # A = 고정 비용, B = 가변 비용, C = 노트북 판매 가격, n = 노트북 개수 3 | # 이익 = (1대 당 판매가 C - 1대 당 생산비용 B) * n - 고정 비용 A 4 | 5 | A, B, C = map(int, input().split()) 6 | if B >= C: 7 | print(-1) 8 | else: 9 | print(int(A//(C-B)+1)) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0216_4_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | i = 2 3 | while n!=1: 4 | if n%i == 0: 5 | print(i) 6 | n = n/i 7 | else: 8 | i+=1 -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0217_5_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | 2 | # input 대신 sys 라이브러리로 시간 줄임 3 | 4 | import sys 5 | n = int(sys.stdin.readline()) 6 | list = [] 7 | for i in range(n): 8 | a, b = map(int, sys.stdin.readline().split()) 9 | list.append([a, b]) 10 | list.sort() 11 | for i in list: 12 | print(i[0], i[1]) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0220_6_HaeunKim01.py: -------------------------------------------------------------------------------- 1 | 2 | n = int(input()) 3 | lst = list(map(int, input().split())) 4 | 5 | print(max(lst) * min(lst)) 6 | -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0222_07_HaeunKim01: -------------------------------------------------------------------------------- 1 | 2 | num = input() 3 | divisor = int(input()) 4 | num = int(num[:-2] + '00') 5 | while True: 6 | if num % divisor == 0: 7 | break 8 | num += 1 9 | print(str(num)[-2:]) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0222_8_HaeunKim01: -------------------------------------------------------------------------------- 1 | 2 | c1 = input() 3 | c2 = input() 4 | c3 = input() 5 | 6 | color = {'black': 0, 'brown': 1, 'red': 2, 'orange': 3, 'yellow': 4, 'green': 5, 'blue': 6, 'violet': 7, 7 | 'grey': 8, 'white': 9} 8 | print((color[c1]*10 + color[c2]) * 10**color[c3]) -------------------------------------------------------------------------------- /시즌8/하/HaeunKim01/0224_9_HaeunKim01: -------------------------------------------------------------------------------- 1 | 2 | from itertools import combinations 3 | 4 | N, M = map(int, input().split()) 5 | lst = list(map(int, input().split())) 6 | nlst = [] 7 | 8 | for three in combinations(lst, 3): 9 | if sum(three) > M: 10 | continue 11 | else: 12 | nlst.append(sum(three)) 13 | print(max(nlst)) -------------------------------------------------------------------------------- /시즌8/하/hamin924/0213_1_hamin924.py: -------------------------------------------------------------------------------- 1 | # 1일차, 최댓값 2 | 3 | A = [] 4 | max = 0 5 | result = 0 6 | 7 | for i in range(9): 8 | A.append(int(input())) 9 | 10 | for i in range(9): 11 | if max < A[i]: 12 | max = A[i] 13 | result = i + 1 14 | 15 | print(max) 16 | print(result) 17 | -------------------------------------------------------------------------------- /시즌8/하/hamin924/0214_2_hamin924.py: -------------------------------------------------------------------------------- 1 | # 2일차, 펠린드롬 2 | 3 | str = list(input()) 4 | 5 | str_reverse = str[::-1] # 역순 6 | 7 | 8 | if str == str_reverse: 9 | print("1") 10 | else: 11 | print("0") -------------------------------------------------------------------------------- /시즌8/하/hamin924/0215_3_hamin924.py: -------------------------------------------------------------------------------- 1 | # 손익분기점 2 | 3 | a, b, c = map(int, input().split()) 4 | 5 | if b >= c: 6 | print("-1") 7 | else: 8 | print(int(a/(c-b))+1) # n의 값 -------------------------------------------------------------------------------- /시즌8/하/hamin924/0216_4_hamin924.py: -------------------------------------------------------------------------------- 1 | # 소인수분해 2 | 3 | n = int(input()) 4 | 5 | for i in range(2, n+1): 6 | if n % i == 0: 7 | while n % i == 0: # 나눌 수 없을 때 까지 나누기 8 | print(i) 9 | n = n / i 10 | if n == 1: 11 | break 12 | -------------------------------------------------------------------------------- /시즌8/하/hamin924/0217_5_hamin924.py: -------------------------------------------------------------------------------- 1 | # 좌표 정렬하기 2 | 3 | n = int(input()) 4 | lst = [] 5 | for i in range(n): 6 | [a,b] = list(map(int, input().split())) 7 | lst.append([a,b]) 8 | 9 | lst.sort(key = lambda x: (x[0], x[1])) # x좌표가 같으면 y좌표로 둘다 오름차순! 10 | 11 | for i in lst: 12 | print(i[0], i[1]) -------------------------------------------------------------------------------- /시즌8/하/hamin924/0220_6_hamin924.py: -------------------------------------------------------------------------------- 1 | # 약수 2 | 3 | n = int(input()) 4 | 5 | a = list(map(int, input().split())) 6 | 7 | a.sort() 8 | 9 | result = a[0] * a[-1] 10 | 11 | print(result) -------------------------------------------------------------------------------- /시즌8/하/hamin924/0221_7_hamin924.py: -------------------------------------------------------------------------------- 1 | # 나누기 2 | 3 | N = int(input()) 4 | F = int(input()) 5 | front = N // 100 6 | answer = front * 100 7 | 8 | while answer % F != 0: # 나눠떨어질때까지 9 | answer += 1 10 | 11 | print(str(answer)[-2:]) -------------------------------------------------------------------------------- /시즌8/하/hamin924/0222_8_hamin924.py: -------------------------------------------------------------------------------- 1 | # 저항 2 | 3 | color1 = input() 4 | color2 = input() 5 | color3 = input() 6 | 7 | colors = {"black":0, "brown":1, "red":2, "orange":3, "yellow":4, "green":5 8 | , "blue": 6, "violet" : 7, "grey":8, "white":9} 9 | 10 | print((colors[color1]*10+colors[color2]) * 10**colors[color3]) # 제 -------------------------------------------------------------------------------- /시즌8/하/hamin924/0223_9_hamin924.py: -------------------------------------------------------------------------------- 1 | # 블랙잭 2 | from itertools import combinations 3 | 4 | n, m = map(int, input().split()) 5 | 6 | a = list(map(int,input().split())) 7 | result = [] 8 | 9 | for i in combinations(a, 3): 10 | if sum(i) > m: 11 | continue 12 | else: 13 | result.append(sum(i)) 14 | 15 | print(max(result)) 16 | -------------------------------------------------------------------------------- /시즌8/하/hamin924/0224_10_hamin924.py: -------------------------------------------------------------------------------- 1 | n=int(input()) 2 | 3 | text=input() 4 | 5 | security = text.count("security") 6 | bigdata = text.count("bigdata") 7 | 8 | if security > bigdata: 9 | print("security!") 10 | elif bigdata > security: 11 | print("bigdata?") 12 | else: 13 | print("bigdata? security!") 14 | -------------------------------------------------------------------------------- /시즌8/하/hamin924/2022_8_hamin924.py: -------------------------------------------------------------------------------- 1 | # 저항 2 | 3 | color1 = input() 4 | color2 = input() 5 | color3 = input() 6 | 7 | colors = {"black":0, "brown":1, "red":2, "orange":3, "yellow":4, "green":5 8 | , "blue": 6, "violet" : 7, "grey":8, "white":9} 9 | 10 | print((colors[color1]*10+colors[color2]) * 10**colors[color3]) # 제곱 -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0213_1_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | # 입력 받기 2 | numbers = [int(input()) for _ in range(9)] 3 | 4 | # 최댓값 찾기 5 | max_num = max(numbers) 6 | 7 | # 위치 찾기 8 | index = numbers.index(max_num) + 1 9 | 10 | # 출력하기 11 | print(max_num) 12 | print(index) 13 | -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0214_2_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | def is_palindrome(word): 2 | if word == word[::-1]: 3 | return 1 4 | else: 5 | return 0 6 | 7 | word = input() 8 | print(is_palindrome(word)) -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0215_3_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | A, B, C = map(int, input().split()) 2 | 3 | if B >= C: 4 | print(-1) 5 | else: 6 | x = 0 7 | while True: 8 | if A + B * x < C * x: 9 | print(x) 10 | break 11 | x += 1 12 | 13 | 14 | -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0216_4_syxxnejeong.py: -------------------------------------------------------------------------------- 1 | def prime_factorization(n): 2 | i=2 3 | while i*i <= n: 4 | if n%i: 5 | i+=1 6 | 7 | else: 8 | n//=i 9 | print(i) 10 | 11 | if n>1: 12 | print(n) 13 | 14 | 15 | n=int(input()) 16 | prime_factorization(n) 17 | -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0220_6_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | n=int(input()) 2 | factor=list(map(int,input().split())) 3 | factor.sort() 4 | print(factor[0]*factor[-1]) -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0221_7_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | F = int(input()) 3 | 4 | 5 | def is_divisible(n, f): 6 | return n % f == 0 7 | 8 | 9 | def find_smallest(n, f): 10 | for i in range(100): 11 | if is_divisible(n + i, f): 12 | return i 13 | 14 | 15 | answer = find_smallest(N, F) 16 | print("%02d" % answer) -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/0224_10_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | import re 2 | 3 | N = int(input()) 4 | answers = input() 5 | 6 | bigdata_count = len(re.findall('bigdata', answers)) 7 | security_count = len(re.findall('security', answers)) 8 | 9 | if bigdata_count > security_count: 10 | print("bigdata?") 11 | elif bigdata_count < security_count: 12 | print("security!") 13 | else: 14 | print("bigdata? security!") -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/2017_5_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | # 점의 개수 N 입력 받기 2 | N = int(input()) 3 | 4 | # 점의 위치 정보를 저장할 리스트 초기화 5 | points = [] 6 | 7 | # N개의 점 위치 정보를 입력 받기 8 | for _ in range(N): 9 | x, y = map(int, input().split()) 10 | points.append((x, y)) 11 | 12 | # x좌표를 기준으로 오름차순 정렬하고, x좌표가 같으면 y좌표를 기준으로 오름차순 정렬 13 | points.sort() 14 | 15 | # 정렬된 점 위치 정보 출력 16 | for point in points: 17 | print(point[0], point[1]) -------------------------------------------------------------------------------- /시즌8/하/syxxnjeong/2023_9_syxxnjeong.py: -------------------------------------------------------------------------------- 1 | N, M = map(int, input().split()) 2 | cards = list(map(int, input().split())) 3 | 4 | result = 0 5 | length = len(cards) 6 | 7 | for i in range(0, length): 8 | for j in range(i+1, length): 9 | for k in range(j+1, length): 10 | sum_value = cards[i] + cards[j] + cards[k] 11 | if sum_value <= M: 12 | result = max(result, sum_value) 13 | 14 | print(result) -------------------------------------------------------------------------------- /시즌9/상/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌9/상/.keep -------------------------------------------------------------------------------- /시즌9/상/kimkimgungunwoo/)411_kimkimgungunwoo.py: -------------------------------------------------------------------------------- 1 | N=int(input()) 2 | inp=list(map(int,input().split())) 3 | dp=[0]*(N+1) 4 | for i in range(N): 5 | dp[inp[i]]=dp[inp[i]-1]+1 6 | print(N-max(dp)) -------------------------------------------------------------------------------- /시즌9/중/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌9/중/.keep -------------------------------------------------------------------------------- /시즌9/중/EJimin0509/0401_1_EJimin0509.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | A = list(map(int, input().split())) 3 | 4 | i = N - 2 5 | while i: 6 | if i == 1: 7 | A[0] -= 1 8 | A[N - 1] -= 1 9 | else: 10 | if A[0] >= A[N - 1]: 11 | A[0] -= 1 12 | else: 13 | A[N - 1] -= 1 14 | i -= 1 15 | 16 | if A[0] >= A[N - 1]: 17 | print(A[0]) 18 | else: 19 | print(A[N - 1]) -------------------------------------------------------------------------------- /시즌9/중/EJimin0509/0402_2_EJimin0509.py: -------------------------------------------------------------------------------- 1 | while True: 2 | n = int(input()) 3 | if n == 0: 4 | break 5 | 6 | charge = [] 7 | for _ in range(n): 8 | charge.append(int(input())) 9 | 10 | charge.sort() 11 | 12 | answer = "POSSIBLE" 13 | for i in range(len(charge) - 1): 14 | if charge[i + 1] - charge[i] > 200: 15 | answer = "IMPOSSIBLE" 16 | break 17 | 18 | if 1422 - charge[-1] > 100: 19 | answer = "IMPOSSIBLE" 20 | print(answer) -------------------------------------------------------------------------------- /시즌9/중/EJimin0509/0405_5_EJimin0509.py: -------------------------------------------------------------------------------- 1 | INF = 1000001 2 | 3 | n, k = map(int, input().split()) 4 | dp = [INF] * (n + 1) 5 | dp[0] = 0 6 | 7 | for i in range(n): 8 | if i + 1 <= n: 9 | dp[i + 1] = min(dp[i + 1], dp[i] + 1) 10 | if i + i // 2 <= n: 11 | dp[i + i // 2] = min(dp[i + i // 2], dp[i] + 1) 12 | 13 | print("minigimbob" if dp[n] <= k else "water") -------------------------------------------------------------------------------- /시즌9/중/EJimin0509/0409_7_EJimin0509.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | input = sys.stdin.readline 4 | 5 | t = int(input()) 6 | for _ in range(t): 7 | n = int(input()) 8 | prime_cnt = [] 9 | for p in range(2, n + 1): 10 | cnt = 0 11 | while n % p == 0: 12 | cnt += 1 13 | n = n // p 14 | if cnt: 15 | prime_cnt.append([p, cnt]) 16 | for p in prime_cnt: 17 | print(*p) -------------------------------------------------------------------------------- /시즌9/중/EJimin0509/0411_9_EJimin0509.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | if n==1 or n==2: 3 | print(0) 4 | elif n==3: 5 | print(1) 6 | else: 7 | start = 2 8 | d = 2 9 | cnt = 0 10 | for i in range(n-4): 11 | start += d 12 | cnt += 1 13 | if cnt == 2: 14 | cnt = 0 15 | d += 1 16 | print(start) -------------------------------------------------------------------------------- /시즌9/중/HongSeokYoung/240411_9_HongSeokYoung.cpp: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int N; 6 | int sum = 1; 7 | int total = 0; 8 | 9 | scanf("%d", &N); 10 | 11 | for (int i = 1; i <= N - 2; i++) { 12 | 13 | total += sum; 14 | 15 | if (i % 2 == 0) { 16 | sum += 1; 17 | } 18 | 19 | } 20 | printf("%d", total); 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /시즌9/중/JEKKY/0401_1_JEKKY.py: -------------------------------------------------------------------------------- 1 | N = int(input()) 2 | fList = list(map(int,input().split())) 3 | for i in range(N-3): 4 | if(fList[0]>fList[-1]): 5 | fList[0]-=1 6 | else: 7 | fList[-1]-=1 8 | fList[0]-=1; fList[-1]-=1 9 | print(max(fList[0],fList[-1])) -------------------------------------------------------------------------------- /시즌9/중/JEKKY/0405_5_JEKKY.py: -------------------------------------------------------------------------------- 1 | N, K = map(int, input().split()) 2 | def climb(i, cnt): 3 | if i<3: return cnt+i 4 | elif i%3==0: return climb(i/3*2,cnt+1) 5 | elif (i-1)%3==0: return climb((i-1)/3*2+1, cnt+1) 6 | else: return climb(i-1, cnt+1) 7 | if climb(N,0)<=K: print("minigimbob") 8 | else: print("water") 9 | -------------------------------------------------------------------------------- /시즌9/중/JEKKY/0408_6_JEKKY.py: -------------------------------------------------------------------------------- 1 | P = int(input()) 2 | for i in range(P): 3 | N,M = map(int, input().split()) 4 | cnt = 0 5 | a=b=1 6 | while(True): 7 | tmp = (a+b)%M 8 | a=b 9 | b=tmp 10 | cnt+=1 11 | if a==1 and b==1:break 12 | print(N, cnt) -------------------------------------------------------------------------------- /시즌9/중/JEKKY/0409_7_JEKKY.py: -------------------------------------------------------------------------------- 1 | R = int(input()) 2 | for i in range(R): 3 | N = int(input()) 4 | m = N 5 | prime = [0]*100000 6 | for j in range(2,m+1): 7 | while m % j ==0: 8 | m = m / j 9 | prime[j]+=1 10 | for j in range(2,len(prime)): 11 | if prime[j]: 12 | print(j,prime[j]) -------------------------------------------------------------------------------- /시즌9/중/JEKKY/0411_9_JEKKY.py: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | if n==1 or n==2: 4 | result = 0 5 | elif n==3: 6 | result = 1 7 | else: 8 | result = 2 9 | d = 2 10 | cnt = 0 11 | for i in range(n-4): 12 | result += d 13 | cnt += 1 14 | if cnt == 2: 15 | cnt = 0 16 | d += 1 17 | print(result) -------------------------------------------------------------------------------- /시즌9/중/Kimryungyo04/0411_9_Kimryungyo04.py: -------------------------------------------------------------------------------- 1 | # [ 알고리즘 ] 2 | # 답들을 정렬해보면 다음과 같은 규칙이 존재한다. 3 | # 해당 규칙을 통해 값을 구한다. 4 | # 5 | # 자리를 바꾼 횟수 : 0 0 1 2 4 6 9 12 16 20 25 30 6 | # 각 횟수 사이의 차이 : 0 0 1 1 2 2 3 3 4 4 5 5 7 | 8 | def main(): 9 | """씨부엉 난이도 중 9일차 알고리즘 함수""" 10 | 11 | n = int(input()) # 정보 입력 12 | result = 0 # 자리를 바꾼 횟수 정의 13 | 14 | for i in range(n): result += i // 2 # 규칙에 따라 횟수 추가 15 | 16 | print(result) # 결과 출력 17 | 18 | main() 19 | -------------------------------------------------------------------------------- /시즌9/중/gksgh108/0404_4_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | MAX = 1000001 4 | arr = [0] * (MAX) 5 | 6 | for i in range(2, MAX): 7 | buffer = 0 8 | for j in range(i, MAX): 9 | buffer = buffer + j 10 | if buffer >= MAX: 11 | break 12 | arr[buffer] = arr[buffer] + 1 13 | 14 | while True: 15 | price = int(sys.stdin.readline()) 16 | if price == 0: 17 | break 18 | sys.stdout.write("%d\n" % arr[price]) 19 | -------------------------------------------------------------------------------- /시즌9/중/gksgh108/0405_5_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | def solve(n, k): 2 | dp = [10**9] * (n + 1) 3 | dp[0] = 0 4 | for i in range(n): 5 | dp[i + 1] = min(dp[i + 1], dp[i] + 1) 6 | m = i + i // 2 7 | if m <= n: 8 | dp[m] = min(dp[m], dp[i] + 1) 9 | return "minigimbob" if dp[n] <= k else "water" 10 | 11 | n, k = map(int, input().split()) 12 | 13 | print(solve(n, k)) 14 | -------------------------------------------------------------------------------- /시즌9/중/gksgh108/0406_6_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | p = int(input()) 2 | results = [] 3 | for _ in range(p): 4 | n, m = map(int, input().split()) 5 | a, b = 0, 1 6 | for i in range(0, m * m): 7 | a, b = b, (a + b) % m 8 | if a == 0 and b == 1: 9 | results.append((n, i + 1)) 10 | break 11 | 12 | for n, period in results: 13 | print(f"{n} {period}") 14 | -------------------------------------------------------------------------------- /시즌9/중/gksgh108/0409_7_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | for _ in range(n): 3 | m = int(input()) 4 | result = [] 5 | dev = 2 6 | while m != 1: 7 | count = 0 8 | while True: 9 | if m % dev == 0: 10 | m //= dev 11 | count += 1 12 | else: 13 | break 14 | result.append([dev, count]) 15 | dev += 1 16 | for i in result: 17 | if i[1]: 18 | print(*i) 19 | -------------------------------------------------------------------------------- /시즌9/중/gksgh108/0411_9_gksgh108.ipynb: -------------------------------------------------------------------------------- 1 | n = int(input()) 2 | 3 | if n <= 3: 4 | print(0 if n <= 2 else 1) 5 | else: 6 | res = 2 7 | val = 2 8 | for i in range(5, n+1): 9 | res += val 10 | if i % 2 == 0: 11 | val += 1 12 | print(res) 13 | -------------------------------------------------------------------------------- /시즌9/중/golapaduck/0401_1_golapaduck.py: -------------------------------------------------------------------------------- 1 | # 21557 2 | count = int(input()) 3 | stack = list(map(int,input().split())) 4 | left = stack[0] 5 | right = stack[count-1] 6 | 7 | for i in range(0,count-2): 8 | if i == count-3: 9 | left = left-1 10 | right = right-1 11 | break 12 | if left > right: 13 | left = left-1 14 | else: 15 | right = right-1 16 | 17 | print(max(left,right)) -------------------------------------------------------------------------------- /시즌9/중/golapaduck/0405_5_golapaduck.py: -------------------------------------------------------------------------------- 1 | #28069 2 | n,k = map(int,input().split()) 3 | 4 | result="water" 5 | for _ in range(k): 6 | if (n % 3 == 2): n -=1 7 | else: n= min(2*(n+1)//3, n-1) 8 | 9 | if (n==0): 10 | result="minigimbob" 11 | break 12 | 13 | print(result) -------------------------------------------------------------------------------- /시즌9/중/golapaduck/0409_7_golapaduck.py: -------------------------------------------------------------------------------- 1 | #2312 2 | import sys 3 | 4 | case = int(sys.stdin.readline()) 5 | 6 | for _ in range(case): 7 | num = int(sys.stdin.readline()) 8 | i = 2 9 | while i*i <= num: 10 | count = 0 11 | while (num % i == 0): 12 | num //= i 13 | count += 1 14 | 15 | if count: sys.stdout.write(f"{i} {count}\n") 16 | 17 | i += 1 18 | 19 | if num > 1: 20 | sys.stdout.write(f"{num} 1\n") -------------------------------------------------------------------------------- /시즌9/중/golapaduck/0411_9_golapaduck.py: -------------------------------------------------------------------------------- 1 | #2117 2 | N = int(input()) 3 | 4 | if N ==1: 5 | print(0) 6 | elif N % 2 == 0: 7 | print((N // 2 - 1) * (N // 2)) 8 | else: 9 | print((N // 2) ** 2) -------------------------------------------------------------------------------- /시즌9/하/.keep: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌9/하/.keep -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0401_1_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | ios_base::sync_with_stdio(false); 7 | cin.tie(0); 8 | cout.tie(0); 9 | 10 | int L, A, B, C, D; 11 | cin >> L >> A >> B >> C >> D; 12 | 13 | for (int i = 1; i <= L; ++i) { 14 | A -= C; 15 | B -= D; 16 | 17 | if (A <= 0 && B <= 0) { 18 | cout << L - i << endl; 19 | break; 20 | } 21 | } 22 | } -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0403_3_kkanghyun.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/C-B-U/algorithm_challenge/b97dbfb762036b58ac7c5bd2b70ff38ea0f9b01b/시즌9/하/kkanghyun/0403_3_kkanghyun.cpp -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0404_4_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | while (true) { 7 | int A; 8 | cin >> A; 9 | if (cin.eof() == true) 10 | break; 11 | 12 | if (A % 6 == 0) 13 | cout << "Y" << endl; 14 | else 15 | cout << "N" << endl; 16 | } 17 | } -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0406_6_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int A, B, C, D, E; 7 | cin >> A >> B >> C >> D >> E; 8 | 9 | if (A < 0) 10 | std::cout << abs(A) * C + D + B * E << std::endl; 11 | else 12 | std::cout << (B - A) * E << std::endl; 13 | } -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0407_7_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int N, M; 9 | cin >> N >> M; 10 | 11 | for (int i = 0; i < N; ++i) { 12 | string s; 13 | for (int j = 0; j < M; ++j) { 14 | char c; 15 | cin >> c; 16 | s += c; 17 | } 18 | reverse(s.begin(), s.end()); 19 | cout << s << endl; 20 | } 21 | } -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0408_8_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int N, T, C, P; 7 | cin >> N >> T >> C >> P; 8 | cout << P * C * ((N - 1) / T) << endl; 9 | } -------------------------------------------------------------------------------- /시즌9/하/kkanghyun/0409_9_kkanghyun.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int N; 8 | cin >> N; 9 | 10 | vector v; 11 | v.resize(N); 12 | for (int i = 0; i < N; ++i) 13 | cin >> v[i]; 14 | 15 | int res{}; 16 | int sum{}; 17 | for (int i = 0; i < N - 1; ++i) { 18 | if (v[i] < v[i + 1]) { 19 | sum += v[i + 1] - v[i]; 20 | if (sum > res) 21 | res = sum; 22 | } 23 | else 24 | sum = 0; 25 | } 26 | 27 | cout << res; 28 | } --------------------------------------------------------------------------------