JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c/100|0

Try it online!

I figure there has to be at least one JS answer to an Arnauld challenge.

The concept here is mainly to use the number of distinct elements as a lookup key:

• 1 unique => 4 of a kind
• 2 unique => 2 pair or 3 of a kind
• 3 unique => 1 pair
• 4 unique => nothing

In order to distinguish between 2 pair and 3 of a kind, the input array is sorted and the middle 2 elements are compared.

JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c*.01|0

Try it online!

I figured there had to be at least one JavaScript answer to an Arnauld challenge!

The concept here is mainly to use the number of distinct elements as a lookup key.

• 1 unique => 4 of a kind
• 2 unique => 2 pair or 3 of a kind
• 3 unique => 1 pair
• 4 unique => no matches

In order to distinguish between 2 pair and 3 of a kind, the input array is sorted and the middle 2 elements are compared.

JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c/100|0

Try it online!

I figure there has to be at least one JS answer to an Arnauld challenge.

JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c/100|0

Try it online!

I figure there has to be at least one JS answer to an Arnauld challenge.

The concept here is mainly to use the number of distinct elements as a lookup key:

• 1 unique => 4 of a kind
• 2 unique => 2 pair or 3 of a kind
• 3 unique => 1 pair
• 4 unique => nothing

In order to distinguish between 2 pair and 3 of a kind, the input array is sorted and the middle 2 elements are compared.

JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c/100|0

Try it online!

I am certain that this is golfable, but there has to be at least one JS answer to an Arnauld challenge.

JavaScript (Node.js), 64 bytes

c=>a=>[,7.77,a.sort()[1]-a[2]?2:3,1,.1][new Set(a).size]+c/100|0

Try it online!

I figure there has to be at least one JS answer to an Arnauld challenge.