```cpp
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m;
bool map[200][200];
int x1[9]={0,-2,-2,-1,1,2,2,1,-1};
```
int
```cpp
y1[9]={0,-1,1,2,2,1,-1,-2,-2};
long long f[50][50];
int main()
{
int x,y;
scanf("%d%d%d%d",&n,&m,&x,&y);
map[x+1][y+1]=true;
for(int i=1;i<=8;i++)
if(x1[i]+x>=0&&x1[i]+x<=n&&y1[i]+y<=m&&y1[i]+y>=0)
map[x1[i]+x+1][y1[i]+y+1]=1;
f[0][1]=1;
for(int i=1;i<=n+1;i++)
for(int j=1;j<=m+1;j++)
if(!map[i][j])
f[i][j]=f[i-1][j]+f[i][j-1];
else
f[i][j]=0;
printf("%lld",f[n+1][m+1]);
return 0;
}
```
by 笑歌自若 @ 2016-11-28 16:18:15
暴力100
```cpp
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
int n,v[20000],x[20000],vv,xx;
long long ans;
long long f() {
cin>>n;
for(int i=0;i<n;i++) {
cin>>v[i]>>x[i];
for(int j=0;j<i;j++) {
if(v[i]>v[j]) vv=v[i];
else vv=v[j];
xx=abs(x[i]-x[j]);
ans+=vv*xx;
}
}
cout<<ans;
return 0;
}
int main() {
f();
return 0;
}
```
by MOLGYPETER @ 2016-12-03 15:58:24
胡扯@ MOLGYPETER
by 星爵 @ 2017-08-09 19:16:50
@[星爵](/space/show?uid=35360)
暴力卡常100分。
# pragma GCC optimize "O3"
# pragma G++ optimize "O3"
```cpp
#include<cstdio>
#include<cctype>
#include<algorithm>
#define MAXN 20000
using namespace std;
struct Cow{
int v,x;
inline bool operator < (Cow tar){
return v<tar.v;
}
}cow[MAXN+1];
inline char get_char(){
static char buf[1000001],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int num=0;
char c;
while(isspace(c=get_char()));
while(num=num*10+c-48,isdigit(c=get_char()));
return num;
}
inline int Abs(int a){
int b=a>>31;
return (a+b)^b;
}
int main(){
int n=read();
long long ans=0;
for(int i=1;i<=n;++i) cow[i].v=read(),cow[i].x=read();
sort(cow+1,cow+n+1);
for(int i=1;i<=n;++i)
for(int j=1;j<i;++j)
ans+=cow[i].v*Abs(cow[i].x-cow[j].x);
printf("%lld",ans);
return 0;
}
```
by Creeper_LKF @ 2017-08-27 10:14:31
其实暴力真的有100
by Tyher @ 2018-01-06 17:22:26
开氧优化能过
by Foehn_Pioneer @ 2018-04-27 19:29:30