希望更丰富的展现?使用Markdown
by nofall @ 2019-01-25 20:18:12
希望更丰富的展现?使用Markdown
by Methylene_Blue @ 2019-01-25 20:21:18
```cpp
//代码:
#include<bits/stdc++.h>
using namespace std;
#define RE(i,st,ed) for(register int i=st;i<=ed;++i)
#define RES(i,st,ed) for(register int i=ed;i>=st;--i)
int ap[81][81];
int bin[81][81],res[81],fnal[81],jkl,i,j,x,y,n,lx,ly,plh[81],plt[81];
/*void add()
{
x=0;
RE(i,1,80)
{
y=eax[i]+ebx[i]+x;
res[i]=y%10;
x=y/10;
}
}
void eql()
{
RE(i,1,80)
{
y=eax[i]*jkl+x;
res[i]=y%10;
x=y/10;
}
}*/
int main()
{
x=0;
RE(i,0,80)
{
RE(j,0,80)
{
bin[i][j]=0;
}
}
bin[0][1]=1,bin[1][1]=2;
RE(i,1,79)
{
RE(j,1,80)
{
y=bin[i][j]+bin[i][j]+x;
bin[i+1][j]=y%10;
x=y/10;
}
}
cin>>lx>>ly;
RE(i,1,lx)
{
RE(j,1,ly)
{
cin>>ap[i][j];
}
}
RE(i,1,lx)
{
plh[i]=1,plt[i]=ly;
}
RE(j,1,ly)
{
RE(i,1,lx)
{
if(ap[i][plh[i]]>ap[i][plt[i]]&&plt[i]>plh[i])
{
jkl+=ap[i][plt[i]],--plt[i];
}
else
{
jkl+=ap[i][plh[i]],++plh[i];
}
}
x=0;
RE(i,1,80)
{
y=jkl*bin[j][i]+x;
res[i]=y%10;
x=y/10;
}
x=0,jkl=0;
RE(i,1,80)
{
y=res[i]+fnal[i]+x;
fnal[i]=y%10;
x=y/10;
}
}
RES(i,1,80)
{
if(fnal[i]!=0)
{
n=i;
break;
}
}
RES(i,1,n)
{
cout<<fnal[i];
}
}
```
by 树行云 @ 2019-01-25 20:21:32
你这是哪个运算的,我倒是可以给你发一个我自己做的……
by 老子是北瓜 @ 2019-01-25 20:22:30
@[老子是白菜](/space/show?uid=121813) 请大家忽视这条消息
by 老子是北瓜 @ 2019-01-25 20:23:52
@[老子是白菜](/space/show?uid=121813) 真的不知道是哪里出了问题QAQ单独的高精运算都过了……
by 树行云 @ 2019-01-25 20:29:01
@[老子是白菜](/space/show?uid=121813) [自己](/space/show?uid=106235)@[自己](/space/show?uid=106235)
by 绝顶我为峰 @ 2019-01-25 20:35:31
f**k
by 绝顶我为峰 @ 2019-01-25 20:35:47
用啥高精度,__int128多好
by NaCly_Fish @ 2019-01-25 20:37:03
233333
by Zyque @ 2019-01-25 20:37:20