1139. City Blocks

最新推荐文章于 2014-03-01 18:43:00 发布

原创最新推荐文章于 2014-03-01 18:43:00 发布 · 967 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Timus

当前文章被收录于：

Timus

25 篇文章 1 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

1139. City Blocks

Time Limit: 1.0 second
Memory Limit: 16 MB

The blocks in the city of Fishburg are of square form. N avenues running south to north and Mstreets running east to west bound them. A helicopter took off in the most southwestern crossroads and flew along the straight line to the most northeastern crossroads. How many blocks did it fly above?

Note. A block is a square of minimum area (without its borders).

Input

The input contains N and M separated by one or more spaces. 1 < N, M < 32000.

Output

The number of blocks the helicopter flew above.

Samples

input	output
4 3	4
3 3	2

Hint

The figures for samples:

#include <iostream>
using namespace std;

int main()
{
	int n, m, i, ans = 0, x, y;
	double k, a, b;
	cin>>n>>m;
	n--;
	m--;
	ans = n;
	for (i=1; i<=m; i++)
		if ((i*n)%m != 0)
			ans++;
	cout<<ans<<endl;
}

标签

#input