codeforces.com
Open in
urlscan Pro
2606:4700:20::ac43:44fe
Public Scan
Submitted URL: http://codeforces.com/contest/935/problem/A
Effective URL: https://codeforces.com/contest/935/problem/A
Submission: On May 17 via manual from DE — Scanned from DE
Effective URL: https://codeforces.com/contest/935/problem/A
Submission: On May 17 via manual from DE — Scanned from DE
Form analysis
5 forms found in the DOMPOST /search
<form method="post" action="/search"><input type="hidden" name="csrf_token" value="761c8f36c976f782a2c621acb24ce4b9">
<input class="search" name="query" data-isplaceholder="true" value="">
<input type="hidden" name="_tta" value="421">
</form>
POST
<form action="" method="post"><input type="hidden" name="csrf_token" value="761c8f36c976f782a2c621acb24ce4b9">
<input type="hidden" name="action" value="registerForPractice">
<input type="submit" name="submit" value="Register for practice" style="padding:0 0.5em;">
<input type="hidden" name="_tta" value="421">
</form>
GET /contest/935/virtual
<form action="/contest/935/virtual" method="get">
<input type="submit" name="submit" value="Start virtual contest" style="padding:0 0.5em;">
</form>
POST /data/problemTags
<form id="addTagForm" action="/data/problemTags" method="post" style="display:none;"><input type="hidden" name="csrf_token" value="761c8f36c976f782a2c621acb24ce4b9">
<input name="action" type="hidden" value="addTag">
<input name="problemId" type="hidden" value="158421">
<input name="tagName" type="hidden" value="">
<input type="hidden" name="_tta" value="421">
</form>
POST /data/problemTags
<form id="removeTagForm" action="/data/problemTags" method="post" style="display:none;"><input type="hidden" name="csrf_token" value="761c8f36c976f782a2c621acb24ce4b9">
<input name="action" type="hidden" value="removeTag">
<input name="problemId" type="hidden" value="158421">
<input name="tagName" type="hidden" value="">
<input type="hidden" name="_tta" value="421">
</form>
Text Content
Enter | Register * Home * Top * Catalog * Contests * Gym * Problemset * Groups * Rating * Edu * API * Calendar * Help Codeforces Round 465 (Div. 2) Finished → Practice? Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions. → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems in the archive. If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive. Never use someone else's code, read the tutorials or communicate with other person during a virtual contest. → Problem tags brute force implementation *800 No tag edit access → Contest materials * Announcement (en) * editorial (en) * * Problems * Submit Code * My Submissions * Status * Hacks * Room * Standings * Custom Invocation The problem statement has recently been changed. View the changes. × A. Fafa and his Company time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees. Fafa finds doing this every time is very tiring for him. So, he decided to choose the best l employees in his company as team leaders. Whenever there is a new project, Fafa will divide the tasks among only the team leaders and each team leader will be responsible of some positive number of employees to give them the tasks. To make this process fair for the team leaders, each one of them should be responsible for the same number of employees. Moreover, every employee, who is not a team leader, has to be under the responsibility of exactly one team leader, and no team leader is responsible for another team leader. Given the number of employees n, find in how many ways Fafa could choose the number of team leaders l in such a way that it is possible to divide employees between them evenly. Input The input consists of a single line containing a positive integer n (2 ≤ n ≤ 105) — the number of employees in Fafa's company. Output Print a single integer representing the answer to the problem. Examples Input Copy 2 Output Copy 1 Input Copy 10 Output Copy 3 Note In the second sample Fafa has 3 ways: * choose only 1 employee as a team leader with 9 employees under his responsibility. * choose 2 employees as team leaders with 4 employees under the responsibility of each of them. * choose 5 employees as team leaders with 1 employee under the responsibility of each of them. Codeforces (c) Copyright 2010-2023 Mike Mirzayanov The only programming contests Web 2.0 platform Server time: May/17/2023 18:54:24UTC (g1). Desktop version, switch to mobile version. Privacy Policy Supported by User lists Name No items