Happy :)
#define N 4
#define K 4
int parent[K];
int pN=0;
void permutation(int depth){
if(depth==K-1){
for(int i=0;i<K;i++){
printf("%d ",parent[i]);
}
printf("
");
pN++;
return;
}
for(int i=0;i<N;i++){
bool goFurther=true;
for(int j=0;j<=depth;j++){
if(parent[j]==i){
goFurther=false;
break;
}
}
if(goFurther){
parent[depth+1]=i;
permutation(depth+1);
}
}
}
int main(){
for(int i=0;i<N;i++){
parent[0] = i;
permutation(0);
}
printf("%d
",pN);
}
long a[100];
//fibonacci(i)
long fibonacci(int i){
if(a[i]!=-1){
return a[i];
}
//a[i] = fibonacci(i-2) + fibonacci(i-1);
return fibonacci(i-2) + fibonacci(i-1);
// return a[i];
}
int main(int argc, char** argv){
//if(argc!=2){
// printf("!!USAGE: fibo limit
");
// return 1;
//}
printf("%d
",sizeof(int));
printf("%d
",sizeof(long long));
a[0]=1;
a[1]=1;
for(int i=2;i<100;i++){
a[i]=-1;
}
int limit = 100;
for(int i=0;i<limit;i++){
if(i>0 && i%10==0){
printf("
");
}
printf("%015ld ",fibonacci(i));
}
printf("
");
}
#define N 5
char boggle[N][N+1]={
{"URLPM"},
{"XPRET"},
{"GIAET"},
{"XTNZY"},
{"XOQRS"}
};
int wordN = 6;
bool hasWord(int x, int y, int depth, const char* word){
if(x<0 || x>=N || y <0 || y >= N){
return false;
}
bool hasWordValue = boggle[x][y]==word[depth];
if(!hasWordValue) return hasWordValue;
if(depth==wordN-1) return hasWordValue;
if(hasWord(x+1,y+1,depth+1,word)){return true;}
if(hasWord(x+1,y-1,depth+1,word)){return true;}
if(hasWord(x-1,y-1,depth+1,word)){return true;}
if(hasWord(x-1,y+1,depth+1,word)){return true;}
if(hasWord(x+1,y,depth+1,word)){return true;}
if(hasWord(x-1,y,depth+1,word)){return true;}
if(hasWord(x,y+1,depth+1,word)){return true;}
if(hasWord(x,y-1,depth+1,word)){return true;}
return false;
}
int main(){
char word[10]="PRETTY";
if(hasWord(1,1,0,word)){
printf("%s exists
",word);
}
return 0;
}