UVALive 3295 Counting Triangles
- 链接:UVALive 3295
- 题意:给出一个M*N的矩阵,问取其任意三点最多能取多少不完全重叠的三角形?
- 思路:这题与UVALive 3720 Highways很相似,描述好复杂,组合数学+dp。其实就是先求出组合数C,然后减去重复的和无法组成三角形的情况,重复情况用dp数组递推出来,递推公式与Highways也很相似。
下面是完整代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <set>
#include <algorithm>
#include <map>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <functional>
#include <sstream>
#include <list>
#include <complex>
#include <ctime>
using namespace std;
#define ll long long
#define ull unsigned long long
const int MAXN=2000005;
const int INF=987654323;
const int MOD=1e9+7;
ll m,n,t,ans;
ll C[MAXN][4],dp[1005][1005];
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
memset(C,0,sizeof(C));
for(ll i=0;i<MAXN;i++)
C[i][0]=1;
for(ll i=0;i<MAXN;i++)
for(ll j=1;j<4;j++)
C[i][j]=C[i-1][j]+C[i-1][j-1];
for(ll i=2;i<1005;i++)
for(ll j=2;j<1005;j++)
dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+gcd(i,j)-1;
for(ll i=2;i<1005;i++)
for(ll j=2;j<1005;j++)
dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
t=1;
scanf("%lld%lld",&m,&n);
while(m||n){
ans=C[(n+1)*(m+1)][3]-C[n+1][3]*(m+1)-C[m+1][3]*(n+1)-(dp[m][n]<<1);
printf("Case %lld: %lld\n",t++,ans);
scanf("%lld%lld",&m,&n);
}
return 0;
}