zoukankan      html  css  js  c++  java
  • Stripe

    Description

    Once Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?

    Input

    The first input line contains integer n (1 ≤ n ≤ 105) — amount of squares in the stripe. The second line contains n space-separated numbers — they are the numbers written in the squares of the stripe. These numbers are integer and do not exceed 10000 in absolute value.

    Output

    Output the amount of ways to cut the stripe into two non-empty pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece. Don't forget that it's allowed to cut the stripe along the squares' borders only.

    Sample Input

    Input
    9
    1 5 -6 7 9 -16 0 -2 2
    Output
    3
    Input
    3
    1 1 1
    Output
    0
    Input
    2
    0 0
    Output
    1

    题意:
    一个序列 有几种划分方法 让 左右两部分相等
    代码 很短看看就知道了
    #include<iostream>
    using namespace std;
    long long int x[100005];
    int main(){
        int n;
        while(cin>>n){
                x[0]=0;
            for(int i=1;i<=n;i++){
                cin>>x[i];
                x[i]=x[i]+x[i-1];
            }
            int sum=0;
            for(int i=2;i<=n;i++){
                if(x[n]-x[i-1]==x[i-1])sum++;
            }
            cout<<sum<<endl;
        }
    return 0;
    }
    View Code
  • 相关阅读:
    线程池3种终止方式比较
    SQL Update多表联合更新的方法
    SQL SERVER 表添加新字段
    JSONObject
    char码值对应列表大全
    JSONOjbect,对各种属性的处理
    Spring MVC ajax提交方式
    docker 初学者 安装 命令
    VMware虚拟机安装CentOS7 设置Nat网络 (超详细)
    关于 i++ 和 ++ i
  • 原文地址:https://www.cnblogs.com/demodemo/p/4716145.html
Copyright © 2011-2022 走看看