Insomnia cure
来源:互联网 发布:大学生网络兼职 编辑:程序博客网 时间:2024/06/01 09:32
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output the number of damaged dragons.
123412
12
234524
17
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
#include<stdio.h>int main(){int k,l,m,n,d,sum=0,an[100005]={0};scanf("%d%d%d%d%d",&k,&l,&m,&n,&d);for(int i=k;i<=d;i+=k)an[i]=1;for(int i=l;i<=d;i+=l)an[i]=1;for(int i=m;i<=d;i+=m)an[i]=1;for(int i=n;i<=d;i+=n)an[i]=1;for(int i=1;i<=d;i++){if(an[i])sum++;}printf("%d",sum);return 0;}
- Insomnia cure
- Insomnia cure
- A. Insomnia cure
- 148A - Insomnia cure
- 148A - Insomnia cure
- CF148 A Insomnia cure
- Coderforces Insomnia cure
- Insomnia cure CodeForces
- [Codeforces] 148A - Insomnia cure
- CodeForces-148A-Insomnia cure
- CodeForces 148A Insomnia cure
- codeforces-148A-Insomnia cure
- codeforce 148->A. Insomnia cure
- codeforces 148A Insomnia cure
- Problem--148A--Codeforces--A. Insomnia cure
- codeforces 148A(Insomnia cure) Java
- CodeForce 148A Insomnia Cure 公倍数计算问题
- insomnia
- poj 2031 Building a Space Station (kruskal算法)
- 蓝牙基础知识学习
- 最全Pycharm教程(14)——Pycharm编辑器功能总篇
- ACM/ICPC 沈阳网络赛 1004 (nlogn最长上升子序列)
- bzoj 1562: [NOI2009]变换序列
- Insomnia cure
- CSS3box-shadow属性的使用
- Struts2文件上传
- linux 配置tftp和nfs
- 水王争霸
- 实体实现parcelable接口传递整个对象(购物车逻辑之前)
- 0908期 HTML 基础 第一讲
- Mycat从入门到放弃
- 一位资深程序员大牛给予Java初学者的学习路线建议