Codeforces-Atcoder/codeforces/1/A.cpp at master · nabil0day/Codeforces-Atcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*****
 *                                                   __Bismillahir Rahmanir Rahim__
 *                                          American International University Bangladesh (AIUB)
 *                                                         Hadiur Rahman Nabil


*****/
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

typedef long long ll;
typedef long double ld;

//Palindrome--
// for(int i=s.size()-1;i>=0;--i){s_rev.push_back(s[i]);} if(s==s_rev)
 //Anagram--
 //sort(a.begin(), a.end());sort(b.begin(), b.end());if(a==b)

//Find_Last + Delete_Last--
//num%10    +   num/10
//Fibonacci--
//for(int i=1;i<=N-2;i++){ num3=num1(1)+num2(2);num1=num2;num2=num3(Fibonacci);


    int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    ll n,m,a,x,y;
    cin>>n>>m>>a;
    if(m%a==0)
    {
         x=m/a;
    }
    else
    {
        x=m/a+1;
    }
    if(n%a==0)
    {
         y=n/a;
    }
    else
    {
        y=n/a+1;
    }
    cout<< x*y <<"\n";


    }