fgets - is clearing the buffer by assigning char * buffer to '\n' while getting user input inside a loop in c wrong? -


i tried solve problem* face when want user input inside loop. edit *: problem -> clearing buffer read next input.

is error-prone?

 #include <stdio.h>       int main(){         char buffer[10];         while(1){           fgets(buffer,10,stdin);           // use buffer whatever need... then!           *buffer = '\n';         }     }

edit: code faced error. without assignment '\n' got wrong loop coun , inputs. deleted lines there nothing wrong :/

#include <stdio.h> #include <stdlib.h> int main(){         int numbers[100];         int quant;         char buffer[10];         printf("how many numbers need ask? max = 99\n");         fgets(buffer,10,stdin);         quant = atoi(buffer);         *buffer = '\n';         printf("%d times enter numbers! max 9 digit long !\n",quant);         for(int i=0;i<quant;i++){                 printf("%d. number: ",i);                 fgets(buffer,10,stdin);                 numbers[i] = atoi(buffer);                 *buffer = '\n';          }          printf("numbers: \n");         for(int i=0;i<quant;i++){                 printf("%d ",numbers[i]);         }

edit2: error based on memory overflow , how fgets handles inputs.

#include <stdio.h>  int main(){         int ch;         char buffer[10];          for(int i=0; i<3; i++){                  fgets(buffer,10,stdin);                 printf("%s -- %d. time\n",buffer,i+1);                 //while ((ch = getchar()) != '\n' && ch != eof);                 *buffer= '\n';         }         return 0; }

if enter more 9 digits input (which did accidentally), jumps next loop. if clear buffer while loop nothing wrong happens. *buffer = '\n' useless, meaningles...

it's not "error-prone", pointless.

there point in "clearing" buffer, , it's never well-defined "clearing" means.

why feel buffer needs cleared, when it's going overwritten fget(), regardless of contents? if behavior confusing, should make sure fgets() succeeds before relying on result.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more