500 Ways to Print 1 to 10

**Freaky Chris** · March 31st, 2010, 06:49 AM

OK, so every forum has one, and it's something to get your hacking skills out on!

Lets see if we can list 500 ways to print the numbers 1 to 10.

a) There are no language boundaries
b) Try not to repeat the same things
c) number your solution so it follows on
d) name your language
e) Make your code compilable not matter what language it is

ok, good luck every one

#1 Java

public class Loop1to10 {
	public static void main(String[] args) {
		for(int i = 1; i < 11; i++)
			System.out.print(i + " ");
	}
}

**JavaPF** · March 31st, 2010, 08:32 AM

Nice idea Chris.

I'll be amazed if we ever make it to 500!!

Heres my first contribution:

#2 Java

public class Print1to10 {
    public static void main(String[] args) {        
        int array[] = {1,2,3,4,5,6,7,8,9,10};
        for(int s : array){
            System.out.print(s + " ");
        }
    }
}

**Freaky Chris** · March 31st, 2010, 09:29 AM

Haha ye we shall see, here's a messy long winded one lol.

#3 Java

public class Loop1to10 {
	public static void main(String[] args) {
		new Loop1to10();
	}
 
	public Loop1to10(){
		class Insanity implements Madness{
			void print(int x){
				System.out.println(x);
			}
			private int i;
			public Insanity(int i){
				set(i);
			}
			private void set(int i){
				this.i = i;
			}
			public int value() {
				return i;
			}
		}
		Insanity[] PrintingOneToTen = new Insanity[10];
		for(int i = 1; i < 11; i++){
			PrintingOneToTen[i-1] = new Insanity(i);
			PrintingOneToTen[i-1].print(PrintingOneToTen[i-1].value());
		}
 
	}
}

**JavaPF** · March 31st, 2010, 10:33 AM

#4 Java

public class Print1to10 {
    public static void main(String[] args) {
        int count = 1;
        while (count < 11) {
            System.out.print(count + " ");
            count++;
        }
    }
}

**JavaPF** · March 31st, 2010, 10:44 AM

lol this is going to get very messy

#5 Java

public class Print1to10 {
 
    public static void main(String[] args) {
 
        int a = (11 - 1), b = (10 - 1), c = (9 - 1), d = (8 - 1),
        e = (7 - 1), f = (6 - 1), g = (5 - 1), h = (4 - 1), i = (3 - 1),
        j = (2 - 1);
 
        System.out.print(j + " ");
        System.out.print(i + " ");
        System.out.print(h + " ");
        System.out.print(g + " ");
        System.out.print(f + " ");
        System.out.print(e + " ");
        System.out.print(d + " ");
        System.out.print(c + " ");
        System.out.print(b + " ");
        System.out.print(a + " ");
    }
}

**helloworld922** · March 31st, 2010, 12:13 PM

don't know if this counts.

6. Java

public class OneToTen
{
public static void main(String[] args)
{
     System.out.println("1 2 3 4 5 6 7 8 9 10");
}
}

**helloworld922** · March 31st, 2010, 12:16 PM

Pretty sure I didn't see a recursive solution yet...

7. Java

public class OneToTen
{
public static void main(String[] args)
{
     recurse(1);
}
 
public static void recurse(int num)
{
     System.out.print(num+" ");
     if (num > 10)
     {
          return;
     }
     recurse(num+1);
}
}

**JavaPF** · March 31st, 2010, 04:44 PM

Originally Posted by helloworld922

don't know if this counts.

6. Java

public class OneToTen
{
public static void main(String[] args)
{
     System.out.println("1 2 3 4 5 6 7 8 9 10");
}
}

Haha that totally counts! Every method counts if we are ever going to get to 500!

**Cuju** · March 31st, 2010, 08:48 PM

8. Java

