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);
}