Problem--148A--Codeforces--A. Insomnia cure
4501 단어 Codeforces
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
«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 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 Output the number of damaged dragons.
Examples input 1 2 3 4 12 output 12 input 2 3 4 5 24 output 17
Note 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.
대체적인 사고방식: a, b, c, d, e를 입력하고 출력 1~e에서 a, b, c, d배수의 개수 01을 입력한다.
#include
int main(){
int a,b,c,d,e;
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
int num[e+1];
for(int i=1;i<=e;i++)
num[i]=1;
for(int i=1;i<=e;i++){
if(i%a==0||i%b==0||i%c==0||i%d==0)
num[i]=0;
}
int count=0;
for(int i=1;i<=e;i++){
if(num[i]==0)
count++;
}
printf("%d
",count);
}
10
#include
int main () {
int ss=0,i,a,b,c,d,x;
scanf("%d %d %d %d %d",&a,&b,&c,&d,&x);
for(i=1;i<=x;i++)
if(i%a==0 || i%b==0 || i%c==0 || i%d==0)
ss++;
printf("%d
",ss);
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
CF1303E - Erase Subsequences DP문자열의 길이를 보면 O(N3)O(N^3)O(N3)O(N3)의 가장 직접적인 생각은 tt열을 두 부분으로 나누어 t1, t2t1, t2t1, t2t1, t2t2, 그리고 ss열을 매칭하는 것이다. t2는 같은 문자를...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.