Editorial for CCC '17 J2 - Shifty Sum

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

Multiply n by 10 k times, and print the sum of the resulting products.

Time Complexity: \mathcal O (k)

Solution — D

import std.stdio;

int k;
long n, ans;
void main() {
    scanf("%lld%d", &n, &k);
    for(int i=0;i<=k;n*=10, i++)
        ans += n;
    printf("%lld", ans);


There are no comments at the moment.