Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define d(x) cout << #x << " = " << (x) << endl;
- #define fr freopen("in.txt", "r", stdin);
- #define fw freopen("out.txt", "w", stdout);
- #define mem(x) memset((x), 0, sizeof((x)));
- #define pb push_back
- #define LL long long
- #define fastIO ios_base::sync_with_stdio(false)
- #define sf scanf
- #define pf printf
- #define SQR(x) ((x)*(x))
- #define sc1(x) scanf("%d", &x)
- #define scb(x, y) scanf("%d %d", &x, &y)
- #define sc3(x, y, z) scanf("%d %d %d", &x, &y, &z)
- #define FOR(i, x, y) for(int i=int(x); i<int(y); i++)
- #define ROF(i, x, y) for(int i=int(x-1); i>=int(y); i--)
- #define all(c) (c.begin(), c.end())
- #define unq(v) sort(all(v)), (v).erase(unique(all(v)),v.end())
- #define EPSILON (1.0E-8)
- #define siz 100000
- long long int fact(long long int n){
- long long int ans = 1;
- for(long long int i = 1; i <= n; i++){
- ans *= i;
- }
- return ans;
- }
- long sum(long long ara[], long n){
- double sum = 0;
- for(int i = 0; i < n; i++){
- sum += ara[i];
- }
- return sum;
- }
- int main(){
- #ifndef ONLINE_JUDGE
- clock_t tStart = clock();
- freopen("in.txt", "r", stdin);
- freopen("out.txt", "w", stdout);
- #endif
- int r, n;
- int tr = 0;
- while(cin >> r >> n and n and r){
- tr++;
- printf("Case %d: ", tr);
- int possible_names = (n*26)+n;
- if(possible_names < r){
- printf("impossible\n");
- continue;
- }
- r -= n;
- double ans = ceil((1.0*r)/(1.0*n));
- // printf("%0.0lf\n", ans);
- cout << abs(ans) << endl;
- }
- #ifndef ONLINE_JUDGE
- printf("\n>>Time taken: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
- #endif
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement