freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-194-coloured-configurations.en.md

---
id: 5900f42f1000cf542c50ff40
challengeType: 5
title: 'Problem 194: Coloured Configurations'
---

## Description
<section id='description'>
Consider graphs built with the units A: 
and B: , where the units are glued along
the vertical edges as in the graph .

A configuration of type (a,b,c) is a graph thus built of a units A and b units B, where the graph's vertices are coloured using up to c colours, so that no two adjacent vertices have the same colour.
The compound graph above is an example of a configuration of type (2,2,6), in fact of type (2,2,c) for all c ≥ 4.

Let N(a,b,c) be the number of configurations of type (a,b,c).
For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.

Find the last 8 digits of N(25,75,1984).
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
- text: <code>euler194()</code> should return 61190912.
  testString: 'assert.strictEqual(euler194(), 61190912, ''<code>euler194()</code> should return 61190912.'');'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler194() {
  // Good luck!
  return true;
}

euler194();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>