Submission #966939

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for(int (i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for(int (i) = (m); (i) < (n); (i)++)
#define RFOR(i, a, b) for (int (i) = (b) - 1; (i) >= (a); (i)--)

#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(v.begin(), v.end())
#define REVERSE(v, n) reverse(v, v + n)
#define SIZE(v) (sizeof(v) / sizeof(v[0]))
#define ALLCOUNT(v, n, x) count(v, v + n, x)

#define PUT(x)  cout << #x << ": " << x << endl
#define ll long long

int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};

using namespace std;

int main(){
    double a, b, c;cin >> a >> b >> c;
    cout << c / a * b << endl; 
}

Submission Info

Judge Result