/* Author : Mohamed Ahmed
Just solution will be average * index - (sum of elements before it)
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin>>n ;
long long sum = 0 ;
for(int i = 1 ; i <= n ; ++i)
{
long long x ;
cin>>x ;
long long a = x * (i*1ll) - sum ;
cout<<a<<" ";
sum += a ;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
484 KB |
Output is correct |
3 |
Correct |
2 ms |
484 KB |
Output is correct |
4 |
Correct |
2 ms |
540 KB |
Output is correct |
5 |
Correct |
2 ms |
540 KB |
Output is correct |
6 |
Correct |
2 ms |
540 KB |
Output is correct |
7 |
Correct |
2 ms |
540 KB |
Output is correct |
8 |
Correct |
2 ms |
540 KB |
Output is correct |
9 |
Correct |
2 ms |
544 KB |
Output is correct |
10 |
Correct |
2 ms |
544 KB |
Output is correct |