<em>A.)</em>
<em>It's either A or D both of them stand out and make sense to me so I think that it'll be right if you choose A or D.</em>
<em>-Ɽ3₮Ɽ0 Ⱬ3Ɽ0</em>
// 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];
Answer:
A Caesar Cipher is a basic encryption type.
Explanation:
Its implementation is very easy and straightforward. It uses a one-to-one of characters in a character set. The input needed is the plain-text message and the encryption number.
For example, using the character set A-Z, encrypting the text CS IS COOL using the key of 3 generates FV LV FRRO. What has been done here is to take each character in the plain-text message and move it by "encryption number steps" in the character set.
I believe it was Nintendo hope this helps
