목록Algorithm (187)
:: ADVANCE ::
http://183.106.113.109/30stair/sprime/sprime.php?pname=sprime super prime 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 #include using namespace std; int check_prime(int n) { int i; if(n == 1) return 0; for(i = 2; i*i
[91.1] 16_75 eratosthenes http://183.106.113.109/30stair/eratosthenes/eratosthenes.php?pname=eratosthenes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 #include using namespace std; int number[10000]; void makenum(int n) { int i; for(i = 2; i
http://183.106.113.109/30stair/ncpc_event/ncpc_event.php?pname=ncpc_event 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 #include using namespace std; int main(void) { int n, total, hotel, week, temp, min = 999999; int pri[20], inwon[15]; cin >> n >> total >> hotel >> week; for(int i = 0; i > pri[i]; for(int j = 0; j > inwon[j]; if(inwon[j] >= n) { temp..
http://183.106.113.109/30stair/ladder/ladder.php?pname=ladder 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 #include using namespace std; int ladder[100]; int main(void) { int col, row, path; char alpha = 'A'; cin >> col >> row; for(int i = 0; i > ladder[i]; } for(int i = 1; i
dovelet 4 단계 다중 반복문 이벤트 (ncpc_event) http://59.23.113.171/30stair/ncpc_event/ncpc_event.php?pname=ncpc_event 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 #include using namespace std; int main(void) { int n, total, hotel, week, temp, min = 999999; int pri[20], inwon[15]; cin >> n >> total >> hotel >> week; for(int i = 0; i > pri[i]; for(int j = 0; j >..
dovelet 5 단계 배열 베이비 긴 (baby_gin) http://59.23.113.171/30stair/baby_gin/baby_gin.php?pname=baby_gin 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 #include using namespace std; int card[6]; void so..
dovelet 5 단계 배열 두 수 (pir) http://59.23.113.171/30stair/pir/pir.php?pname=pir 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 #include using namespace std; int main(void) { int i, input[20], temp = 0, mmax = 0, max = 0; for(i = 0; i > input[i]; if(temp
http://183.106.113.109/30stair/cryption/cryption.php?pname=cryption 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 #include using namespace std; int num[10]; int n, cnt; int checknum(int chnum, int e) { int check, ten = 1, flag = 0; for(int i =..
http://183.106.113.109/30stair/cantoring/cantoring.php?pname=cantoring 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 #include using namespace std; char data[540000]; long total; void init(long n) { for(int i = 1; i total) return; if(start > n; total = mypow(3, n); init(total); func(1, total..
dovelet 4 단계 다중 반복문 거듭 제곱 테이블 (table) http://59.23.113.171/30stair/table/table.php?pname=table 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 #include using namespace std; int table[1000]; void split(long long n..