Codeforces 148A Insomnia cure Solution

Solve in C:


#include<stdio.h>
int main()
{

    int k,l,m,n,d,count=0,i;
    while(scanf("%d%d%d%d%d",&k,&l,&m,&n,&d)!=EOF)
    {
        for(i=1; i<=d; i++)
        {
            if(i%k==0||i%l==0||i%m==0||i%n==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.