RohithKumar1368

#include<stdio.h>

int main(){
  int n ;
  int sum ;
  scanf("%d",&n) ;

  int three = (n-1) / 3 ; // no of 3 multiples below n
  int five = (n-1) / 5 ; // no of 5 multiples below n
  int fifteen = (n-1) / 15 ; // no of 15 multiples below n

RohithKumar1368

// problem at https://www.hackerrank.com/challenges/mini-max-sum

// Simply sort the elements and add the first 4 elements for min
// and the last 4 for the max

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>

RohithKumar1368

// Problem : https://www.hackerrank.com/challenges/grading/problem

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

RohithKumar1368

1. https://www.hackerrank.com/challenges/birthday-cake-candles?h_r=next-challenge&h_v=zen
2. https://www.hackerrank.com/challenges/apple-and-orange

RohithKumar1368

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<time.h>

using namespace std ;

int pow(int n, int k){

RohithKumar1368

#include<iostream>

using namespace std ;

int main() {
  int prime[501] ;
  int n = 3 ;
  int j = 1 ;
  
  prime[1] = 2 ;

RohithKumar1368

@echo off
set logfile=log.txt

:main
echo 1.insert
echo 2.delete
echo 3.update
set /p opt=select an option:

if %opt%==1 GOTO insert