Vingying | 赤红幻想

完全适用我的电脑……不知道为啥我的电脑总会有这样那样的问题……

#include <bits/stdc++.h>
#include <windows.h>
using namespace std;
int main()
{
	system("g++ makedata.cpp -o data -O2");
	system("g++ std.cpp -o std -O2");
	system("g++ test.cpp -o test");
	clock_t st, ed;
	for (int i = 1; i <= 10000000; i++)
	{
		printf("%d\n", i);
		//Sleep(1000);
		system("data");
		system("std");
		st = clock();
		system("test");
		ed = clock();
		printf("Time used:%lfs\n", (double)(ed - st) / CLOCKS_PER_SEC);
		int k = system("fc my.out std.out");
		if (k) printf("WA\n"),system("pause");
		else printf("AC\n");
	}
	return 0;
}

#include <bits/stdc++.h>

#include <windows.h>

using namespace std;

int main()

{

system("g++ makedata.cpp -o data -O2");

system("g++ std.cpp -o std -O2");

system("g++ test.cpp -o test");

clock_t st, ed;

for (int i = 1; i <= 10000000; i++)

{

printf("%d\n", i);

//Sleep(1000);

system("data");

system("std");

st = clock();

system("test");

ed = clock();

printf("Time used:%lfs\n", (double)(ed - st) / CLOCKS_PER_SEC);

int k = system("fc my.out std.out");

if (k) printf("WA\n"),system("pause");

else printf("AC\n");

}

return 0;

}

赤红幻想

The Deep Red Fantasy

标签归档：Vingying

[POI2015]Odwiedziny

Codeforces Round #634(Div.3) 解题报告

[Codeforces Round #307(Div.2)] 551E-GukiZ and GukiZiana

[Codeforces Round #323(Div.1)] 582C-Superior Periodic Subarrays

Codeforces Round #629(Div.3) 解题报告

[Codeforces Round #538(Div.2)] 1114F-Please, another Queries on Array?

Codeforces Round #333(Div.1) 解题报告

记录一下dg的对拍板子

[Codeforces Round #334(Div.1)] 603E-Pastoral Oddities

Codeforces Round #627(Div.3) 解题报告