1209B - Koala and Lights - CodeForces Solution

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

int main() {
// 	cout<<"GfG!";
    
    
        int n;
        cin>>n;
        
        string light;
        cin>>light;
        
        vector<int > v1;
        vector<int> v2;
        
        for( int i=0; i<n; i++)
        {
            int x,y;
            cin>>x>>y;
            v1.push_back(x);
            v2.push_back(y);
        }
        
        
        vector<int> p(n,0);
        int count=0;
        
        
        int count_max=0;
        
                    for( int j=0; j<n; j++)
            {
                if( light[j]=='1') count++;
                
            }
            
            count_max=count;
        
        for( int i=1; i<10000; i++)
        {
            count=0;
            for( int j=0; j<n; j++)
            {
                if( i%(v2[j]+p[j]*v1[j])==0 )
                {
                    p[j]++;
                    if( light[j]=='0') light[j]='1';
                    else light[j]='0';
                }
            }
            
            for( int j=0; j<n; j++)
            {
                if( light[j]=='1') count++;
                
            }
            
            count_max=max(count,count_max);
            
        }
        
        cout<<count_max<<endl;
    
	return 0;
}