Search is not available for this dataset
name stringlengths 2 88 | description stringlengths 31 8.62k | public_tests dict | private_tests dict | solution_type stringclasses 2
values | programming_language stringclasses 5
values | solution stringlengths 1 983k |
|---|---|---|---|---|---|---|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
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 = ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
template <class T>
using vv = vector<vector<T>>;
template <class T>
ostream &operator<<(ostream &os, const vector<T> &t) {
os << "{";
for (int(i) = 0; (i) < (t.size()); ++(i)) {
os << t[i] << ",";
}
os << "}" << endl;
return os;
}
template <class S, class T>
o... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
cout << x / 2 + x % 2;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, x;
cin >> x >> p;
if (x % 2 == 0)
cout << x / 2;
else
cout << (x + 1) / 2;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long double p, n;
int main() {
cin >> n >> p;
p = 100.0l - p;
p /= 100.0l;
long double ans = n / (2 - p * 2);
printf("%.14Lf\n", ans);
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int x, p;
int main(void) {
scanf("%d%d", &x, &p);
int ans = x / 2;
if (ans % 2 == 1) {
ans++;
}
printf("%d\n", ans);
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
double p;
int x;
int main() {
cin >> x >> p;
if (x % 2 == 1) x++;
cout << setprecision(8) << x / (2 * p) << endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #{{{ header
{.hints:off}
import algorithm, sequtils, tables, macros, math, sets, strutils, streams
when defined(MYDEBUG):
import header
proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(base:int = 0): int =
scanf("%lld",addr result)
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
ll X, P;
const int MAX_TURN = 200;
map<tuple<int, int, int>, ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
assert(p == 100);
if (p == 100) {
int tim = (x + 1) / 2;
cout << tim << endl;
}
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
const int inf = 1e8;
int main() {
int x;
double p;
cin >> x >> p;
if (p == 100) {
cout << (x + 1) / 2 << endl;
return 0;
}
vector<double> dp(1000);
dp[x - 1] = 1;
double out = 0;
for (int i = 0; ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java |
import java.io.*;
import java.util.*;
import java.util.function.IntPredicate;
public class Main {
class Graph {
Node[] nodes;
public Graph(int n) {
nodes = new Node[n];
for (int i = 0; i < n; i++) {
nodes[i] = new Node(i);
}
}
public void addEdge(int from, int to, int weight) {
nodes[fro... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int x, p;
int main() {
cin >> x >> p;
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
double xx = x / 2 + x % 2;
cout << xx / p * 100;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | import sys
X = int(sys.stdin.readline())
P = int(sys.stdin.readline())
print((X+1)//2)
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
double p;
cin >> x >> p;
if (x % 2 == 1) {
x++;
}
x /= 2;
double y = x;
cout << x / p * 100 << endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int64_t inf64 = 1e18;
const double eps = 1e-9;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
void solve() {
int x;
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = 1e12;
long long x, p;
bool f(double m) {
double aoki = m;
double tak = (double)x + m * (1.0 - 2.0 * p / 100.0);
return (tak < aoki);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> x >> p;... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int x, p;
int main() {
cin >> x >> p;
if (p != 100) return 0;
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
unsigned long xor128() {
static unsigned long x = time(NULL), y = 362436069, z = 521288629,
w = 88675123;
unsigned long t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%lld", &a[j][i]);
}
}
long long num[n];
for (int i = 0; i < n; i++) num[i] = 0;
int s = 0;
long long ans = 0;
long l... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int x, p;
int main() {
scanf("%d%d", &x, &p);
if (p == 100) {
printf("%d\n", (x + 1) / 2);
} else {
printf("%f\n", x);
}
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <istream>
#include <ostream>
#include <cstdlib>
#include <cmath>
#include <cstdio>
using namespace std;
#define fi first
#define ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long x, p;
int main() {
cin >> x >> p;
if (x % 2 == 0)
cout << 100.0 / p * (x / 2) << endl;
else
cout << 100.0 / p * ((x + 1) / 2) * (100 - p) / 100 +
100.0 / p * ((x - 1) / 2) * p / 100 + 1
<< endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
template <class S, class T>
istream& operator>>(istream& is, pair<S, T>& p) {
return is >> p.first >> p.second;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const long long MOD = 1e9 + 7;
double C[1010][1010];
double ps[1010], qs[1010];
int main() {
cin.tie... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
double X;
double rad;
double ans;
int main() {
cin >> X >> rad;
if ((int)X % 2 == 0) {
for (int i = 0; i < 100000; i++) {
ans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;
}
} else {
for (int i = 0; i < 100000; i++) {
ans = (an... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
template <typename T>
inline void chmin(T &l, T r) {
l = min(l, r);
}
template <typename T>
inline void chmax(T &l, T r) {
l = max(l, r);
}
int main() {
int x;
double p;
cin >> x >... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long x, p;
int main() {
cin >> x >> p;
cout << 100.0 / p * ((x + 1) / 2) << endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long double X;
long double rad;
long double ans;
int main() {
cin >> X >> rad;
if ((long long int)X % 2 == 0) {
for (int i = 0; i < 1000; i++) {
ans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;
}
} else {
for (int i = 0; i < 1000; i... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int x, p;
int main() {
cin >> x >> p;
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, p;
cin >> x >> p;
if (p != 100) {
cout << "もうダメ" << endl;
return 0;
}
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long UNDEF = -1;
const long long INF = 1e18;
template <typename T>
inline bool chkmax(T& aa, T bb) {
return aa < bb ? aa = bb, true : false;
}
template <typename T>
inline bool chkmin(T& aa, T bb) {
return aa > bb ? aa = bb, true : false;
}
struct debugger {
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
x = x / 2 + x % 2;
cout << x / ((double)p / 100);
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007ll;
const double EPS = 1e-11;
double pq[2521][2521];
int main() {
long long x;
int _p;
cin >> x >> _p;
if (x % 2 == 1) x++;
double p = (double)_p / 100.0;
double q = 1.0 - p;
pq[0][0] = 1.0;
for (int i = 0; i < (int)(2520); ++... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int inf = 1000000009;
int i, j, k, m, n, l, x, p;
int ans;
int main() {
cin >> x >> p;
if (p == 0) {
cout << (x + 1) / 2 << endl;
return 0;
}
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long a[1005][1005];
int main() {
ios::sync_with_stdio(0);
cin.tie();
cin >> n >> m;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> a[i][j];
long long ans = 0;
long long last = 0;
for (int i = 1; i < n; ++i) {
if (a[i - 1]... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #{{{ header
{.hints:off}
import algorithm, sequtils, tables, macros, math, sets, strutils, streams
when defined(MYDEBUG):
import header
proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(base:int = 0): int =
scanf("%lld",addr result)
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
assert(p == 100);
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int x, p;
int main(void) {
scanf("%d%d", &x, &p);
int ans = x / 2;
if (ans % 2 == 1) {
ans++;
}
if (ans == 0) {
ans = 1;
}
printf("%d\n", ans);
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
template <class S, class T>
istream& operator>>(istream& is, pair<S, T>& p) {
return is >> p.first >> p.second;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const long long MOD = 1e9 + 7;
double C[1010][1010];
double ps[1010], qs[1010];
int main() {
cin.tie... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
double f(int p, int n) {
double P = p / 100.0;
double Q = 1.0 - P;
double ans = pow(P, n / 2) * pow(1 - Q, -n / 2) * (-n) / (2 * (Q - 1));
return ans;
}
int main() {
int x, p;
cin >> x >> p;
cout.precision(10);
double ans;
if (x % 2)
ans = 1.0 + (p / 1... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937 rn... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long x, p;
int main() {
cin >> x >> p;
if (p == 100) {
if (x % 2 == 0) {
cout << x / 2 << endl;
} else {
cout << x / 2 + 1 << endl;
}
return 0;
}
printf("%.20f\n", 100 * (double)x / (100 - (double)p) / 2.0);
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, p;
cin >> x >> p;
if (p == 100) {
printf("%.12lf\n", (double)(x + 1) / 2);
return 0;
}
printf("%.12lf\n", 100.0 * ((x + 1) / 2) / p);
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
double f(long long x, double p) { return double(x) / p * 100; }
int main() {
long long x;
double p;
cin >> x >> p;
if (x % 2 == 0) {
x /= 2;
cout << f(x, p) << endl;
} else {
long long y = x / 2;
x = y + 1;
cout << 1 + (f(x, p) * (100 - p) / 10... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = 1e12;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long x, p;
cin >> x >> p;
assert(p == 100);
cout << (x + 1) / 2 << endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
long long x;
double p;
cin>>x>>p;
if(x%2){cout<<setprecision(20)<<((double)x+1)/2/p*100)<<endl;}
else{ cout<<setprecision(20)<<((double)x)/2/p*100)<<endl;}
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int K;
string S;
int main() {
cin >> K >> S;
if (K == 0)
cout << S << endl;
else if (K <= 2) {
if (S.size() == 1)
cout << S << endl;
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class TEST{
static void Main(){
Sol mySol =new Sol();
mySol.Solve();
}
}
class Sol{
public void Solve(){
int TT = X/2;
if(X%2 == 1) TT++;
if(P == 100){
Console.WriteLine("{0}",(double)TT)... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007ll;
const double EPS = 1e-11;
const int C = 100000;
double perc[2][252521];
int main() {
long long x;
int _p;
cin >> x >> _p;
double p = (double)_p / 100.0;
double q = 1.0 - p;
int cur = 0;
perc[cur][x + C] = 1.0;
int pos = C;... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = std::int_fast64_t;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-15;
template <typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
os << to_s... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
int a;
float r;
std::cin >> x >> p;
if (x % 2 == 0) {
a = 0;
} else {
a = -1;
}
if (p == 100) {
r = (x - a) / 2;
std::cout << r << std::endl;
} else {
std::cout << "(´・ω・｀)" << std::endl;
}
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int X;
double p;
double calc(int x) {
double ret = 0;
double pp = 1, np = 1;
for (int i = 0; i < x / 2; i++) pp *= p;
double comb = 1;
for (int tm = 0; tm < 1e6; tm++) {
long k = x / 2 + tm;
ret += k * pp * np * comb;
np *= 1 - p;
comb *= k;
co... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
int main() {
long long x, p;
std::cin >> x >> p;
x++;
if (x % 2 == 0)
std::cout << x / 2 << ".00000000" << std::endl;
else
std::cout << x / 2 + 1 << std::endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
ll X, P;
const int MAX_TURN = 300;
map<tuple<int, int, int>, ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | say 100*(get+1>>1)/get |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
int main() {
long long x, p;
std::cin >> x >> p;
x++;
if (x % 2 == 0)
std::cout << x / 2 << std::endl;
else
std::cout << x / 2 << ".5" << std::endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
signed long long X;
double P;
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> X >> P;
if (P != 100) return;
P /= 100;
(void)printf("%lld\n", (X + 1) / 2);
}
int main(int argc, char** argv) {
string s;
int i;
if (argc == 1) ios::sync_with_stdio(fal... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
cout.precision(10);
if (p == 100)
cout << (x / 2) + (x % 2) << ".000000\n";
else {
double P = p / 100.0;
double Q = 1.0 - P;
double ans = pow(P, x / 2) * (-2 * x * Q + 2 * x + 12 * Q);
ans /= 4;
ans /= ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
const int inf = 1e8;
int main() {
int x;
double p;
cin >> x >> p;
if (p == 100) {
cout << (x + 1) / 2 << endl;
return 0;
}
vector<double> dp(1000);
dp[x - 1] = 1;
double out = 0;
for (int i = 0; ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int INF = 1 << 29;
const long double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
ll X, P;
const int MAX_TURN = 2000;
const int MAX_POS = ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long x;
double p;
int main() {
cin >> x >> p;
if (p == 100) {
if (x % 2 == 0) {
cout << x / 2 << endl;
} else {
cout << x / 2 + 1 << endl;
}
return 0;
}
if (x > 10) {
return 1;
}
vector<double> dp(15, 0);
long long turn = 0... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
const int inf = 1e8;
int main() {
int x;
double p;
cin >> x >> p;
if (p == 100) {
cout << (x + 1) / 2 << endl;
return 0;
}
vector<double> dp(1000);
dp[x - 1] = 1;
double out = 0;
for (int i = 0; ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
const int inf = 1e8;
int main() {
int x;
double p;
cin >> x >> p;
if (p == 100) {
cout << (x + 1) / 2 << endl;
return 0;
}
vector<double> dp(1000);
dp[x - 1] = 1;
double out = 0;
for (int i = 0; ... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int>::max() / 2;
int dp[100100];
int main(void) {
int x, p;
cin >> x >> p;
fill(dp, dp + 100100, -1);
if (p != 100) {
return 0;
}
cout << setprecision(15) << ceil(x / 2.0) << endl;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
unsigned long xor128() {
static unsigned long x = time(NULL), y = 362436069, z = 521288629,
w = 88675123;
unsigned long t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | /+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
import std.typecons;
import std.bigint;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.container.deque;
int main() {
auto sc = new Scanner(stdin);
int n, m, k;
sc.read(... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
double X;
double P;
int main() {
cin >> X >> P;
cout << 50.0 * (X + ((int)X % 2)) / P << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int x, p;
cin >> x >> p;
cout << (x + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long double X;
long double rad;
long double ans;
int main() {
cin >> X >> rad;
if ((long long int)X % 2 == 0) {
for (int i = 0; i < 10000000; i++) {
ans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;
}
} else {
for (int i = 0; i < 100... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int f(int x, int y) {
int r;
for (int i = x; i > y; i--) {
r *= i;
}
return r;
}
int main() {
int x, p;
int a;
float r;
std::cin >> x >> p;
if (x % 2 == 0) {
a = 0;
} else {
a = -1;
}
if (p == 100) {
r = (x - a) / 2;
std::cout << r << std::endl;
r... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
ll X, P;
const int MAX_TURN = 1000;
const int MAX_POS = 100;
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007ll;
const double EPS = 1e-11;
const int C = 1000;
double perc[2][2521];
int main() {
long long x;
int _p;
cin >> x >> _p;
double p = (double)_p / 100.0;
double q = 1.0 - p;
int cur = 0;
perc[cur][x + C] = 1.0;
int pos = C;
c... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int x, p;
cin >> x >> p;
cout << x - 1 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;
public class Main {
static final Scanner in = new Scanner(System.in);
static final PrintWriter out = new PrintWriter(System.out,false);
static boolean debug = false;
static void solve() {
int x = in.nextInt();
int p = in.nextIn... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
if (p == 100) {
int tim = (x + 1) / 2;
cout << tim << endl;
}
double pp = p / 100.0;
if (x % 2) {
printf("%.14f\n", ((double)(1 - pp) / pp + (double)x / pp) / 2.0);
} else
printf("%.14f\n", ((double)x / pp)... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | print<>*50/<>#に近い値 |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using LONG = long long int;
using ULONG = unsigned long long int;
int main(void) {
int x, p;
cin >> x >> p;
if (p != 100) return 0;
cout << ((x + 1) / 2) << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long double X;
long double rad;
long double ans;
int main() {
cin >> X >> rad;
if ((long long int)X % 2 == 0) {
for (int i = 0; i < 10000000; i++) {
ans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;
}
} else {
for (int i = 0; i < 100... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, p;
cin >> x >> p;
x = (x + 1) / 2 * 100;
cout << x / (double)p << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <c... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python2 | x = int(raw_input())
p = int(raw_input())
if p==100:
print x/2 + x%2
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
#include <iomanip>
using namespace std;
double p
int x;
int main(){
cin >> x >> p;
if(x%2==1) x++;
cout << setprecision(8) << x/(2*p) << endl;
} |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | x,$0=int(++x/2)*100/$0;{x=$0} |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
double p;
cin >> x >> p;
if (x % 2) {
cout << setprecision(20) << (((double)x + 1) / 2) / p * 100 << endl;
} else {
cout << setprecision(20) << (((double)x) / 2) / p * 100 << endl;
}
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
using namespace std;
double p,x;
int main(){
cin >> x >> p;
if(x%2==1) x++;
cout << setprecision(8) << x/(2*p) << endl;
} |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%lld", &a[j][i]);
}
}
long long num[n];
for (int i = 0; i < n; i++) num[i] = 0;
int s = 0;
long long ans = 0;
long l... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main {
private static void solve() {
long x = nel();
int p = nei();
if (p < 100) {
out(114514);
return;
}
if (x % 2 == 0) {
out(x >> 1);
return;
}
out(x +... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | say 100*(get+1+>1)/get |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class TEST{
static void Main(){
Sol mySol =new Sol();
mySol.Solve();
}
}
class Sol{
public void Solve(){
int TT = X/2;
if(X%2 == 1) TT++;
if(P == 100){
Console.WriteLine("{0}",(double)TT)... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int inf = 1000000009;
int i, j, k, m, n, l;
long long ans;
long long a[400][400], b[400];
const int U = 4000;
long long C[U][U];
int good(int i) {
for (int j = 1; j <= m; j++)
if (a[i][j] < a[i + 1][j])
return 1;
else if (a[i]... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, p;
int main() {
cin >> n >> p;
cout << (n + 1) / 2 << endl;
return 0;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int INF = 1 << 29;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
ll X, P;
const int MAX_TURN = 2000;
const int MAX_POS = 100;
... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using double = long double;
const int INF=1<<29;
const double EPS=1e-9;
const ll MOD = 1000000... |
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int x, p;
int main() {
cin >> x >> p;
cout << (x + 1) / 2 << endl;
return (0);
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int p, x;
std::cin >> p >> x;
std::cout << (x + 1) / 2;
}
|
p03901 CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel) - Takahashi is Missing! | Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki.
Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneou... | {
"input": [
"6\n40",
"101\n80",
"3\n100"
],
"output": [
"7.5000000",
"63.7500000",
"2.0000000"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
if (p == 100)
cout << (x / 2) + (x % 2) << ".000000\n";
else
cout << "poop\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.