I am having an issue with the problem 769 link : https://projecteuler.net/problem=679
The value for f(n) when n = 15, as suggested in the problem statement is 72863 but the total number of words that I am getting is 73313 after performing the suggested operations like generating a word of length 15 form given 4 letters, eliminating the duplicates and confirming that the given keywords occur only once in the given word.
Problem 679
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
-
v6ph1
- Posts: 134
- Joined: Mon Aug 25, 2014 7:14 pm
-
DJohn
- Posts: 90
- Joined: Sat Oct 11, 2008 12:24 pm
Re: Problem 679
I don't know what you mean by "eliminating the duplicates". What duplicates?
If I
If I
- List all 15-letter words
- Count the number of occurrences of each keyword in each word, including overlapping occurrences as v6ph1 points out
- Delete the words that don't have exactly one occurrence of each keyword