https://github.com/amitthecoder/bit-plus-plus
https://github.com/amitthecoder/bit-plus-plus
codeforces codeforces-problems codeforces-solutions kotlin
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/amitthecoder/bit-plus-plus
- Owner: amitthecoder
- Created: 2024-10-05T02:31:24.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-05T02:35:01.000Z (over 1 year ago)
- Last Synced: 2025-03-19T12:17:52.998Z (about 1 year ago)
- Topics: codeforces, codeforces-problems, codeforces-solutions, kotlin
- Language: Kotlin
- Homepage:
- Size: 2.93 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Bit++
time limit per test : 1 second
memory limit per test : 256 megabytes
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
- Operation ++ increases the value of variable x by 1.
- Operation -- decreases the value of variable x by 1.
A statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters "+", "-", "X". Executing a statement means applying the operation it contains.
A programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.
You're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).
### Input
The first line contains a single integer n (1 ≤ n ≤ 150) — the number of statements in the programme.
Next n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order.
### Output
Print a single integer — the final value of x.
## Examples
### Input
1
++X
### Output
1
### Input
2
X++
--X
### Output
0