Problem 879

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
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.

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


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Post Reply
aarora09
Posts: 2
Joined: Wed May 15, 2024 6:29 pm

Problem 879

Post by aarora09 »

I would like to start by expressing my sincere appreciation for the work that all of you do to maintain Project Euler. I have greatly enjoyed solving some of these problems over the last decade.

This is my first post, and it is quite likely that I am missing something simple here. The problem states that there are 389,488 passwords that are valid on a 3 x 3 grid. I don't understand this; isn't the upper bound for the number of passwords 9! = 362,880?

Thank you for your help.
mdean
Posts: 206
Joined: Tue Aug 02, 2011 2:05 am

Re: Problem 879

Post by mdean »

I imagine that would be true if all passwords were 9 digits in length.
Image
aarora09
Posts: 2
Joined: Wed May 15, 2024 6:29 pm

Re: Problem 879

Post by aarora09 »

You're right; that's exactly what I was missing. Thank you for the quick reply.
User avatar
neverforget
Posts: 88
Joined: Sat Sep 16, 2006 10:10 pm

Re: Problem 879

Post by neverforget »

Problem 879 (View Problem)

(adding problem link missing from first post)
Image
User avatar
timday
Posts: 43
Joined: Tue Oct 12, 2010 11:25 pm

Re: Problem 879

Post by timday »

Is it possible to enter e.g 1-to-6 or 1-to-8 - passing over no intermediate spots - in this interface? Or is it limited to horizontal, vertical and 45-degree diagonal strokes?

(I've seen people using this style of "password" to unlock their phones but I've never tried it myself.)

I imagine reproducing the given 3x3 result will clarify this for me, of course!
Image
User avatar
RobertStanforth
Administrator
Posts: 2666
Joined: Mon Dec 30, 2013 11:25 pm

Re: Problem 879

Post by RobertStanforth »

timday wrote: Tue Jul 09, 2024 2:43 pm Is it possible to enter e.g 1-to-6 or 1-to-8 - passing over no intermediate spots - in this interface? Or is it limited to horizontal, vertical and 45-degree diagonal strokes?
Yes, straight line segments are permitted in any direction.
Post Reply