CodeFoeces-1256A

题目

原题链接:A. Payment Without Change

题意

问a个n和b个1可否组成s

代码

#include
int main(){
    int t,a,b,n,s;
    scanf("%d",&t); 
    while(t--){
        scanf("%d %d %d %d",&a,&b,&n,&s);
        int tmp = s/n;
        tmp = tmp >= a ? a : tmp;
        if( (s - (tmp * n)) <= b ){
            printf("YES\n");
        }else{
            printf("NO\n");
        }
    }
    return 0;
}

你可能感兴趣的:(CodeFoeces-1256A)