chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.TreeMap;
import java.util.Map;

chermehdi

def generate_primes(n):
  seive = [True] * n
  pr = []
  for i in range(2, n):
    if seive[i]:
      j = 2 * i
      while j < n:
        seive[j] = False
        j += i
      pr.append(i)

chermehdi

package com.mehdi.main.codeforces.div_505;

import com.mehdi.lib.ds.CountingMap;
import com.mehdi.lib.io.InputReader;
import com.mehdi.lib.math.IntMath;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.Map;

chermehdi

package com.mehdi.main.codeforces.div_503;

import com.mehdi.lib.io.InputReader;
import java.io.PrintWriter;
import java.util.HashMap;

import static com.mehdi.lib.Factories.*;

public class VirtualFriends {

chermehdi

package com.mehdi.main.codeforces.div_503;

import com.mehdi.lib.ArrayUtils;
import com.mehdi.lib.io.InputReader;
import java.io.PrintWriter;

import static com.mehdi.lib.Factories.*;

public class BingItOn {

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in Actual solution is at the top

chermehdi

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;
import java.io.IOException;
import java.io.InputStream;

chermehdi

Super Computer

Problem

• Given a binary array, perform two types of queries on it:

  [1] - F x     flip the bit at position x
  [2] - C l r   count the number of set bits in the range [l, r]