:: ADVANCE ::

[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