题意:往N*M的矩阵放置 半径为R的圆,再也不能放则输。
first能放则first win。因为此后first能根据second对称摆放。(思路)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
typedef long long LL;
const int MAXN = 130;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int main()
{
int a,b,r;
cin>>a>>b>>r;
r*=2;
if(r<=a&&r<=b) puts("First");
else puts("Second");
}