From 644dd9402d6a9d4b2d68ab44bc0c44fee8b2c726 Mon Sep 17 00:00:00 2001 From: Roman Kurnovskii Date: Tue, 4 Apr 2023 08:05:46 +0300 Subject: [PATCH] upd --- .../codeforces/01-implementation-and-greedy/1778A.en.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/content/tracks/algorithms-101/codeforces/01-implementation-and-greedy/1778A.en.md b/content/tracks/algorithms-101/codeforces/01-implementation-and-greedy/1778A.en.md index 072b090a01..5f987d9e17 100644 --- a/content/tracks/algorithms-101/codeforces/01-implementation-and-greedy/1778A.en.md +++ b/content/tracks/algorithms-101/codeforces/01-implementation-and-greedy/1778A.en.md @@ -1,5 +1,5 @@ --- -title: "1788A - One and Two - 800" +title: "1788A - Flip Flop Sum - 800" seoTitle: "Solution Codeforces 1778A - Flip Flop Sum (greedy, implementation, 800)" description: "Codeforces 1778A - Flip Flop Sum (greedy, implementation, 800)" toc: true @@ -12,7 +12,7 @@ draft: false weight: 80 --- -[1778A - Flip Flop Sum (greedy, implementation, 800)](https://codeforces.com/contest/1788/problem/A) +[1778A - Flip Flop Sum (greedy, implementation, 800)](https://codeforces.com/contest/1778/problem/A) There are three possible conditions: 1. `-1 -1` - all negative. In this case sum `-2` becomes sum `2`. Plus 4. @@ -22,7 +22,6 @@ There are three possible conditions: **Solution:** ```python - def solve(): n = int(input()) ar = list(map(int, input().split()))