Submission #997809


Source Code Expand

#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int main() {
//	ios::sync_with_stdio(false);
//	cin.tie(0);
	int x, p;
	cin >> x >> p;
	double ans = (x + 1) / 2 * 100.0 / p;
	printf("%.7lf\n", ans);
	return 0;
}

Submission Info

Submission Time
Task A - Takahashi is Missing!
User ant2357
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1242 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample Dataset1 Dataset2 Dataset3
Score / Max Score 0 / 0 200 / 200 300 / 300 200 / 200
Status
AC × 3
AC × 7
AC × 10
AC × 23
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 2 ms 256 KB
subtask_01_03.txt AC 2 ms 256 KB
subtask_01_04.txt AC 2 ms 256 KB
subtask_01_ex1.txt AC 2 ms 256 KB
subtask_02_01.txt AC 2 ms 256 KB
subtask_02_02.txt AC 2 ms 256 KB
subtask_02_03.txt AC 2 ms 256 KB
subtask_03_01.txt AC 2 ms 256 KB
subtask_03_02.txt AC 2 ms 256 KB
subtask_03_03.txt AC 2 ms 256 KB
subtask_03_04.txt AC 2 ms 256 KB
subtask_03_05.txt AC 2 ms 256 KB
subtask_03_ex2.txt AC 2 ms 256 KB
subtask_04_01.txt AC 2 ms 256 KB
subtask_04_02.txt AC 2 ms 256 KB
subtask_04_03.txt AC 2 ms 256 KB
subtask_04_04.txt AC 2 ms 256 KB
subtask_04_05.txt AC 2 ms 256 KB
subtask_04_06.txt AC 2 ms 256 KB
subtask_04_07.txt AC 2 ms 256 KB
subtask_04_08.txt AC 2 ms 256 KB
subtask_04_09.txt AC 2 ms 256 KB
subtask_04_ex3.txt AC 2 ms 256 KB