๋ฐ์ํ
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 | 31 |
Tags
- ์ดํญ๊ณ์
- ๋ชจ๋ฐ์ผ์ฑํ๋ก๊ทธ๋๋ฐ
- ์น๊ฐ๋ฐ๊ธฐ๋ก
- ์๊ณ ๋ฆฌ์ฆ
- ๋ฐฑ์๋
- ์๋ฃ๊ตฌ์กฐ
- ์คํ๋ง
- ์ฝ๋ฉํ ์คํธ
- ๋จ์ํ ์คํธ
- ๋ฐฑ์ค
- SSE
- ๋ฆฌ์กํธ
- spring
- ๊ทธ๋ฆฌ๋์๊ณ ๋ฆฌ์ฆ
- ๋ฐฑ์คํ์ด
- ๋ฆฌ์กํธ๋ค์ดํฐ๋ธ
- ์ฐ์ ์์ํ
- boj11653
- ChatGPT
- ์ฝ๋ฉ
- ๋ฐฑ์ค1436
- ์ปด๊ณต์
- ๊ฐ๋ฐ์
- ์ปดํจํฐ๊ณตํ
- ํ์ด์ฌ
- ์น๊ฐ๋ฐ
- ํ๋ก๊ทธ๋๋ฐ
- ์ปด๊ณต
- ํ๋ก ํธ์ค๋
- ๊ทธ๋ฆฌ๋
Archives
- Today
- Total
๐ป๐ญ๐ง๐
[C][์๋ฃ๊ตฌ์กฐ] ์ํ ๋ณธ๋ฌธ
๋ฐ์ํ
6C2๋ฅผ ์๋ก ๋ค์ด์ ์ฝ๋ฉํจ!
์ํ ์ด์ฉ
#include <stdio.h>
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 <stdio.h>
int factorial (int n)
{
int result = 1;
for (int i=1; i<=n; i++)
{
result*=i;
}
return result;
}
int main()
{
printf("%d\n",factorial(6)/(factorial(2)*factorial(4)));
return 0;
}
๊ทผ๋ฐ ๋ฐ๋ณต์ ์ด์ฉํ๋๊ฒ ์ด๋ ๊ฒ ํ๋ผ๋๊ฒ ๋ง๋์ง ์ ๋ชจ๋ฅด๊ฒ ๋ค
๋ฐ์ํ
'C์ธ์ด > ์๋ฃ๊ตฌ์กฐ' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[C][์๋ฃ๊ตฌ์กฐ] 5.2 ํ ์์ฉ ํ๋ก๊ทธ๋จ (0) | 2022.01.19 |
---|