题意
给你x,然后让你找有多少个n*m的矩形,可以由x个相同的多边形组成
题解:
数学题,这道题实际上是问,f(n,m) = sigma(k=1,k=min(n,m))(n-k+1)*(m-k+1)=x的解有多少个
化简之后,我们可以得到f(n,m) = n^2m+n^2+n*m+n-(n+1)*n/2*(n+m+2)+n*(n+1)*(2n+1)/6
这个式子是一个关于m的一次函数,我们枚举n就好了
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-4
#define maxn 2000010
struct node
{
long long x,y;
bool operator < (const node &a) const
{
return x < a.x;
}
}st;
vector <node> v;
int main()
{
long long n;
while(scanf("%I64d",&n) != EOF)
{
long long x = 6 * n;
v.clear();
for(long long i = 1; i < maxn; i++)
{
long long y = i * i * i - i;
long long z = 3 * i * i + 3 * i;
if((x+y) % z == 0)
{
st.x = i;
st.y = (x + y) / z;
if(st.x <= st.y)
v.push_back(st);
}
}
sort(v.begin(),v.end());
long long ans = v.size();
if(v[ans-1].x == v[ans-1].y)
printf("%I64d\n",ans*2-1);
else
printf("%I64d\n",2*ans);
for(long long i = 0; i < ans; i++)
printf("%I64d %I64d\n",v[i].x,v[i].y);
if(v[ans-1].x == v[ans-1].y)
ans--;
for(long long i = ans-1; i >= 0; i--)
printf("%I64d %I64d\n",v[i].y,v[i].x);
}
return 0;
}