Right Triangles

Description
You are given a n × m field consisting only of periods (‘.’) and asterisks (‘‘). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of ‘‘-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle).

Input
The first line contains two positive integer numbers n and m (1 ≤ n, m ≤ 1000). The following n lines consist of m characters each, describing the field. Only ‘.’ and ‘*’ are allowed.

Output
Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Sample Input
Input
2 2
**
*.
Output
1
Input
3 4
..
.**.
.*
Output
9
题意是让你求直角三角形的个数，三个顶点必须是‘*’。
代码：

#include <stdio.h>
#include <string.h>
using namespace std;
long long a[1002];
char x[1002][1002];
int main()
{
    int n, m;
    long long ans, k;
    while(~scanf("%d %d", &n, &m))
    {
        ans = 0;
        for(int i = 0;i < n; i++)
        {
            scanf("%s", x[i]);
        }
        for(int i = 0; i < n; i++)
        {
            for(int j = 0;j < m; j++)
            {
                 if(x[i][j] == '*') a[j]++;
            }
        }
        for(int i = 0; i < n; i++)
        {
            k = 0;
            for(int j = 0;j < m; j++)
            if(x[i][j] == '*')
            {
                ans += k * (a[j]-1);
                k++;
            }
            k = 0;
            for(int j = m - 1; j >= 0; j--)
            if(x[i][j] == '*')
            {
                ans += k *(a[j] - 1);
                k++;
            }
        }
        printf("%I64d\n", ans);
    }
    return 0;
}