Submission #967111

Source Code Expand

#include <algorithm>
#include <climits>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map> //pair is also included in this library
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define REP(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define fst first
#define snd second
#define MP make_pair //incase c++11 or later is not available

using namespace std;

typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;

//prefer define statement
//for reason that const int ver. of INF will raise a silly warning (unused variable)
#define INF (INT_MAX/3)
#define LIM_INF (INT_MAX)
//const int INF = INT_MAX/3;


int main(){
  int A, B, C;

  cin >> A >> B >> C;

  double ans = ((double)B / (double)A) * (double) C;

  cout << ans << endl;

  return 0;

Submission Info

Submission Time
Task A - SDカード
User IrnBru
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1030 Byte
Exec Time 3 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 0 / 100 00_example_01.txt, 00_example_02.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 20_hand_01.txt, 20_hand_02.txt
Case Name Status Exec Time Memory
00_example_01.txt 3 ms 256 KB
00_example_02.txt 3 ms 256 KB
10_rand_01.txt 3 ms 256 KB
10_rand_02.txt 3 ms 256 KB
10_rand_03.txt 3 ms 256 KB
10_rand_04.txt 3 ms 256 KB
10_rand_05.txt 3 ms 256 KB
10_rand_06.txt 3 ms 256 KB
20_hand_01.txt 3 ms 256 KB
20_hand_02.txt 3 ms 256 KB