func_code_string: #include <bits/stdc++.h>   const int MAXN = 1000;   int ba[MAXN], bb[MAXN];   int a, b, da, db, t, x, l1, l2;   int main() {     scanf( %d %d %d %d %d %d , &x, &t, &a, &b, &da, &db);     int tm = 0;     while (a >= 0) {       ba[l1++] = a;       a -= da;       tm++;       if (tm >= t) break;     }     tm = 0;     while (b >= 0) {       bb[l2++] = b;       b -= db;       tm++;       if (tm >= t) break;     }     for (int i = 0; i < l1; i++)       if (ba[i] == x) {         printf( YES n );         return 0;       }     if (x == 0) {       printf( YES n );       return 0;     }     for (int i = 0; i < l2; i++)       if (bb[i] == x) {         printf( YES n );         return 0;       }     for (int i = 0; i < l1; i++)       for (int j = 0; j < l2; j++)         if (ba[i] + bb[j] == x) {           printf( YES n );           return 0;         }     printf( NO n );     return 0;     return 0;   }   