Pagini recente » Cod sursa (job #1622628) | Cod sursa (job #852282) | Cod sursa (job #2336783) | Cod sursa (job #2865206) | Cod sursa (job #3186758)
#include <fstream>
using namespace std;
ifstream cin ("1-sir.in");
ofstream cout ("1-sir.out");
const int mod = 194767;
int modalitati[2][32896];
int main ()
{
int lungime , suma;
cin >> lungime >> suma;
if (!(-((lungime * (lungime - 1)) >> 1) <= suma && suma <= ((lungime * (lungime - 1)) >> 1)))
{ cout << '0'; }
else
{
modalitati[0][0] = 1;
for (int lungime_actuala = 2 , limita = 1 ; lungime_actuala <= lungime ; limita += lungime_actuala++)
{
for (int suma = 0 ; suma <= limita ; suma++) {
if ((modalitati[1][suma] = modalitati[0][lungime_actuala - 1 <= suma ? suma - lungime_actuala + 1 : -(suma - lungime_actuala + 1)] + modalitati[0][suma + lungime_actuala - 1]) >= mod)
{ modalitati[1][suma] -= mod; }
}
swap(modalitati[0] , modalitati[1]);
}
cout << modalitati[0][(suma < 0 ? -suma : suma)];
}
cout.close(); cin.close();
return 0;
}