1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | #include <iostream> #include <chrono> #include <ctime> int fibonacci(int n) { if (n < 3) return 1; return fibonacci(n-1) + fibonacci(n-2); } int main() { std::chrono::time_point<std::chrono::system_clock> start, end; start = std::chrono::system_clock::now(); int result = fibonacci(42); end = std::chrono::system_clock::now(); int elapsed_seconds = std::chrono::duration_cast<std::chrono::nanoseconds> (end-start).count(); std::time_t end_time = std::chrono::system_clock::to_time_t(end); std::cout << "finished computation at " << std::ctime(&end_time) << "elapsed time: " << elapsed_seconds << "ns\n"; } |
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y2hyb25vPgojaW5jbHVkZSA8Y3RpbWU+CiAKaW50IGZpYm9uYWNjaShpbnQgbikKewogICAgaWYgKG4gPCAzKSByZXR1cm4gMTsKICAgIHJldHVybiBmaWJvbmFjY2kobi0xKSArIGZpYm9uYWNjaShuLTIpOwp9CiAKaW50IG1haW4oKQp7CiAgICBzdGQ6OmNocm9ubzo6dGltZV9wb2ludDxzdGQ6OmNocm9ubzo6c3lzdGVtX2Nsb2NrPiBzdGFydCwgZW5kOwogICAgc3RhcnQgPSBzdGQ6OmNocm9ubzo6c3lzdGVtX2Nsb2NrOjpub3coKTsKICAgIGludCByZXN1bHQgPSBmaWJvbmFjY2koNDIpOwogICAgZW5kID0gc3RkOjpjaHJvbm86OnN5c3RlbV9jbG9jazo6bm93KCk7CiAKICAgIGludCBlbGFwc2VkX3NlY29uZHMgPSBzdGQ6OmNocm9ubzo6ZHVyYXRpb25fY2FzdDxzdGQ6OmNocm9ubzo6bmFub3NlY29uZHM+CiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgKGVuZC1zdGFydCkuY291bnQoKTsKICAgIHN0ZDo6dGltZV90IGVuZF90aW1lID0gc3RkOjpjaHJvbm86OnN5c3RlbV9jbG9jazo6dG9fdGltZV90KGVuZCk7CiAKICAgIHN0ZDo6Y291dCA8PCAiZmluaXNoZWQgY29tcHV0YXRpb24gYXQgIiA8PCBzdGQ6OmN0aW1lKCZlbmRfdGltZSkKICAgICAgICAgICAgICA8PCAiZWxhcHNlZCB0aW1lOiAiIDw8IGVsYXBzZWRfc2Vjb25kcyA8PCAibnNcbiI7Cn0=
-
upload with new input
-
result: Success time: 1.24s memory: 3016 kB returned value: 0
finished computation at Fri Aug 10 03:26:55 2012 elapsed time: 1239804000ns