public class OneToTen {
 
public static void main(String[] args) {
 
int c = 0;
 
while(c<10) {
	if(c==0) {
		System.out.println(1);
	}
	else if(c==1) {
		System.out.println(2);
	}
	else if(c==2) {
		System.out.println(3);
	}
	else if(c==3) {
		System.out.println(4);
	}
	else if(c==4) {
		System.out.println(5);
	}
	else if(c==5) {
		System.out.println(6);
	}
	else if(c==6) {
		System.out.println(7);
	}
	else if(c==7) {
		System.out.println(8);
	}
	else if(c==8) {
		System.out.println(9);
	}
	else if(c==9) {
		System.out.println(10);
		break;
	}
	c++;	
}
 
}
}

**helloworld922** · March 31st, 2010, 11:11 PM

I'm pretty sure this works

9. Brainf***

++++++++
[>++++++++>++++<<-]
>+.+>.<.+>.<.+>.<.+>.<.+>.<.+>.<.+>.<.+>.<.>.<--------.-.>.<

**helloworld922** · April 1st, 2010, 01:13 AM

10. Java

import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
 
import javax.swing.Timer;
 
public class OneToTen implements ActionListener
{
	private int num;
	public static Thread main;
 
	public static void main(String[] args)
	{
		OneToTen.main = Thread.currentThread();
		Timer timer = new Timer(10, new OneToTen());
		timer.setRepeats(false);
		timer.start();
		try
		{
			Thread.sleep(1000);
		}
		catch (InterruptedException exception)
		{
			// TODO Auto-generated catch block
			System.exit(0);
		}
	}
 
	public OneToTen()
	{
		this.num = 1;
	}
 
	/**
	 * @param e
	 */
	@Override
	public void actionPerformed(ActionEvent e)
	{
		System.out.print(this.num + " ");
		this.num++;
		if (this.num == 11)
		{
			OneToTen.main.interrupt();
		}
		else
		{
			Timer timer = new Timer(10, this);
			timer.setRepeats(false);
			timer.start();
		}
	}
}

**Freaky Chris** · April 1st, 2010, 02:40 AM

omg

helloworld you stole brainf*** from me, i was going to do that one later you gay lol.

**JavaPF** · April 1st, 2010, 03:06 AM

LOL @ the brainf*** example. Never even heard of it!!

**helloworld922** · April 1st, 2010, 03:21 PM

you snooze you lose

Besides, there are multiple ways to print out 1-10 in brainf***. Just find another one. Here's another one

11. Brainf***

++++++++[>++++++>++++>++++++>++++>++++++>++++>++++++>++++>++++++>++++>+++++>++++>++++++>++++>++++++>++++>++++++>++++>++++++>++++++>++++<<<<<<<<<<<<<<<<<<<<<-]
>>>>>>>>>>>>>>>>>>>+<<+++++++++<<++++++++<<+++++++<<++++++<<+++++<<++++<<+++<<++<<+.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.

**Darryl.Burke** · April 1st, 2010, 11:55 PM

Java is an object oriented language

12. Java

public class NumbersOO {
 
  int number;
 
  public static void main(String[] args) {
    System.out.println(new NumbersOO(10));
  }
 
  public NumbersOO(int number) {
    this.number = number;
  }
 
  @Override
  public String toString() {
    StringBuffer sb = new StringBuffer(" ");
    for (int i = 1; i <= number; i++) {
      sb.append(String.valueOf(i));
      sb.append(' ');
    }
    return sb.toString().trim();
  }
}

db

**Darryl.Burke** · April 1st, 2010, 11:57 PM

And how about a recursive non-OOPS solution?

13. Java

public class NumbersRecursive {
 
  public static void main(String[] args) {
    printNumber(10);
  }
 
  private static void printNumber(int number) {
    if (number == 0) {
      return;
    }
    printNumber(--number);
    System.out.print(number + 1 + " ");
  }
}

db

**helloworld922** · April 2nd, 2010, 06:54 PM

14. Java

public class OneToTen
{
	public enum Num {
		ONE, TWO, THREE, FOUR, FIVE, SIX, SEVEN, EIGHT, NINE, TEN;
 
