# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
659868 | Savu_Stefan_Catalin | 송금 (JOI19_remittance) | C++14 | 186 ms | 31564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
using namespace std;
long long e[1005005],i,ok1,ok2,a[1005005],b[1005005],n,d[1005005],pp[1001],f[1000005],p,ppp[1001],poz1,poz2,poz3;
void make()
{
long long t=0,i;
for (i=1;(i<=e[0]||t)&&i<=1005004;++i)
{
e[i]+=t;
t=0;
if (e[i]>=0) {t=e[i]/2; e[i]%=2;}
else {t=(e[i]-1)/2; e[i]=(e[i]%2+2)%2;}
}
e[0]=i-1;
if (i>1005000) e[0]=1,e[1]=-1;
else while (e[e[0]]==0&&e[0]!=0) e[0]--;
}
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
ppp[0]=1;
for (i=1;i<=50;++i)
ppp[i]=2*ppp[i-1];
cin>>n;
for (i=1;i<=n;++i)
{
cin>>a[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |