Pagini recente » Cod sursa (job #3256421) | Cod sursa (job #2671094) | Cod sursa (job #268620) | Cod sursa (job #2518513) | Cod sursa (job #1413006)
# include <cstdio>
# define MAX 5005
# define mod 2000003
using namespace std;
int n,k,nrsol,i,z,j,nr1,nr2;
int a[MAX];
int main ()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d\n",&n, &k);
for (i = 1; i <= n; i++)
scanf("%d ",&a[i]);
if (k == n) printf("%d",1);
if (k == n-1) printf("%d",k-1);
/*
k--;
z = n % k;
if (z == 0) z = k;
for (i = 1; i < n; i++)
for (j = 1; j <= i && j <= z; j++)
a[j] = (a[j-1] + a[j]) % mod;
printf("%d",a[z]);
*/
return 0;
}