134A - Average Numbers - CodeForces Solution


brute force implementation *1200

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;

const int N = 2e5+5;
typedef long long LL;
int a[N], n, sum = 0;
int b[N], t = 0;

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i ++){
		scanf("%d", &a[i]);
		sum += a[i];
	}
	for(int i = 1; i <= n; i ++){
		if((sum-a[i])%(n-1) == 0 && a[i] == (sum-a[i])/(n-1))b[t++] = i;
	}
	cout << t << endl;
	for(int i = 0; i < t; i ++){
		cout << b[i] << " ";
	}
	cout << endl;
}

int main(){

	int T = 1;
//	cin >> T;
	while(T--)solve();

    return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST