Description

Input

一個double型數據N(0<=N<=20000)

Output

輸出啤酒和飲料的罐數，如果存在多組結果按照啤酒數從大到小排列；如果沒有解答輸出"No Solution"

Sample Input

82.3

Sample Output

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;
}

SDNU 1309.啤酒和飲料