Syed Ahmed Zaki

Hackerearth : Digit Problem

Posted on June 12, 2017 | Leave a comment

code:

#include<bits/stdc++.h>
using namespace std;
int main()
{

    char x[1000];
    int k;
    scanf("%s %d",x,&k);
    for(int i=0; i<k; i++)
    {
        if(x[i]!='9')
        {
            x[i]='9';

        }
        else if(x[i]=='9')
        {
            //continue; //continue will give partially accepted as after getting 9 it will not increase
            k++; //k needs to be updated
        }
    }
    cout<<x<<endl;

    return 0;
}

#include<bits/stdc++.h>

using namespace std;

int main()

{

char x[1000];

int k;

scanf("%s %d",x,&k);

for(int i=0; i<k; i++)

{

if(x[i]!='9')

{

x[i]='9';

}

else if(x[i]=='9')

{

//continue; //continue will give partially accepted as after getting 9 it will not increase

k++; //k needs to be updated

}

cout<<x<<endl;

return 0;

}

Leave a comment

Posted in HackerEarth

10579 Fibonacci Numbers

Posted on June 11, 2017 | Leave a comment

code:

import java.math.BigInteger;
import java.util.Scanner;

/**
 * Created by Zaki on 6/11/2017.
 */
public class Uva_Fibonacci {
    public static void main(String[] args)
    {
        Scanner input=new Scanner(System.in);
        int n;
        while(input.hasNext()){
            n=input.nextInt();
            BigInteger a = new BigInteger("1");
            BigInteger b= new BigInteger("1");
            BigInteger sum=new BigInteger("0");
            while(n>=3) {
                sum = a.add(b);
                b = a;
                a = sum;
                n--;
            }
        System.out.println(sum);
        }
    }
}

import java.math.BigInteger;

import java.util.Scanner;

/**

* Created by Zaki on 6/11/2017.

public class Uva_Fibonacci {

public static void main(String[] args)

{

Scanner input=new Scanner(System.in);

int n;

while(input.hasNext()){

n=input.nextInt();

BigInteger a = new BigInteger("1");

BigInteger b= new BigInteger("1");

BigInteger sum=new BigInteger("0");

while(n>=3) {

sum = a.add(b);

b = a;

a = sum;

n--;

}

System.out.println(sum);

}

Leave a comment

Posted in A ll Codes, UVa

Tagged BigInteger

BigInteger in Java and C++

Posted on June 11, 2017 | Leave a comment

code:

for c++ this link link or google search is good but i didn’t found any goood solution yet:
http://codeforces.com/blog/entry/16380

java:

Simple addition:

/**
 * Created by ZakiHP on 6/11/2017.
 */
import java.util.*;
public class AddNumbers {
    public static void main(String[] args){
        int x,y,z;
        System.out.println("Enter two integers to calculate their sum:");
        Scanner in=new Scanner(System.in);
        x=in.nextInt();
        y=in.nextInt();
        z=x+y;
        System.out.println("Sum of entered integeres:"+z);

    }
}

/**

* Created by ZakiHP on 6/11/2017.

import java.util.*;

public class AddNumbers {

public static void main(String[] args){

int x,y,z;

System.out.println("Enter two integers to calculate their sum:");

Scanner in=new Scanner(System.in);

x=in.nextInt();

y=in.nextInt();

z=x+y;

System.out.println("Sum of entered integeres:"+z);

}

BigInt Sum:

import java.math.BigInteger;
import java.util.Scanner;

/**
 * Created by ZakiHP on 6/11/2017.
 */
public class BigInt {

    public static void main(String[] args) {
        String number1, number2;
        Scanner input = new Scanner(System.in);
        System.out.println("Enter first large number:");
        number1 = input.nextLine();
        System.out.println("Enter second large number:");
        number2 = input.nextLine();
        BigInteger first = new BigInteger(number1);
        BigInteger second = new BigInteger(number2);
        BigInteger sum;
        sum = first.add(second);
        System.out.println("Result of addition: " + sum);


    }
}

import java.math.BigInteger;

import java.util.Scanner;

/**

* Created by ZakiHP on 6/11/2017.

public class BigInt {

public static void main(String[] args) {

String number1, number2;

Scanner input = new Scanner(System.in);

System.out.println("Enter first large number:");

number1 = input.nextLine();

System.out.println("Enter second large number:");

number2 = input.nextLine();

BigInteger first = new BigInteger(number1);

BigInteger second = new BigInteger(number2);

BigInteger sum;

sum = first.add(second);

System.out.println("Result of addition: " + sum);

}

Leave a comment

Posted in A ll Codes, C++, Java

Tagged BigInteger

Hackerearth Min-Max

Posted on June 11, 2017 | Leave a comment

code:

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{

    int n,flag=0;
    cin>>n;
    int a[n];
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a[i]);
    }

    int    mini=a[0];
    int    maxi=a[0];

    for(int i=0; i<n; i++)
    {
        if(a[i]<mini)
        {
            mini=a[i];
        }
        if(a[i]>maxi)
        {
            maxi=a[i];
        }
    }
    //cout<<mini<<" "<<maxi;
    //  maxi-mini;

    for(int i=mini; i<maxi; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(a[j]==i)
            {
                flag++;
                break;
            }
            else
            {
                continue;
            }
        }
    }
    int q=maxi-mini;
    if(flag==q)
    {
        printf("YES\n");
    }
    else
    {
        printf("NO\n");
    }
    //cout<<flag;

//    for(int i=1; i<=n; i++)
//    {
//        if(temp[i]==a[i])
//        {
//            printf("Yes\n");
//        }
//        else
//        {
//            printf("No\n");
//        }
//    }

    return 0;
}

#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

int n,flag=0;

cin>>n;

int a[n];

for(int i=0; i<n; i++)

{

scanf("%d",&a[i]);

}

int mini=a[0];

int maxi=a[0];

for(int i=0; i<n; i++)

{

if(a[i]<mini)

{

mini=a[i];

}

if(a[i]>maxi)

{

maxi=a[i];

}

//cout<<mini<<" "<<maxi;

// maxi-mini;

for(int i=mini; i<maxi; i++)

{

for(int j=0; j<n; j++)

{

if(a[j]==i)

{

flag++;

break;

}

else

{

continue;

}

int q=maxi-mini;

if(flag==q)

{

printf("YES\n");

}

else

{

printf("NO\n");

}

//cout<<flag;

// for(int i=1; i<=n; i++)

// {

// if(temp[i]==a[i])

// {

// printf("Yes\n");

// }

// else

// {

// printf("No\n");

// }

return 0;

}

partially accepted code with vector:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    cin>>n;
    vector<int> a(n);
    for(int i=0; i<n; i++)
    {
        cin>>a[i];
    }
    sort(a.begin(),a.end());
    bool yesnoo=true;
    for(int i=1; i<n; i++)
    {
        if((a[i]-a[i-1])!=1)
        {
            yesnoo=false;
        }
    }

    if(yesnoo)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;


    return 0;
}

#include<iostream>

#include<vector>

#include<algorithm>

using namespace std;

int main()

{

int n;

cin>>n;

vector<int> a(n);

for(int i=0; i<n; i++)

{

cin>>a[i];

}

sort(a.begin(),a.end());

bool yesnoo=true;

for(int i=1; i<n; i++)

{

if((a[i]-a[i-1])!=1)

{

yesnoo=false;

}

if(yesnoo)

cout<<"YES"<<endl;

else

cout<<"NO"<<endl;

return 0;

}

Leave a comment

Posted in C++, HackerEarth, Vector

Tagged algorithm, C++, sort, STL, VECTOR

10523 – Very Easy !!!

Posted on June 11, 2017 | Leave a comment

C++ Code:
But it will not work as c++ don’t support BigIntger so we have to write it in java my code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int sum=0,n,a;
    while(scanf("%d %d",&n,&a)==2)

    {
        for(int i=1; i<=n; i++)
        {
            sum=sum+(i*pow(a,i));
        }
        printf("%d\n",sum);
        sum=0;
    }

    return 0;
}

#include<bits/stdc++.h>

using namespace std;

int main()

{

int sum=0,n,a;

while(scanf("%d %d",&n,&a)==2)

{

for(int i=1; i<=n; i++)

{

sum=sum+(i*pow(a,i));

}

printf("%d\n",sum);

sum=0;

}

return 0;

}

Java:

import java.math.BigInteger;
import java.util.Scanner;
import java.util.*;
import java.io.IOException;
import java.math.*;

public class Uva_Very_Easy {
    public static void main(String[] args) {
        int n, a;
        BigInteger ans, tmpA;
        Scanner input = new Scanner(System.in);

        while (input.hasNext()) {
            n = input.nextInt();
            a = input.nextInt();
            ans = new BigInteger("0");
            BigInteger sum = new BigInteger("0");
            tmpA = BigInteger.valueOf(a);
            for (int i = 1; i <= n; i++) {
                sum = sum.add(BigInteger.valueOf(i).multiply(tmpA.pow(i)));
            }
            System.out.println(sum);
        }

    }
}

import java.math.BigInteger;

import java.util.Scanner;

import java.util.*;

import java.io.IOException;

import java.math.*;

public class Uva_Very_Easy {

public static void main(String[] args) {

int n, a;

BigInteger ans, tmpA;

Scanner input = new Scanner(System.in);

while (input.hasNext()) {

n = input.nextInt();

a = input.nextInt();

ans = new BigInteger("0");

BigInteger sum = new BigInteger("0");

tmpA = BigInteger.valueOf(a);

for (int i = 1; i <= n; i++) {

sum = sum.add(BigInteger.valueOf(i).multiply(tmpA.pow(i)));

}

System.out.println(sum);

}

Leave a comment

Posted in UVa

HAckerearth – HAWKEYE AND FLOODFILL ⇾⚄ (EASY)

Posted on June 11, 2017 | Leave a comment

code:

#include<bits/stdc++.h>
using namespace std;
int main()
{

int n;
int i,j;
long int p;
cin>>n>>i>>j>>p;
for(int m=0; m<n; m++)
{
	for(int k=0;k<n;k++)
	{
	   // printf("m=%d k=%d\n",m,k);
		long int u=m-i;
		long int y=k-j;
		//cout<<u<<" "<<y;
		if(u<0)
		{
			u=0-u;
		}
		if(y<0)
		{
			y=0-y;
		}
		long int max=0;
		if(u<y)
		{
			max=y;
		}
		else{
			max=u;
		}
		if(p-max>0)
		{
			printf("%ld ",p-max);
		}
		else{
			printf("0 ");
		}
	}
	printf("\n");
}
return 0;
}

#include<bits/stdc++.h>

using namespace std;

int main()

{

int n;

int i,j;

long int p;

cin>>n>>i>>j>>p;

for(int m=0; m<n; m++)

{

for(int k=0;k<n;k++)

{

// printf("m=%d k=%d\n",m,k);

long int u=m-i;

long int y=k-j;

//cout<<u<<" "<<y;

if(u<0)

{

u=0-u;

}

if(y<0)

{

y=0-y;

}

long int max=0;

if(u<y)

{

max=y;

}

else{

max=u;

}

if(p-max>0)

{

printf("%ld ",p-max);

}

else{

printf("0 ");

}

printf("\n");

}

return 0;

}

another code:

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
int main()
{
    vector<int> vec[1000];
    int n;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            vec[i].push_back(0);
            //printf("%d\n",i);
        }

    }
    int pow,x,y;
    cin>>x>>y>>pow;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(pow-max(abs(x-i),abs(y-j))>0)
            {
                vec[i][j]=(pow-max(abs(x-i),abs(y-j)));
            }
            else
            {
                vec[i][j]=0;
            }
            cout<<vec[i][j]<<" ";
        }
        cout<<"\n";
    }

    return 0;
}

#include<bits/stdc++.h>

#define pb push_back

using namespace std;

int main()

{

vector<int> vec[1000];

int n;

cin>>n;

for(int i=0; i<n; i++)

{

for(int j=0; j<n; j++)

{

vec[i].push_back(0);

//printf("%d\n",i);

}

int pow,x,y;

cin>>x>>y>>pow;

for(int i=0; i<n; i++)

{

for(int j=0; j<n; j++)

{

if(pow-max(abs(x-i),abs(y-j))>0)

{

vec[i][j]=(pow-max(abs(x-i),abs(y-j)));

}

else

{

vec[i][j]=0;

}

cout<<vec[i][j]<<" ";

}

cout<<"\n";

}

return 0;

}

Leave a comment

Posted in HackerEarth, Pore Abar Bujhbo

Digit Hackerearth

Posted on June 9, 2017 | Leave a comment

code:

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+55; //max range 10^9
int cnt;
string str;
int main()
{
    cin>>str;
    for(int i=0;str[i]!='\0';i++)
    {
        if(str[i]>=0 || str[i]<=9)
        {
            cnt++;
        }
    }
    cout<<cnt<<endl;

    return 0;
}

#include<bits/stdc++.h>

using namespace std;

const int N=2e5+55; //max range 10^9

int cnt;

string str;

int main()

{

cin>>str;

for(int i=0;str[i]!='\0';i++)

{

if(str[i]>=0 || str[i]<=9)

{

cnt++;

}

cout<<cnt<<endl;

return 0;

}

Leave a comment

Posted in HackerEarth

Stevie Hackerearth

Posted on June 9, 2017 | Leave a comment

code:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define pr(x) printf("%d\n",x)
#define prl(x) printf("%lld\n",x)
#define clr(x) memset(x,0,sizeof(x))
const int N=2e5+55; //max range 10^9

int n,a[N],b[N];
map<int,int> mpp; //<key value, mapped value>
//vector<int> A(n), B(n);
//cin>>n;
int main()
{
    sc(n);
    for(int i=1; i<=n; i++)
    {
        sc(a[i]);
    }
    for(int i=1; i<=n; i++)
    {
        sc(b[i]);
    }
    for(int i=1; i<=n; i++)
    {
        mpp[a[i]]=max(b[i],mpp[a[i]]);
    }
    for(int i=1; i<=n; i++)
    {
        cout<<mpp[a[i]]<<" ";
    }

}

#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define pb push_back

#define mp make_pair

#define ff first

#define ss second

#define sc(x) scanf("%d",&x)

#define scl(x) scanf("%lld",&x)

#define pr(x) printf("%d\n",x)

#define prl(x) printf("%lld\n",x)

#define clr(x) memset(x,0,sizeof(x))

const int N=2e5+55; //max range 10^9

int n,a[N],b[N];

map<int,int> mpp; //<key value, mapped value>

//vector<int> A(n), B(n);

//cin>>n;

int main()

{

sc(n);

for(int i=1; i<=n; i++)

{

sc(a[i]);

}

for(int i=1; i<=n; i++)

{

sc(b[i]);

}

for(int i=1; i<=n; i++)

{

mpp[a[i]]=max(b[i],mpp[a[i]]);

}

for(int i=1; i<=n; i++)

{

cout<<mpp[a[i]]<<" ";

}

Leave a comment

Posted in A ll Codes, Algorithm, HackerEarth, Pore Abar Bujhbo

Tagged map

Basics of Implementation – Hackerearth

Posted on June 7, 2017 | Leave a comment

Vowel count in a string:
code:

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int a=0,e=0,i=0,o=0,u=0;
    string s;
    cin>>s;
    int len=s.length();
    for(int j=0;j<len;j++)
    {
        if(s[j]=='a')
        {
            a++;
        }
        else if(s[j]=='e')
        {
            e++;
        }
        else if(s[j]=='i')
        {
            i++;
        }
        else if(s[j]=='o')
        {
            o++;
        }
        else if(s[j]=='u')
        {
            u++;
        }
    }

    cout<<"a "<<a<<endl;
    cout<<"e "<<e<<endl;
    cout<<"i "<<i<<endl;
    cout<<"o "<<o<<endl;
    cout<<"u "<<u<<endl;

}

#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

int a=0,e=0,i=0,o=0,u=0;

string s;

cin>>s;

int len=s.length();

for(int j=0;j<len;j++)

{

if(s[j]=='a')

{

a++;

}

else if(s[j]=='e')

{

e++;

}

else if(s[j]=='i')

{

i++;

}

else if(s[j]=='o')

{

o++;

}

else if(s[j]=='u')

{

u++;

}

cout<<"a "<<a<<endl;

cout<<"e "<<e<<endl;

cout<<"i "<<i<<endl;

cout<<"o "<<o<<endl;

cout<<"u "<<u<<endl;

}

Count Digit:

#include<iostream>
using namespace std;
int main()
{
    int zero=0,one=0,two=0,three=0,four=0,five=0,six=0,seven=0,eight=0,nine=0;
    string s;
    cin>>s;
    int len=s.length();
    for(int i=0;i<len;i++){
        if(s[i]=='0'){
            zero++;
        }
        else if(s[i]=='1'){
            one++;
        }
        else if(s[i]=='2'){
            two++;
        }
        else if(s[i]=='3')
        {
            three++;
        }
        else if(s[i]=='4'){
            four++;
        }
        else if(s[i]=='5')
        {
            five++;
        }
        else if(s[i]=='6'){
            six++;
        }
        else if(s[i]=='7'){
            seven++;
        }
        else if(s[i]=='8'){
            eight++;
        }
        else if(s[i]=='9')
        {
            nine++;
        }
    }
    cout<<"0 "<<zero<<endl;
    cout<<"1 "<<one<<endl;
    cout<<"2 "<<two<<endl;
    cout<<"3 "<<three<<endl;
    cout<<"4 "<<four<<endl;
    cout<<"5 "<<five<<endl;
    cout<<"6 "<<six<<endl;
    cout<<"7 "<<seven<<endl;
    cout<<"8 "<<eight<<endl;
    cout<<"9 "<<nine<<endl;

    return 0;
}

#include<iostream>

using namespace std;

int main()

{

int zero=0,one=0,two=0,three=0,four=0,five=0,six=0,seven=0,eight=0,nine=0;

string s;

cin>>s;

int len=s.length();

for(int i=0;i<len;i++){

if(s[i]=='0'){

zero++;

}

else if(s[i]=='1'){

one++;

}

else if(s[i]=='2'){

two++;

}

else if(s[i]=='3')

{

three++;

}

else if(s[i]=='4'){

four++;

}

else if(s[i]=='5')

{

five++;

}

else if(s[i]=='6'){

six++;

}

else if(s[i]=='7'){

seven++;

}

else if(s[i]=='8'){

eight++;

}

else if(s[i]=='9')

{

nine++;

}

cout<<"0 "<<zero<<endl;

cout<<"1 "<<one<<endl;

cout<<"2 "<<two<<endl;

cout<<"3 "<<three<<endl;

cout<<"4 "<<four<<endl;

cout<<"5 "<<five<<endl;

cout<<"6 "<<six<<endl;

cout<<"7 "<<seven<<endl;

cout<<"8 "<<eight<<endl;

cout<<"9 "<<nine<<endl;

return 0;

}

Leave a comment

Posted in A ll Codes, Adhoc/Brute Force, Algorithm, HackerEarth

C++ Vector push_back()…pop_back()

Posted on June 7, 2017 | Leave a comment

#include<vector>
#include<iostream>
using namespace std;
int main()
{

    vector<string> list;
    cout<<"Please enter the names, press Q to quit:"<<endl;
    string name; //string //
    while(name!="Q")
    {
        cin>>name;
        list.push_back(name); //pushing string to the list
    }
    list.pop_back(); //poping string from the list
    list.pop_back();

    cout<<"You have entered "<<list.size()<<" names:"<<endl;
    for(int i=0; i<list.size(); i++)
    {
        cout<<list[i]<<endl;
    }


    return 0;
}

#include<vector>

#include<iostream>

using namespace std;

int main()

{

vector<string> list;

cout<<"Please enter the names, press Q to quit:"<<endl;

string name; //string //

while(name!="Q")

{

cin>>name;

list.push_back(name); //pushing string to the list

}

list.pop_back(); //poping string from the list

list.pop_back();

cout<<"You have entered "<<list.size()<<" names:"<<endl;

for(int i=0; i<list.size(); i++)

{

cout<<list[i]<<endl;

}

return 0;

}

Leave a comment

Posted in A ll Codes, Algorithm, C++

Tagged STL

Algo – Linked List

Posted on June 5, 2017 | Leave a comment

Best Video Explained:

code:

some bugs here but understood the implementation:

#include<bits/stdc++.h>
void display(void);
void addatbegin(void);
void addafter(void);
struct node
{
    int data;
    struct node *link;
};

struct node *root=NULL;
int len;

void append()
{

    struct node *temp;
    temp=(struct node*)malloc(sizeof(struct node));
    printf("Enter node data: ");
    scanf("%d", &temp->data);
    temp->link=NULL;
    if(root==NULL) //list is empty
    {
        root=temp;
    }
    else
    {
        struct node* p;
        p=root;
        while(p->link!=NULL)
        {
            p=p->link;
        }
        p->link=temp;
    }
}

int length()
{
    int cnt=0;
    struct node *temp;
    temp=root;
    while(temp!=NULL)
    {
        cnt++;
        temp=temp->link;
    }
    return cnt;
}
void display()
{
    struct node* temp;
    temp==root;
    if(temp==NULL)
    {
        printf("List is empty\n");

    }
    else
    {
        while(temp!=NULL)
        {
            printf("%d-->",temp->data);
            temp=temp->link;
        }
        printf("\n");
    }
}
//void delete();

int main()
{
    int ch;
    while(1)
    {
        printf("Single linked list op:");
        printf("1. Append\n");
        printf("2. Add at begin\n");
        printf("3. Add at after\n");
        printf("4. Lenght\n");
        printf("5. Display\n");
        printf("6. Delete\n");
        printf("7. Quit\n");
        printf("enter your chocie: ");
        scanf("%d",ch);
        switch(ch)
        {
        case 1:
            append();
            break;
        case 2:
            addatbegin();
            break;
        case 3:
            addafter();
            break;
        case 4:
            len=length();
            printf("Length=%d",len);
            break;
        case 5:
            display();
            break;
        case 7:
            exit(1);
        default:
            printf("invalid\n");

        }
    }
}

100

101

102

103

104

105

106

107

108

109

110

111

#include<bits/stdc++.h>

void display(void);

void addatbegin(void);

void addafter(void);

struct node

{

int data;

struct node *link;

};

struct node *root=NULL;

int len;

void append()

{

struct node *temp;

temp=(struct node*)malloc(sizeof(struct node));

printf("Enter node data: ");

scanf("%d", &temp->data);

temp->link=NULL;

if(root==NULL) //list is empty

{

root=temp;

}

else

{

struct node* p;

p=root;

while(p->link!=NULL)

{

p=p->link;

}

p->link=temp;

}

int length()

{

int cnt=0;

struct node *temp;

temp=root;

while(temp!=NULL)

{

cnt++;

temp=temp->link;

}

return cnt;

}

void display()

{

struct node* temp;

temp==root;

if(temp==NULL)

{

printf("List is empty\n");

}

else

{

while(temp!=NULL)

{

printf("%d-->",temp->data);

temp=temp->link;

}

printf("\n");

}

//void delete();

int main()

{

int ch;

while(1)

{

printf("Single linked list op:");

printf("1. Append\n");

printf("2. Add at begin\n");

printf("3. Add at after\n");

printf("4. Lenght\n");

printf("5. Display\n");

printf("6. Delete\n");

printf("7. Quit\n");

printf("enter your chocie: ");

scanf("%d",ch);

switch(ch)

{

case 1:

append();

break;

case 2:

addatbegin();

break;

case 3:

addafter();

break;

case 4:

len=length();

printf("Length=%d",len);

break;

case 5:

display();

break;

case 7:

exit(1);

default:

printf("invalid\n");

}

Leave a comment

Posted in A ll Codes, Algorithm, C, Linked List

Hackerearth: Seating Arrangement (Unsolved)

Posted on June 4, 2017 | Leave a comment

code that not accepted:

#include<bits/stdc++.h>
int main()
{
    int i,t,rem,n,near=0,flag;
    scanf("%d",&t);
    for(i=0; i<t; i++)
    {
        scanf("%d",&n);
        rem=n%12 ;//block 1;
        switch(rem)
        {
        //window seat
        case 1: //1+12
        case 13:
        case 25:
        case 37:
        case 49:
        case 61:
        case 73:
        case 85:
        case 97:
            flag=0;
            near=n+11;
            break;
        case 6:
        case 18:
        case 42:
        case 54:
        case 66:
        case 78:
        case 90:
        case 102:
            flag=0;
            near=n+1;
            break;
        // for(case=7;case<=108;case=case+12)
        case 7: //7+12 increment
        case 19:
        case 31:
        case 43:
        case 55:
        case 67:
        case 79:
        case 91:
        case 103:
            flag=0;
            near=n-1;
            break;
        case 12:
        case 24:
        case 36:
        case 48:
        case 60:
        case 72:
        case 84:
        case 96:
        case 108:
            flag=0;
            near=n-1;
            break;
        //middle seat
        case 2:
        case 14:
        case 26:
        case 38:
        case 50:
        case 62:
        case 74:
        case 86:
        case 98:
            flag=1;
            near=n+9;
            break;
        case 5:
        case 17:
        case 29:
        case 41:
        case 53:
        case 65:
        case 77:
        case 89:
        case 101:
            flag=1;
            near=n+3;
            break;
        case 8:
        case 20:
        case 32:
        case 44:
        case 56:
        case 68:
        case 80:
        case 92:
        case 104:
            flag=1;
            near=n-3;
            break;
        case 11:
        case 23:
        case 35:
        case 47:
        case 59:
        case 71:
        case 83:
        case 95:
        case 107:
            flag=1;
            near=n-9;
            break;
        //aisle seat
        case 3:
            flag=2;
            near=n+7;
            break;
        case 4:
            flag=2;
            near=n+5;
            break;
        case 10:
            flag=2;
            near=n-7;
            break;
        case 9:
            flag=2;
            near=n-5;
            break;
        }
        if(flag==0)
        {
            printf("%d WS\n",near);
        }
        if(flag==1)
        {
            printf("%d MS\n",near);
        }
        if(flag==2)
        {
            printf("%d AS\n",near);
        }
    }

    return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

#include<bits/stdc++.h>

int main()

{

int i,t,rem,n,near=0,flag;

scanf("%d",&t);

for(i=0; i<t; i++)

{

scanf("%d",&n);

rem=n%12 ;//block 1;

switch(rem)

{

//window seat

case 1: //1+12

case 13:

case 25:

case 37:

case 49:

case 61:

case 73:

case 85:

case 97:

flag=0;

near=n+11;

break;

case 6:

case 18:

case 42:

case 54:

case 66:

case 78:

case 90:

case 102:

flag=0;

near=n+1;

break;

// for(case=7;case<=108;case=case+12)

case 7: //7+12 increment

case 19:

case 31:

case 43:

case 55:

case 67:

case 79:

case 91:

case 103:

flag=0;

near=n-1;

break;

case 12:

case 24:

case 36:

case 48:

case 60:

case 72:

case 84:

case 96:

case 108:

flag=0;

near=n-1;

break;

//middle seat

case 2:

case 14:

case 26:

case 38:

case 50:

case 62:

case 74:

case 86:

case 98:

flag=1;

near=n+9;

break;

case 5:

case 17:

case 29:

case 41:

case 53:

case 65:

case 77:

case 89:

case 101:

flag=1;

near=n+3;

break;

case 8:

case 20:

case 32:

case 44:

case 56:

case 68:

case 80:

case 92:

case 104:

flag=1;

near=n-3;

break;

case 11:

case 23:

case 35:

case 47:

case 59:

case 71:

case 83:

case 95:

case 107:

flag=1;

near=n-9;

break;

//aisle seat

case 3:

flag=2;

near=n+7;

break;

case 4:

flag=2;

near=n+5;

break;

case 10:

flag=2;

near=n-7;

break;

case 9:

flag=2;

near=n-5;

break;

}

if(flag==0)

{

printf("%d WS\n",near);

}

if(flag==1)

{

printf("%d MS\n",near);

}

if(flag==2)

{

printf("%d AS\n",near);

}

return 0;

}

Leave a comment

Posted in HackerEarth, Unsolved

Algorithm: Euler’s GCD

Posted on June 3, 2017 | Leave a comment

code:

int euclid_gcd(int a,int b)
{
    int dividend,divisor,remainder;
    dividend = a>=b?a:b;
    divisor= a<=b?a:b;

    while(divisor!=0)
    {
        remainder=dividend%divisor;
        dividend=divisor;
        divisor=remainder;
    }
    return dividend;
}

int euclid_gcd(int a,int b)

{

int dividend,divisor,remainder;

dividend = a>=b?a:b;

divisor= a<=b?a:b;

while(divisor!=0)

{

remainder=dividend%divisor;

dividend=divisor;

divisor=remainder;

}

return dividend;

}

more optimized:

int euclid_gcd(int a,int b)
{
    int dividend,divisor,remainder;
    dividend = a;
    divisor= b;

    while(divisor!=0)
    {
        remainder=dividend%divisor;
        dividend=divisor;
        divisor=remainder;
    }
    return dividend;
}

int euclid_gcd(int a,int b)

{

int dividend,divisor,remainder;

dividend = a;

divisor= b;

while(divisor!=0)

{

remainder=dividend%divisor;

dividend=divisor;

divisor=remainder;

}

return dividend;

}

Recursive:

#include<bits/stdc++.h>
int euclid_gcd_recursive(int a,int b)
{
    return b==0?a:euclid_gcd_recursive(b,a%b);
}
int main()
{
    int d,x,z;
    printf("Scanf a and b:");
    scanf("%d %d",&x,&z);
    d=euclid_gcd_recursive(x,z);
    printf("GCD= %d",d);
    return 0;
}

#include<bits/stdc++.h>

int euclid_gcd_recursive(int a,int b)

{

return b==0?a:euclid_gcd_recursive(b,a%b);

}

int main()

{

int d,x,z;

printf("Scanf a and b:");

scanf("%d %d",&x,&z);

d=euclid_gcd_recursive(x,z);

printf("GCD= %d",d);

return 0;

}

http://www.progkriya.org/gyan/basic-number-theory.html#section3

Leave a comment

Posted in A ll Codes, Algorithm, C, Euler GCD, Number Theory

Algo: Prime factorization of a number

Posted on June 3, 2017 | Leave a comment

code:

#include<bits/stdc++.h>
int main()
{
    int i,n,ct=0;;
    scanf("%d",&n);
    for(i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            ct=0;

            while(n%i==0)
            {
                n=n/i;
                ct++;
            }
            printf("(%d^%d)X",i,ct);
        }

    }
    if(n!=1)
        printf("%d^%d",n,1); //it's cleared but will see more about this in future

    return 0;
}

#include<bits/stdc++.h>

int main()

{

int i,n,ct=0;;

scanf("%d",&n);

for(i=2;i<=sqrt(n);i++)

{

if(n%i==0)

{

ct=0;

while(n%i==0)

{

n=n/i;

ct++;

}

printf("(%d^%d)X",i,ct);

}

if(n!=1)

printf("%d^%d",n,1); //it's cleared but will see more about this in future

return 0;

}

I/O:

input: 36
output: (2^2)X(3^2)X

1 2	input: 36 output: (2^2)X(3^2)X

Leave a comment

Posted in A ll Codes, Algorithm, C, Prime factorization

Prime Number: Trial division | Prime check upto N in C

Posted on June 2, 2017 | Leave a comment

code:

#include<bits/stdc++.h>

int main()
{
    int i,j,n,flag=0;
    printf("enter number: ");
    scanf("%d",&n);
    for(i=2;i<=n;i++) //first iterate upto n
    {
        flag=1;
        for(j=2;j<=sqrt(i);j++) //trial division is using here //(i/2) can also use instead of sqrt(i)
        {
            if(i%j==0)
            {
                flag=0;
                break;
            }
        }
        if(flag==1)
        {
            printf("%d \t",i);
        }
    }


return 0;

}

#include<bits/stdc++.h>

int main()

{

int i,j,n,flag=0;

printf("enter number: ");

scanf("%d",&n);

for(i=2;i<=n;i++) //first iterate upto n

{

flag=1;

for(j=2;j<=sqrt(i);j++) //trial division is using here //(i/2) can also use instead of sqrt(i)

{

if(i%j==0)

{

flag=0;

break;

}

if(flag==1)

{

printf("%d \t",i);

}

return 0;

}

Help can be find:
http://www.studystreet.com/c-program-print-prime-numbers/
http://www.codingalpha.com/prime-number-c-program/
https://en.wikipedia.org/wiki/Primality_test

Leave a comment

Posted in A ll Codes, Algorithm, C, Trial Division

Tagged Trial Divison

Syed Ahmed Zaki

Hackerearth : Digit Problem

10579 Fibonacci Numbers

BigInteger in Java and C++

Hackerearth Min-Max

10523 – Very Easy !!!

HAckerearth – HAWKEYE AND FLOODFILL ⇾⚄ (EASY)

Digit Hackerearth

Stevie Hackerearth

Basics of Implementation – Hackerearth

C++ Vector push_back()…pop_back()

Algo – Linked List

Hackerearth: Seating Arrangement (Unsolved)

Algorithm: Euler’s GCD

Algo: Prime factorization of a number

Prime Number: Trial division | Prime check upto N in C

Caution and Tips:

About Me & MyBlog

Category

Recent Posts

Recent Comments

My Facebook

Follow Me

My Algorithmic Progress in OJ’s

My Github

My Linkedin

Count per Day

Archives

This site is powered by:

Bookmarks

My Coding Page

Caution and Tips:

About Me & MyBlog

Category

Recent Posts

Recent Comments

My Facebook

My Github

My Linkedin

Tags

Count per Day

Archives

This site is powered by:

Bookmarks

My Coding Page