Educational Codeforces Round 50: B Diagonal Walking v.2

Educational Codeforces Round 50: B Diagonal Walking v.2_第1张图片Educational Codeforces Round 50: B Diagonal Walking v.2_第2张图片

题目大意:一个人,可以向八个方向走,起点是(0,0),终点是(x,y),问k次是否可以走到,如果可以走到,

  最多可以走几次 斜线

思路:在纸上画画,各种情况讨论一下,就可以发现规律,分一下奇偶即可

#include
#include
#include
#include
#include
#include
#include
#include
#include
const int inf = 0x3f3f3f3f;
using namespace std;
const int N = 5e5+9;
const int mod = 1e9+7;
#define ll long long
ll a,b,c;
int n;
int main()
{
	//freopen("in.txt","r",stdin);
	int n;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%lld%lld%lld",&a,&b,&c);
		if(c

 

你可能感兴趣的:(codeforces,思维)