sgu 246

---

一道好题。

把距离为 $n+1$的珠子连边，一共有 $gcd(2*n-1, n+1)$ 个联通块，

每个联通块的大小为 $\dfrac{2*n-1}{gcd(2*n-1, n+1)}$,

所以每个联通块最多可以有$\lfloor\dfrac{(2*n-1)}{gcd(2*n-1, n+1)*2} \rfloor$ 颗黑色珠子。

那么 $ans = {\lfloor\dfrac{(2*n-1)}{gcd(2*n-1, n+1)*2} \rfloor}*gcd(2*n-1, n+1)+1$

---

#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<map>
#include<string>
#include<stack>
#include<queue>
#include<utility>
#include<iostream>
#include<algorithm>

int gcd(int a,int b)
{
    return b?gcd(b, a%b):a;
}

int main()
{
    int n, m, cnt, L;
#ifndef ONLINE_JUDGE
    freopen("sgu246.in","r",stdin);
    freopen("sgu246.out","w",stdout);
#endif

    std::cin >> m;

    n = ((unsigned int)m + 1)>>1;

    cnt = gcd(m, n+1), L = m/cnt;

    std::cout << (long long)cnt*(L>>1)+1;

#ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
#endif
    return 0;
}