목록백준/백준-C++ (193)
VioletaBabel
소수 모든 자연수는 소수의 곱으로 나타낼 수 있다.x = 2^j0 * 3^j1 * 5^j2 * 7^j3 * 11^j4 * 13^j5 * 17^j6 … --소수의 가분성(divisibility) x = 2^j0 * 3^j1 * 5^j2 * 7^j3 * 11^j4 * 13^j5 * 17^j6 …y = 2^k0 * 3^k1 * 5^k2 * 7^k3 * 11^k4 * 13^k5 * 17^k6 … gcd = greatest common divisor = 최대공약수gcd(x,y) = 2^min(j0,k0) * 3^min(j1,k1) * 5^min(j2,k2) ... lcm = least common multiple = 최소공배수lcm(x,y) = 2^max(j0,k0) * 3^max(j1,k1) * 5^max(j2..
1234567891011#include int main(){ long long int n[100]; int t, i; n[0] = n[1] = n[2] = 1; for (int i = 3; i
123456789101112131415161718192021#include int main(){ int tri[44], t, k; bool next = 1; for (int i = 1; i
12345678910111213141516#include int main(){ int w, h, p, q, t, dx=1, dy=1; scanf("%d %d %d %d %d", &w, &h, &p, &q, &t); while (t--) { if (p == w || p == 0) dx *= (-1); if (q == h || q == 0) dy *= (-1); p += dx; q += dy; } printf("%d %d", p, q);}Colored by Color Scriptercs
123456789101112131415161718#include#includeint main(){ char a[101]; scanf("%s", &a); int ans = 0; for(int i = 0; a[i] != '\0'; ++i) switch (a[i]) { case 'a': case 'e': case 'i': case 'o': case 'u': ++ans; break; } printf("%d", ans);}Colored by Color Scriptercs
123456789101112131415#include#includeint main(){ char a[101]; scanf("%s", &a); int b = 1; for (int l = 0, r = strlen(a) - 1; l
12345678910111213#includeint main(){ int n, k, up=1; scanf("%d %d", &n, &k); for (int i = n; i > 1; --i) up *= i; for (int i = k; i > 1; --i) up /= i; for (int i = (n - k); i > 1; --i) up /= i; printf("%d", up);}Colored by Color Scriptercs
1234567891011121314151617181920212223#includeint main(){ int n, k; char s[100][101]; scanf("%d", &n); for (int i = 0; i
12345678910111213141516#includeint main(){ int n; scanf("%d", &n); for (int i = 2; i