-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathURI_2709.cpp
52 lines (43 loc) · 983 Bytes
/
URI_2709.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <cmath>
#include <vector>
bool isPrimeNumber(int64_t n)
{
if(n == 1) return false;
bool flag = true;
for(int i = 2; i <= ((int)sqrt(n)); ++i)
{
if(n % i == 0)
{
flag = false;
break;
}
}
return flag;
}
int main()
{
int coins{}, value{}, jump{};
int64_t sum{};
std::vector<int> values;
while(std::cin>>coins)
{
for(int i = 0; i < coins; ++i)
{
std::cin>>value;
values.push_back(value);
}
std::cin>>jump;
for(int i = coins - 1; i >= 0; i -= jump)
{
sum += values[i];
}
if(isPrimeNumber(sum))
std::cout << "You’re a coastal aircraft, Robbie, a large silver aircraft.\n";
else
std::cout << "Bad boy! I’ll hit you.\n";
sum = 0;
values.clear();
}
return 0;
}