##C++ A nice clean language like C++ can permit you to lay out your source in a neat and highly readable way, and has the advantage of being easy to copy out by hand with minimum ambiguity.

Here the solution is reached using only the number 1.

#include <iostream> typedef long int lI; auto &VV = std::cout; std::string vv = " "; int main() { for(lI UU; UU --> UU;) { lI l1=1l+1l;lI ll=1l << l1;VV << ll << vv;lI Il=ll*l1;VV << Il << vv;VV << ll*ll-1l << vv; lI II=ll*ll;VV << II << vv;VV <<(II += Il-1l) << vv;VV << l1 * (II-l1)<< vv; } } 

Test: http://ideone.com/fuOdem

C++

A nice clean language like C++ can permit you to lay out your source in a neat and highly readable way, and has the advantage of being easy to copy out by hand with minimum ambiguity.

Here the solution is reached using only the number 1.

#include <iostream> typedef long int lI; auto &VV = std::cout; std::string vv = " "; int main() { for(lI UU; UU --> UU;) { lI l1=1l+1l;lI ll=1l << l1;VV << ll << vv;lI Il=ll*l1;VV << Il << vv;VV << ll*ll-1l << vv; lI II=ll*ll;VV << II << vv;VV <<(II += Il-1l) << vv;VV << l1 * (II-l1)<< vv; } } 

Test: http://ideone.com/fuOdem

##C++ A nice clean language like C++ can permit you to lay out your source in a neat and highly readable way, and has the advantage of being easy to copy out by hand with minimum ambiguity.

Here the solution is reached using only the number 1.

#include <iostream> typedef long int lI; auto &VV = std::cout; std::string vv = " "; int main() { lI l1=1l+1l;lI ll=1l << l1;VV << ll << vv;lI Il=ll*l1;VV << Il << vv;VV << ll*ll-1l << vv; lI II=ll*ll;VV << II << vv;VV <<(II += Il-1l) << vv;VV << l1 * (II-l1)<< vv; } 

Test: http://ideone.com/fuOdem

##C++ A nice clean language like C++ can permit you to lay out your source in a neat and highly readable way, and has the advantage of being easy to copy out by hand with minimum ambiguity.

Here the solution is reached using only the number 1.

#include <iostream> typedef long int lI; auto &VV = std::cout; std::string vv = " "; int main() { for(lI UU; UU --> UU;) { lI l1=1l+1l;lI ll=1l << l1;VV << ll << vv;lI Il=ll*l1;VV << Il << vv;VV << ll*ll-1l << vv; lI II=ll*ll;VV << II << vv;VV <<(II += Il-1l) << vv;VV << l1 * (II-l1)<< vv; } } 

Test: http://ideone.com/fuOdem