zl程序教程

您现在的位置是:首页 >  其它

当前栏目

CodeForces - 282A Bit++ (水)

Codeforces ++ bit
2023-09-14 08:56:48 时间


CodeForces - 282A


Bit++



Submit Status




Description




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
  • Operation -- decreases the value of variable x

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.

Youre 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)

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.






Sample Input





Input



1++X





Output



1





Input



2X++--X





Output



0





Source



Codeforces Round #173 (Div. 2)



/题意:++表示自增1,--表示自减1



给你n个字符串,让你输出这n个字符串最后的计算结果。




#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int judge(char *s)
{
	int l=strlen(s);
	for(int i=0;i<l;i++)
	{
		if(s[i]==+) return 1;			
		if(s[i]==-) return -1;			
	}
	return 0;
}
char s[20];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int cnt=0;
		while(n--)
		{
			scanf("%s",s);
			cnt+=judge(s);
		}
		printf("%d\n",cnt);
	}
	return 0;
}




Time Limit: 1000MS

 

Memory Limit: 262144KB

 

64bit IO Format: %I64d & %I64u