QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#578005 | #9136. Exponent Calculator | yhddd | WA | 0ms | 3556kb | C++20 | 1.9kb | 2024-09-20 15:58:00 | 2024-09-20 15:58:00 |
Judging History
answer
#include<bits/stdc++.h>
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
return x*f;
}
bool Mbe;
long double x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15;
int n=7,b=10;
void work(){
// cin>>x1;
// x1=x1*0.0009765625;
// x0=x1*0.0001984127;
// x0=x0+0.0013888889;
// x0=x0*x1;
// x0=x0+0.0083333333;
// x0=x0*x1;
// x0=x0+0.0416666667;
// x0=x0*x1;
// x0=x0+0.1666666667;
// x0=x0*x1;
// x0=x0+0.5000000000;
// x0=x0*x1;
// x0=x0+1.0000000000;
// x0=x0*x1;
// x0=x0+1.0000000000;
// printf("%.10Lf\n",x0);
// for(int i=1;i<=b;i++)x0=x0*x0;
puts("25");
puts("&1 = &1 * 0.0009765625");
puts("&0 = &1 * 0.0001984127");
puts("&0 = &0 + 0.0013888889");
puts("&0 = &0 * &1");
puts("&0 = &0 + 0.0083333333");
puts("&0 = &0 * &1");
puts("&0 = &0 + 0.0416666667");
puts("&0 = &0 * &1");
puts("&0 = &0 + 0.1666666667");
puts("&0 = &0 * &1");
puts("&0 = &0 + 0.5000000000");
puts("&0 = &0 * &1");
puts("&0 = &0 + 1.0000000000");
puts("&0 = &0 * &1");
puts("&0 = &0 + 1.0000000000");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
puts("&0 = &0 * &0");
}
// \
444
bool Med;
int T;
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// ios::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
// cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
T=1;
while(T--)work();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3556kb
input:
input
output:
25 &1 = &1 * 0.0009765625 &0 = &1 * 0.0001984127 &0 = &0 + 0.0013888889 &0 = &0 * &1 &0 = &0 + 0.0083333333 &0 = &0 * &1 &0 = &0 + 0.0416666667 &0 = &0 * &1 &0 = &0 + 0.1666666667 &0 = &0 * &1 &0 = &0 + 0.5000000000 &0 = &0 * &1 &0 = &0 + 1.0000000000 &0 = &0 * &1 &0 = &0 + 1.0000000000 &0 = &0 * &0...
result:
wrong answer Can't recognize op #1: '&1 = &1 * 0.0009765625' (in 1-indexation)