๋ฐ์ํ
Notice
Recent Posts
Recent Comments
Link
| ์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |
Tags
- ๋ฐฑ์ค
- ์น๊ฐ๋ฐ๊ธฐ๋ก
- boj11653
- ์ฐ์ ์์ํ
- ์ปด๊ณต
- ๋ชจ๋ฐ์ผ์ฑํ๋ก๊ทธ๋๋ฐ
- ๊ฐ๋ฐ์
- ์ปด๊ณต์
- ์ฝ๋ฉ
- ๋ฐฑ์คํ์ด
- ๋ฆฌ์กํธ๋ค์ดํฐ๋ธ
- ์ดํญ๊ณ์
- spring
- ๊ทธ๋ฆฌ๋์๊ณ ๋ฆฌ์ฆ
- ์น๊ฐ๋ฐ
- ChatGPT
- ๋ฆฌ์กํธ
- ๋ฐฑ์ค1436
- ๋ฐฑ์๋
- ์คํ๋ง
- ๊ทธ๋ฆฌ๋
- ์๋ฃ๊ตฌ์กฐ
- ์๊ณ ๋ฆฌ์ฆ
- ๋จ์ํ ์คํธ
- ์ฝ๋ฉํ ์คํธ
- ํ๋ก๊ทธ๋๋ฐ
- ํ์ด์ฌ
- ํ๋ก ํธ์ค๋
- ์ปดํจํฐ๊ณตํ
- SSE
Archives
- Today
- Total
๋ชฉ๋ก์ดํญ๊ณ์ (1)
๐ป๐ญ๐ง๐
[C][์๋ฃ๊ตฌ์กฐ] ์ํ
6C2๋ฅผ ์๋ก ๋ค์ด์ ์ฝ๋ฉํจ! ์ํ ์ด์ฉ #include int binomial (int n, int k) { if(k==0 || k==n) return 1; else return (binomial(n-1,k)+binomial(n-1, k-1)); } int main() { printf("%d\n",binomial(6, 2)); return 0; } ๋ฐ๋ณต ์ด์ฉ #include int factorial (int n) { int result = 1; for (int i=1; i
C์ธ์ด/์๋ฃ๊ตฌ์กฐ
2022. 1. 5. 13:38