Submission #2010454
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <cstring> #include <vector> #include <queue> #include <set> #include <map> #include <cmath> #include <iomanip> #include <cassert> #include <bitset> using namespace std; //typedef pair<int, int> P; #define rep(i, n) for (int i=0; i<(n); i++) #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) #define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin()) #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 int X, P, Q; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> X >> P; Q = 100-P; double np = 1+(double)Q/(double)P; double ans = 0; if (X%2) { ans += (P/100.0)*(1+((X-1)/2)*np); ans += (1-(P/100.0))*(1+((X+1)/2)*np); } else { ans += (X/2)*np; } cout << fixed << setprecision(20) << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Takahashi is Missing! |
User | funcsr |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 984 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 |