uva12075 Counting Triangles

关键词：三点共线组数、两次DP
题意：求n*m格点中三角形个数
解法：转化为求n*m格点中三点共线组数——两次DP

# include<iostream>
# include<cstdio>
# include<algorithm>
# include<queue>
# include<stack>
# include<math.h>
# include<cstring>
# define INF 0x3f3f3f3f
# define ll long long
using namespace std;

const int maxn = 1000+10;

int cas;
ll n,m;
ll Ans;
ll dp[maxn][maxn];//dp[i][j]:i*j矩阵中不在同一水平/竖直线上的经过原点的三点共线点的组数
ll ans[maxn][maxn];//ans[i][j]:i*j矩阵中不在同一水平/竖直线上的三点共线点的组数
ll g[maxn][maxn];


ll gcd(ll a,ll b){
    if(g[a][b]!=0) return g[a][b];
    return g[a][b]=(b==0)?a:gcd(b,a%b);
}

int main(){
    //afreopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    cas=0;
    memset(g,0,sizeof(g));
    memset(dp,0,sizeof(dp));
    memset(ans,0,sizeof(ans));
    for(ll i=1;i<maxn;i++)
    for(ll j=1;j<maxn;j++){
        gcd(i,j);
    }
    for(ll i=1;i<maxn;i++){
        for(ll j=1;j<maxn;j++){
            dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+g[i][j]-1;
        }
    }
    for(ll i=1;i<maxn;i++){
        for(ll j=1;j<maxn;j++){
            ans[i][j]=ans[i-1][j]+ans[i][j-1]-ans[i-1][j-1]+dp[i][j];
        }
    }
    while(scanf("%lld%lld",&n,&m)!=EOF){
        if(n==0&&m==0) break;
        n++,m++;
        Ans=n*m*(n*m-1)*(n*m-2)/6;
        Ans-=n*m*(m-1)*(m-2)/6;
        Ans-=m*n*(n-1)*(n-2)/6;
        Ans-=ans[n-1][m-1]*2;
        printf("Case %d: %lld\n",++cas,Ans);
    }
    return 0;
}