Codeforces Beta Round #1 A. Theatre Square

题意：n*m的一块地方，铺a*a的砖，边沿可以超出但是要保证铺满，求最少多少块砖，直接看代码

#include<stdio.h>#include<algorithm>using namespace std;int main(){    long long int n,m,a,ans,x,y;    scanf("%lld%lld%lld",&n,&m,&a);    ans=0;    if(n%a!=0) x=n/a+1;    else x=n/a;    if(m%a!=0) y=m/a+1;    else y=m/a;    ans=x*y;    printf("%lld\n",ans);}