06 2015 档案

【高精度运算】加,减,乘,比较
摘要: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 阅读(291) 评论(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 阅读(602) 评论(0) 推荐(0)

【设计模式】Prototype Pattern
摘要:main.cpp#include "Prototype.h"#include using namespace std;int main(int argc, char *argv[]) { Prototype *p = new ConcreatePrototype(); Proto... 阅读全文

posted @ 2015-06-14 18:12 Susake 阅读(243) 评论(0) 推荐(0)

【设计模式】Singleton Pattern
摘要:main.cpp#include "Singleton.h"#include using namespace std;int main(int argc, char *argv[]) { Singleton *sgn = Singleton::Instance(); return... 阅读全文

posted @ 2015-06-13 17:16 Susake 阅读(231) 评论(0) 推荐(0)

【设计模式】AbstractFactory
摘要:main.cpp#include "AbstractFactory.h"#include "Product.h"#include using namespace std;int main(int argc, char *argv[]) { AbstractFactory *cf1 = ... 阅读全文

posted @ 2015-06-10 17:30 Susake 阅读(213) 评论(0) 推荐(0)

【设计模式】Factory Pattern
摘要:main.cpp#include "Factory.h"#include "Product.h"#include using namespace std;int main(int argc, char *argv[]) { Factory *fac = new ConcreateFac... 阅读全文

posted @ 2015-06-09 17:15 Susake 阅读(252) 评论(0) 推荐(0)

导航