tests/python/triangular.py


print("somme des n premiers entiers")

n = int(input("entrez n : "))
#@ assume n >= 0

s = 0
k = 0
while k <= n:
    #@ invariant k <= n+1
    #@ invariant s == (k - 1) * k // 2
    #@ variant n - k
    s = s + k
    k = k + 1

print(s)
#@ assert s == n * (n+1) // 2
python: new examples 2017-02-21 08:27:14 +01:00
			`print("somme des n premiers entiers")`

			`n = int(input("entrez n : "))`
			`#@ assume n >= 0`

			`s = 0`
			`k = 0`
			`while k <= n:`
tests Python 2017-10-09 13:32:25 +02:00			`#@ invariant k <= n+1`
triangular.py: use a more natural formalisation 2017-03-06 16:19:32 +01:00			`#@ invariant s == (k - 1) * k // 2`
python: update for new_system 2017-04-25 17:02:29 +02:00			`#@ variant n - k`
python: new examples 2017-02-21 08:27:14 +01:00			`s = s + k`
			`k = k + 1`

			`print(s)`
triangular.py: use a more natural formalisation 2017-03-06 16:19:32 +01:00			`#@ assert s == n * (n+1) // 2`