{"id":18700991,"url":"https://github.com/rabestro/interview-algorithms-kolin-task-01","last_synced_at":"2025-08-07T15:32:32.576Z","repository":{"id":105045463,"uuid":"560872633","full_name":"rabestro/interview-algorithms-kolin-task-01","owner":"rabestro","description":"small task for the interview","archived":false,"fork":false,"pushed_at":"2022-11-04T12:57:53.000Z","size":61,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-12-28T05:25:33.845Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Kotlin","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rabestro.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-11-02T13:08:07.000Z","updated_at":"2022-11-02T13:08:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"f9d18871-ecd5-4b53-9587-595b685003e2","html_url":"https://github.com/rabestro/interview-algorithms-kolin-task-01","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rabestro%2Finterview-algorithms-kolin-task-01","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rabestro%2Finterview-algorithms-kolin-task-01/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rabestro%2Finterview-algorithms-kolin-task-01/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rabestro%2Finterview-algorithms-kolin-task-01/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rabestro","download_url":"https://codeload.github.com/rabestro/interview-algorithms-kolin-task-01/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239565650,"owners_count":19660154,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-07T11:40:10.022Z","updated_at":"2025-02-18T22:44:34.408Z","avatar_url":"https://github.com/rabestro.png","language":"Kotlin","funding_links":[],"categories":[],"sub_categories":[],"readme":"# The smallest value\n\nA user inputs a `long` positive number *m*. You need to find out what is the smallest int number *n* such that *n! \u003e m*.\n\n**n!**, or factorial n, is a product of all natural numbers from 1 to n inclusive: for example, 5! = 1 * 2 * 3 * 4 * 5.\n\nJust in case: [wiki on factorials](https://en.wikipedia.org/wiki/Factorial).\n\nFor example, the user enters 100. This means m = 100 and n = 5 because 5! = 120 (see the factorial formula) and this is the smallest number that satisfies the condition n! \u003e m.\n\nPay attention that the user may input a really big number so choose an appropriate data type!","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frabestro%2Finterview-algorithms-kolin-task-01","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frabestro%2Finterview-algorithms-kolin-task-01","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frabestro%2Finterview-algorithms-kolin-task-01/lists"}