当前位置: 首页>>代码示例>>C++>>正文


C++ BombSweeper::winPercentage方法代码示例

本文整理汇总了C++中BombSweeper::winPercentage方法的典型用法代码示例。如果您正苦于以下问题:C++ BombSweeper::winPercentage方法的具体用法?C++ BombSweeper::winPercentage怎么用?C++ BombSweeper::winPercentage使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在BombSweeper的用法示例。


在下文中一共展示了BombSweeper::winPercentage方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: test1

double test1() {
	string t0[] = {"BBBBB",
 "B...B",
 "B...B",
 "B...B",
 "BBBBB"};
	vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
	BombSweeper * obj = new BombSweeper();
	clock_t start = clock();
	double my_answer = obj->winPercentage(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	double p1 = 5.882352941176471;
	cout <<"Desired answer: " <<endl;
	cout <<"\t" << p1 <<endl;
	cout <<"Your answer: " <<endl;
	cout <<"\t" << my_answer <<endl;
	if (p1 != my_answer) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
开发者ID:harshit-knit,项目名称:myTopCoder,代码行数:27,代码来源:BombSweeper.cpp

示例2: test3

int test3() {
    vector<string> board = {".........................", ".........................", ".........................", "........................."};
    BombSweeper* pObj = new BombSweeper();
    clock_t start = clock();
    double result = pObj->winPercentage(board);
    clock_t end = clock();
    delete pObj;
    double expected = 100.0;
    if(result == expected) {
        cout << "Test Case 3: Passed! Time: " << static_cast<double>(end-start)/CLOCKS_PER_SEC << " seconds" << endl;
        return 0;
    } else {
        cout << "Test Case 3: Failed! Time: " << static_cast<double>(end-start)/CLOCKS_PER_SEC << " seconds" << endl;
        return 1;
    }
}
开发者ID:rick-qiu,项目名称:topcoder,代码行数:16,代码来源:srm156_bombsweeper.cpp


注:本文中的BombSweeper::winPercentage方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。