|
|
1.1 ! root 1: #define N 200 ! 2: int b1[10]; ! 3: int b2[10]; ! 4: ! 5: main() ! 6: { ! 7: double t; ! 8: register i, a = 0; ! 9: int n; ! 10: ! 11: times(b1); ! 12: for(n=0; n<N; n++) ! 13: for(i=1000; --i;) { ! 14: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 15: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 16: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 17: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 18: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 19: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 20: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 21: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 22: a++;a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 23: a++;a++;a++;a++;a++;a++;a++;a++;a++; ! 24: } ! 25: a = a; ! 26: times(b2); ! 27: if(b2[0]) ! 28: t = b2[0]-b1[0]; else ! 29: t = b2[1]-b1[1]; ! 30: t = (6.*N)/t; ! 31: printf("%.2f\n", t); ! 32: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.