int
modify_damage( int dam, object enemy, string type )
{
int res = enemy->query_prop(type);

dam = dam - res*dam/100;
return dam;
}

// ta kurwa funkcja usuwa nam z tablicy jeden pierdolony element duplikat:P

string *
delete( string str, string *tab )
{

int i;
int index=0;
string *tmp = ({});
    for ( i = 0; i < sizeof(tab); i++ )
	if ( tab[i] == str && !index)
	    index=i;
    
    for ( i = 0; i < sizeof(tab); i++ )
	if ( i != index )
    	    tmp+=({tab[i]});

return tmp; 
}


int
ile( string *tab, string str )
{
int i;
int num=0;
    for ( i = 0; i < sizeof(tab); i++ )
	if (tab[i]==str)
	    num++;
	    
return num;
}


int
check_resource( object kto, string *skladniki )
{
int i,j;
int heap=0;
string *temp=({});
object *sr=({});
object *inv = all_inventory(kto);

    for ( i = 0; i < sizeof(inv); i++ )
	{
	
	for ( j = 0; j < sizeof(skladniki); j++ )
	    if (lower_case(inv[i]->short(kto,PL_MIA)) == lower_case(skladniki[j]) ||
		lower_case(inv[i]->query_nazwa_ziola(PL_MIA)) == lower_case(skladniki[j]) ||
		lower_case(inv[i]->query_nazwa(PL_MIA)) == lower_case(skladniki[j]))
		{
		
		if (inv[i]->query_prop(HEAP_I_IS))
			{
			inv[i]->set_heap_size(inv[i]->num_heap()-
			    ile(skladniki,skladniki[j]));
			    skladniki-=({skladniki[j]});
			} else {
		    	    skladniki=delete(skladniki[j],skladniki);
			    sr+=({inv[i]});
			}
		}
		
	}
				
    if (!sizeof(skladniki))	
	{
	for ( i = 0; i < sizeof(sr); i++ )
	    {
	    if (!sr[i]->query_prop(HEAP_I_IS))
		sr[i]->remove_object();
	    else
		sr[i]->set_heap_size(sr[i]->num_heap());
	    }
	return 1;
	}
		
	return 0;


}