TaoSama's Microcosm

本博客不再更新,新博客地址: http://taosama.github.io

Codeforces #332 D. Spongebob and Squares (公式)

题意:

nm,x1018,nm,

分析:

nm:
n<=m,f=nm+(n1)(m1)+(n2)(m2)++1(m(n1)),
n,n3,n106,
set

代码:

//
//  Created by TaoSama on 2015-11-21
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

typedef long long LL;
typedef pair<LL, LL> P;

LL x;

LL f(LL n, LL m) {
    LL ret = n * n * m - (n - 1) * n / 2 * (n + m);
    ret += n * (n - 1) * (2 * n - 1) / 6;
    return ret;
}

LL getM(LL n) {
    LL t = x;
    t -= n * (n - 1) * (2 * n - 1) / 6 - (n - 1) * n * n / 2;
    LL m = t / (n * n - ((n - 1) * n / 2));
    return m;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

//  cout << f()
    while(scanf("%I64d", &x) == 1) {
        set<P> ans;
        LL to = x;
        for(LL n = 1; n <= to; ++n) {
            LL m = getM(n);
            to = m;
            if(f(n, m) != x) continue;
            if(ans.count(P(n, m))) break;
            ans.insert(P(n, m));
            ans.insert(P(m, n));
        }
        printf("%I64d\n", (LL)ans.size());
        for(auto &i : ans) printf("%I64d %I64d\n", i.first, i.second);
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/lwt36/article/details/49961315
文章标签: codeforces
上一篇Codeforces #332 C. Day at the Beach (贪心)
下一篇LightOJ 1060 - nth Permutation (逆康托展开的思想)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