Programming 썸네일형 리스트형 [C++] 백준 2909번 : 캔디 구매 https://www.acmicpc.net/problem/2909 #include #include using namespace std;int main() {int n,k;cin >> n >> k;int tmp = pow(10,k);int n1;n1 = n % tmp;n1 >= pow(10, k) / 2 ? n = n+(pow(10, k)-n1) : n = n - n1;cout 더보기 [C++] 백준 10539번 : 수빈이와 수열 https://www.acmicpc.net/problem/10539 #include using namespace std;int main() {int n;cin >> n; int sum = 0 , n1,result;for (int i = 0; i > n1;result = n1 * (i + 1) - sum;cout 더보기 [C++] 백준 5533번 : 유니크 https://www.acmicpc.net/problem/5533 #include #include using namespace std;int main() { int n;cin >> n;int **Player = new int*[n]; int Card[100] = { 0, };int tmp;for (int i = 0; i > Player[i][j];Card[Player[i][j] - 1] = tmp+ Card[Player[i][j] - 1];}} int sum = 0;for (int i = 0; i < n; i++) {for (int j = 0;.. 더보기 [C++] 백준 2783번 : 삼각 김밥 https://www.acmicpc.net/problem/2783 #include using namespace std;int main() {double S_25;int a, b;cin >> a >> b;double min = ((double)a / b);; int n;cin >> n;for (int i = 0; i > a >> b;min = min > ((double)a / b) ? ((double)a / b) : min;} cout 더보기 [C++] 백준 4153번 : 직각삼각형 https://www.acmicpc.net/problem/4153 #include #include #include using namespace std; int main() { vector v;int tmp[3];do {cin >> tmp[0] >> tmp[1] >> tmp[2];if ((tmp[0] != 0) || (tmp[1] != 0) || (tmp[2] != 0)) {sort(tmp, tmp + 3);if (tmp[0] * tmp[0] + tmp[1] * tmp[1] == tmp[2] * tmp[2])v.push_back(1);elsev.push_back(0);}elsebreak;} while (1); for (int i = 0; i < v.size(); i++) if (v.at(i) == 1)cout 더보기 [C++] 백준 8320번 : 직사각형을 만드는 방법 https://www.acmicpc.net/problem/8320 #include #include using namespace std; int main() {int n;cin >> n;int *square = new int[n]; int cnt = 0;for (int i = 0; i < n; i++) {for (int j = 1; j 더보기 [C++] 백준 5618번 : 공약수 https://www.acmicpc.net/problem/5618 #include #include using namespace std;int main() {int n;cin >> n;int *ary = new int[n];for(int i=0; i> ary[i];sort(ary, ary + n); int min = ary[0];int cnt = 1;for (int i = 1; i 더보기 [C++] 백준 5576번 : 콘테스트 https://www.acmicpc.net/problem/5576 #include #include using namespace std;int main() {int w[10], k[10];for (int i = 0; i > w[i];for (int i = 0; i > k[i]; sort(w, w + 10);sort(k, k + 10);cout 더보기 이전 1 ··· 21 22 23 24 25 26 27 ··· 38 다음