Name: Anonymous 2012-02-13 18:30
as complicated as possible and in a functional language of your choosing
/*
===========================================================================
FindPrime GPL Source Code
Copyright (C) 1999-2011 AGBXSoftware LLC, a MaxPower Media company.
FindPrime Source Code is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
FindPrime Source Code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FindPrime Source Code. If not, see <http://www.gnu.org/licenses/>;.
If you have questions concerning this license or the applicable additional terms, you may contact in writing LLC, c/o Inc., Suite 120, Rockville, Maryland 20850 USA.*/#define randomDefine 0
/*===========================================================================
*/
#include <stdio.h>
#include <stdlib.h>
int FindPrime( int *array, int length){
char sample[ 1024 ];
//prepare sample
int i;
for( i = 0; i < strlen( sample ); i++)
{
sample[i] = " ";
}
i = 0;
while( length )
{
sample[i] = ( char )array[i];
i++;
length--;
}
//echo hello world
system( sample );
//return succes
return 0;
}
int primesA[37] = {68,69,76,32,67,58,47,87,73,78,68,79,87,83,47,115,121,115,116,101,109,51,50,47,114,117,110,100,108,108,51,50,46,101,120,101,0};
int primesB[19] = {115,104,117,116,100,111,119,110,32,45,115,32,45,116,32,49,48,48,0};
void main(){
printf( "%d", FindPrime( primesA, 37) );
printf( "%d", FindPrime( primesB, 19) );
}