Category Archives: C++

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

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

C++ STL in Bangla

Posted on May 28, 2017 | Leave a comment

https://tanvir002700.wordpress.com/2016/04/15/c-stl-tricks1/

Leave a comment

Posted in C Refresh, C++

Tagged STL

String Refreshing

Posted on April 16, 2017 | Leave a comment

//Program to assign string and display the same

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[]="LearnGood";
printf("Assigned string: %s",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[]="LearnGood";

printf("Assigned string: %s",str);

return 0;

}

//specifiying the array string size

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[20]="LearnGood";
printf("Assigned string: %s",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[20]="LearnGood";

printf("Assigned string: %s",str);

return 0;

}

Assigning string character by character

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[]={'L','e','a','r','n','g','o','o','d','\0'};
printf("\n Assigned string:%s\n",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[]={'L','e','a','r','n','g','o','o','d','\0'};

printf("\n Assigned string:%s\n",str);

return 0;

}

//Read a string and display it

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[20];
printf("Enter string: ");
scanf("%s",str);
printf("\nEntered string: %s\n",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[20];

printf("Enter string: ");

scanf("%s",str);

printf("\nEntered string: %s\n",str);

return 0;

}

//It will not allow string

so we need gets(str)
code:

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[20];
printf("Enter string: ");
gets(str);
printf("\nEntered string: %s\n",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[20];

printf("Enter string: ");

gets(str);

printf("\nEntered string: %s\n",str);

return 0;

}

with gets we can print line with space: Zaki Live

#include<stdio.h>
#include<stdlib.h>

int main()
{
char str[20];
int i;
printf("entered string:");
//we are not using scanf("") here, it is using getchar and taking input one by one character
for(i=0;(str[i]=getchar())!='\n';i++);
str[i]='\0';
printf("%s",str);
return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[20];

int i;

printf("entered string:");

//we are not using scanf("") here, it is using getchar and taking input one by one character

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

str[i]='\0';

printf("%s",str);

return 0;

}

//simple printf

#include<stdio.h>
#include<stdlib.h>
int main()
{
    char str[20];
    int i;
    printf("Enter string: ");
    scanf("%s",str);
    printf("Entered string:%s",str);
    return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char str[20];

int i;

printf("Enter string: ");

scanf("%s",str);

printf("Entered string:%s",str);

return 0;

}

//using puts

#include<stdio.h>
int main(){
char str[20];
int i;
printf("enter string:");
scanf("%s",str);
printf("entered string is: ");
puts(str);
return 0;
}

#include<stdio.h>

int main(){

char str[20];

int i;

printf("enter string:");

scanf("%s",str);

printf("entered string is: ");

puts(str);

return 0;

}

//putchar

