标签:没有 using span ble tput rip bsp 存在 sample
一个double型数据N(0<=N<=20000)
输出啤酒和饮料的罐数,如果存在多组结果按照啤酒数从大到小排列;如果没有解答输出"No Solution"
82.3
30 7 11 30
#include <cstdio> #include <iostream> #include <cmath> #include <algorithm> #include <string> #include <cstring> #include <queue> using namespace std; #define eps 1e-6 int main() { double n; int x, y, m = 0; queue<int>colo; queue<int>drink; scanf("%lf", &n); x = n/2.3; for(int i = x; i >0; i--) { y = (int)((n-(i*2.3))/1.9); //printf("%d : %lf\n", i, y*1.9+i*2.3); if(fabs(y*1.9+i*2.3-n) <= eps)//为什么这个判断得不到正确的结果 { printf("%d %d\n", i, y); m++; } } if(m == 0)printf("No Solution\n"); return 0; }
标签:没有 using span ble tput rip bsp 存在 sample
原文地址:https://www.cnblogs.com/RootVount/p/10356225.html