跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1705. Right Triangles

  • ID: 1711
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 组合数学
  • 数学
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Right Triangles

题目描述

B. Right Triangles
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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).

Examples
Input
2 2
**
*.
Output
1
Input
3 4
*..*
.**.
*.**
Output
9

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1249 题。保留原作者与原赛事署名。