Solution: Big (O) of Nested Loop with Addition

int main(){
  int n = 10;
  int sum = 0;     
  float pie = 3.14;   
  for (int i=0; i<n; i+=3){  // O(n/3)
    cout << pie << endl;        // O(n/3)
    for (int j=0; j<n; j+=2){    // O((n/3)*(n/2)) 
      sum += 1;        // O((n/3)*(n/2))
      cout << sum << endl;   // O((n/3)*(n/2))
    }
  }
}