UVA 11934 Magic Formula Solution

Solve in C:

#include<stdio.h>
int main()
{
   int a,b,c,d,l,i,count=0,n;
   while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&l)!=EOF)
   {
    if(a==0&&b==0&&c==0&&d==0&&l==0)
    break;
    for(i=0;i<=l;i++)
    {

        n=a*(i*i)+(b*i)+c;
        {
            if(n%d==0)
            count++;
        }
    }
        printf("%d\n",count);
        count=0;

   }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.