		@Override
		public String toString()
		{
			if (this.equals(ONE))
			{
				return "1";
			}
			else if (this.equals(TWO))
			{
				return "2";
			}
			else if (this.equals(THREE))
			{
				return "3";
			}
			else if (this.equals(FOUR))
			{
				return "4";
			}
			else if (this.equals(FIVE))
			{
				return "5";
			}
			else if (this.equals(SIX))
			{
				return "6";
			}
			else if (this.equals(SEVEN))
			{
				return "7";
			}
			else if (this.equals(EIGHT))
			{
				return "8";
			}
			else if (this.equals(NINE))
			{
				return "9";
			}
			else
			{
				return "10";
			}
		}
	}
 
	public static void main(String[] args)
	{
		Num number = Num.valueOf("ONE");
		System.out.print(number + " ");
		number = Num.valueOf("TWO");
		System.out.print(number + " ");
		number = Num.valueOf("THREE");
		System.out.print(number + " ");
		number = Num.valueOf("FOUR");
		System.out.print(number + " ");
		number = Num.valueOf("FIVE");
		System.out.print(number + " ");
		number = Num.valueOf("SIX");
		System.out.print(number + " ");
		number = Num.valueOf("SEVEN");
		System.out.print(number + " ");
		number = Num.valueOf("EIGHT");
		System.out.print(number + " ");
		number = Num.valueOf("NINE");
		System.out.print(number + " ");
		number = Num.valueOf("TEN");
		System.out.print(number + " ");
	}
}

**helloworld922** · April 2nd, 2010, 07:00 PM

15. Java

public class OneToTen
{
	public static void main(String[] args)
	{
		int num = 3628800;
		OneToTen.tenFactors(num);
	}
 
	public static void tenFactors(int num)
	{
 
		int count = 0;
		for (int j = 1; j < num && count < 10; j++)
		{
			if (num % j == 0)
			{
				System.out.print(j + " ");
				count++;
			}
		}
 
	}
}

**helloworld922** · April 2nd, 2010, 08:35 PM

Technically these are similar methods, but they use different algorithms

16. Java

import java.io.FileNotFoundException;
 
/**
 * Solves a linear system of equations Ax = b using 3 different iterative
 * algorithms.
 * 
 * @author Andrew Ho
 * 
 */
public class CopyOfOneToTen
{
	/**
	 * Calculates the residual matrix of Ax = B, where x is a guess vector.
	 * residual = B - Ax
	 * 
	 * @param a
	 * @param guessX
	 * @param b
	 * @return
	 */
	private static double[][] calculateResidual(double[][] a, double[] guessX, double[] b)
	{
		// convert x into a matrix to allow us to multiply
		double[][] matX = new double[guessX.length][1];
		for (int i = 0; i < matX.length; i++)
		{
			matX[i][0] = guessX[i];
		}
		// calculate the residual
		double[][] resid = CopyOfOneToTen.mMult(a, matX);
		for (int i = 0; i < b.length; i++)
		{
			resid[i][0] = b[i] - resid[i][0];
		}
		return resid;
	}
 
	/**
	 * Gets the dot product of two vectors.
	 * 
	 * @param mat1
	 * @param mat2
	 * @return mat1 dot mat2
	 */
	public static double dot(double[] v1, double[] v2)
	{
		if (v1.length != v2.length)
		{
			throw new RuntimeException("Error! lengths don't match");
		}
		double dot = 0;
		for (int i = 0; i < v1.length; i++)
		{
			dot += v1[i] * v2[i];
		}
		return dot;
	}
 
	/**
	 * Performs the matrix multiplication mat1*mat2. Throws a runtime exception
	 * if col(mat1) != row(mat2). It is assumed that both matrices are
	 * non-jagged.
	 * 
	 * @param mat1
	 * @param mat2
	 * @return
	 */
	public static double[][] mMult(double[][] mat1, double[][] mat2)
	{
		if (mat1[0].length != mat2.length)
		{
			throw new RuntimeException("error! col{mat1) != col(mat2)");
		}
		double[][] result = new double[mat1.length][mat2[0].length];
		// simplify the process of getting the correct row
		double[][] temp = CopyOfOneToTen.transpose(mat2);
		for (int i = 0; i < mat1.length; i++)
		{
			for (int j = 0; j < mat2[0].length; j++)
			{
				result[i][j] = CopyOfOneToTen.dot(mat1[i], temp[j]);
			}
		}
		return result;
	}
 
