Submission

Status:

PPPPPP

Score: 100

User: Winzzwz

Problemset: แตกต่างกัน

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-05 20:42:34

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

int n,dp[110];
set <int> st;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> dp[i];
        dp[i] += dp[i-1];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            st.insert(dp[j]-dp[i-1]);
        }
    }
    cout << st.size();

    
    return 0;
}