Cod sursa(job #2281917)
Utilizator | Data | 12 noiembrie 2018 22:31:31 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define MOD 194767
using namespace std;
ifstream fin("1-sir.in") ;
ofstream fout("1-sir.out") ;
int dp[5][35000] ;
int modul(int x)
{
if ( x < 0 )
return -x;
return x;
}
int main()
{
int n , k , i , j , p , q ;
fin >> n >> k ;
dp[1][0] = 1 ;
p = 1 ;
q = 0 ;
for ( i = 2 ; i <= n ; i++ )
{
p = 1-p ;
q = 1-q ;
for ( j = 0 ; j <= i*(i+1)/2 ; j++ )
{
dp[p][j] = (dp[q][modul(j-i+1)] + dp[q][j+i-1] )% MOD ;
}
}
fout << dp[p][modul(k)] ;
}