EntryPoint
codeprocessor.EntryPoint
Editor EntryPoint
fileedit.EntryPoint
Processor Class
tangentz.TZTester
code Template
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <utility>
using namespace std;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int d8[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};
const int d[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
typedef long long ll;
typedef pair<int, int> ii;
#define two(X) (1 << (X))
#define twoL(X) (1LL << (X))
#define contain(S, X) ((S & two(X)) != 0)
#define containL(S, X) ((S & twoL(X)) != 0)
template<class T> string x2s(T x) { ostringstream o; o << x; return o.str(); }
int s2i(string s) { istringstream i(s); int x; i >> x; return x; }
//long long s2ll(string s) { istringstream i(s); long long x; i >> x; return x; }
template<class T> T sqr(T a) { return a * a; }
template<class T> T gcd(T a, T b) { for (T c; b; c = a, a = b, b = c % b); return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> void out(const vector<T> &a)
{ int n = a.size(); for (int i = 0; i < n; ++i) cout << a[i] << " "; cout << endl; }
int countbit(int n) { return n == 0 ? 0 : 1 + countbit(n & (n - 1)); }
class $CLASSNAME$
{
public:
$RC$ $METHODNAME$($METHODPARMS$)
{
}
$TESTCODE$
};
// BEGIN CUT HERE
int main()
{
$CLASSNAME$ ___test;
___test.run_test(-1);
}
// END CUT HERE
- 1
- 2
前往页