A gpt/2025-10-07/circle.go

@@ -0,0 +1,32 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"log"
+	"os"
+	"strconv"
+)
+
+func main() {
+	pi := 3.1415
+
+	fmt.Println("radius:")
+	scanner := bufio.NewScanner(os.Stdin)
+	scanner.Scan()
+	err := scanner.Err()
+	if err != nil {
+		log.Fatal(err)
+	}
+	radius, err := strconv.ParseFloat(scanner.Text(), 32)
+	if err != nil {
+		log.Fatal(err)
+	}
+
+	
+	umfang := 2*radius*pi
+	flaeche := pi*radius*radius
+
+	fmt.Printf("umfang: %f\nfläche: %f", umfang, flaeche)
+}
+

A gpt/2025-10-07/numbers.go

@@ -0,0 +1,51 @@
+package main
+
+import(
+	"fmt"
+	"bufio"
+	"log"
+	"os"
+	"strconv"
+)
+
+func readNumber() int {
+	for {
+		scanner := bufio.NewScanner(os.Stdin)
+		scanner.Scan()
+		err := scanner.Err()
+		if err != nil {
+			log.Println(err)
+			continue
+		}
+		number, err := strconv.ParseInt(scanner.Text(), 0, 64)
+		if err != nil {
+			log.Println(err)
+			continue
+		}
+		return int(number)
+	}
+}
+
+func leftmost(number int) *int {
+	for ; number >= 10; number=number/10 {
+	}
+	return &number
+}
+
+func main(){
+	var maximum int
+	var sum int
+	var quersum int
+	poolSize := readNumber()
+
+	for i := 0; i < poolSize; i++ {
+		currentNumber := readNumber()
+		if currentNumber > maximum {
+			maximum = currentNumber
+		}
+		sum = sum + currentNumber
+		quersum = quersum + *(leftmost(currentNumber))
+	}
+	fmt.Printf("Maximum: %d\nSumme: %d\nQuersumme: %d\n\n", maximum, sum, quersum)
+}
+