Submission #7815620
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> #include<stack> #include <cmath> #include <limits> #include<set> #include <iomanip> #include <queue> #include <string> #pragma GCC optimize("Ofast") using namespace std; const long long INF=20000000000; //setprecision(2) << const int MOD = 1000000007; long long max(long long a,long long b){ if(a<b)return b; else return a; } long long min(long long a,long long b){ if(a>b)return b; else return a; } long long gcd(long long a,long long b){ if(a<b)swap(a,b); if(a%b==0)return b; else return gcd(a%b,b); } long long lcm(long long a,long long b){ return a*b/gcd(a,b); } long long com(long long n,long long k){ } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); double a,b,c; cin>>a>>b>>c; cout<<setprecision(200) <<b*c/a<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - SDカード |
User | Pkodama |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 866 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 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 | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
10_rand_01.txt | AC | 1 ms | 256 KB |
10_rand_02.txt | AC | 1 ms | 256 KB |
10_rand_03.txt | AC | 1 ms | 256 KB |
10_rand_04.txt | AC | 1 ms | 256 KB |
10_rand_05.txt | AC | 1 ms | 256 KB |
10_rand_06.txt | AC | 1 ms | 256 KB |
20_hand_01.txt | AC | 1 ms | 256 KB |
20_hand_02.txt | AC | 1 ms | 256 KB |