Algorithmic Competition Primer Classic (II)

Example 2-4 file read and write (Freopen redirect)

#include <stdio.h>#defineINF 1000000000intFile_freopen () {intx,min=inf,max=-inf,s=0, count=0; Freopen ("e:\\code\\c\\ Algorithm Competition Primer Classic \\Debug\\input.txt","R", stdin); Freopen ("e:\\code\\c\\ Algorithm Competition Primer Classic \\Debug\\output.txt","W", stdout);  while(SCANF ("%d", &x) = =1) {S+=x; if(x<min) min=x; if(X>max) max=x; Count++; } printf ("%d%d%.3lf\n", Min,max, (Double) s/count); return 0;}

Example 2-4 file read and write (fopen)

#include <stdio.h>#defineINF 1000000000intFile_fopen () {intx,min=inf,max=-inf,s=0, count=0; FILE*fin,*Fout; Fin= fopen ("e:\\code\\c\\ Algorithm Competition Primer Classic \\Debug\\input.txt","RB"); Fout= fopen ("e:\\code\\c\\ Algorithm Competition Primer Classic \\Debug\\output.txt","WB");  while(FSCANF (FIN,"%d", &x) = =1) {S+=x; if(x<min) min=x; if(X>max) max=x; Count++; } fprintf (Fout,"%d%d%.3lf\n", Min,max, (Double) s/count);    Fclose (stdin);    Fclose (stdout); return 0;}

Exercise 2-2 Narcissus number

#include <stdio.h>intDaffodil () {inta,b,c,x;  for(a=1; a<=9; a++)    {         for(b=0; b<=9; b++)        {             for(c=0; c<=9; C + +) {x=a* -+b*Ten+C; if(X==A*A*A+B*B*B+C*C*C)//Abc=a*a*a+b*b*b*c*c*cprintf"%d\n", x); }        }    }    return 0;}

Algorithmic Contest Introduction Classic (II)