Codeforces 935A

题目链接

https://vjudge.net/problem/CodeForces-935A

题意

n个人，从中挑出x个领队，每个领队带y个人。问x有多少种选择方法。

思路

由于n不超过1e5，直接模拟一下。

AC代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<string>
#include<sstream>
#include<cctype>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
const double PI=atan(1.0)*4;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1000000007;
const int maxn = 100010;

int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int n, ans = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n / 2; i++)
    {
        if((n - i) % i == 0)
            ans++;
    }
    printf("%d\n", ans);
    return 0;
}