Säähavainnot

// Lähde: GeeksForGeeks
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
 
class Regression {
    vector<float> x;
    vector<float> y;
    float coeff;
    float constTerm;
    float sum_xy;
    float sum_x;
    float sum_y;
    float sum_x_square;
    float sum_y_square;
 
public:
    Regression() {
        coeff = 0;
        constTerm = 0;
        sum_y = 0;
        sum_y_square = 0;
        sum_x_square = 0;
        sum_x = 0;
        sum_xy = 0;
    }
 
    void calculateCoefficient() {
        float N = x.size();
        float numerator
            = (N * sum_xy - sum_x * sum_y);
        float denominator
            = (N * sum_x_square - sum_x * sum_x);
        coeff = numerator / denominator;
    }
 
    void calculateConstantTerm() {
        float N = x.size();
        float numerator
            = (sum_y * sum_x_square - sum_x * sum_xy);
        float denominator
            = (N * sum_x_square - sum_x * sum_x);
        constTerm = numerator / denominator;
    }
 
    void takeInput(int n, int tries) {
        for (int i = 0; i < 24-tries; ++i) {
            float x;
            cin >> x;
        }
        for (int i = 0; i < tries; ++i) {
            float xi = i+1;
            float yi;
            cin >> yi;
            sum_xy += xi * yi;
            sum_x += xi;
            sum_y += yi;
            sum_x_square += xi * xi;
            sum_y_square += yi * yi;
            x.push_back(xi);
            y.push_back(yi);
        }
    }
 
    void lisaa_havainto(float xi, float yi) {
        sum_xy += xi * yi;
        sum_x += xi;
        sum_y += yi;
        sum_x_square += xi * xi;
        sum_y_square += yi * yi;
        x.push_back(xi);
        y.push_back(yi);
    }
 
    float predict(float x) {
        return coeff * x + constTerm;
    }
};
 
 
int main() {
    int n, tries = 3;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        Regression reg;
        reg.takeInput(24, tries);
        for (int j = 1; j <= tries; ++j) {
            reg.calculateCoefficient();
            reg.calculateConstantTerm();
            float ennuste = reg.predict(j+tries);
            cout << ennuste << ' ';
            reg.lisaa_havainto(j+tries,ennuste);
        }
        for (int i = 0; i < 12-tries; ++i)
            cout << "? ";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED