How to modify ASCII with prime numbers C program -


here's program asks user enter line of text , shows ascii code it's associated with, , after modifies ascii code adding plus 1 i, , prints out new character associated new ascii code.

#include <stdio.h> #include <stdlib.h> #include <ctype.h> #include <string.h>  int main() {     char s[ 70 ]; // define character array of size 70     size_t i; // loop counter      // use gets text user     puts( "enter line of text: \a\n" );     fgets( s, 70, stdin );      // convert each character ascii , output     puts("\n ascii code characters \n");     ( = 0; s[ ] != '\0'; ++i )     {         printf(" %c:%d",(s[ ]),(s[ ]));     } // end  uppercase ascii      // convert each character modified ascii , output     puts( "\nthe line modified progressively higher ascii:\n" );     ( = 0; s[ ] != '\0'; ++i )     {         printf( "%c", ( s[ ] + (i+1)) );     } // end modified characters      puts("");     printf( " \n modified  ascii code entered string \n\n\a");     ( = 0; s[ ] != '\0'; ++i )     {         printf( " %c:%d",(s[ ] + (i+1)),(s[ ] +(i+1)));     } // end  modified ascii code     printf( "\n \t final value of loop variable 'i' is:%d\n", i);     puts( "" );     system("pause"); }

i'm having difficulty modifying ascii code , characters change first 7 prime numbers 2,3,5...17 , after first 7 prime numbers go in reverse 17,13,11,7,...2. after first loop g has ascii code 103, modified ascii code 105 , new letter i. can me out?

start declaring array storing pattern (primes, in ascending order , descending order, in such way reducing modulo arrays size cause cycle). example:

unsigned int prime[] = { 2, 3, 5, 7, 11, 13, 17, 13, 11, 7, 5, 3 };

now, rather adding (i + 1) each character in loop, you'll want add prime[i % (sizeof prime / sizeof *prime)]. example:

for (i = 0; s[i] != '\0'; i++) {      putchar(s[i] + prime[i % (sizeof prime / sizeof *prime)]); }

p.s. technically, it's not required ascii. think of way: c , ascii go coffee , cows milk. people love it, use coconut milk or cream instead.


Comments

Post a Comment

Popular posts from this blog

c# - Validate object ID from GET to POST -

i have method allows user access comment have made on site. have post method lets them update comment. my normal solution send entire comment model through, let them update it, update on database when post back. involve sending commentid through in hiddenfor , can manipulated. how can verify commentid sent in get method same i'm getting in post , not able alter comment wish? how can verify commentid sent in method same i'm getting in post? basically have validate following things in post - user logged-in user. authenticated users post comments. commentid in post , should valid commentid , should present in database. userid associated logged-in user should same userid associated comment . comment should contain userid column, can check @ time of update. to make sure update happens comment has been sent in get - hold commentid in session , in post action compare commentid value in session .
Read more

node.js - Custom Model Validator SailsJS -

when using custom model validator checks record within model. return within spread doesn't seem end control flow. //post.js model /** * custom validator **/ types: { isuservalid: function(user_id) { var promise = require('bluebird'); promise.all([ user.findone({id: user_id}) ]) .spread(function(user) { console.log(user); if (user === null || user === undefined) { console.log('failed'); return false; }else{ console.log('passed'); return true; } }); } }, my response standard validation failed response. { "error": "e_validation", "status": 400, "summary": "1 attribute invalid", "model": "post", "invalidattributes": { "owner": [ { "rule": "isuservalid", ...
Read more

php - Find a regex to take part of Email -

i have following emails need extract part from: bestellnummer xxx: 1 von xxx, 1er pack ------------- anfang der nachricht ------------- foo bar baz foo bar baz // <<<<< need text here ------------- ende der nachricht ------------- ------------- anfang der nachricht ------------- foo bar baz foo bar baz ------------- ende der nachricht ------------- there 0 unlimited occurences of ------------- anfang der nachricht ------------- ------------- ende der nachricht ------------- and i'm able extract first part regex: $re = "/------------- .*? -------------.?(.*?).?------------- .*? -------------/s"; but, i'm quite new on learning regex, i'm pretty sure there must better regex extract part (foo bar baz foo bar baz) of text between ------------- anfang der nachricht ------------- ------------- ende der nachricht ------------- as can in different languages, i'm using .? to match between hyphens. i...
Read more