About color check, Ancient Dragons post, that was what I was talking about...

no need to redo what has already been done
grep -n word file
or to use it in that context once you got the string do

Help with Code Tags

C++ Syntax (Toggle Plain Text)

char *arg[5] ;
arg[0] = "grep" ; arg[1] = "-n" ; arg[2] = string.c_str() ; arg[3] = fileName.c_str() ;
arg[4] = NULL ;
execvp(arg[0], arg) ;

char *arg[5] ; arg[0] = "grep" ; arg[1] = "-n" ; arg[2] = string.c_str() ; arg[3] = fileName.c_str() ; arg[4] = NULL ; execvp(arg[0], arg) ;

(Your not using unix, when do one ever use console apps in windows ? go fetch mingw and tools )

If you think about 5 minutes before you knew this trick this post wouldn't be very helpful.

And I dont consider producing code that could just as well be copy pasted from just about any project showing that he has tried to understand or solve the problem...

and if you read his post you se that he says nothing about what operating system he is using, so I could just as well assume he was using linux and was nice enough to point out what to do if he was not...

]Mind solving this one:
You guys I was given a task to solve the integer factorization problem efficiently, preferable using the general number field sieve, mind helping me out (look code, I have made an effort)..

Help with Code Tags

C++ Syntax (Toggle Plain Text)

#include <iostream>
#include <string>
int main( int argc, char **argv )
{
  std::string number ;
  std::cout << "What number do you want to factorize: " ;
  std::getline( std::cin, number ) ;
  std::string factors ;
  // so I'm stuck here, I could use some help implementing the general number field   
  // sieve, perferable in a easily paralizable manner so that I can use all my 
  // availible computers to solve the problem...
  // ofcourse if you have a faster algorithm for 100+ digits numbers I would appreciate
  // an implementation of that as well....
  std::cout << number << " factors into " << factors << std::endl ;
  return 0 ;
}

#include <iostream> #include <string> int main( int argc, char **argv ) { std::string number ; std::cout << "What number do you want to factorize: " ; std::getline( std::cin, number ) ; std::string factors ; // so I'm stuck here, I could use some help implementing the general number field // sieve, perferable in a easily paralizable manner so that I can use all my // availible computers to solve the problem... // ofcourse if you have a faster algorithm for 100+ digits numbers I would appreciate // an implementation of that as well.... std::cout << number << " factors into " << factors << std::endl ; return 0 ; }