UVA Problem 10254 ( The Priest Mathematician) Solution

Problem Solving, UVa

 

 

#include <bits/stdc++.h>



using namespace std;



int main()



{

    int s,n;

    int first_term,last_term;

   

    while (scanf("%d", &s), s != -1)

    {

        int n_sum =(int)sqrt(2*s);

       

        for (n = n_sum ; n > 0; n--)

       

         {

            if ( (2 * s + n - n * n) % (2 * n) == 0 )

           

            {

           

             first_term =  (2 * s + n - n * n) / (2 * n);

              last_term  =  first_term + n - 1;

           

            break;



            }

        }

        printf("%d = %d + ... + %d\n", s, first_term, last_term);

//    return 0*    printf("%d = %d + ... + %d\n", s, a, last_term);

    }



    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...