hi mukesh,
thanx , i got it after all.
minhaz.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group,
Hey Minhaz,
I have the same algorithm w/z you.
#include stdio.h
#include algorithm
#include memory.h
#include string.h
#include vector
using namespace std;
const int MAX_N = 17;
int used[MAX_N];
int Prime (int n)
{
if(n==1)
return 0;
if(n==2)
hey mukesh,
this code got 3 P.E. I am not sure why. Is it helpful?
#includestdio.h
#includestring
using namespace std;
int res[20],taken[20],c_len; bool p[35];
void prime(void);
void init(void);
void dp(int);
void main(void){
int cases=0;
/* freopen(c:pr.txt,w,stdout);*/
prime();
/*/
