Codeforces Round #598 (Div. 3) A,B,C,D{E,F待补}
A. Payment Without Change 1 #include<bits/stdc++.h> 2 3 using namespace std; 4 #define int long long 5 #define N 100500 6 int arr[N]; 7 signed main(){ 8 int _; 9 cin>>_; 10 while(_--){ 11 int a,b,n,s; 12 cin>>a>>b>>n>>s; 13 int y=s/n; 14 int x=min(a,y); 15 s-=x*n; 16 if(b>=s){ 17 printf("YES\n"); 18 } else{ 19 printf("NO\n"); 20 } 21 } 22 return 0; 23 } B. Minimize the Permutation 按照题意暴力就行。从1到n枚举，每个数尽量地往前和比他大的数交换。并且保证相邻的位置只能换一次。【比赛·的时候读错题意，还想错了思路QAQ难受====】 1 #include<bits/stdc++.h> 2 3 using namespace std; 4 #define int long long 5 #define N 150 6 int arr[N];int vis[N]; 7 signed main(){ 8 int