A. Insomnia cure
来源:互联网 发布:windows已激活是正版吗 编辑:程序博客网 时间:2024/05/18 02:17
«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.
解题说明:循环判断是不是k,l,m,n的倍数即可,注意这里d范围较小,如果范围较大,可能导致超时
#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){int k,l,m,n,d;int i,sum;sum=0;scanf("%d\n%d\n%d\n%d\n%d",&k,&l,&m,&n,&d);for(i=1;i<=d;i++){if(i%k==0){sum++;continue;}else if(i%l==0){sum++;continue;}else if(i%m==0){sum++;continue;}else if(i%n==0){sum++;continue;}else{continue;}}printf("%d\n",sum);return 0;}
- A. Insomnia cure
- 148A - Insomnia cure
- 148A - Insomnia cure
- CF148 A Insomnia cure
- [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
- Insomnia cure
- Insomnia cure
- codeforces 148A(Insomnia cure) Java
- CodeForce 148A Insomnia Cure 公倍数计算问题
- Coderforces Insomnia cure
- Insomnia cure CodeForces
- Codeforces Round #105 (Div. 2) / 148A Insomnia cure (枚举 || 数论)
- Ubuntu10.04编译安装Linux kernel 3.7.10
- WordPress主题安装全解析
- SWT之一: HelloWorld
- 在Windows下android设备无法识别虚拟器
- LG F200L去掉lockscreen界面的韩国时间!
- A. Insomnia cure
- Windows下,伪分布模式启动TaskTracker失败问题之一
- 第一次去软件公司上班
- 程序员面试宝典--简历注意事项
- Command 模式
- 四款常用问答系统
- 通过one-to-many建立classes类与student类的关联
- many-to-one描述了多对一的关系 并没有inverse属性 因为对student对象的增、删、改的一部分操作就相当于维护了关系 column 外键
- public class Classes implements Serializable{