소스코드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

소스코드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

소스코드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

소스코드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

소스코드123456789101112131415161718192021222324252627282930313233#include using namespace std; int n, num[101], result=0;long long dp[101][1001]; long long cal(int idx, int sum) { if (sum 20) { return 0; } if (idx == n - 1) { if (sum == num[n - 1]) dp[idx][sum] = 1; else dp[idx][sum] = 0; return dp[idx][sum]; } if (dp[idx][sum] != -1) { return dp[idx][sum]; } long long ret = 0; ret += cal(idx + 1, s..

소스코드12345678910#include using namespace std; int main() { int i, n, num[101] = {0}; cin >> n; for (i = 1; i > num[i]; num[i] *= i; } for (i = 1; i