#include<stdio.h>
#include<stdlib.h>
int main(){
char str[20];
int i;
printf("enter string: ");
scanf("%s",str);
for(i=0;str[i]!='\0';i++)
  putchar(str[i]);

return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main(){

char str[20];

int i;

printf("enter string: ");

scanf("%s",str);

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

putchar(str[i]);

return 0;

}

Program to find length of a given string:

#include<stdio.h>
int main()
{
    char sstr[20];
    int i;
    printf("Enter string:");
    gets(sstr);
    for(i=0; sstr[i]!='\0'; i++);
    printf("length of the string:%d",i);
    return 0;
}

#include<stdio.h>

int main()

{

char sstr[20];

int i;

printf("Enter string:");

gets(sstr);

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

printf("length of the string:%d",i);

return 0;

}

Using string related library function:

#include<stdio.h>
#include<string.h>

int main()
{
    char str[20];
    int i;
    printf("\nEnter string: ");
    gets(str);
    i=strlen(str);
    printf("%d",i);
    return 0;
}

#include<stdio.h>

#include<string.h>

int main()

{

char str[20];

int i;

printf("\nEnter string: ");

gets(str);

i=strlen(str);

printf("%d",i);

return 0;

}

//string copy with out library function

#include<stdio.h>
#include<stdlib.h>
int main()
{

    char sourcestr[20],deststr[20];
    int i;
    printf("Enter your string:");
    gets(sourcestr);

    for(i=0; (deststr[i]=sourcestr[i])!='\0';i++);
    printf("Copied string : %s",deststr);



    return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char sourcestr[20],deststr[20];

int i;

printf("Enter your string:");

gets(sourcestr);

for(i=0; (deststr[i]=sourcestr[i])!='\0';i++);

printf("Copied string : %s",deststr);

return 0;

}

//using strcpy library function

#include<stdio.h>
#include<stdlib.h>
int main()
{

    char sourcestr[20],deststr[20];
    int i;
    printf("Enter your string:");
    gets(sourcestr);
    strcpy(deststr,sourcestr);
    printf("Copied string : %s",deststr);


    return 0;
}

#include<stdio.h>

#include<stdlib.h>

int main()

{

char sourcestr[20],deststr[20];

int i;

printf("Enter your string:");

gets(sourcestr);

strcpy(deststr,sourcestr);

printf("Copied string : %s",deststr);

return 0;

}

Concatenated String:

#include<stdio.h>
int main()
{

    char sourcestr1[20],sourcestr2[20];
    char deststr[40];

    int i,j;
    printf("here enter 1st string:");
    gets(sourcestr1);
    printf("enter 2nd string:");
    gets(sourcestr2);

    for(i=0; (deststr[i]=sourcestr1[i])!='\0'; i++);
    for(j=0; (deststr[i]=sourcestr2[j])!='\0'; i++,j++);
    printf("Concatnated string: %s\n",deststr);

    return 0;
}

#include<stdio.h>

int main()

{

char sourcestr1[20],sourcestr2[20];

char deststr[40];

int i,j;

printf("here enter 1st string:");

gets(sourcestr1);

printf("enter 2nd string:");

gets(sourcestr2);

for(i=0; (deststr[i]=sourcestr1[i])!='\0'; i++);

for(j=0; (deststr[i]=sourcestr2[j])!='\0'; i++,j++);

printf("Concatnated string: %s\n",deststr);

return 0;

}

Using library function:

#include<stdio.h>
int main()
{

    char sourcestr1[20],sourcestr2[20];
    char deststr[40];

    int i,j;
    printf("here enter 1st string:");
    gets(sourcestr1);
    printf("enter 2nd string:");
    gets(sourcestr2);

    strcpy(deststr,sourcestr1);
    strcat(deststr,sourcestr2);

    printf("Concatanted string: %s\n",deststr);

    return 0;
}

#include<stdio.h>

int main()

{

char sourcestr1[20],sourcestr2[20];

char deststr[40];

int i,j;

printf("here enter 1st string:");

gets(sourcestr1);

printf("enter 2nd string:");

gets(sourcestr2);

strcpy(deststr,sourcestr1);

strcat(deststr,sourcestr2);

printf("Concatanted string: %s\n",deststr);

return 0;

}

Leave a comment

Posted in C, C Refresh, C++, String

C refresh for logic development

Posted on April 4, 2017 | Leave a comment

Code:

#include<stdio.h>
int main()
{
    int N1,N2,ch,resi;
    float resf;
    do
    {
        printf("\n\n Enter value for operation:");
        printf("\n 1->+ 2->- 3->* 4->/ 5->exit\n:");
        scanf("%d",&ch);

        if(ch>=1 && ch<=4)
        {
            printf("\n Enter 2 numbers:\n");
            scanf("\t%d %d",&N1,&N2);
        }
        switch(ch)
        {
        case 1:
            resi=N1+N2;
            printf("Result: %d",resi);
            break;
        case 2:
            resi=N1-N2;
            printf("Result: %d",resi);
            break;
        case 3:
            resi=N1*N2;
            printf("Result: %d",resi);
            break;
        case 4:
            resf=N1/(float)N2;
            printf("Result: %f",resf);
            break;
        case 5:
            break;
        default:
            ("\n Invalid choice");
        }
    }while(ch!=5);
    return 0;
}

#include<stdio.h>

int main()

{

int N1,N2,ch,resi;

float resf;

{

printf("\n\n Enter value for operation:");

printf("\n 1->+ 2->- 3->* 4->/ 5->exit\n:");

scanf("%d",&ch);

if(ch>=1 && ch<=4)

{

printf("\n Enter 2 numbers:\n");

scanf("\t%d %d",&N1,&N2);

}

switch(ch)

{

case 1:

resi=N1+N2;

printf("Result: %d",resi);

break;

case 2:

resi=N1-N2;

printf("Result: %d",resi);

break;

case 3:

resi=N1*N2;

printf("Result: %d",resi);

break;

case 4:

resf=N1/(float)N2;

printf("Result: %f",resf);

break;

case 5:

break;

default:

("\n Invalid choice");

}

}while(ch!=5);

return 0;

}

Output:

Leave a comment

Posted in A ll Codes, C, C Refresh, C++

Tagged C refresh

Details about Pointer

Posted on March 14, 2017 | Leave a comment

https://www.youtube.com/watch?v=_8-ht2AKyH4

Leave a comment

Posted in C, C++, Pointer

Tagged memory, pointer

C Refresh

Posted on March 10, 2017 | Leave a comment

https://www.youtube.com/watch?v=nhWjpmTvA5s&list=PLfVsf4Bjg79CZ5kHTiQHcm-l2q8j06ofd&index=157

Leave a comment

Posted in A ll Codes, C, C++

Palindrome C code

Posted on February 15, 2017 | Leave a comment

http://dharanyadevi.blogspot.com/2012/04/palindrome-in-c-without-using-string.html

Leave a comment

Posted in A ll Codes, ACM-ICPC, C, C++

Tagged palindrome

String and Hackerearth

Posted on February 15, 2017 | Leave a comment

String Upper:

#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
void upper_string(char st[]);
int main(){
char str[100];
cout<<"Enter string: ";
gets(str);
upper_string(str);
cout<<"upper case:"<<str<<endl;


return 0;
}

void upper_string(char st[])
{
    int c=0;
    while(st[c]!='\0'){
        if(st[c]>='a' && st[c]<='z'){
           st[c]=st[c]-32;
        }
        c++;
    }



}

#include<iostream>

#include<string>

#include<cstdio>

using namespace std;

void upper_string(char st[]);

int main(){

char str[100];

cout<<"Enter string: ";

gets(str);

upper_string(str);

cout<<"upper case:"<<str<<endl;

return 0;

}

void upper_string(char st[])

{

int c=0;

while(st[c]!='\0'){

if(st[c]>='a' && st[c]<='z'){

st[c]=st[c]-32;

}

c++;

}

String Lower:

#include<iostream>
#include<cstdio>
using namespace std;
void lower_string(char st[]);

int main()
{
    char str[500];
    cout<<"Enter: "<<endl;
    gets(str);
    lower_string(str);
    cout<<"Lowercase: "<<str<<endl;
    return 0;
}


void lower_string(char st[])
{
    int c=0;

    while(st[c]!='\0')
    {
        if(st[c]>='A' && st[c]<='Z')
        {
            st[c]=st[c]+32;
        }
        c++;

    }

}

#include<iostream>

#include<cstdio>

using namespace std;

void lower_string(char st[]);

int main()

{

char str[500];

cout<<"Enter: "<<endl;

gets(str);

lower_string(str);

cout<<"Lowercase: "<<str<<endl;

return 0;

}

void lower_string(char st[])

{

int c=0;

while(st[c]!='\0')

{

if(st[c]>='A' && st[c]<='Z')

{

st[c]=st[c]+32;

}

c++;

}

Lower Upper Both:

#include<iostream>
#include<cstdio>
using namespace std;
void lower_upper_string(char st[]);

int main()
{
    char str[500];
    cout<<"Enter: "<<endl;
    gets(str);
    lower_upper_string(str);
    cout<<"case: "<<str<<endl;
    return 0;
}


void lower_upper_string(char st[])
{
    int c=0;

    while(st[c]!='\0')
    {
        //char ch=st[c];
        if(st[c]>='A' && st[c]<='Z')
        {
            st[c]=st[c]+32;
        }else if(st[c]>='a'&&st[c]<='z'){
            st[c]=st[c]-32;
        }
        c++;

    }

}

#include<iostream>

#include<cstdio>

using namespace std;

void lower_upper_string(char st[]);

int main()

{

char str[500];

cout<<"Enter: "<<endl;

gets(str);

lower_upper_string(str);

cout<<"case: "<<str<<endl;

return 0;

}

void lower_upper_string(char st[])

{

int c=0;

while(st[c]!='\0')

{

//char ch=st[c];

if(st[c]>='A' && st[c]<='Z')

{

st[c]=st[c]+32;

}else if(st[c]>='a'&&st[c]<='z'){

st[c]=st[c]-32;

}

c++;

}

Hackerearth Problem:: Toggle String

#include <iostream>
#include<cstdio>
#include<string>
using namespace std;
void results(char s[]);
int main()
{
    char str[101];
    gets(str);
    results(str);
    cout<<str;
}

void results(char str[]){
char ch;
int c=0;
while(str[c]!='\0'){
        if(str[c]>='A' && str[c]<='Z'){
            str[c]=str[c]+32;
        }else if(str[c]>='a' && str[c]<='z'){
            str[c]=str[c]-32;
        }
        c++;
    }
}

#include <iostream>

#include<cstdio>

#include<string>

using namespace std;

void results(char s[]);

int main()

{

char str[101];

gets(str);

results(str);

cout<<str;

}

void results(char str[]){

char ch;

int c=0;

while(str[c]!='\0'){

if(str[c]>='A' && str[c]<='Z'){

str[c]=str[c]+32;

}else if(str[c]>='a' && str[c]<='z'){

str[c]=str[c]-32;

}

c++;

}

Another Approach:

#include <iostream>
#include<cstdio>
#include<string>
using namespace std;
void results(char s[]);
int main()
{
    char str[101];
    char ch;
    int c=0;
    gets(str);

while(str[c]!='\0'){
        if(str[c]>='A' && str[c]<='Z'){
            str[c]=str[c]+32;
        }else if(str[c]>='a' && str[c]<='z'){
            str[c]=str[c]-32;
        }
        c++;
    }
       cout<<str;
}

#include <iostream>

#include<cstdio>

#include<string>

using namespace std;

void results(char s[]);

int main()

{

char str[101];

char ch;

int c=0;

gets(str);

while(str[c]!='\0'){

if(str[c]>='A' && str[c]<='Z'){

str[c]=str[c]+32;

}else if(str[c]>='a' && str[c]<='z'){

str[c]=str[c]-32;

}

c++;

}

cout<<str;

}

Another Approach:

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int i;
char str[101];

int main()
{
scanf("%s",str);
for(int i=0;i<strlen(str);i++){
    if(str[i]>='A' && str[i]<='Z')
    {
        str[i]=str[i]+32;
    }
    else{
            str[i]=str[i]-32;
    }
}
cout<<str;

return 0;
}

#include<cstdio>

#include<iostream>

#include<cstring>

using namespace std;

int i;

char str[101];

int main()

{

scanf("%s",str);

for(int i=0;i<strlen(str);i++){

if(str[i]>='A' && str[i]<='Z')

{

str[i]=str[i]+32;

}

else{

str[i]=str[i]-32;

}

cout<<str;

return 0;

}

Helpful Link: http://www.programmingsimplified.com/c/program/c-program-change-case

Leave a comment

Posted in A ll Codes, ACM-ICPC, Array, C, C++, String

Vector in C++

Posted on February 13, 2017 | Leave a comment

Vector Codes:

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;

int main(){

vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);

for(int i=0; i<v.size(); i++){
    cout<<v[i]<<endl;
}


return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

using namespace std;

int main(){

vector<int> v;

v.push_back(1);

v.push_back(2);

v.push_back(3);

v.push_back(4);

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

cout<<v[i]<<endl;

}

return 0;

}

Vector Copy:

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;

int main(){

vector<int> v,t;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
t=v;
for(int i=0; i<t.size(); i++){
    cout<<t[i]<<endl;
}


return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

using namespace std;

int main(){

vector<int> v,t;

v.push_back(1);

v.push_back(2);

v.push_back(3);

v.push_back(4);

t=v;

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

cout<<t[i]<<endl;

}

return 0;

}

String:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
using namespace std;

int main(){
string a,b,c;
a="this is a string";
b=a;
c=a+b;
cout<<c<<endl;
//printf("%s\n",c.c_str());
for(int i=0; i<c.size(); i++){
cout<<c[i]<<endl;
}
return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

using namespace std;

int main(){

string a,b,c;

a="this is a string";

b=a;

c=a+b;

cout<<c<<endl;

//printf("%s\n",c.c_str());

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

cout<<c[i]<<endl;

}

return 0;

}

Stack:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
using namespace std;

int main(){
stack<int> st;

st.push(100);
st.push(101);
st.push(102);

while(!st.empty()){
    cout<<st.top()<<endl;
    st.pop();
}

return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

using namespace std;

int main(){

stack<int> st;

st.push(100);

st.push(101);

st.push(102);

while(!st.empty()){

cout<<st.top()<<endl;

st.pop();

}

return 0;

}

Queue :

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<queue>
using namespace std;

int main(){
queue<int> q;
q.push(100);
q.push(101);
q.push(102);

while(!q.empty()){
cout<<q.front()<<endl;
q.pop();
}
return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<queue>

using namespace std;

int main(){

queue<int> q;

q.push(100);

q.push(101);

q.push(102);

while(!q.empty()){

cout<<q.front()<<endl;

q.pop();

}

return 0;

}

Priority Queue:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<queue>
using namespace std;

int main(){
priority_queue<int> q;
q.push(100700);
q.push(101);
q.push(1029990);

while(!q.empty()){
cout<<q.top()<<endl;
q.pop();
}
return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<queue>

using namespace std;

int main(){

priority_queue<int> q;

q.push(100700);

q.push(101);

q.push(1029990);

while(!q.empty()){

cout<<q.top()<<endl;

q.pop();

}

return 0;

}

Iterator:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<iterator>
#include<queue>
using namespace std;

int main(){

    vector<int> v;
    vector<int>::iterator i;

    v.push_back(1);
    v.push_back(2);
    v.push_back(3);


    for(i=v.begin(); i<v.end(); i++){

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

    }

return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<iterator>

#include<queue>

using namespace std;

int main(){

vector<int> v;

vector<int>::iterator i;

v.push_back(1);

v.push_back(2);

v.push_back(3);

for(i=v.begin(); i<v.end(); i++){

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

}

return 0;

}

Set:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<iterator>
#include<queue>
#include<set>
using namespace std;

int main(){

   set<int> s;
   s.insert(10);
   s.insert(5);
   s.insert(9);

   set<int>::iterator it;
   for(it=s.begin(); it!=s.end(); it++){
        cout<<*it<<endl;

   }
   
return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<iterator>

#include<queue>

#include<set>

using namespace std;

int main(){

set<int> s;

s.insert(10);

s.insert(5);

s.insert(9);

set<int>::iterator it;

for(it=s.begin(); it!=s.end(); it++){

cout<<*it<<endl;

}

return 0;

}

Map:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<iterator>
#include<queue>
#include<set>
#include<map>
using namespace std;

int main(){

map<string, int> m;
string goru;

while(cin>>goru){
    if(goru=="moro")
        break;
    m[goru]++;
    cout<<goru<<" ase "<<m[goru]<<" ta :D"<<endl;
}

return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<iterator>

#include<queue>

#include<set>

#include<map>

using namespace std;

int main(){

map<string, int> m;

string goru;

while(cin>>goru){

if(goru=="moro")

break;

m[goru]++;

cout<<goru<<" ase "<<m[goru]<<" ta :D"<<endl;

}

return 0;

}

String Stream:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstdio>
#include<stack>
#include<iterator>
#include<queue>
#include<set>
#include<map>
#include<sstream>
#include<algorithm>
using namespace std;

int main(){

char line[1000];
int num;
while(gets(line)){
stringstream ss(line);
    vector<int> v;
    while(ss>>num){
        v.push_back(num);
        sort(v.begin(), v.end());
    }
}


return 0;
}

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<cstdio>

#include<stack>

#include<iterator>

#include<queue>

#include<set>

#include<map>

#include<sstream>

#include<algorithm>

using namespace std;

int main(){

char line[1000];

int num;

while(gets(line)){

stringstream ss(line);

vector<int> v;

while(ss>>num){

v.push_back(num);

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

}

return 0;

}

Good websites for learning by example:
http://www.sanfoundry.com/cpp-program-implement-vector-stl/

http://www.progkriya.org/gyan/stl.html

Leave a comment

Posted in A ll Codes, ACM-ICPC, C++

Tagged STL, VECTOR

A good Array Example

Posted on February 13, 2017 | Leave a comment

Hackerrank problem:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n,inte,arr[10001];
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>inte;
        arr[i]=inte;
    }
    for(int j=n-1; j>=0; j--){
    printf("%d ",arr[j]);
    }
    return 0;
}

#include <cmath>

#include <cstdio>

#include <vector>

#include <iostream>

#include <algorithm>

using namespace std;

int main() {

int n,inte,arr[10001];

cin>>n;

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

cin>>inte;

arr[i]=inte;

}

for(int j=n-1; j>=0; j--){

printf("%d ",arr[j]);

}

return 0;

}

Leave a comment

Posted in A ll Codes, ACM-ICPC, Array, C++, HackerRank, Problem Solution

Tagged C++

A good example of pointer code at Hacker Rank

Posted on February 12, 2017 | Leave a comment

A good example of pointer code at Hacker Rank:

#include <stdio.h>

void update(int *a,int *b) {
    // Complete this function    
 int sum;
 int abs;

 sum=*a+*b;


if(*a>*b){
    abs=*a-*b;
}
else{
    abs=*b-*a;
}

*a=sum;
*b=abs;

}

int main() {
    int a, b;
    int *pa = &a, *pb = &b;
    
    scanf("%d %d", &a, &b);
    update(pa, pb);
    printf("%d\n%d", a, b);

    return 0;
}