# Codeforces #332 D. Spongebob and Squares （公式）

nm,x1018,nm,$n*m矩形网格, 给定x\leq 10^{18}种正方形可能, 问有多少种n*m方案, 按照字典序输出$

nm:$我们发现n*m的矩形网格有正方形可能是:$
n<=m,f=nm+(n1)(m1)+(n2)(m2)++1(m(n1)),$假设n<=m, 那么方法数为f = n*m+(n-1)*(m-1)+(n-2)*(m-2)+\cdots +1*(m-(n-1)), 展开化简就好了$
n,n3,n106,$然后暴力枚举n, 由于式子是个n^3的多项式, 可以知道答案n在10^6量级最多, 枚举的时候判断下就好了$
set$这里偷懒用了set$

//
//  Created by TaoSama on 2015-11-21
//
#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;
}

#### Coderforce #332 D. Spongebob and Squares

2015-11-24 23:01:30

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

2015-11-22 05:09:05

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

2016-08-17 22:09:08

#### Codeforces Round #332 (Div. 2) D. Spongebob and Squares 公式推导

2015-12-05 12:53:15

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

2016-05-11 10:01:24

#### Codeforces 599D：Spongebob and Squares

2015-11-22 21:08:20

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

2015-11-23 16:17:10

#### Codeforces Round #332 (Div. 2)-D Spongebob and Squares（枚举+递推）

2017-10-09 09:56:16

#### CodeForces 599D Spongebob and Squares(DP＋math)

2016-01-23 11:51:11