Answer:
def leap_year(y):
if y % 4 == 0:
return 1
else:
return 0
def number_of_days(m,y):
if m == 2:
return 28 + leap_year(y)
elif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m ==10 or m == 12:
return 31
elif m == 4 or m == 6 or m == 9 or m == 11:
return 30
def days(m,d):
if m == 1:
return 0 + d
if m == 2:
return 31 + d
if m == 3:
return 59 + d
if m == 4:
return 90 + d
if m == 5:
return 120 + d
if m == 6:
return 151 + d
if m == 7:
return 181 + d
if m == 8:
return 212 + d
if m == 9:
return 243 + d
if m == 10:
return 273 + d
if m == 11:
return 304 + d
if m == 12:
return 334 + d
def days_left(d,m,y):
if days(m,d) <= 60:
return 365 - days(m,d) + leap_year(y)
else:
return 365 - days(m,d)
print("Please enter a date")
day=int(input("Day: "))
month=int(input("Month: "))
year=int(input("Year: "))
choice=int(input("Menu:\n1) Calculate the number of days in the given month.\n2) Calculate the number of days left in the given year.\n"))
if choice == 1:
print(number_of_days(month, year))
if choice == 2:
print(days_left(day,month,year))
Explanation:
Hoped this helped
Answer:
WAN router security standard, Web services standard
Explanation:
Complete statement with blanks filled:
In general, WAN-specific standards identify specific security requirements for WAN devices. For example, the WAN router security standard explains the family of controls needed to secure the connection from the internal network to the WAN router, whereas the Web services standard identifies which controls are vital for use of Web services provided by suppliers and external partnerships.
// Variable to keep track of array size
int length = 0;
// Array itself
int array[] = {};
// while loop will take input in the array until a negative number is entered
while(input>=0){
stdin = new Scanner(System.in);
array[length] = stdin;
length +=1;
}
// int variable to terminate while loop
int i =0;
// keep track of index of output array
int y =0;
while(arr[i] != length){
// making output array
int output[]={}; bool flag;
// put the element in out put array considering if it the desired one
output[y] = array [i];
// Now check if it was the desired?
for(int z=1;z<=length;z++){
if(array[i+z]!=output[y]){
flag = true;
}
else
{
output[y]=0;
y+=1;
}
if(array[i+z+1]=output[y] && flag == true){
output[y] = array[i];
y+=1;
}
}
//output the array
for(int o=0;o<y;o++)
System.out.println(output[o];
int IsAbundant(int n)
{
int divisorSum = 0;
for (int i = 1; i < n; i++) {
if ((n % i) == 0) {
divisorSum += i;
}
}
return divisorSum > n;
}
int main()
{
int number = 0;
do {
printf("Enter a number (0 to quit): ");
scanf_s("%d", &number);
if (IsAbundant(number)) {
printf("%d is abundant!\n", number);
} else
{
printf("%d is not abundant.\n", number); }
} while (number > 0);
return 0;
}
