. ¦3<RELATIVISM Anupam Srivastava (Gitter):
. ¦3<RELATIVISM try protonmail/tutanota/or kolabnow
Hello everyone,
Currently there's a live puzzle going on from 4th of sept to 7th of Sept. It a highly anticipating and encouraging event and therefore requires basic fundamentals programming skills.
Anyone looking forward to teaming up then ping up in private
In short I'm a python developer, scientific computational programmer and ML enthusiast.
Results for cs50/problems/2020/x/caesar generated by check50 v3.1.2
:) caesar.c exists.
:) caesar.c compiles.
:) encrypts "a" as "b" using 1 as key
:) encrypts "barfoo" as "yxocll" using 23 as key
:) encrypts "BARFOO" as "EDUIRR" using 3 as key
:) encrypts "BaRFoo" as "FeVJss" using 4 as key
:) encrypts "barfoo" as "onesbb" using 65 as key
:( encrypts "world, say hello!" as "iadxp, emk tqxxa!" using 12 as key
expected "ciphertext: ia...", not "ciphertext: ia..."
:) handles lack of key
:( handles non-numeric key
timed out while waiting for program to exit
:) handles too many arguments
include <cs50.h>
include <stdio.h>
include <math.h>
include <string.h>
include <ctype.h>
include <stdlib.h>
int main(int argc, string argv[])
{
if (argc == 2 && isdigit (*argv[1]))
{
int k = atoi (argv[1]);
string s = get_string("plaintext: ");
printf("ciphertext: ");
for(int x = 0; s[x] != '\0' ; x++)
{
//somando os numeros
if (isalpha (s[x]))
{
if (islower(s[x]))
{
char c = ((s[x]-97) + k) % 26;
printf("%c", c + 97);
}
else if (isupper (s[x]))
{
char d = ((s[x]-65) + k) % 26;
printf("%c",d + 65);
}
else printf("%c", s[x]);
}
}
printf("\n");
}
else
{
printf("Usage: ./caesar key\n");
return 1;
}}
Hi! I am new here, Doing the Cs50 for business professionals. I need some help with this question.
Suppose that an engineer excitedly runs up to you and claims that they've implemented an algorithm that can sort n elements (e.g., numbers) in fewer than n steps. Give some thought as to why that's simply not possible and politely explain.
