给定一个数字N，任务是检查它是否有趣。 迷人的数字 ：当一个数字（3位或更多）乘以2和3，并且当这两个乘积与原始数字串联时，则会导致1到9之间的所有数字恰好出现一次。可以有任意数量的零，并且被忽略。 例如：
null
输入： 192 输出： 对 在与2和3相乘，并与原始数串联后，结果数为192384576，包含1到9之间的所有数字。 输入： 853 输出： 不 与2和3相乘，并与原始数串联后，结果数为85317062559。在这本书中，数字4缺失，数字5出现了多次。
方法 :
- 检查给定的数字是否有三位数或更多。如果没有，请打印“否”。
- 否则，将给定的数字乘以2和3。
- 将这些产品与给定的数字连接起来，形成一个字符串。
- 遍历这个字符串，保持数字的频率计数。
- 如果任何数字缺失或出现多次，请打印否。
- 否则，请打印“是”。
以下是上述方法的实施情况：
C++14
// C++ program to implement // fascinating number #include <bits/stdc++.h> using namespace std; // function to check if number // is fascinating or not bool isFascinating( int num) { // frequency count array // using 1 indexing int freq[10] = {0}; // obtaining the resultant number // using string concatenation string val = "" + to_string(num) + to_string(num * 2) + to_string(num * 3); // Traversing the string // character by character for ( int i = 0; i < val.length(); i++) { // gives integer value of // a character digit int digit = val[i] - '0' ; // To check if any digit has // appeared multiple times if (freq[digit] and digit != 0 > 0) return false ; else freq[digit]++; } // Traversing through freq array to // check if any digit was missing for ( int i = 1; i < 10; i++) { if (freq[i] == 0) return false ; } return true ; } // Driver code int main() { // Input number int num = 192; // Not a valid number if (num < 100) cout << "No" << endl; else { // Calling the function to // check if input number // is fascinating or not bool ans = isFascinating(num); if (ans) cout << "Yes" ; else cout << "No" ; } } // This code is contributed // by Subhadeep |
JAVA
// Java program to implement // fascinating number import java.io.*; import java.util.*; public class GFG { // function to check if number // is fascinating or not public static boolean isFascinating( int num) { // frequency count array //using 1 indexing int [] freq = new int [ 10 ]; // obtaining the resultant number // using string concatenation String val = "" + num + num * 2 + num * 3 ; // Traversing the string character //by character for ( int i = 0 ; i < val.length(); i++) { // gives integer value of //a character digit int digit = val.charAt(i) - '0' ; // To check if any digit has // appeared multiple times if (freq[digit]> 0 && digit != 0 ) return false ; else freq[digit]++; } // Traversing through freq array to // check if any digit was missing for ( int i = 1 ; i < freq.length; i++) { if (freq[i] == 0 ) return false ; } return true ; } // Driver code public static void main(String args[]) { // Input number int num = 192 ; // Not a valid number if (num < 100 ) System.out.println( "No" ); else { // Calling the function to check // if input number is fascinating or not boolean ans = isFascinating(num); if (ans) System.out.println( "Yes" ); else System.out.println( "No" ); } } } |
Python 3
# Python 3 program to implement # fascinating number # function to check if number # is fascinating or not def isFascinating(num) : # frequency count array # using 1 indexing freq = [ 0 ] * 10 # obtaining the resultant number # using string concatenation val = ( str (num) + str (num * 2 ) + str (num * 3 )) # Traversing the string # character by character for i in range ( len (val)) : # gives integer value of # a character digit digit = int (val[i]) # To check if any digit has # appeared multiple times if freq[digit] and digit ! = 0 > 0 : return False else : freq[digit] + = 1 # Traversing through freq array to # check if any digit was missing for i in range ( 1 , 10 ) : if freq[i] = = 0 : return False return True # Driver Code if __name__ = = "__main__" : # Input number num = 192 # Not a valid number if num < 100 : print ( "No" ) else : # Calling the function to # check if input number # is fascinating or not ans = isFascinating(num) if ans : print ( "Yes" ) else : print ( "No" ) # This code is contributed by ANKITRAI1 |
C#
// C# program to implement // fascinating number using System; class GFG { // function to check if number // is fascinating or not public static bool isFascinating( int num) { // frequency count array // using 1 indexing int [] freq = new int [10]; // obtaining the resultant number // using string concatenation String val = "" + num.ToString() + (num * 2).ToString() + (num * 3).ToString(); // Traversing the string // character by character for ( int i = 0; i < val.Length; i++) { // gives integer value of // a character digit int digit = val[i] - '0' ; // To check if any digit has // appeared multiple times if (freq[digit] && digit != 0 > 0 ) return false ; else freq[digit]++; } // Traversing through freq array to // check if any digit was missing for ( int i = 1; i < freq.Length; i++) { if (freq[i] == 0) return false ; } return true ; } // Driver code static void Main() { // Input number int num = 192; // Not a valid number if (num < 100) Console.WriteLine( "No" ); else { // Calling the function to check // if input number is fascinating or not bool ans = isFascinating(num); if (ans) Console.WriteLine( "Yes" ); else Console.WriteLine( "No" ); } } } // This code is contributed by mits |
PHP
<?php // PHP program to implement // fascinating number // function to check if number // is fascinating or not function isFascinating( $num ) { // frequency count array // using 1 indexing $freq = array_fill (0, 10, NULL); // obtaining the resultant number // using string concatenation $val = "" . $num . ( $num * 2). ( $num * 3); // Traversing the string // character by character for ( $i = 0; $i < strlen ( $val ); $i ++) { // gives integer value of // a character digit $digit = $val [ $i ] - '0' ; // To check if any digit has // appeared multiple times if ( $freq [ $digit ] > 0 && $digit != 0) return false; else $freq [ $digit ]++; } // Traversing through freq array to // check if any digit was missing for ( $i = 1; $i < 10; $i ++) { if ( $freq [ $i ] == 0) return false; } return true; } // Driver code // Input number $num = 192; // Not a valid number if ( $num < 100) echo "No" ; else { // Calling the function to // check if input number // is fascinating or not $ans = isFascinating( $num ); if ( $ans ) echo "Yes" ; else echo "No" ; } // This code is contributed // by ChitraNayal ?> |
Javascript
<script> // Javascript program to implement // fascinating number // function to check if number // is fascinating or not function isFascinating(num) { // frequency count array //using 1 indexing let freq = new Array(10); for (let i=0;i<freq.length;i++) { freq[i]=0; } // obtaining the resultant number // using string concatenation let val = "" + num + num * 2 + num * 3; // Traversing the string character //by character for (let i = 0; i < val.length; i++) { // gives integer value of //a character digit let digit = val[i].charCodeAt(0) - '0' .charCodeAt(0); // To check if any digit has // appeared multiple times if (freq[digit]>0 && digit != 0) return false ; else freq[digit]++; } // Traversing through freq array to // check if any digit was missing for (let i = 1; i < freq.length; i++) { if (freq[i] == 0) return false ; } return true ; } // Driver code // Input number let num = 192; // Not a valid number if (num < 100) document.write( "No" ); else { // Calling the function to check // if input number is fascinating or not let ans = isFascinating(num); if (ans) document.write( "Yes" ); else document.write( "No" ); } // This code is contributed by rag2127 </script> |
输出：
Yes
© 版权声明
文章版权归作者所有，未经允许请勿转载。
THE END
![关于”PostgreSQL错误：关系[表]不存在“问题的原因和解决方案-yiteyi-C++库](https://www.yiteyi.com/wp-content/themes/zibll/img/thumbnail.svg)
