Pagini recente » Cod sursa (job #703776) | Cod sursa (job #1295828) | Cod sursa (job #1624637) | Cod sursa (job #1639296) | Cod sursa (job #2020919)
#include <cstdio>
#include <algorithm>
using namespace std;
long long dp[2][140000];
#define dp[0] (dp[0] + 70000)
#define dp[1] (dp[1] + 70000)
int main ()
{
freopen ("1-sir.in", "r", stdin);
freopen ("1-sir.out", "w", stdout);
int n, s;
scanf ("%d %d", &n, &s);
if (s > n * (n + 1) / 2 || s < -n * (n + 1) / 2)
{
printf ("0\n");
return 0;
}
for (int i = 1; i <= n; ++i)
for
return 0;
}