| Task: | Säähavainnot | 
| Sender: | vgtcross | 
| Submission time: | 2023-10-30 00:46:03 +0200 | 
| Language: | C++ (C++20) | 
| Status: | READY | 
| Result: | 9 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 8.88 | 
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1.13 | details | 
| #2 | ACCEPTED | 0.02 s | 2 | details | 
| #3 | ACCEPTED | 0.02 s | 2.13 | details | 
| #4 | ACCEPTED | 0.02 s | 1.75 | details | 
| #5 | ACCEPTED | 0.02 s | 0.25 | details | 
| #6 | ACCEPTED | 0.02 s | 0 | details | 
| #7 | ACCEPTED | 0.02 s | 0.25 | details | 
| #8 | ACCEPTED | 0.02 s | 1.38 | details | 
Code
#include <bits/stdc++.h>
#define MODE 1
#if MODE
#define debug(x) cout << #x << ": " << x << endl
#define log(x) cout << x << endl
#define test(x) x
#else
#define debug(x)
#define log(x)
#define test(x)
#endif
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define X real()
#define Y imag()
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using P = complex<ll>;
const ll M = 1000000007; // 998244353
void solve() {
    vector<double> v(24);
    for (auto &i : v) cin >> i;
    double d = v[23] - v[0];
    for (int i = 0; i < 12; ++i) cout << v[i] + d << " \n"[i == 11];
}
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 0;
    if (t == 0) cin >> t;
    while (t--) solve();
    return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input | 
|---|
| 1000 -0.4 -0.1 -0.2 -0.3 -0.4 -0.5 ...  | 
| correct output | 
|---|
| 0.4 0.4 0.5 0.8 0.9 1.1 1.3 1.... | 
| user output | 
|---|
| 0.2 0.5 0.4 0.3 0.2 0.1 0.3 0.... Truncated  | 
Test 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 2.9 2.9 2.9 2.1 2.6 2 2 2.2 2....  | 
| correct output | 
|---|
| 2.3 1.6 1.5 1.1 1 0.7 0.6 0.8 ... | 
| user output | 
|---|
| 2.6 2.6 2.6 1.8 2.3 1.7 1.7 1.... Truncated  | 
Test 3
Verdict: ACCEPTED
| input | 
|---|
| 1000 6.6 6 6.4 6 4.6 4.6 4.2 4.3 4....  | 
| correct output | 
|---|
| 10 10.9 10.3 10.1 9.1 7.3 5.7 ... | 
| user output | 
|---|
| 10.1 9.5 9.9 9.5 8.1 8.1 7.7 7... Truncated  | 
Test 4
Verdict: ACCEPTED
| input | 
|---|
| 1000 19.4 20.2 19.1 18.9 18.3 17.3 ...  | 
| correct output | 
|---|
| 18 18.2 17 17.5 17.2 16.2 12 8... | 
| user output | 
|---|
| 17.2 18 16.9 16.7 16.1 15.1 13... Truncated  | 
Test 5
Verdict: ACCEPTED
| input | 
|---|
| 1000 -5.7 -5.8 -5.8 -5.9 -7.1 -6.9 ...  | 
| correct output | 
|---|
| -4.2 -4.1 -4 -3.8 -3.5 -3.2 -3... | 
| user output | 
|---|
| -4.5 -4.6 -4.6 -4.7 -5.9 -5.7 ... Truncated  | 
Test 6
Verdict: ACCEPTED
| input | 
|---|
| 1000 14.8 14.8 15.4 12.9 11.8 9.7 9...  | 
| correct output | 
|---|
| 11.8 11 11.6 10.8 10.4 10.4 10... | 
| user output | 
|---|
| 12.6 12.6 13.2 10.7 9.6 7.5 7.... Truncated  | 
Test 7
Verdict: ACCEPTED
| input | 
|---|
| 1000 0.7 1 2 1.4 0.6 -0.4 -0.9 -0.7...  | 
| correct output | 
|---|
| -1.3 -0.5 -0.6 -1 -3.2 -7.2 -6... | 
| user output | 
|---|
| -1.8 -1.5 -0.5 -1.1 -1.9 -2.9 ... Truncated  | 
Test 8
Verdict: ACCEPTED
| input | 
|---|
| 1000 15.1 15.3 14.9 14.4 14.4 13.7 ...  | 
| correct output | 
|---|
| 15.6 15.9 16 15.2 14.6 14.4 13... | 
| user output | 
|---|
| 15 15.2 14.8 14.3 14.3 13.6 12... Truncated  | 
