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

原创 2015年11月21日 03:30:10

题意:

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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【Codeforces Round 332 (Div 2)D】【数学 公式推导】Spongebob and Squares 正方形数量恰好为x个的所有大矩形

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...

Codeforces Round #332 (Div. 2) D. Spongebob and Squares

Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked y...

Codeforces Round #332 (Div. 2) D. Spongebob and Squares详解

Codeforces Round #332 (Div. 2) D. Spongebob and Squares

codeforces 599D. Spongebob and Squares【推公式+暴力枚举】

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...
  • Bcwan_
  • Bcwan_
  • 2016年08月30日 20:26
  • 269

Coderforce #332 D. Spongebob and Squares

题意 给你x,然后让你找有多少个n*m的矩形,可以由x个相同的多边形组成 题解: 数学题,这道题实际上是问,f(n,m) = sigma(k=1,k=min(n,m))(n-k+1)...
  • Ezereal
  • Ezereal
  • 2015年11月24日 23:01
  • 227

Codeforces 599 D Spongebob and Squares

传送门: http://codeforces.com/problemset/problem/599/D题意: 求出所有的n和m,使得在n*m的矩形里恰有k个不同的正方形和明显的数学公式题嘛!! ...
  • yp_2013
  • yp_2013
  • 2016年01月16日 23:58
  • 666

CodeForces 599D Spongebob and Squares(DP+math)

Spongebob and Squares Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u...

Codeforces 599D Spongebob and Squares【思维枚举+数学方程】

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabytes ...

【Codeforces Round 332 (Div 2)B】【扭转题意 位置映射】Spongebob and Joke 给b[]中的每个数找f[]中的位置

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #332 (Div. 2)_B. Spongebob and Joke

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces #332 D. Spongebob and Squares (公式)
举报原因:
原因补充:

(最多只允许输入30个字)