求助求助!!

P1548 [NOIP1997 普及组] 棋盘问题

希望更丰富的展现?使用Markdown
by 庄庄庄庄乜 @ 2018-11-03 16:56:55


```cpp #include<cstdio> //#include<cmath> using namespace std; long long l,s,N,M,a/*正方形(个数)*/,as/*边长*/,b/*矩形*/,bs/*长*/,bss/*宽*/; int main(){ scanf("%lld%lld",&N,&M); l=N;s=M;if(N<M){l=M;s=N;} for(as=1;as<=s;as++){a=a+(l-as+1)*(s-as+1);} for(bs=1;bs<=l;bs++){for(bss=1;bss<=s;bss++){ if(bs!=bss){b=b+(l-bs+1)*(s-bss+1);} }} printf("%lld %lld",a,b); return 0; } ```
by SS003 @ 2019-05-18 08:17:35


@[SS003](/space/show?uid=94621) 暴力大法好!
by SS003 @ 2019-05-18 08:17:56


# 暴力解法 ```cpp #include<cstdio> using namespace std; int main() { int n,m; scanf("%d %d",&n,&m); int zheng=0,chang=0,a; if(n>m) a=m; else a=n; for(int i=0;i<a;i++) zheng+=(n-i)*(m-i); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) chang+=(n-i+1)*(m-j+1); } chang-=zheng; printf("%d %d",zheng,chang); } ```
by 爱嘤撕毯 @ 2020-02-23 13:17:33


|