Submission #997805
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)
int x,p;
double solve(int n){
return 100.0 * n / p;
}
int main(){
scanf("%d%d" , &x , &p);
if(p == 100){
printf("%d\n" , (x+1) / 2);
} else if(x%2==0){
printf("%.9f\n" , solve(x/2));
} else {
printf("%.9f\n" , 1.0 + solve(x/2)*0.01*p + solve(x/2+1)*0.01*(100-p));
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Takahashi is Missing! |
User |
PIandS |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1055 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
128 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d" , &x , &p);
^
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 |
128 KB |
subtask_01_03.txt |
AC |
1 ms |
128 KB |
subtask_01_04.txt |
AC |
1 ms |
128 KB |
subtask_01_ex1.txt |
AC |
1 ms |
128 KB |
subtask_02_01.txt |
AC |
1 ms |
128 KB |
subtask_02_02.txt |
AC |
1 ms |
128 KB |
subtask_02_03.txt |
AC |
1 ms |
128 KB |
subtask_03_01.txt |
AC |
1 ms |
128 KB |
subtask_03_02.txt |
AC |
1 ms |
128 KB |
subtask_03_03.txt |
AC |
1 ms |
128 KB |
subtask_03_04.txt |
AC |
1 ms |
128 KB |
subtask_03_05.txt |
AC |
1 ms |
128 KB |
subtask_03_ex2.txt |
AC |
1 ms |
128 KB |
subtask_04_01.txt |
AC |
1 ms |
128 KB |
subtask_04_02.txt |
AC |
1 ms |
128 KB |
subtask_04_03.txt |
AC |
1 ms |
128 KB |
subtask_04_04.txt |
AC |
1 ms |
128 KB |
subtask_04_05.txt |
AC |
1 ms |
128 KB |
subtask_04_06.txt |
AC |
1 ms |
128 KB |
subtask_04_07.txt |
AC |
1 ms |
128 KB |
subtask_04_08.txt |
AC |
1 ms |
128 KB |
subtask_04_09.txt |
AC |
1 ms |
128 KB |
subtask_04_ex3.txt |
AC |
1 ms |
128 KB |