Algorithm (2139) 썸네일형 리스트형 C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 5522번:카드 게임 답 1234567891011#include using namespace std;int main() { int sum=0, x; for (int i = 0; i > x; sum += x; } cout C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 1475번:방번호 답 123456789101112131415161718#include #include using namespace std;int a[10], big;int main() { string k; cin >> k; for (int i = 0; i C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 10866번:덱 답 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667#include #include #include using namespace std;int main() { string k; deque d; int n,x; cin >> n; while (n--) { cin >> k; if (k == "push_front") { cin >> x; d.push_front(x); } else if (k == "push_back") { cin >> x; d.push_back(x); } else if (k == "pop_back") { if (!d.empty.. C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2161번:카드1 답 1234567891011121314151617181920#include #include using namespace std;int main() { int n; queue q; cin >> n; for (int i = 1; i C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 10103번:주사위 게임 답 1234567891011121314151617#include using namespace std;int main() { int n,as=100,bs=100; cin >> n; while (n--) { int a, b; cin >> a >> b; if (a > b) bs -= a; else if (a C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 4504번:배수 찾기 답 12345678910111213141516#include using namespace std;int main() { int n; cin >> n; while (1) { int x; cin >> x; if (x == 0) { break; } if (x % n == 0) cout (C++) - 백준(BOJ) 5361번 : 전투 드로이드 가격 답 #include using namespace std; int main() { double a[5] = { 350.34,230.9,190.55,125.3,180.9 }, sum; int n; cin >> n; while (n--) { sum = 0; for (int i = 0; i > x; sum += a[i] * x; } printf("$%.2f\n",sum ); } } (C++) - 백준(BOJ) 10101번 : 삼각형 외우기 #include using namespace std; int main() { int a[3], sum=0; for (int i = 0; i > a[i]; sum += a[i]; } if (sum != 180) { cout 이전 1 ··· 229 230 231 232 233 234 235 ··· 268 다음