oj.uz

Submission #2645

# Submission time Handle Problem Language Result Execution time Memory
2645 2013-07-30T04:10:26 Z tncks0121 새로운 달력 (GCJ12KOR_calendar) C++
25 / 25
 0 ms 1676 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <assert.h>
#include <memory.h>
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef long double llf;

int TC, TCC;
ll A; int B, C;
bool used[200];
ll sum[200];

int main() {
    int i, j;

    scanf("%d", &TC);
    while(++TCC <= TC) {
        memset(used, 0, sizeof used);
        memset(sum, 0, sizeof sum);

        scanf("%lld%d%d", &A, &B, &C);

        int t = C-1;
        int l = 0;
        for(l = 0; l <= C; l++) {
            int e = (t + B) % C;
            if(used[e]) { --l; break; }
            used[e] = true;
            if(l > 0) sum[l] = sum[l-1] + (ll)ceil((double)(t+B+1)/C);
            else sum[l] = (ll)ceil((double)B/C);
            t = e;
        }

        ll res = 0;

        res = sum[l] * (A / (l+1));
        if(A % (l+1) > 0) res += sum[A % (l+1) - 1];

        printf("Case #%d: %lld\n", TCC, res);
/*        for(i = 0; i <= l; i++) printf("%lld ", sum[i]);
        puts("");
 */
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct