Timus Problem 1009(K-based Numbers) Solution

Timus Problem Solution


Problem details link: http://acm.timus.ru/problem.aspx?space=1&num=1009

Problem Description: This is a straightforward problem check validity of K-based numbers.

Problem Solution:

#include <stdio.h>

  int main()

  {

      int m[1009],n,k;

      scanf("%d %d",&n,&k);

  m[1] = k-1;

         m[2] = k*(k-1);

         for (int i = 3; i <=n; i++)

        {

            m[i] = (m[i-1]+m[i-2])*(k-1);

        }

           printf("%d",m[n]);

    return 0;

    }

 

0 Comments

You may find interest following article

Complete Guide: Create Laravel Project in Docker Without Local Dependencies

, , , | 0 Comments

Create Laravel Project Through Docker — No Need to Install PHP, MySQL, or Apache on Your Local Machine In this tutorial, I’ll show you how to create and run a full Laravel project using Docker containers. That means you won’t have to install PHP, MySQL, or Apache locally on your computer. By the end of this guide, you’ll have a fully functional Laravel development...