Submission #71487556

---

Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
 
#ifndef ONLINE_JUDGE
#include "debug.h"
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
template <class T> void output(vector < T > & a) { for (auto & x: a) {cout << x << ' ';}cout << '\n';}


 
// Golden Rules
/*
    Solutions are simple.
 
    Proofs are simple.
 
    Implementations are simple.
 
                         ~ TEJA DRONADULA SIR!!
*/



void solve() {
     int n;
     cin >> n;
     vector<int> a(n);
     for (int i = 0; i < n; ++i) {
          cin >> a[i];
     }
     int ans = 0;
     for (int i = 0; i < n; ++i) {
          int s = 0;
          for (int j = i; j < n; ++j) {
               s += a[j];
               int ok = 1;
               for (int k = i; k <= j; ++k) {
                    if (s % a[k] == 0) {
                         ok = 0;
                    }
               }
               ans += ok;
          }
     }
     cout << ans;
} 



int32_t main() {
     ios::sync_with_stdio(false);
     cin.tie(nullptr);
 
     #ifndef ONLINE_JUDGE
          freopen("input.txt", "r", stdin);
          freopen("output.txt", "w", stdout);
          freopen("error.txt", "w", stderr);
     #endif

     int t = 1;
     // cin >> t; 


     for (int cases = 1; cases <= t; ++cases) {
          solve();
     }
 
     #ifndef ONLINE_JUDGE
          double T = 1000.0 * clock() / CLOCKS_PER_SEC;
          cout << "\n[Finished in " << T << "ms]";
          cerr << "\n[Finished in " << T << "ms]";
     #endif
 
     return 0;
}

Submission Info

Judge Result