Cod sursa(job #1413003)
Utilizator | Data | 1 aprilie 2015 18:01:06 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int n,k,i,x,ap[2000000],nr;
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1; i<=n; i++)
{
scanf("%d",&x);
ap[x]++;
}
for(i=0; i<=2000000; i++)
if(ap[i]>1)nr++;
if(nr==0 && n==k)printf("1");
else if(nr==0)printf("%d",(n-1)*(k-1));
else printf("%d",n-k+1);
return 0;
}