## Problem:

A row of five black square tiles is to have a number of its tiles replaced with coloured oblong tiles chosen from red (length two), green (length three), or blue (length four).

If red tiles are chosen there are exactly seven ways this can be done.

If green tiles are chosen there are three ways.

And if blue tiles are chosen there are two ways.

Assuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length.

How many different ways can the black tiles in a row measuring fifty units in length be replaced if colours cannot be mixed and at least one coloured tile must be used?

NOTE: This is related to problem 117.

1366

## Code:The solution may include methods that will be found here: Library.java .

public interface EulerSolution{public String run();}
/*  * Solution to Project Euler problem 16 * By Nayuki Minase *  * http://nayuki.eigenstate.org/page/project-euler-solutions * https://github.com/nayuki/Project-Euler-solutions */import java.math.BigInteger;public final class p016 implements EulerSolution {		public static void main(String[] args) {		System.out.println(new p016().run());	}			public String run() {		String temp = BigInteger.ONE.shiftLeft(1000).toString();		int sum = 0;		for (int i = 0; i < temp.length(); i++)			sum += temp.charAt(i) - '0';		return Integer.toString(sum);	}	}