QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#90200 | #5253. Denormalization | chiranko# | AC ✓ | 482ms | 3916kb | C++14 | 881b | 2023-03-22 14:49:28 | 2023-03-22 14:49:32 |
Judging History
answer
#include<bits/stdc++.h>
#define rep(l,r) for(int i=l;i<=r;i++)
#define jrep(l,r) for(int j=l;j<=r;j++)
using namespace std;
typedef long double LD;
typedef long long ll;
const int N=1e4+10;
int n;
double a[N],b[N];
int c[N];
double p[N];
bool check(int x)
{
c[1]=x;
rep(2,n)c[i]=round(b[i]*c[1]);
int d=c[1];
rep(1,n)d=__gcd(c[i],d);
rep(1,n)c[i]/=d;
rep(1,n)if(c[i]>10000)return false;
double q=0;
rep(1,n)q+=c[i]*c[i];
q=sqrt(q);
rep(1,n)p[i]=c[i]/q;
rep(1,n)if(fabs(a[i]-p[i])>1e-6)return false;
return true;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
rep(1,n)cin>>a[i];
rep(1,n)b[i]=a[i]/a[1];
// rep(1,n)cout<<b[i]<<"\n";
rep(1,10000)if(check(i))
{
jrep(1,n)cout<<c[j]<<"\n";
//jrep(1,n)cout<<p[j]<<"\n";
return 0;
}
assert(false);
return 0;
}
/*
2
0.707107
0.707107
*/
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3516kb
input:
2 0.909840249060 0.414958698174
output:
1127 514
result:
ok good solution
Test #2:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
3 0.005731604132 0.696198848562 0.717826101486
output:
22 2672 2755
result:
ok good solution
Test #3:
score: 0
Accepted
time: 3ms
memory: 3516kb
input:
10 0.338936215010 0.390914583549 0.048893426174 0.446152513833 0.137891103101 0.017985796057 0.459132554353 0.201452557127 0.362800863500 0.358493585479
output:
5823 6716 840 7665 2369 309 7888 3461 6233 6159
result:
ok good solution
Test #4:
score: 0
Accepted
time: 3ms
memory: 3448kb
input:
100 0.027828573352 0.034289446708 0.021442608673 0.002752893865 0.091163859407 0.180717182268 0.012097751269 0.101332712254 0.087249881055 0.112643922419 0.016667180541 0.108449036530 0.050488448020 0.104216696303 0.120734059490 0.090096410766 0.066537631979 0.046668105514 0.174836851156 0.084908984...
output:
1486 1831 1145 147 4868 9650 646 5411 4659 6015 890 5791 2696 5565 6447 4811 3553 2492 9336 4534 5302 193 5082 58 1438 4729 3774 542 5876 1641 5574 1443 9374 7710 9570 1413 3054 396 2768 8066 1774 1546 9548 1546 8339 411 3862 3496 3418 8165 4760 7829 4709 8174 8816 4396 7811 8148 2957 1239 1857 4361...
result:
ok good solution
Test #5:
score: 0
Accepted
time: 482ms
memory: 3756kb
input:
10000 0.014153431495 0.006246805276 0.014846752535 0.008905976745 0.012146085543 0.003020528319 0.010107617948 0.005218062088 0.014054879627 0.009239669913 0.008637984822 0.013371932468 0.009493829995 0.005771335736 0.002264963994 0.010799210007 0.015999982294 0.014564928771 0.001206828144 0.0056243...
output:
7094 3131 7442 4464 6088 1514 5066 2615 7045 4631 4330 6702 4759 2893 1135 5413 8020 7300 605 2819 16 5847 5532 6569 1285 1881 3751 6385 1796 7131 3304 7577 8320 4658 7982 3658 5939 7340 7269 805 2257 3556 7435 2399 986 3253 1854 6207 5092 455 7604 3818 6733 1433 2669 636 3423 3718 5917 4156 3472 41...
result:
ok good solution
Test #6:
score: 0
Accepted
time: 3ms
memory: 3776kb
input:
10000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.010000000000 0.0100000...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok good solution
Test #7:
score: 0
Accepted
time: 6ms
memory: 3908kb
input:
10000 0.000001731921 0.000003463842 0.000005195763 0.000006927684 0.000008659605 0.000010391525 0.000012123446 0.000013855367 0.000015587288 0.000017319209 0.000019051130 0.000020783051 0.000022514972 0.000024246893 0.000025978814 0.000027710735 0.000029442656 0.000031174576 0.000032906497 0.0000346...
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 ...
result:
ok good solution
Test #8:
score: 0
Accepted
time: 2ms
memory: 3488kb
input:
2 0.447213595500 0.894427191000
output:
1 2
result:
ok good solution
Test #9:
score: 0
Accepted
time: 2ms
memory: 3540kb
input:
2 0.707142137409 0.707071423196
output:
9725 9724
result:
ok good solution
Test #10:
score: 0
Accepted
time: 2ms
memory: 3440kb
input:
2 0.000100000000 0.999999995000
output:
1 10000
result:
ok good solution
Test #11:
score: 0
Accepted
time: 4ms
memory: 3724kb
input:
10000 0.000001000050 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.010000500037 0.0100005...
output:
1 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 1000...
result:
ok good solution
Test #12:
score: 0
Accepted
time: 5ms
memory: 3916kb
input:
10000 0.009999000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.010000000100 0.0100000...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok good solution