QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#285486 | #5253. Denormalization | light_ink_dots# | WA | 1ms | 3692kb | C++14 | 780b | 2023-12-16 19:38:24 | 2023-12-16 19:38:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
static const int maxn = 10010;
int n;
scanf("%d", &n);
static double x[maxn];
for (int i = 1; i <= n; i++) scanf("%lf", x + i);
for (int a = 1; a <= 10000; a++) {
double s = a / x[1];
if (s * s - (int)(s * s) >= 1e-2)
continue;
static int ans[maxn];
ans[1] = a;
bool flag = true;
for (int i = 2; i <= n; i++) {
ans[i] = x[i] * s;
if (ans[i] - (int)ans[i] >= 1e-2) {
flag = false;
break;
}
}
if (flag) {
for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
return 0;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3692kb
input:
2 0.909840249060 0.414958698174
output:
25 11
result:
wrong answer incorrect solution