CF——Average Numbers

Average Numbers

Crawling in process... Crawling failed Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

You are given a sequence of positive integers a₁, a₂, ..., a_n. Find all such indices i, that the i-th element equals the arithmetic mean of all other elements (that is all elements except for this one).

Input

The first line contains the integer n (2 ≤ n ≤ 2·10⁵). The second line contains elements of the sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000). All the elements are positive integers.

Output

Print on the first line the number of the sought indices. Print on the second line the sought indices in the increasing order. All indices are integers from 1 to n.

If the sought elements do not exist, then the first output line should contain number 0. In this case you may either not print the second line or print an empty line.

Sample Input

Input

5
1 2 3 4 5

Output

1
3 

Input

4
50 50 50 50

Output

4
1 2 3 4 

题解：给出n个正整数，从第一个数开始遍历，若第i个数等于其他数之和的平均数，计数器加1，最后，输出符合条件的个数以及按照遍历顺序输出该数的序号，要注意的是，整数的序号从1开始算起。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

int shu[200000],sh[200000];

int main()
{
    int n,i,j,k;
    int sum = 0;
    scanf("%d",&n);
    for(i = 0; i<n; i++)
    {
        scanf("%d",&shu[i]);
        sum = sum + shu[i];
    }
    int num = 0,mm,nn;
    j = 0;
    for(i = 0; i<n; i++)
    {
        mm = sum - shu[i];
        nn = (n-1) * shu[i];
        if(mm == nn)
        {
            num++;
            sh[j++] = i+1;
        }
    }
    printf("%d\n",num);
    if(num == 0)
        printf("\n");
    else
    {
        for(i = 0;i<j;i++)
        {
            if(i == 0)
                printf("%d",sh[i]);
            else
                printf(" %d",sh[i]);
        }
        printf("\n");
    }
    return 0;
}