OJ Board

Code: Select all

#include <algorithm>
#include <bitset>
#include <cstring>
#include <cctype>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <stdio.h>
#include <sstream>
#include <utility>
#include <vector>
#define INT_MAX 2147483647
#define INT_MIN -2147483648
#define pi acos(-1.0)
#define N 1000000
#define LL long long

using namespace std;

int main()
{
    int roads,numbers;
    int i = 1;
    while(1)
    {
        cin>>roads>>numbers;
        if(roads==0 && numbers == 0)
        {
            break;
        }

        if(roads<numbers)
        {
            cout<<"Case "<<i<<": 0\n";
            i++;
            continue;
        }
        double temp = roads - numbers;
        if(temp<numbers && roads>numbers)
        {
            cout<<"Case "<<i<<": 1\n";
            i++;
            continue;
        }
        double answer = temp / numbers;
        if(answer>26)
        {
            cout<<"Case "<<i<<": impossible\n";
        }
        else
            cout<<"Case "<<i<<":"<<ceil(answer)<<"\n";
    i++;
    }
return 0;
}