zoukankan      html  css  js  c++  java
  • Codeforces Round #540 (Div. 3)--1118B

    Tanya has nn candies numbered from 11 to nn. The ii-th candy has the weight aiai.

    She plans to eat exactly n1n−1 candies and give the remaining candy to her dad. Tanya eats candies in order of increasing their numbers, exactly one candy per day.

    Your task is to find the number of such candies ii (let's call these candies good) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days. Note that at first, she will give the candy, after it she will eat the remaining candies one by one.

    For example, n=4n=4 and weights are [1,4,3,3][1,4,3,3]. Consider all possible cases to give a candy to dad:

    • Tanya gives the 11-st candy to dad (a1=1a1=1), the remaining candies are [4,3,3][4,3,3]. She will eat a2=4a2=4 in the first day, a3=3a3=3 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 4+3=74+3=7 and in even days she will eat 33. Since 737≠3 this case shouldn't be counted to the answer (this candy isn't good).
    • Tanya gives the 22-nd candy to dad (a2=4a2=4), the remaining candies are [1,3,3][1,3,3]. She will eat a1=1a1=1 in the first day, a3=3a3=3 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 33. Since 434≠3 this case shouldn't be counted to the answer (this candy isn't good).
    • Tanya gives the 33-rd candy to dad (a3=3a3=3), the remaining candies are [1,4,3][1,4,3]. She will eat a1=1a1=1 in the first day, a2=4a2=4 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 44. Since 4=44=4 this case should be counted to the answer (this candy is good).
    • Tanya gives the 44-th candy to dad (a4=3a4=3), the remaining candies are [1,4,3][1,4,3]. She will eat a1=1a1=1 in the first day, a2=4a2=4 in the second day, a3=3a3=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 44. Since 4=44=4 this case should be counted to the answer (this candy is good).

    In total there 22 cases which should counted (these candies are good), so the answer is 22.

    Input

    The first line of the input contains one integer nn (1n21051≤n≤2⋅105) — the number of candies.

    The second line of the input contains nn integers a1,a2,,ana1,a2,…,an (1ai1041≤ai≤104), where aiai is the weight of the ii-th candy.

    Output

    Print one integer — the number of such candies ii (good candies) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days.

    Examples
    input
    Copy
    7
    5 5 4 5 5 5 6
    
    output
    Copy
    2
    
    input
    Copy
    8
    4 8 8 7 8 4 4 5
    
    output
    Copy
    2
    
    input
    Copy
    9
    2 3 4 2 2 3 2 2 4
    
    output
    Copy
    3

     

    #include<iostream>
    using namespace std;
    int num[200005];
    int main(){
        int n;
        cin>>n;
        int evenPre=0,oddPre=0,even=0,odd=0;
        for(int i=0;i<n;i++){
            cin>>num[i];
            if(i&1)
                odd+=num[i];
            else
                even+=num[i];
        }
        int ans=0;
        for(int i=0;i<n;i++){
            if(i&1)
                odd-=num[i];
            else
                even-=num[i];            
            if(oddPre+even==evenPre+odd)
                ans++;
            if(i&1)
                oddPre+=num[i];
            else
                evenPre+=num[i];
        }
        cout<<ans<<endl;
        return 0;
    }

    Ta

    nn;njklya has nn candies numbered from 11 to nn. The ii-th candy has the weight aiai.

    She plans to eat exactly n1n−1 candies and give the remaining candy to her dad. Tanya eats candies in order of increasing their numbers, exactly one candy per day.

    Your task is to find the number of such candies ii (let's call these candies good) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days. Note that at first, she will give the candy, after it she will eat the remaining candies one by one.

    For example, n=4n=4 and weights are [1,4,3,3][1,4,3,3]. Consider all possible cases to give a candy to dad:

    • Tanya gives the 11-st candy to dad (a1=1a1=1), the remaining candies are [4,3,3][4,3,3]. She will eat a2=4a2=4 in the first day, a3=3a3=3 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 4+3=74+3=7 and in even days she will eat 33. Since 737≠3 this case shouldn't be counted to the answer (this candy isn't good).
    • Tanya gives the 22-nd candy to dad (a2=4a2=4), the remaining candies are [1,3,3][1,3,3]. She will eat a1=1a1=1 in the first day, a3=3a3=3 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 33. Since 434≠3 this case shouldn't be counted to the answer (this candy isn't good).
    • Tanya gives the 33-rd candy to dad (a3=3a3=3), the remaining candies are [1,4,3][1,4,3]. She will eat a1=1a1=1 in the first day, a2=4a2=4 in the second day, a4=3a4=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 44. Since 4=44=4 this case should be counted to the answer (this candy is good).
    • Tanya gives the 44-th candy to dad (a4=3a4=3), the remaining candies are [1,4,3][1,4,3]. She will eat a1=1a1=1 in the first day, a2=4a2=4 in the second day, a3=3a3=3 in the third day. So in odd days she will eat 1+3=41+3=4 and in even days she will eat 44. Since 4=44=4 this case should be counted to the answer (this candy is good).

    In total there 22 cases which should counted (these candies are good), so the answer is 22.

    Input

    The first line of the input contains one integer nn (1n21051≤n≤2⋅105) — the number of candies.

    The second line of the input contains nn integers a1,a2,,ana1,a2,…,an (1ai1041≤ai≤104), where aiai is the weight of the ii-th candy.

    Output

    Print one integer — the number of such candies ii (good candies) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days.

    Examples
    input
    Copy
    7
    5 5 4 5 5 5 6
    
    output
    Copy
    2
    
    input
    Copy
    8
    4 8 8 7 8 4 4 5
    
    output
    Copy
    2
    
    input
    Copy
    9
    2 3 4 2 2 3 2 2 4
    
    output
    Copy
    3
  • 相关阅读:
    tensorflow入门(三)
    tensorflow入门(二)
    setTimeout
    PreResultListener
    sql 删除重复记录
    oracle dual表用途及结构详解
    oracle中的dual表
    Dubbo远程调用服务框架原理与示例
    struts2和spring的两种整合方式
    Timer和TimerTask详解
  • 原文地址:https://www.cnblogs.com/albert67/p/10410316.html
Copyright © 2011-2022 走看看