Language: C++

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;
 
 
 
int main() {
    int n;
    scanf("%d",&n);

    int a[n+1]={};
    int b[n+1][25];

    srep(i,1,n+1){
        int aaa;
        scanf("%d",&aaa);
        a[i] = aaa;
        int j=0;
        while(aaa>=0){
            if(aaa>0){
                b[i][j] = aaa % 2;
                aaa = aaa / 2; 
                j++;
            }else{
                b[i][j] = -1;
            }
        }
    }

    ll calc = 0;
    int l = 1;
    int r = 1;
    int temp[25] = {};
    int count = 0;
    int flag = 1; //OKなら1、NGなら0、初期状態は1。
    while(true){
        int k = 0;
        if(flag==1){
            while(b[k]!=-1){
                if(b[k]==1){
                    if(temp[k]==0){
                        temp[k]=1;
                    }else{
                        flag=0;
                        break;
                    }
                }
            }
        }
        if(flag==1){
            if(r=n){//終了条件
                //計算
                calc += r-l+1;
                break;
            }else{
                r-l+1;
                count++
                r++;
            }
        }else{
            count = 0;
            l++;
        }
    }


    ll ans = 0;
    ans = calc;
    cout << ans << endl;
   
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:88:23: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   88 |             while(b[k]!=-1){
      |                   ~~~~^~~~
a.cc:89:24: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   89 |                 if(b[k]==1){
      |                    ~~~~^~~
a.cc:106:24: error: expected ';' before 'r'
  106 |                 count++
      |                        ^
      |                        ;
  107 |                 r++;
      |                 ~