Fibonacci numbers - the other way

Every programmer comes to the point where he or she must/should/wants to implement a programm for calculating fibonacci numbers. But I think my way is quite a new one.

Quine

A program, that prints out its own source code, is called a quine. In every turing-complete programming language it is possible to generate such a program. This fact was proven by Stephen Kleene in his so called recursion theorem.

Today i wrote my first quine (in C):

int main(int argc, char *argv[]){char* s=\"int main(int argc, char *argv[]){char* s=%c%s%c;printf(s,34,s,34);}\";printf(s,34,s,34);}