Hyuk(200)
-
[백준 3023번] 마술사 이민혁
소스코드123456789101112131415161718192021222324252627282930313233343536373839404142434445#include using namespace std; int main() { char card[101][101]; int r, c, er,ec; cin >> r >> c; for (int i = 1; i card[i][j]; cin >> er >> ec; for (int rr = 1; rr
2018.01.11 -
[백준 1748번] 수 이어 쓰기 1
소스코드12345678910111213141516171819202122232425#include using namespace std; int main() { int n, tmp,len=0, result=0; cin >> n; tmp = n; while (tmp > 0) { tmp /= 10; len++; } for (int i = 1; i
2018.01.11 -
[백준 9322번] 철벽 보안 알고리즘
소스코드123456789101112131415161718192021222324252627282930#include #include using namespace std; int main() { int tc; cin >> tc; while (tc--) { int n, idx[1001]; string word[3][1001]; cin >> n; for (int j = 0; j word[j][i]; } } for (int i = 0; i
2018.01.11 -
[백준 2783번] 삼각 김밥
소스코드123456789101112131415161718#include using namespace std; int main() { double Min,x, y; int i, n; cin >> x >> y >> n; Min = x / y * 1000; for (i = 0; i > xx >> yy; if (Min >= (xx / yy) * 1000) { Min = xx / yy * 1000; } } cout.setf(ios::fixed); cout.precision(2); cout
2018.01.11 -
[백준 4153번] 직각삼각형
소스코드123456789101112131415#include using namespace std; int main() { while (1) { int a, b, c; cin >> a >> b >> c; if (!a && !b && !c) { break; } if (b*b + c*c == a*a || a*a + c*c ==b*b || b*b + a*a==c*c) cout
2018.01.11 -
[백준 5533번] 유니크
소스코드1234567891011121314151617181920#include using namespace std; int n,i,j,k, c[201][3], score[201]; int main() { cin >> n; for (i = 0; i > c[i][0] >> c[i][1] >> c[i][2]; } for (i = 0; i
2018.01.11