codeforces 390D Inna and Sweet Matrix
2014-02-23 13:57
393 查看
几个小结论:
1.路径长度=i+j-1;
2.最简单的走法是先横走再竖着走或者先竖着走再横着走
View Code
1.路径长度=i+j-1;
2.最简单的走法是先横走再竖着走或者先竖着走再横着走
#include<cstdio> #include<cstring> using namespace std; void print(int x,int y) { for(int i=1; i<=y; i++) printf("(1,%d) ",i); for(int i=2; i<=x; i++) printf("(%d,%d) ",i,y); printf("\n"); } int main() { int n,m,k; scanf("%d%d%d",&n,&m,&k); int cnt=0; int ans=0; int l,i; for(l=2;; l++) { for(i=1; i<=n&&i<l; i++) { if(l-i>m)continue; ans+=l-1; cnt++; if(cnt>=k)break; } if(cnt>=k)break; } printf("%d\n",ans); // printf("%d %d\n",l,i); for(; i>=1; i--) { if(l-i>m)break; print(i,l-i); } l--; for(; l>=2; l--) for(i=1; i<l&&i<=n; i++) { if(l-i>m)continue; print(i,l-i); } return 0; }
View Code
相关文章推荐
- Codeforces 390 E. Inna and Large Sweet Matrix
- codeforces 400C - Inna and Huge Candy Matrix(耐心找规律,细节还是要注意的)
- Codeforces 400C Inna and Huge Candy Matrix
- CF 390E - Inna and Large Sweet Matrix(TODO)
- Codeforces 400 B. Inna and New Matrix of Candies 【 Codeforces Round #234 (Div. 2)】
- Codeforces 400 C. Inna and Huge Candy Matrix【 Codeforces Round #234 (Div. 2)】
- codeforces 400B - Inna and New Matrix of Candies
- Codeforces 400B Inna and Huge Candy Matrix(模拟)
- codeforces 400C - Inna and Huge Candy Matrix
- Codeforces 400B Inna and New Matrix of Candies 【模拟】
- Codeforces 400 C. Inna and Huge Candy Matrix
- Codeforces 400C Inna and Huge Candy Matrix 【模拟】
- codeforces 400 C Inna and Huge Candy Matrix【模拟】
- Codeforces 400C Inna and Huge Candy Matrix(模拟)
- Codeforces #229 D2D: Inna and Sweet Matrix
- codeforces 400C Inna and Huge Candy Matrix
- CF 390D:Inna and Sweet Matrix
- Inna and New Matrix of Candies(CodeForces - 400B)
- CF390-E. Inna and Large Sweet Matrix(区间更新+区间查询)
- CodeForces 374 B. Inna and Nine