codeforces 148A Insomnia cure
来源:互联网 发布:手机锁帧软件 编辑:程序博客网 时间:2024/06/05 14:58
«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. Everyk-th dragon got punched in the face with a frying pan. Everyl-th dragon got his tail shut into the balcony door. Everym-th dragon got his paws trampled with sharp heels. Finally, she threatened everyn-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 ofd dragons?
Input data contains integer numbers k, l, m, n andd, 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.
AC:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k,l,m,n,d;
scanf("%d%d%d%d%d",&k,&l,&m,&n,&d);
int su[100010];
int sum=0;
memset(su,0,sizeof(su));
for(int i=1;i*k<=d;i++)
su[i*k]=1;
for(int i=1;i*l<=d;i++)
su[i*l]=1;
for(int i=1;i*m<=d;i++)
su[i*m]=1;
for(int i=1;i*n<=d;i++)
su[i*n]=1;
for(int i=1;i<=d;i++)
if(su[i])
sum++;
printf("%d",sum);
}
- [Codeforces] 148A - Insomnia cure
- CodeForces-148A-Insomnia cure
- CodeForces 148A Insomnia cure
- codeforces-148A-Insomnia cure
- codeforces 148A Insomnia cure
- Problem--148A--Codeforces--A. Insomnia cure
- codeforces 148A(Insomnia cure) Java
- 148A - Insomnia cure
- 148A - Insomnia cure
- codeforce 148->A. Insomnia cure
- Insomnia cure CodeForces
- A. Insomnia cure
- CF148 A Insomnia cure
- Codeforces Round #105 (Div. 2) / 148A Insomnia cure (枚举 || 数论)
- Codeforces刷题之路——148A Insomnia cure
- CodeForce 148A Insomnia Cure 公倍数计算问题
- Insomnia cure
- Insomnia cure
- vue引入JQ的方法
- 简易统计Python有效代码行数
- 解析 RecyclerView多布局
- 给prometheus加一个export
- 分割大头文件并压缩打包shell脚本
- codeforces 148A Insomnia cure
- 调用相册相机
- 104,101规约中的短浮点数
- 分类实现
- leetCode-Search in Rotated Sorted Array
- dict方法总结
- 给sublime3配置C++(编译,运行,和格式化代码)
- 反转链表
- List<Object> 排序