CF 509A(Maximum in Table-暴力)
来源:互联网 发布:乳液 知乎 编辑:程序博客网 时间:2024/06/15 06:07
暴力即可
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include<cctype>#include<ctime>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Forpiter(x) for(int &p=iter[x];p;p=next[p]) #define Lson (x<<1)#define Rson ((x<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (2139062143)#define F (100000007)#define MAXN (10+10)long long mul(long long a,long long b){return (a*b)%F;}long long add(long long a,long long b){return (a+b)%F;}long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}typedef long long ll;int n;int a[MAXN][MAXN];int main(){//freopen("Table.in","r",stdin);//freopen(".out","w",stdout);cin>>n;For(i,n) a[i][1]=a[1][i]=1;Fork(i,2,n)Fork(j,2,n) a[i][j]=a[i-1][j]+a[i][j-1];cout<<a[n][n];return 0;}
0 0
- CF 509A(Maximum in Table-暴力)
- A. Maximum in Table
- A. Maximum in Table
- A - Maximum in Table
- CodeForces 509A Maximum in Table
- 【水题】 Codeforces Round #289 509A Maximum in Table
- codeforces——509A—— Maximum in Table
- cf 323 A. GCD Table (还原gcd_暴力)
- cf 55A(暴力 )
- A. Maximum in Table( Codeforces Round #289)
- Codefroces 289 div2 A.Maximum in Table (打表)
- Codeforces Maximum in Table
- cf-348A 二分暴力
- CF 568A 数学 暴力
- cf 102 A(暴力)
- CF 71C Round Table Knights 暴力
- cf 582A GCD Table
- cf#276-B - Maximum Value- (数学+暴力)/(二分)
- iOS开发之32bit转64bit需要注意的地方
- Dbgprint
- 6. GCD Block
- MongoDB 那些坑
- bzoj 2761 不重复数字
- CF 509A(Maximum in Table-暴力)
- hadoop基础----hadoop理论(一)----Hadoop简介
- SDUT 2857-艺术联合会(dp)
- 分布式Hadoop安装入门(3)——安装jdk
- dmidecode
- flex css选择器学习
- 界面设计代码收集
- java 实现word 转PDF (采用第三方技术 IText、Poi、Jsoup)
- 美国13509个城镇的经纬度和TSP旅行商回路