HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Data Structures > problem:


50306 - Beautiful Numbers

Guest
• Review clarifications (1)

Volume problems

• 50367 - Bar Codes
• 50386 - Conformity
• 50711 - Snail Trails
• 50472 - Minimum Sum Triangle
• 50842 - Minimum Sum Triangle - DP
• 50549 - k-Nearest Neighbours (kNN)
• 50676 - Cinema Millennium
• 50678 - The Jumping Rabbit
• 50306 - Beautiful Numbers
• 50700 - Candidates for the Mayor
• 50692 - How much money?
• 50790 - Fire Alarm
• 50710 - Permutations
• 50709 - k-ary Strings
• 50708 - Binary Strings
• 50694 - The Cheapest Flight
• 50996 - Checkers - the shortest path

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Geri Gokaj.

Beautiful Numbers

John really likes the numbers 3 and 7. So Maria made him a gift for his birthday. She gave him an integer N which is made up of only 3’s and or 7’s.
John was really touched by this beautiful gift and wanted to know how much Maria kept searching for this number. You will be given a number N (a beautiful number) and than you will find the how many’th beautiful number it is. A beautiful number is considered a number to have either 3 or 7 or both in it.

Input specification
An integer number N(beautiful number) where N is smaller than 4x108

Output specification
An integer that represents the order of the beautiful number.

Sample Input I
3
Sample Input II
7
Sample Input III
373
Sample Output I
1
Sample Output II
2
Sample Output III
9


Output Explanation:
Number 373 is the 9th beautiful number in ascending order
Previous beautiful numbers are 3,7,33,37,73,77,333,337

Äëÿ îòïðàâêè ðåøåíèé íåîáõîäèìî âûïîëíèòü âõîä.

www.contester.ru