본문 바로가기

백준138

[2456] 나는 학급회장이다 #include using namespace std;int main(){int n, i, j;pair arr[3];cin >> n;for (i = 0; i a;arr[j].first += a;arr[j].second += a*a;}}int max = 0, check = 0;if (arr[0] 2018. 8. 23.
[1269] 대칭 차집합 #include #include using namespace std;int main(){set s;int n1, n2, i;cin >> n1 >> n2;for (i = 0; i > a;s.insert(a);}for (i = 0; i > a;if (s.count(a)) s.erase(a);else s.insert(a);}cout 2018. 8. 21.
[9971] The Hardest Problem Ever #include #include using namespace std;char chip[26] = { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };char plain[26] ={ 'V','W','X','Y','Z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U' };int main(){string str;while (1){cin >> str;cin.ignore();char s[101];if (str == "START"){while (1){cin.get(s, 101.. 2018. 8. 19.
[9455] 박스 #include using namespace std;int main(){int testcase, m, n, sum, cnt, i ,j;int arr[101][101] = { 0 };cin >> testcase;while (testcase--){cin >> m >> n;sum = 0;for (i = 1; i arr[i][j];for (j = 1; j = 1; i--){cnt = 0;if (arr[i][j] == 1){for (int k = i + 1; k 2018. 8. 19.
[13240] chessboard #include using namespace std;int main(){int i, j;int n, m;char star[11][11] = {};cin >> n >> m;for (i = 1; i 2018. 8. 19.
[2506] 점수계산 #include using namespace std;int main(){int Testcase, i, Allcount, Count;int n;cin >> Testcase;Allcount = 0;Count = 0;for (i = 0; i > n;if (n == 1){Count++;Allcount += Count;}elseCount = 0;}cout 2018. 8. 19.
[12778] CTP공국으로 이민 가자 #include using namespace std;int main(){int testcase, m, j;char alp;int arr1[501];char arr2[501];cin >> testcase;for (j = 0; j > m >> alp;if (alp == 'C'){for (int i = 0; i > arr2[i];}for (int i = 0; i arr1[i];}for (int i = 0; i 2018. 8. 18.
[5339] 콜센터 #include int main(){printf(" /~\\\n");printf(" ( oo|\n");printf(" _\\=/_\n");printf(" / _ \\\n");printf(" //|/.\\|\\\\ \n");printf(" || \\ / ||\n");printf("============\n");printf("| |\n");printf("| |\n");printf("| |\n");return 0;} 2018. 8. 18.
[8394] 악수 #include using namespace std;int fib[10000001];int main(){int n, i;cin >> n;fib[0] = 1;fib[1] = 1;fib[2] = 2;for (i = 3; i 2018. 8. 18.
[11722] 가장 긴 감소하는 부분 수열 #includeusing namespace std;int main(void){int N, max = 0, i, j;int Dp[1010] = {};int A[1010] = {};cin >> N;for (i = 1; i > A[i];for (i = 1; i 2018. 8. 18.
[15953] 상금 헌터 #include using namespace std;int main(){int t, i;cin >> t;for (i = 0; i > a >> b;if (!a)sum += 0;else if (a == 1)sum += 5000000;else if (a 2018. 8. 18.
[2740] 행렬 곱셈 #includeusing namespace std;int main(){int arr1[101][101], arr2[101][101], arr3[101][101] = {0};int i, j, n, m, k;cin >> n >> m;for (i = 0; i arr1[i][j];cin >> m >> k;for (i = 0; i arr2[i][j];for (i = 0; i 2018. 8. 13.
[1057] 토너먼트 #includeusing namespace std;int main(){int total, kim, im, count = 0;cin >> total >> kim >> im;if (total 2018. 8. 13.
[1094] 막대기 #includeusing namespace std;int main(){int len = 64, x, count = 0;cin >> x;while (x > 0){if (x 2018. 8. 13.
[2455] 지능형 기차 #include#includeusing namespace std;int main(){int i, j;int arr[4][2];vector v;for (i = 0; i arr[i][j];}int sum = arr[0][0] + arr[0][1];for (i = 1; i 2018. 8. 12.
[3036] 링 #include#includeusing namespace std;int gcd(int m, int n);int main(){int a, i;vector v;cin >> a;for (i = 0; i > r;v.push_back(r);}for (i = 1; i 2018. 8. 12.
[2609] 최대공약수와 최소공배수 #includeusing namespace std;int gcd(int m, int n);int lcm(int m, int n);int main(){int a, b;cin >> a >> b;cout 2018. 8. 12.
[13241] 최소공배수 #includeusing namespace std;long long gcd(long long m, long long n);long long lcm(long long m, long long n);int main(){long long a, b;cin >> a >> b;cout 2018. 8. 12.
[1934] 최소공배수 #includeusing namespace std;int gcd(int m, int n);int lcm(int m, int n);int main(){int testcase;cin >> testcase;while (testcase--){int a, b;cin >> a >> b;cout 2018. 8. 12.
[3053] 택시 기하학 #include#define _USE_MATH_DEFINES#include using namespace std;int main(){double r;cin >> r;printf("%.6f\n%.6f\n", r*r*M_PI, r*r*2);return 0;} 2018. 8. 12.

티스토리툴바