Submission #3325489


Source Code Expand

# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)


double n;
double p;

int main() {
	cin >> n >> p;
	p /= 100.0;
	cout << fixed << setprecision(13) << (n + 1) / 2 / p << endl;
}

Submission Info

Submission Time
Task A - Takahashi is Missing!
User M3_cp
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1631 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample Dataset1 Dataset2 Dataset3
Score / Max Score 0 / 0 0 / 200 0 / 300 0 / 200
Status
AC × 2
WA × 1
AC × 5
WA × 2
AC × 5
WA × 5
AC × 18
WA × 5
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 WA 1 ms 256 KB
subtask_01_03.txt AC 1 ms 256 KB
subtask_01_04.txt WA 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 WA 1 ms 256 KB
subtask_03_04.txt AC 1 ms 256 KB
subtask_03_05.txt WA 1 ms 256 KB
subtask_03_ex2.txt WA 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