Submission #1986396
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}
inline R sq(R x) {return sqrt(max(x, 0.0L));}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main(void) {
ll x, t;
cin >> x >> t;
const R p = 1.0 * t / 100.0;
const R q = 1.0 - p;
R ans = 1.0 * (x / 2) / p;
if (x % 2 == 1) ans += q / p + 1.0;
cout.precision(20);
cout << fixed << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Takahashi is Missing! |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1485 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Dataset1 |
Dataset2 |
Dataset3 |
Score / Max Score |
0 / 0 |
200 / 200 |
300 / 300 |
200 / 200 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
subtask_01_ex1.txt, subtask_03_ex2.txt, subtask_04_ex3.txt |
Dataset1 |
subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt |
Dataset2 |
subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt |
Dataset3 |
subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_ex3.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask_01_02.txt |
AC |
1 ms |
256 KB |
subtask_01_03.txt |
AC |
1 ms |
256 KB |
subtask_01_04.txt |
AC |
1 ms |
256 KB |
subtask_01_ex1.txt |
AC |
1 ms |
256 KB |
subtask_02_01.txt |
AC |
1 ms |
256 KB |
subtask_02_02.txt |
AC |
1 ms |
256 KB |
subtask_02_03.txt |
AC |
1 ms |
256 KB |
subtask_03_01.txt |
AC |
1 ms |
256 KB |
subtask_03_02.txt |
AC |
1 ms |
256 KB |
subtask_03_03.txt |
AC |
1 ms |
256 KB |
subtask_03_04.txt |
AC |
1 ms |
256 KB |
subtask_03_05.txt |
AC |
1 ms |
256 KB |
subtask_03_ex2.txt |
AC |
1 ms |
256 KB |
subtask_04_01.txt |
AC |
1 ms |
256 KB |
subtask_04_02.txt |
AC |
1 ms |
256 KB |
subtask_04_03.txt |
AC |
1 ms |
256 KB |
subtask_04_04.txt |
AC |
1 ms |
256 KB |
subtask_04_05.txt |
AC |
1 ms |
256 KB |
subtask_04_06.txt |
AC |
1 ms |
256 KB |
subtask_04_07.txt |
AC |
1 ms |
256 KB |
subtask_04_08.txt |
AC |
1 ms |
256 KB |
subtask_04_09.txt |
AC |
1 ms |
256 KB |
subtask_04_ex3.txt |
AC |
1 ms |
256 KB |