UVa 11323 Satisfying Constraints

我就判了一下是否每一个都有整数解就完了，居然过了。。。。。

//
//  Created by  CQU_CST_WuErli
//  Copyright (c) 2015 CQU_CST_WuErli. All rights reserved.
//
// #include<bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <sstream>
#define CLR(x) memset(x,0,sizeof(x))
#define OFF(x) memset(x,-1,sizeof(x))
#define MEM(x,a) memset((x),(a),sizeof(x))
#define For_UVa if (kase!=1) cout << endl
#define BUG cout << "I am here" << endl
#define lookln(x) cout << #x << "=" << x << endl
#define SI(a) scanf("%d",&a)
#define SII(a,b) scanf("%d%d",&a,&b)
#define SIII(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define rep(flag,start,end) for(int flag=start;flag<=end;flag++)
#define Rep(flag,start,end) for(int flag=start;flag>=end;flag--)
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
#define Root 1,n,1
#define BigInteger bign
template <typename T> T max(T& a,T& b) {return a>b?a:b;}
template <typename T> T min(T& a,T& b) {return a<b?a:b;}
int gcd(int a,int b) {return b==0?a:gcd(b,a%b);}
long long gcd (long long a,long long b) {return b==0LL?a:gcd(b,a%b);}
const int MAX_L=2005;// For BigInteger
const int INF_INT=0x3f3f3f3f;
const long long INF_LL=0x7fffffff;
const int MOD=1e9+7;
const double eps=1e-9;
const double pi=acos(-1);
typedef long long  ll;
using namespace std;

int main(){
#ifdef LOCAL
    freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);
//  freopen("C:\\Users\\john\\Desktop\\out.txt","w",stdout);
#endif
    int t;cin >> t;
    while(t--) {
        int n,m,k;
        cin >> n >> m >> k;
        int A,I,B,J,C;
        int flag=1;
        rep(i,1,m) {
            cin >> A >> I >> B >> J >> C;
            if (!flag) continue;
            int ok=0;
            if (A==0 && B==0) {
                if (C==0) ok=1;
                else ok=0;
            }
            else if (A==0 && B!=0) {
                if (C%B==0 && C/B<=k && C/B>=1) {
                    ok=1;
                }
                else ok=0;
            }
            else if (A!=0 && B==0) {
                if (C%A==0 && C/A<=k && C/A>=1) {
                    ok=1;
                }
                else ok=0;
            }
            else if (A!=0 && B!=0 && C%__gcd(A,B)==0) {
                rep(j,1,k) {
                    if ((C-A*j)%B==0 && (C-A*j)/B>=1 && (C-A*j)/B<=k)
                        ok=1;
                    if ((C-B*j)%A==0 && (C-B*j)/A>=1 && (C-B*j)/A<=k) 
                        ok=1;
                    if (ok) break;
                }
            }
            if (ok==0) flag=0;
        }
        if (flag) cout << "yes" << endl;
        else cout << "no" << endl;
    }
    return 0;
}