Pagini recente » Cod sursa (job #3032059) | Cod sursa (job #2883690) | Cod sursa (job #2213714) | Cod sursa (job #1418128) | Cod sursa (job #2670924)
#include <iostream>
#include <fstream>
const int MOD=194767;
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
int C[270][270];
int sir(int n, int k)
{
if(k<0) k*=-1;
if(k%2!=n%2 || k>n) return 0;
if(k==n) return 1;
k+=n/2;
C[0][1]=1;
for(int i=1; i<=n; i++)
{
C[i][0]=C[i][i]=1;
for(int j=1; j<i; j++) C[i][j]=C[i-1][j]+C[i-1][j-1];
}
return C[n][k];
}
int main()
{
int n, sum;
in>>n>>sum;
out<<sir(5, 1);
return 0;
}