Skip to content

Instantly share code, notes, and snippets.

View anshumanc007's full-sized avatar

anshumanc007

View GitHub Profile
/*articulation points by anshumanc007*/
//ANSHUMANC007
//ANSHUMANC007
#include <bits/stdc++.h>
#include<queue>
#include<stack>
#include<set>
#include<iterator>
using namespace std;
#define MAX 10000
#include <bits/stdc++.h>
using namespace std;
long long int fa(long long int par[],long long int a)
{
if(par[a]==-1)
{
return a;
}
else
void merge (long long int A[],long long int L[],long long int R[],long long int ell,long long int err )
{
long long int i=0;
long long int j=0;
long long int k=0;
while(i<ell && j<err)
{
if(L[i]<=R[j])
{
@anshumanc007
anshumanc007 / my code
Created March 14, 2018 20:13
//testing
#include<stdio.h>
int main()
{
int i,n,sum=0;
scanf("%d\n",&n);
int arr[n];
for (i=0;i<n;i++)
{
scanf("%d",&arr[i]);