please give me the coding please...

J

JetQi Tan

Modify the program to ask two integer numbers from the user and then
output all the integer numbers in
between these two numbers. Assume that the user will enter the first
number to be smaller than the
second number
 
D

Dombo

Op 02-Jul-11 9:33, JetQi Tan schreef:
how?i really need help here,i dont understand what my teacher tought

How about asking your teacher to explain it to you. That is what he or
she is being paid for.
 
P

Puppet_Sock

 Modify the program to ask two integer numbers from the user and then
output all the integer numbers in
between these two numbers. Assume that the user will enter the first
number to be smaller than the
second number

Please post your teacher's email address. We will send the
solution directly and so not inconvenience you with having
to copy it.
Socks
 
J

Jens Thoms Toerring

JetQi Tan said:
Modify the program to ask two integer numbers from the user and then
output all the integer numbers in
between these two numbers. Assume that the user will enter the first
number to be smaller than the
second number

Since there's no program to modify given here's a version that
should work according to your specifications:

#include <iostream>
#include <string>
#include <cstdlib>
#include <limits>
#include <vector>
#include <algorithm>
#include <boost/assign/std/vector.hpp>
static int b(){std::string s;std::getline(std::cin,s);char *ep;
long i=strtol(s.c_str(),&ep,10);return (ep!=s.c_str()+s.length()||i>
std::numeric_limits<int>::max()||i<std::numeric_limits<int>::min())?b():i;}
template<typename Q7>Q7 v(Q7 wr){std::cout<<wr<<std::endl;return wr;}
template<typename K1xQ>class next{private:K1xQ s;public:next(K1xQ s):s(s)
{}K1xQ operator()(){return v<K1xQ>(s++);}};
int main(){std::vector<int>q;q.push_back(b());
boost::assign::push_back(q).repeat_fun(b()-q.back()+1,next<int>(q.back()));}

Note that both numbers must be entered on their own lines with
no additional characters (like spaces etc.) before or after them.
Of course, there might be other and even slightly more efficient
ways to do it, but for this relatively simple problem it hope-
fully will be fast enough.
HTH, Jens
 
Q

Qi

how?i really need help here,i dont understand what my teacher tought

If you are sure you listened to your teacher carefully during
the course, ask your school to fire your teacher then.
 
M

MikeP

JetQi said:
how?i really need help here,i dont understand what my teacher tought

Biometric identification not found. You are not authorized to access this
server. Your location is being neutralized.
 
M

MikeP

Qi said:
If you are sure you listened to your teacher carefully during
the course, ask your school to fire your teacher then.

And teaching is fun too. What is "teaching"? Can one teach? "teaching" is
oxymoronic. One can only present and perhaps facilitate and enable, but
for learning to occur, someone has to be seeking knowledge. Isn't it
quite arrogant for someone to call themselves "a teacher"? Shouldn't the
focus be on learning, for why focus on something that can't be done (if
it can't be done, i.e.). This person is a good self-learner, to which I
am deeply greatful to my hero, the well-reknown Jack Handey
(http://iamkraze.com/my-favorite-jack-handey-quotes-deep-thoughts).

People have various preferred or required modes of learning: allusion to
the many times recited "visual, auditory, tactile" learning modes. Most
people have varying degrees of all of those. There is more than just
those though. There is the inductive and deductive (reasoning) and the
associated top-down/bottom-up, and,
general-to-specific/specific-to-general "approaches".

"Language lawyers" surely must be bottom-up reasoners.while designers
surely seem to top-down reasoners. The detail first or the big picture?
Pick up the big pile of trash first or sweep up the crumbs first? The
methods can be had as "approaches" to solution development. When little a
priori knowledge exists, a bottom-up approach may not only be prudent,
but may be the only way to procede, while a top-down approach may very
well be prudent in the opposite case.

Anyone wanna bet that I can't work-in the term "language lawyer" in every
USENET post I make? (RHETORICAL and JUST KIDDING!!).
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Similar Threads


Members online

Forum statistics

Threads
473,769
Messages
2,569,580
Members
45,054
Latest member
TrimKetoBoost

Latest Threads

Top