QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#352611 | #5103. Fair Division | PorNPtree# | WA | 6ms | 4040kb | C++14 | 1.0kb | 2024-03-13 14:10:00 | 2024-03-13 14:10:00 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
__float128 mypow(__float128 t, int n)
{
__float128 z = 1;
for (int i = 1; i <= n; ++i) {
z *= t;
}
return z;
}
__float128 floor(__float128 x)
{
return floor((double)x + 0.5);
}
__float128 fabs(__float128 x)
{
return x > 0 ? x : -x;
}
signed main()
{
int n;
long long m;
scanf("%d%lld", &n, &m);
if (n < 100) {
for (int q = 2; q <= 100; ++q) {
for (int p = q - 1; p; --p) {
__float128 t = (__float128)p / q, now = m * (1 - t) / (1 - mypow(t, n));
int flg = (fabs(now - floor(now)) < 1e-6);
for (int z = 1; z < n; ++z) {
now *= t;
flg &= (fabs(now - floor(now)) < 1e-6);
}
if (flg) {
printf("%d %d\n", q - p, q);
return 0;
}
}
}
}
puts("impossible");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3780kb
input:
13 382475111752106101
output:
17 28
result:
ok single line: '17 28'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
15 227368755046033249
output:
13 14
result:
ok single line: '13 14'
Test #4:
score: 0
Accepted
time: 0ms
memory: 4040kb
input:
27 72027091647987988
output:
1 4
result:
ok single line: '1 4'
Test #5:
score: -100
Wrong Answer
time: 6ms
memory: 3608kb
input:
12 817283057828223168
output:
impossible
result:
wrong answer 1st lines differ - expected: '10 17', found: 'impossible'