Gunakan fungsi format() untuk menambahkan nol ke float setelah desimal, mis. g. result = format(my_float, '.3f'). Fungsi akan memformat angka dengan tepat N digit setelah titik desimal
Kami menggunakan fungsi untuk menambahkan nol ke float setelah desimal
Fungsi mengambil nilai dan penentu format dan mengonversi nilai menjadi representasi yang diformat sesuai dengan penentu format yang disediakan
Jenis f_ dalam penentu format adalah singkatan dari notasi titik tetap
Perhatikan bahwa nilai yang dikembalikan fungsi format()_ adalah string
Ini diperlukan karena Python tidak menyimpan angka nol yang tidak signifikan
Pendekatan alternatif adalah dengan menggunakan literal string yang diformat
Literal string terformat (f-string) mari kita sertakan ekspresi di dalam string dengan mengawali string dengan f
Dalam tutorial ini, kita akan belajar cara menemukan angka yang faktorialnya diakhiri dengan 'n' nol dengan Python. Tapi pertama-tama, kita perlu memahami bagaimana kita menerapkan logika kita dan menemukan daftar angka yang faktorialnya diakhiri dengan 'n' nol. Pertama-tama kita harus membuat fungsi yang menemukan jumlah angka nol di belakang yang ada dalam faktorial dari angka yang ditentukan. Selanjutnya, kita perlu mencari nomor secara efisien dari seluruh rentang numerik yang memenuhi kriteria dan menambahkannya ke daftar. Pada akhirnya, kita hanya perlu mencetak daftarnya
Program python untuk menemukan angka yang faktorialnya diakhiri dengan 'n' nol
list=[]; def count(n): c=0 while (n>0): n =int(n/5); c=c+n; return c; def search( n ): f=0; l=1e6; while (f<l): mid=int((f+l)/2); no=count(mid); if (no < n): f=mid+1; else: l=mid; while (count(f)==n): list.append(f); f=f+1; for i in range(len(list)): print(list[i]," ") num=input("Enter the number of trailing zeros:"); n=int(num); search(n);Dalam program ini, fungsi 'count()_' mengembalikan jumlah nol tertinggal yang ada dalam faktorial angka tertentu. Fungsi ‘search()_‘ adalah tempat kami menerapkan algoritma pencarian biner untuk secara efisien menemukan angka yang memenuhi kriteria. Ketika angka memenuhi syarat, kami menambahkan angka yang sama dalam daftar. Di akhir fungsi, kami mencetak daftar yang menampilkan semua angka yang faktorialnya memiliki 'n' nol
Program Python untuk Menghitung angka nol di belakang dalam faktorial sebuah angka
Meningkatkan Artikel
Simpan Artikel
Seperti Artikel
- Tingkat Kesulitan. Sedang
- Terakhir Diperbarui. 06 Des 2022
Meningkatkan Artikel
Simpan Artikel
Diberi bilangan bulat n, tulis fungsi yang mengembalikan hitungan nol di belakang dalam n.
Contoh
Input: n = 5 Output: 1 Factorial of 5 is 120 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....Metode 1
Python3
# Python3 program to
# count trailing 0s
# in n !
# Function to return
# trailing 0s in
# factorial of n
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....0 Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....1
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....3
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....5Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....7
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....9
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Count of trailing 0s in 100 ! is 241
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Count of trailing 0s in 100 ! is 243
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Count of trailing 0s in 100 ! is 245Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Count of trailing 0s in 100 ! is 247
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2Count of trailing 0s in 100 ! is 249 Count of trailing 0s in 100 ! is 240Count of trailing 0s in 100 ! is 241 Count of trailing 0s in 100 ! is 242Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Count of trailing 0s in 100 ! is 244Count of trailing 0s in 100 ! is 245
Count of trailing 0s in 100 ! is 246Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....5Count of trailing 0s in 100 ! is 248Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # Python3 program to0Count of trailing 0s in 100 ! is 240Count of trailing 0s in 100 ! is 241 # Python3 program to3
Count of trailing 0s in 100 ! is 246Count of trailing 0s in 100 ! is 245# Python3 program to6Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Count of trailing 0s in 100 ! is 247
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# count trailing 0s0 # Python3 program to0# count trailing 0s2
# count trailing 0s3
# count trailing 0s4Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # count trailing 0s6
# count trailing 0s7# count trailing 0s8# count trailing 0s9 Count of trailing 0s in 100 ! is 248
# in n !1# in n !2# in n !3
Keluaran. Count of trailing 0s in 100 ! is 24
Kompleksitas Waktu. O(log5n)
Ruang Bantu. O(1)
Silakan merujuk artikel lengkap tentang Menghitung angka nol di belakang dalam faktorial angka untuk detail lebih lanjut
Metode 2. Menggunakan matematika. faktorial() dan untuk loop
Python3
# Python3 program to
# count trailing 0s
# in n !
# Function to return
# trailing 0s in
# factorial of n
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....0 Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....1
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# Function to return3 # Function to return4
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# Function to return6Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....7
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# trailing 0s in0Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # trailing 0s in2
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# trailing 0s in4Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # trailing 0s in6# trailing 0s in7
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# trailing 0s in9Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # factorial of n1# factorial of n2Count of trailing 0s in 100 ! is 244# factorial of n4
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# factorial of n6 Count of trailing 0s in 100 ! is 245# factorial of n8 # factorial of n9
Count of trailing 0s in 100 ! is 246Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....01Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....02Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....04Count of trailing 0s in 100 ! is 245
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....06Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....07
Count of trailing 0s in 100 ! is 246Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....09Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....10
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....06# Function to return6Count of trailing 0s in 100 ! is 248Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 Count of trailing 0s in 100 ! is 244
Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....2# count trailing 0s0 # Function to return6
# count trailing 0s3
# count trailing 0s4Trailing 0s in n! = Count of 5s in prime factors of n! = floor(n/5) + floor(n/25) + floor(n/125) + ....6 # count trailing 0s6
# count trailing 0s7# count trailing 0s8# count trailing 0s9 Count of trailing 0s in 100 ! is 248
# in n !1# in n !2# in n !3
KeluaranCount of trailing 0s in 100 ! is 24
Catatan Pribadi Saya arrow_drop_up
Menyimpan