	/**
	 * Transposes the matrix. Assumes a non-jagged matrix.
	 * 
	 * @param mat
	 * @return
	 */
	public static double[][] transpose(double[][] mat)
	{
		double[][] transposed = new double[mat[0].length][mat.length];
		for (int i = 0; i < transposed.length; i++)
		{
			for (int j = 0; j < mat.length; j++)
			{
				transposed[i][j] = mat[j][i];
			}
		}
		return transposed;
	}
 
	/**
	 * Calculated the Frobenius Norm (2-norm) of a matrix.
	 * 
	 * norm(mat) = sqrt(sum(mat[i][j]^2))
	 * 
	 * @param mat
	 * @return
	 */
	public static double fNorm(double[][] mat)
	{
		double sum = 0;
		for (int i = 0; i < mat.length; i++)
		{
			for (int j = 0; j < mat[i].length; j++)
			{
				sum += mat[i][j] * mat[i][j];
			}
		}
		return Math.sqrt(sum);
	}
 
	/**
	 * Uses the jacobi iterative algorithm to calculate the solution vector of
	 * Ax = B. Iterates until the residual norm is less than the tolerance
	 * value, or the max iterations has been reached.
	 * 
	 * @param a
	 * @param b
	 * @param max
	 * @param tol
	 * @return
	 */
	public static double[] jacobi(double[][] a, double[] b, int max, double tol)
	{
		double[] oldX = new double[b.length];
		double[] newX = new double[b.length];
		// initial guesses: b
		for (int i = 0; i < b.length; i++)
		{
			oldX[i] = b[i];
		}
		for (int count = 0; count < max; count++)
		{
			newX = new double[b.length];
			for (int i = 0; i < b.length; i++)
			{
				// temporary value for calculating new x values
				double temp = 0;
				for (int j = 0; j < b.length; j++)
				{
					if (j != i)
					{
						temp = temp + a[i][j] * oldX[j];
					}
				}
				// new x value
				newX[i] = (b[i] - temp) / a[i][i];
				if (Double.isInfinite(newX[i]) || Double.isNaN(newX[i]))
				{
					// won't converge, somehow got to infinity
					System.out.println("Won't converge!");
					return null;
				}
			}
			oldX = newX;
			// calculate the residual
			if (CopyOfOneToTen.fNorm(CopyOfOneToTen.calculateResidual(a, oldX, b)) <= tol)
			{
				// within tolerance, stop
				return newX;
			}
		}
		return newX;
	}
 
	public static void main(String[] args) throws FileNotFoundException
	{
		double[][] a = { { -16, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, { 4, 1, 0, 0, 0, 0, 0, 0, 0, 0 },
				{ -16, -8, 1, 0, 0, 0, 0, 0, 0, 0 }, { 24, 13, -2, 1, 0, 0, 0, 0, 0, 0 },
				{ -37, -11, 2, 0, 1, 0, 0, 0, 0, 0 }, { 28, 20, -4, -1, 0, 1, 0, 0, 0, 0 },
				{ 22, 30, -5, -5, -2, 0, 1, 0, 0, 0 }, { -75, -41, 9, 0, 3, -1, 1, 1, 0, 0 },
				{ -42, -39, 6, 8, 4, 1, -2, 0, 1, 0 }, { 17, -27, 6, 6, 11, 4, 0, 2, 0, 1 } };
		double[] b = { -16, 6, -29, 48, -48, 58, 44, -106, -49, 110 };
		double[] vals = CopyOfOneToTen.jacobi(a, b, 100000, 1e-5);
		for (int i = 0; i < vals.length; i++)
		{
			System.out.printf("%d ", (int) vals[i]);
		}
	}
 
}

17. Java

import java.io.FileNotFoundException;
 
/**
 * Solves a linear system of equations Ax = b using 3 different iterative
 * algorithms.
 * 
 * @author Andrew Ho
 * 
 */
public class OneToTen
{
	/**
	 * Calculates the residual matrix of Ax = B, where x is a guess vector.
	 * residual = B - Ax
	 * 
	 * @param a
	 * @param guessX
	 * @param b
	 * @return
	 */
	private static double[][] calculateResidual(double[][] a, double[] guessX, double[] b)
	{
		// convert x into a matrix to allow us to multiply
		double[][] matX = new double[guessX.length][1];
		for (int i = 0; i < matX.length; i++)
		{
			matX[i][0] = guessX[i];
		}
		// calculate the residual
		double[][] resid = OneToTen.mMult(a, matX);
		for (int i = 0; i < b.length; i++)
		{
			resid[i][0] = b[i] - resid[i][0];
		}
		return resid;
	}
 
