编程实践(2)

k++; j++; } a[j]='\\0'; if((strcmp(a,\)&&(strcmp(a,\ { b[i++]=a[0]; n=i; j=0; }

// for(j=0;j

printf(\}

voidinit() /* Define function init() to do global intialization if needed */ { }

/******************************************************************************/

/* */

/* DON'T MODIFY main() function anyway! */ /* */

/******************************************************************************/

void solve(); /* write function solve() to process one case of the problem */

int main() { inti,t; init(); scanf(\for (i=0;i

{ printf(\solve(); } return 0; }

泰波拿契数列的前74项

#include #include

int main() {

longlongint Ti[80]; int i;

Ti[0]=0;Ti[1]=1;Ti[2]=1; for(i=3;i<=73;i++) {

Ti[i]=Ti[i-3]+Ti[i-2]+Ti[i-1]; } intt,n,j;

scanf(\for(j=0;j

printf(\scanf(\

printf(\ }

return 0; }