QOJ.ac

QOJ

Time Limit: 0.5 s Memory Limit: 64 MB Total points: 100

#23685. Faktorial

Statistics

Diberikan sebuah bilangan bulat $n$ ($2 \le n \le 100000000$). Buatlah program untuk mencari bilangan bulat positif terkecil $m$ sedemikian sehingga faktorial dari $m$ habis dibagi oleh $n$. Di sini, untuk bilangan bulat positif $m$, faktorial dari $m$ adalah hasil kali semua bilangan bulat dari $1$ hingga $m$.

Masukan

Masukan diberikan dalam berkas factorial.in. Berkas ini terdiri dari satu baris yang berisi bilangan bulat $n$.

Keluaran

Program harus mengeluarkan hasilnya ke keluaran standar. Cetaklah satu baris yang hanya berisi bilangan bulat $m$.

Contoh

Masukan 1

10

Keluaran 1

5

Masukan 2

12

Keluaran 2

4

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.