[ create a new paste ] login | about

Link: http://codepad.org/BhDaWj6h    [ raw code | output | fork ]

C++, pasted on Apr 1:
#include <stdio.h>
#include <math.h>

#include <iostream>

using namespace std;

void swap(int& n1, int& n2);

int main(int argc, char* argv[])
{
	long n = 1234567890;

	cout << "n = " << n << endl;

	//int* digits = new int[10];
	int digits[10]; int r = 0;
	for (long val = n; val >= 1; val/=10)
		digits[r++] = val % 10;
	
	int j = r-2;
	for (int i = 1; j >= r/2; i++, j--)
		swap(digits[i],digits[j]);

	int out = 0, t = r-1;
	for (int q = t; q >= 0; q--, t--)
		out+=digits[q] * (int)pow((float)10.,t);

	cout << "result = " << out << endl;

        return 0;
}

void swap(int& n1, int& n2)
 { int _tn = n1; n1 = n2; n2 = _tn; }


Output:
1
2
n = 1234567890
result = 1987654320


Create a new paste based on this one


Comments: