knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

#define INF 1<<29

template <typename T>
struct MaxFlow {

knuu

import collections
import sys
if sys.version[0] == '2':
    input, range = raw_input, xrange


class MyList(list):
    def __init__(self, x=[]):
        list.__init__(self, x)

knuu

import collections


class MaxFlow:
    """Dinic Algorithm: find max-flow
       complexity: O(EV^2)
       used in GRL6A(AOJ)
    """
    class Edge:
        def __init__(self, to, cap, rev):

knuu

# -*- coding: utf-8 -*-
class Gperm:
    def countfee(self, x, y):
        range = xrange
        N, E = 50, len(x)
        INF = 10**9
        dp = [INF] * (1 << E)
        dp[0] = 0
        edge = [0] * N
        # 各頂点を塗りつぶさない状態にしたときにコストがかからなくなる枝集合を計算

knuu

#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

struct Gperm {
  vector<int> x, y;
  int countfee(vector<int> _x, vector<int> _y) {

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

int main() {
  int Q; scanf("%d", &Q);
  map<int, int> mult;
  mult[0]++;

knuu

#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

int main() {
  int N; cin >> N;
  vector<ll> C(N); REP(i, N) cin >> C[i];

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()

int main() {
  int N; scanf("%d", &N);
  vector<int> X(N); REP(i, N) scanf("%d", &X[i]);

knuu

from math import hypot
a, b = map(int, input().split())
n = int(input())
ans = 10**6
for _ in range(n):
    x, y, v = map(int, input().split())
    ans = min(ans, hypot(x-a, y-b)/v)
print('{:.20f}'.format(ans))

knuu

from fractions import gcd

H, W, K = map(int, input().split())
g = gcd(K, W)

W, K = W//g, K//g
print(K//2*W//2+(K-1)//2*(W-2)//2)