zoukankan      html  css  js  c++  java
  • Codeforces 282A

    题目: A. Bit++

    time limit per test: 1 second
    memory limit per test: 256 megabytes
    input: standard input
    output: standard output

    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

    思路:

    不管是前++还是后++,我们取第二个字符,如果是’+‘那就++,如果是’-'那就- -;

    代码:

    #include<iostream>
    using namespace std;
    int main(){
    	int n,x=0;
    	scanf("%d",&n);
    	for(int i=0;i<n;i++){
    		char c[4];
    		scanf("%s",c);
    		if(c[1]=='+') x++;
    		else x--;
    	}
    	printf("%d",x);
    	return 0;
    }
    
  • 相关阅读:
    图论 —— tarjan 缩点 割点 (学习历程)连载中......
    模拟赛记
    模板(按照洛谷顺序)
    CSP-S退役记
    各知识点运用技巧总结
    P3665 [USACO17OPEN]Switch Grass
    跳跳棋——二分+建模LCA
    P3043 [USACO12JAN]牛联盟Bovine Alliance——并查集
    [ZJOI2013]K大数查询——整体二分
    CF741D Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths——dsu on tree
  • 原文地址:https://www.cnblogs.com/yuhan-blog/p/12308972.html
Copyright © 2011-2022 走看看