Algorithm Training Case Conversion

Algorithm training case Conversion time limit: 1.0s memory limit: 512.0MB    Problem description Write a program, enter a string (not more than 20), and then the string of each character in the case of the transformation, will be uppercase letters into lowercase, lowercase letters into uppercase, and then the new string output.
Input format: Enter a string, and the string contains only English letters, no other types of characters, and no spaces.
Output format: Outputs the converted string.
Input and Output sample sample input Aedb sample output Aedb

#include <iostream>#include<cstdio>#include<cstring>using namespacestd;Chars[ -];intMain () {intI,len;  while(~SCANF ("%s", s)) {Len=strlen (s);  for(i=0; i<len;i++)        {            if(s[i]>='a'&&s[i]<='Z') S[i]=s[i]- +; ElseS[i]=s[i]+ +; } printf ("%s\n", s); }    return 0;}

Algorithm Training Case Conversion