【高精度运算】加，减，乘，比较
摘要：
void Susake_add(char *s1, char *s2) { int len1 = strlen(s1), len2 = strlen(s2), len, i; int a[N] = {0}, b[N] = {0}; for(i = 0; i len2 ? l... 阅读全文
posted @ 2015-06-17 15:45 Susake 阅读(271) 评论(0) 推荐(0) 编辑
【动态规划】The least round way
摘要：
B. The least round waytime limit per test5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputThere is a square matrix n ... 阅读全文
posted @ 2015-06-17 15:39 Susake 阅读(587) 评论(0) 推荐(0) 编辑
