Cod sursa(job #2283594)
Utilizator | Data | 15 noiembrie 2018 17:52:22 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define mod 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,k,i,j,x,y;
int dp[2][33000];
int main()
{
f>>n>>k;
dp[1][0]=1;
x=1;
y=0;
for(i=2;i<=n;i++)
{
x=1-x;
y=1-y;
for(j=0;j<=i*(i+1)/2;j++)
{
dp[x][j]=(dp[y][abs(j-i+1)]+dp[y][j+i-1])%mod;
}
}
g<<dp[x][k]<<'\n';
return 0;
}