Comparar texto

Encontre a diferença entre dois arquivos de texto

Diff em tempo real

Diff unificado

Recolher linhas

Destacar alterações

Realce de sintaxe

Ferramentas

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Untitled diff

Created 10 years agoDiff never expires

Linhas
Total
Removido

Palavras
Total
Removido

Para continuar usando este recurso, atualize para Diffchecker Pro Ver preços

47 linhas

Linhas
Total
Adicionado

Palavras
Total
Adicionado

Para continuar usando este recurso, atualize para Diffchecker Pro Ver preços

55 linhas

DP_TABLE_ENTRY CC(int amt,unsigned int denom_count)

DP_TABLE_ENTRY DP_CC(int amt,unsigned int denom_count)

{

unsigned int n = denom_count;

DP_TABLE_ENTRY ret = {0};

/* Calls with a negative amount are not stored.

* Just need to return count= 0.

if(amt <0)

{

ret.runtime = 1; /* constant runtime */

ret.count = 0;

}

/* Precomputed value, just need to update number of references

* to this value.

else if(DP_TABLE[amt][n].references != 0)

{

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

return DP_TABLE[amt][n];

}

else if(n==0)

{

DP_TABLE[amt][n].count = 0;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

ret = DP_TABLE[amt][n];

}

else if(amt == 0 )

{

DP_TABLE[amt][n].count = 1;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

ret = DP_TABLE[amt][n];

}

else

{

DP_TABLE_ENTRY left,right = {0};

int new_amt = amt- maxDenom(n);

int new_n = n-1;

left = CC(amt,new_n);

left = DP_CC(amt,new_n);

right = CC(new_amt,n);

right = DP_CC(new_amt,n);

DP_TABLE[amt][n].count = left.count + right.count;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */

ret = DP_TABLE[amt][n];

}

return ret;

}

Diferenças salvas

Texto original

Abrir arquivo

DP_TABLE_ENTRY  CC(int amt,unsigned int denom_count)
{
	unsigned int n = denom_count;
	DP_TABLE_ENTRY ret = {0};
	
	/* Calls with a negative amount are not stored.
         * Just need to return count= 0.
         */    
	if(amt <0) 
	{
		ret.runtime = 1; /* constant runtime */
		ret.count = 0;
	}

else if(n==0) 
	{
		DP_TABLE[amt][n].count = 0;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}
	else if(amt == 0 ) 
	{
		DP_TABLE[amt][n].count = 1;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}

else
	{
		DP_TABLE_ENTRY left,right = {0};
		int new_amt = amt- maxDenom(n);
		int 	     new_n   = n-1;

left = 	CC(amt,new_n);
		right = CC(new_amt,n);
		DP_TABLE[amt][n].count = left.count + right.count; 
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */
		
		ret = DP_TABLE[amt][n];
	}

return ret;
}

Texto alterado

Abrir arquivo

DP_TABLE_ENTRY  DP_CC(int amt,unsigned int denom_count)
{
	unsigned int n = denom_count;
	DP_TABLE_ENTRY ret = {0};
	
	/* Calls with a negative amount are not stored.
         * Just need to return count= 0.
         */    
	if(amt <0) 
	{
		ret.runtime = 1; /* constant runtime */
		ret.count = 0;
	}

/* Precomputed value, just need to update number of references
         * to this value.
         */  
	else if(DP_TABLE[amt][n].references != 0) 
	{
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		return DP_TABLE[amt][n];
	}
	else if(n==0) 
	{
		DP_TABLE[amt][n].count = 0;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}
	else if(amt == 0 ) 
	{
		DP_TABLE[amt][n].count = 1;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}

else
	{
		DP_TABLE_ENTRY left,right = {0};
		int new_amt = amt- maxDenom(n);
		int 	     new_n   = n-1;

left = 	DP_CC(amt,new_n);
		right = DP_CC(new_amt,n);
		DP_TABLE[amt][n].count = left.count + right.count; 
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */
		
		ret = DP_TABLE[amt][n];
	}

return ret;
}