WA in AE2A (DICE problem)

[tarun550_sof]

I am not able to know y my solution is giving a WA?
it seems to be fine.

#include<iostream>
#include<cstdio>
using namespace std;
double mymap[1001][1001];
double func(int k,int n)
{
	if(n>k)
	return 0;
	else if(k<=0 || n<=0)
	return 0;
	else if(n==1 && k<=6 && k>=1)
	return 1.0/6.0;
	else if(n==1 && k>6)
	return 0;
	else if(mymap[k][n]!=-1)
	return mymap[k][n];;
	double ans=0;
	for(int i=1;i<7;i++)
	{
		ans+=func(k-i,n-1);
			}
	ans=ans/6;		
	mymap[k][n]=ans;
	return ans;
}
int main()
{
	int t,n,k;
	scanf("%d",&t);
	for(int i=0;i<1001;i++)
	{
		for(int j=0;j<1001;j++)
		mymap[i][j]=-1;
	}
	while(t--)
	{
		scanf("%d %d",&n,&k);
		if(n>1000)
		cout<<0<<"\n";
		else
		cout<<int(func(k,n)*100)<<"\n";
	}
}

[leppyr64]

Haven't solved this problem myself, but would you need all permutations or just combinations?

For example 6 on 3 dice:
1 1 4
1 2 3
2 2 2

Are there three ways of throwing this total or ten?

I would also worry about using floating point numbers for this problem. Long long would likely suffice, but if it won't then double won't work either.