Submission #997810
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repq(i,a,n) for(int i=a; i<=n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
signed main() {
int x, p; cin >> x >> p;
cout << fixed << setprecision(10) << ((x - 1) / 2 + 1) / (double)p * 100.0 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Takahashi is Missing! |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1504 Byte |
Status |
AC |
Exec Time |
3 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 |
3 ms |
256 KB |
subtask_01_03.txt |
AC |
3 ms |
256 KB |
subtask_01_04.txt |
AC |
3 ms |
256 KB |
subtask_01_ex1.txt |
AC |
3 ms |
256 KB |
subtask_02_01.txt |
AC |
3 ms |
256 KB |
subtask_02_02.txt |
AC |
3 ms |
256 KB |
subtask_02_03.txt |
AC |
3 ms |
256 KB |
subtask_03_01.txt |
AC |
3 ms |
256 KB |
subtask_03_02.txt |
AC |
3 ms |
256 KB |
subtask_03_03.txt |
AC |
3 ms |
256 KB |
subtask_03_04.txt |
AC |
3 ms |
256 KB |
subtask_03_05.txt |
AC |
3 ms |
256 KB |
subtask_03_ex2.txt |
AC |
3 ms |
256 KB |
subtask_04_01.txt |
AC |
3 ms |
256 KB |
subtask_04_02.txt |
AC |
3 ms |
256 KB |
subtask_04_03.txt |
AC |
3 ms |
256 KB |
subtask_04_04.txt |
AC |
3 ms |
256 KB |
subtask_04_05.txt |
AC |
3 ms |
256 KB |
subtask_04_06.txt |
AC |
3 ms |
256 KB |
subtask_04_07.txt |
AC |
3 ms |
256 KB |
subtask_04_08.txt |
AC |
3 ms |
256 KB |
subtask_04_09.txt |
AC |
3 ms |
256 KB |
subtask_04_ex3.txt |
AC |
3 ms |
256 KB |