codeforces——1A - Theatre Square
2014-10-26 20:36
375 查看
A. Theatre Square
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
Theatre Square in the capital city of Berland has a rectangular shape with the size
n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size
a × a.
What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to
the sides of the Square.
Input
The input contains three positive integer numbers in the first line:
n, m and a (1 ≤ n, m, a ≤ 109).
Output
Write the needed number of flagstones.
Sample test(s)
Input
Output
简单题,注意用__int64
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
Theatre Square in the capital city of Berland has a rectangular shape with the size
n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size
a × a.
What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to
the sides of the Square.
Input
The input contains three positive integer numbers in the first line:
n, m and a (1 ≤ n, m, a ≤ 109).
Output
Write the needed number of flagstones.
Sample test(s)
Input
6 6 4
Output
4
简单题,注意用__int64
#include <map> #include <set> #include <list> #include <stack> #include <vector> #include <queue> #include <cmath> #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int main() { int n, m, a; while (~scanf("%d%d%d", &n, &m, &a)) { __int64 ans = 0; while(m > 0) { ans += n / a; if(n % a) { ans++; } m -= a; } printf("%I64d\n", ans); } return 0; }
相关文章推荐
- Codeforces 1A (A. Theatre Square) Simple math problem
- CodeForces 1A Theatre Square(math)——Codeforces Beta Round #1
- CodeForces 1A Theatre Square
- codeforces-1A-Theatre Square( 测试一下cf平台,囧 )
- codeforces 1A Theatre Square
- CodeForces 1A Theatre Square(水题)
- Problem--1A--Codeforces--TheatreSquare
- CodeForces 1A Theatre Square
- CodeForces 1A-Theatre Square【数学】
- 小白题解 Codeforces 1A Theatre Square
- CodeForces 1A Theatre Square(模拟+简单数学)
- codeforces 1A Theatre Square(再来一水题)
- CodeForces 1A Theatre Square
- codeforces 1A Theatre Square
- codeforces 1A Theatre Square
- Codeforces 1A Theatre Square
- 4000 CodeForces 1A Theatre Square 【数学】【精度】
- CodeForces 1A Theatre Square
- Codeforces 1A-Theatre Square(水)
- Codeforces 1A (A. Theatre Square) Simple math problem