Submission #2449530
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); ++i)
#define forit(it, var) for(__typeof(var.begin()) it = var.begin(); it != var.end(); it++)
#define forrit(rit, var) for(__typeof(var.rbegin()) rit = var.rbegin(); rit != var.rend(); rit++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define maxK 305
#define MOD 1000000007
#define oo 1000000000000000007LL
#define sz(a) (int)a.size()
#define EPS 1e-9
const double PI = acos(-1.0);
double fRand(double fMin, double fMax)
{
double f = (double)rand() / RAND_MAX;
return fMin + f * (fMax - fMin);
}
template <class T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template <class T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
const int n = 6;
double p[n], q[n], w[n];
void read(double &x) {
int a; scanf("%d", &a);
x = a/100.0;
}
int main () {
fto(i, 0, n-1) read(p[i]);
fto(i, 0, n-1) read(q[i]);
fto(i, 0, n-1) w[i] = max(p[i], q[i])/(p[i]+q[i]);
double x1 = 0, x2 = 0;
fto(i, 0, n-1) {
if (p[i] > EPS) x1 += p[i]*w[i];
if (q[i] > EPS) x2 += q[i]*w[i];
}
printf("%.15g", min(x1, x2));
return 0;
}
Submission Info
Submission Time
2018-05-03 15:32:40+0900
Task
D - Dice Game
User
xuanquang1999
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1599 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘void read(double&)’:
./Main.cpp:48:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int a; scanf("%d", &a);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 1000
Status
Set Name
Test Cases
Sample
example0.txt, example1.txt
All
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, example0.txt, example1.txt
Case Name
Status
Exec Time
Memory
000.txt
AC
1 ms
256 KB
001.txt
AC
1 ms
256 KB
002.txt
AC
1 ms
256 KB
003.txt
AC
1 ms
256 KB
004.txt
AC
1 ms
256 KB
005.txt
AC
1 ms
256 KB
006.txt
WA
1 ms
256 KB
007.txt
WA
1 ms
256 KB
008.txt
AC
1 ms
256 KB
009.txt
AC
1 ms
256 KB
010.txt
WA
1 ms
256 KB
011.txt
WA
1 ms
256 KB
012.txt
WA
1 ms
256 KB
013.txt
AC
1 ms
256 KB
014.txt
WA
1 ms
256 KB
015.txt
WA
1 ms
256 KB
016.txt
AC
1 ms
256 KB
017.txt
WA
1 ms
256 KB
018.txt
WA
1 ms
256 KB
019.txt
WA
1 ms
256 KB
020.txt
WA
1 ms
256 KB
021.txt
WA
1 ms
256 KB
022.txt
WA
1 ms
256 KB
023.txt
WA
1 ms
256 KB
024.txt
WA
1 ms
256 KB
025.txt
WA
1 ms
256 KB
026.txt
WA
1 ms
256 KB
027.txt
WA
1 ms
256 KB
028.txt
WA
1 ms
256 KB
029.txt
WA
1 ms
256 KB
030.txt
WA
1 ms
256 KB
031.txt
WA
1 ms
256 KB
032.txt
WA
1 ms
256 KB
033.txt
WA
1 ms
256 KB
034.txt
WA
1 ms
256 KB
035.txt
WA
1 ms
256 KB
036.txt
WA
1 ms
256 KB
037.txt
WA
1 ms
256 KB
038.txt
WA
1 ms
256 KB
example0.txt
AC
1 ms
256 KB
example1.txt
AC
1 ms
256 KB