Submission #61584837

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
using namespace std;
inline void givestone(int* A, int giver, int taker) {
  if (A[giver] > 0)
  {
    A[giver]--;
    A[taker]++;
  }
  return;
}
int main() {
  int N, A[500000]; 
  cin >> N;
  for (int i = 0; i < N; i++)
  {
    cin >> A[i];
  }
  
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
using namespace std;

inline void givestone(int* A, int giver, int taker) {
	if (A[giver] > 0)
	{
		A[giver]--;
		A[taker]++;
	}
	return;
}


int main() {
	int N, A[500000]; 
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
	}
	
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < i; j++)
		{
			givestone(A, j, i);
		}
	}

	for (int i = 0; i < N - 1; i++)
	{
		cout << A[i] << ' ';
	}
	cout << A[N - 1] << endl;
	return 0;
}

Submission Info

Judge Result