	/**
	 * Gets the dot product of two vectors.
	 * 
	 * @param mat1
	 * @param mat2
	 * @return mat1 dot mat2
	 */
	public static double dot(double[] v1, double[] v2)
	{
		if (v1.length != v2.length)
		{
			throw new RuntimeException("Error! lengths don't match");
		}
		double dot = 0;
		for (int i = 0; i < v1.length; i++)
		{
			dot += v1[i] * v2[i];
		}
		return dot;
	}
 
	/**
	 * Calculated the Frobenius Norm (2-norm) of a matrix.
	 * 
	 * norm(mat) = sqrt(sum(mat[i][j]^2))
	 * 
	 * @param mat
	 * @return
	 */
	public static double fNorm(double[][] mat)
	{
		double sum = 0;
		for (int i = 0; i < mat.length; i++)
		{
			for (int j = 0; j < mat[i].length; j++)
			{
				sum += mat[i][j] * mat[i][j];
			}
		}
		return Math.sqrt(sum);
	}
 
	/**
	 * Uses the Gauss-Seidel method for calculating the solution to Ax = b.
	 * Stops when the tolerance is met or the max iterations is reached.
	 * 
	 * @param a
	 * @param b
	 * @param max
	 * @param tol
	 * @return
	 */
	public static double[] gaussSeidel(double[][] a, double[] b, int max, double tol)
	{
		double[] x = new double[b.length];
		// intial guesses: 0
		for (int count = 0; count < max; count++)
		{
			// calculate the residual
			if (OneToTen.fNorm(OneToTen.calculateResidual(a, x, b)) <= tol)
			{
				// within tolerance, stop
				break;
			}
			// outer loop
			for (int i = 0; i < b.length; i++)
			{
				// temporary value for calculating new x values
				double temp = 0;
				for (int j = 0; j < b.length; j++)
				{
					if (i != j)
					{
						temp = temp + a[i][j] * x[j];
					}
				}
				if (a[i][i] == 0)
				{
					// won't converge, divide by 0
					System.out.println("Won't converge!");
					return null;
				}
				x[i] = (b[i] - temp) / a[i][i];
			}
		}
		return x;
	}
 
	public static void main(String[] args) throws FileNotFoundException
	{
		double[][] a = { { -16, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, { 4, 1, 0, 0, 0, 0, 0, 0, 0, 0 },
				{ -16, -8, 1, 0, 0, 0, 0, 0, 0, 0 }, { 24, 13, -2, 1, 0, 0, 0, 0, 0, 0 },
				{ -37, -11, 2, 0, 1, 0, 0, 0, 0, 0 }, { 28, 20, -4, -1, 0, 1, 0, 0, 0, 0 },
				{ 22, 30, -5, -5, -2, 0, 1, 0, 0, 0 }, { -75, -41, 9, 0, 3, -1, 1, 1, 0, 0 },
				{ -42, -39, 6, 8, 4, 1, -2, 0, 1, 0 }, { 17, -27, 6, 6, 11, 4, 0, 2, 0, 1 } };
		double[] b = { -16, 6, -29, 48, -48, 58, 44, -106, -49, 110 };
		double[] vals = OneToTen.gaussSeidel(a, b, 100000, 1e-5);
		for (int i = 0; i < vals.length; i++)
		{
			System.out.print((int) vals[i] + " ");
		}
	}
 
	/**
	 * Performs the matrix multiplication mat1*mat2. Throws a runtime exception
	 * if col(mat1) != row(mat2). It is assumed that both matrices are
	 * non-jagged.
	 * 
	 * @param mat1
	 * @param mat2
	 * @return
	 */
	public static double[][] mMult(double[][] mat1, double[][] mat2)
	{
		if (mat1[0].length != mat2.length)
		{
			throw new RuntimeException("error! col{mat1) != col(mat2)");
		}
		double[][] result = new double[mat1.length][mat2[0].length];
		// simplify the process of getting the correct row
		double[][] temp = OneToTen.transpose(mat2);
		for (int i = 0; i < mat1.length; i++)
		{
			for (int j = 0; j < mat2[0].length; j++)
			{
				result[i][j] = OneToTen.dot(mat1[i], temp[j]);
			}
		}
		return result;
	}
 
	/**
	 * Transposes the matrix. Assumes a non-jagged matrix.
	 * 
	 * @param mat
	 * @return
	 */
	public static double[][] transpose(double[][] mat)
	{
		double[][] transposed = new double[mat[0].length][mat.length];
		for (int i = 0; i < transposed.length; i++)
		{
			for (int j = 0; j < mat.length; j++)
			{
				transposed[i][j] = mat[j][i];
			}
		}
		return transposed;
	}
}

**helloworld922** · April 3rd, 2010, 10:23 AM

18. C++

#include <iostream>
 
int main()
{
     int* a = new int[10];
     for (int i = 0; i < 10; i++)
     {
          *a = 10 - 1;
          a++;
     }
     for (int i = 0; i < 10; i++)
     {
          cout << a* << " ";
          a--;
     }
     delete[] a;
     return 0;
}

**helloworld922** · April 3rd, 2010, 10:26 AM

19. C++

#include <iostream>
#include <math.h>
 
int main()
{
     double a= 10;
     for (int i = 0; i < 10; i++)
     {
          cout << (int) log10(a) << " ";
          a *= 10;
     }
     return 0;
}

**helloworld922** · April 3rd, 2010, 11:00 AM

cheating

19. Matlab

1:10

**Darryl.Burke** · April 4th, 2010, 03:01 PM

20. Java:

int i = 1;
while (2520 % i == 0) {
  System.out.println(i++);
}

db

**copeg** · April 4th, 2010, 09:56 PM

Any rules against Rube Goldberg solutions? haha

# 21: java

class BitSolution 
{
	public static final int[] COUNT_BITS = {0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 
	3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 
	3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 
	5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 
	3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 
	4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 
	5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8};
	public static void main(String[] args){		
		int number = 1;
		int bits = 0;
		while (  (bits = countBits(number))  < 11 ){
			System.out.println(" " + bits );
			number |= ( bits << bits );
		}
 
	}
 
	public static int countBits(int value){
			return COUNT_BITS[ (value >> 24 ) & 0xff ] + 
					COUNT_BITS[ (value >> 16 ) & 0xff ] + 
					 COUNT_BITS[ (value >> 8 ) & 0xff ] +
					  COUNT_BITS[ (value ) & 0xff ];
	}
}

**copeg** · April 4th, 2010, 10:38 PM

Similar to Matlab
#22: R

c(1:10)

Thread: 500 Ways to Print 1 to 10

LinkBack

Thread Tools

Display

500 Ways to Print 1 to 10

Related threads:

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Re: 500 Ways to Print 1 to 10

Similar Threads

print code to browser

print space

How to print results to screen

Can someone please tell me why my code doesn't print out anything?

print hex decimal value