Updated godbolt code.

2 files changed, 3 insertions, 3 deletions

diff --git a/docs/algorithm_api.md b/docs/algorithm_api.md
index 127aa120..63bced22 100644
--- a/docs/algorithm_api.md
+++ b/docs/algorithm_api.md
@@ -128,7 +128,7 @@ Iterate a container or a crange with chained `&&` filtering.
 | `c_flt_counter(it)`               | Increment current and return count         |
 | `c_flt_getcount(it)`              | Number of items passed skip*/take*/counter |
 
-[ [Run this example](https://godbolt.org/z/n9aYrYPv8) ]
+[ [Run this example](https://godbolt.org/z/exqYEK6qa) ]
 ```c
 #include <stc/algorithm.h>
 #include <stdio.h>
diff --git a/docs/coroutine_api.md b/docs/coroutine_api.md
index 6bd558f2..f7d81a34 100644
--- a/docs/coroutine_api.md
+++ b/docs/coroutine_api.md
@@ -78,7 +78,7 @@ yield or await from a (deeply) nested coroutine call using cco_task objects desc
 
 The first example is a generator of Pythagorian triples, and stops when diagonal size > max_c.
 
-[ [Run this code](https://godbolt.org/z/3Efn17cP6) ]
+[ [Run this code](https://godbolt.org/z/d5zW3f9Gv) ]
 ```c
 #include <stc/coroutine.h>
 #include <stdio.h>
@@ -126,7 +126,7 @@ The next variant skips the triples which are upscaled version of smaller ones by
 the gcd() function. Note that the gcd1_triples struct contains the triples struct so that
 both functions have separate call frames:
 
-[ [Run this code](https://godbolt.org/z/ndhMq1haj) ]
+[ [Run this code](https://godbolt.org/z/a7da9M8P5) ]
 ```c
 int gcd(int a, int b) { // greatest common denominator
     while (b) {