Consistent dir names

README.md

@@ -5,5 +5,5 @@ Solutions to problems from various competitive programming sites.
 Beware of old, questionable-looking, code.
 
 * More general solutions can be found under the directory 'algorithms-and-datastructures'
-* Problems found at 'Open Kattis' have been put in directory named after the problem title.
+* Problems found at 'Open Kattis' have been put in directories named after the problem title.
 * Problems I could only find through 'Online Judge' (UVa) are prepended with a 'u' and the problem number at UVa.

pseudoprime-numbers/main.cpp

@@ -1,19 +1,23 @@
 #include <stdio.h>
+#include <chrono>
+#include <iostream>
 typedef long long unsigned llu;
 
 
 bool isPrime(int n)
 {
-    if ( n == 2 || n == 3 )
+    if ( n == 2 || n == 3 ) {
         return true;
-    else if ( n%2 == 0 || n%3 == 0)
+    } else if ( n%2 == 0 || n%3 == 0 ) {
         return false;
+    }
 
     long unsigned i=5, o=0, m=3;
     while ( n != 1 && 0 < n && i < n/m )
     {
-        if ( n%i == 0 )
+        if( n%i == 0 ) {
             return false;
+        }
 
         m = i;
         if( i%6 == 5 ) {
@@ -28,7 +32,7 @@ bool isPrime(int n)
 
 llu repMod(const llu a, const llu p)
 {
-    if (p == 0) return 1;
+    if( p == 0 ) { return 1; }
 
     llu e = p;
     llu rem = 1;
@@ -42,7 +46,7 @@ llu repMod(const llu a, const llu p)
             rem *= c;
             rem %= p;
 
-            if (--e == 0) return rem;
+            if( --e == 0 ) { return rem; }
         }
 
         c *= c;
@@ -77,6 +81,8 @@ void isBAPP(int a, int p)
 int main()
 {
     int p, a;
+
+    auto t_start = std::chrono::high_resolution_clock::now();
     while(1)
     {
         scanf("%d %d\n", &p, &a);
@@ -85,4 +91,10 @@ int main()
         // Calc.
         isBAPP(a, p);
     }
+    auto t_stop = std::chrono::high_resolution_clock::now();
+
+    auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(t_stop - t_start);
+
+    std::cout << "Duration: " << duration.count() << std::endl;
 }
+