본문 바로가기

분류 전체보기

 (35)
백준 2947 #include using namespace std; int arr[5]; int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); for (int i = 0; i > arr[i]; } while (true) { for (int i = 0; i arr[i + 1]) { int temp = arr[i + 1]; arr[i + 1] = arr[i]; arr[i] = temp; for (int i = 0; i < 5; i++) { cout
백준 1904 #include #include #include using namespace std; int num; long long arr[1000000]; int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cin >> num; arr[0] = 1; arr[1] = 2; for (int i = 2; i < num; i++) { arr[i] = (arr[i - 1] + arr[i - 2]) %15746; } cout
백준 13305 #include #include #include using namespace std; int num; vector dist; vectorprice; int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cin >> num; for (int i = 0; i > temp; dist.push_back(temp); } for (int i = 0; i > tmp; price.push_back(tmp); } int min=price[0]; long long total=0; for (int i = 0; i < num-1; i++) { if (..
백준 15654번 #include #include #include using namespace std; int N; int M; int arr[8]; bool check[8] = { false, }; vector save; void Permutation(int n, int r) { if (n == r) { for (int i = 0; i < save.size(); i++) { printf("%d",save[i]); printf(" "); } printf("\n"); } for (int i = 0; i < N; i++) { if (check[i] == true) continue; check[i] = true; save.push_back(arr[i]); Permutation(n + 1, r); save.pop_back(); ..
백준 15903번 #include #include #include using namespace std; int total; int num; long long int total_sum = 0; int main() { cin.tie(0); ios_base::sync_with_stdio(false); priority_queue pq; cin >> total; cin >> num; int temp; for (int i = 0; i > temp; pq.push(temp); } for (int i = 0; i < num; i++) { long long int num1, num2, sum; num1 = pq.top(); pq.pop(); num2 = pq.top(); pq.pop(); sum = ..
백준 11724 #include #include #include #include #include #define max 1001 using namespace std; int n, m; int u, v; int now; int nxt; int graphsize; int cnt = 0; vector graph[max]; bool check[max]; void mark(int i) { queue q; q.push(i); check[i] = true; while (!q.empty()) { now = q.front(); q.pop(); graphsize = graph[now].size(); for (int i = 0; i < graphsize; i++) { nxt = graph[now][i]; if (!check[nxt]) { q..
백준 1012번 #include #include #include #define size 51 using namespace std; int arr[size][size] = {0,}; bool check[size][size] = {false,}; int posX[4] = { 0,0,-1,1 }; int posY[4] = { 1,-1 ,0,0, }; int test; int n, m, num; int cal=0; int nx, ny; int x, y; void dfs(int x , int y) { for (int i = 0; i = 0 && ny >= 0 && nx < m && ny < n) { if (arr[nx][ny] =..
백준 1475번 #include #include using namespace std; int main() { cin.tie(0); ios_base::sync_with_stdio(false); int door=0; int number[10] = { 0, }; int num; int temp; int max=0; cin >> door; num = floor(log10(door) + 1); if (door == 0) { max = 1; } for (int i = 0; i number[9]) { number[6] -= ((number[6] - number[9]) / 2); } else { ..

티스토리툴바