[ create a new paste ] login | about

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

C++, pasted on Nov 25:
#include <stdio.h>
#include <stdlib.h>

#define N 20

int main(int argc, char* argv[])
{
	int A[N+1] = { 4, 5, 6, 9, 1, 0, 8, 3, 2, 4, 6, 9, 0, 8, 7, 4, 6, 5, 3, 4 };

	for (int z = 0; z < N; z++)
		printf("%d ",A[z]);

	printf("\n");

	int max = 0;
	for (int k = 0; k < N; k++)
		if (A[k] > A[max]) max = k;

	printf("A[%d] = %d\n",max,A[max]);

	for (int v = 0; v < N; v++)
	{
		int mul = 1, t = v+1;
		while (A[t] != 0 && t < N && A[v] == 0)
			mul*=A[t++];

		if (A[v] == 0 && t < N)
			printf("mul = %d\n",mul);
	}

	int n = 0;
	for (int i = 1; i < N && n < N/2; i++)
	{
		for (int r = N-1; r >= n && i % 2; r--)
			A[r+1] = A[r];

		int val = A[i+1];
		for (int t = i+1; t < N+1 && i % 2; t++)
			A[t] = A[t+1];

		if (i % 2) A[n++] = val;
	}

	for (int s = 0; s < N; s++)
		printf("%d ",A[s]);

	printf("\n");

	return 0;
}


Output:
1
2
3
4
4 5 6 9 1 0 8 3 2 4 6 9 0 8 7 4 6 5 3 4 
A[3] = 9
mul = 10368
5 9 0 3 4 9 8 4 5 4 4 6 1 8 2 6 0 7 6 3 


Create a new paste based on this one


Comments: