OJ Board

Code: Select all

This is my code !!!

#include<iostream.h>
#include<stdio.h>

long ans[100][6];  
int a[6]; 
double r; 

int i,n,k,j; 
long m; 
void findans()
{
long s; 
 
a[1]=1;a[2]=5;a[3]=10;a[4]=25;a[5]=50; 
for (i=1;i<6;i++) 
  for (j=1;j<100;j++)
  {
    if (j<a[i])
		ans[j][i]=0;
	else
	{
     if(j==a[i])
		 ans[j][i]=1;
	 else 
	 { 
       s=0; 
       for( k=1 ;k<=i;k++)
		   s=s+ans[j-a[i]][k]; 
       ans[j][i]=s; 
	 }
	}
  }
}
int main()
{
   
  findans(); 
  while (cin>>n)
  {
    m=0; 
    for(i=1;i<6;i++)
		m=m+ans[n][i];
	if(m!=1)
		cout<<"There are "<<m<<" ways to produce "<<n<<" cents change.\n";
    else
	cout<<"There is only 1 way to produce "<<n<<" cents change.\n";
    
  }
  return 0;
} 
[color=red][/color][color=#444444][/color]

Code: Select all

#include<stdio.h>


int coin[10]={0,1,5,10,25,50};
long long int ways[30005][7];

void main()
{

	int N,i,j;
	for(i=1;i<=30000;i++) ways[i][0]=0;
	for(i=1;i<=5;i++) ways[0][i]=1;
	
	for(i=1;i<=30000;i++)
	{
		for(j=1;j<=5;j++)
		{
			if((i-coin[j])<0)
				ways[i][j]=ways[i][j-1];
			else 
				ways[i][j]=ways[i][j-1]+ways[i-coin[j]][j];
		}		
	}

	while(scanf("%d",&N)==1)
	{
		if(N==0)
		{
			printf("There are 0 way to produce 0 cents change.\n");
			continue;
		}
		
		if(ways[N][5]==1) printf("There is only 1 way to produce %d cents change.\n",N);
		else printf("There are %lld ways to produce %d cents change.\n",ways[N][5],N);	
	}
}