Write a test program that prompts the user to enter a number and its width and displays a string returned by invoking format(number, width).

PHOTO

Fri Nov 13 2020 07:38:03 GMT+0000 (UTC)

Saved by @mahmoud hussein #c++

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;




string format(int number, int width);
int numberWidthF(int number);

int main()
{

	
	int number,width;
	cin >> number >> width;
	cout << format(number, width);
	
}
string format(int number, int width)
{
	string zeros = " ";
	string num = to_string(number);
	
	int numberWidth = numberWidthF(number);
	
	for (int  i = 1; i <= width-numberWidth; i++)
	{
		zeros += "0";
	}
	return zeros+num;
}
int numberWidthF(int number)
{
	int digits, numberWidth = 0;
	while (number != 0)
	{
		digits = number % 10;
		number /= 10;
		numberWidth++;
	}
	return numberWidth;
}

http://cpp.sh/

Save snippets that work from anywhere online with our extensions

Available in the Chrome Web Store

Get Firefox Add-on

Get VS Code extension

Comments

More like this

c++ functions

@mahmoud hussein

: Converting Decimals to Hexadecimals,” gives a program that converts a decimal to a hexadecimal. How do you convert a hex number into a decimal? (Financial application: find the profit-per-item) Use the scheme in programming Exercise 5.39 to write a function that computes the profit-per-item. The header of the function is: double computeProfitPerItem(double quantity) Write a test program that displays the following table: find LCM check whether the reversed integer is also an Armstrong number (Even Palindrome number) Write a program that displays the first 100 emirps Write a program that finds the first 25 additive prime numbers and displays the output in the following format: (Math: approximate the square root) (Average of even places)Write a function that returns the average of the digits in the even places in an integer using the following header: double avgOfEvenPlaces(int n) (Current date and time) Invoking time(0) returns the elapse time in milliseconds since midnight January 1, 1970. Write a program that displays the date and time. Here is a sample run: Write a test program that prompts the user to enter a number and its width and displays a string returned by invoking format(number, width). octal to decimal binary to octal Write the following function to check whether string s1 is a substring of string s2.

#include<iostream>
using namespace std;
bool issafe(int** arr,int x,int y,int n){
    for(int row=0;row<=x;row++){
        if(arr[x][y]==1){
            return false;
        }
    }
    int row=x;
    int col=y;
    while(row>=0 && col>=0){
        if(arr[row][col]==1){
            return false;
        }
        row--;
        col--;
    }
     row=x;
     col=y;
    while(row>=0 && col<n){
        if(arr[row][col]==1){
            return false;
        }
        row--;
        col++;
    }
    return true ;
}
bool nqueen(int** arr,int x,int n){
    if(x>=n){
        return true;
    }
    for(int col=0;col<=n;col++){
        if(issafe(arr,x,col,n)){
            arr[x][col]==1;
            if(nqueen(arr,x+1,n)){
                return true;
            }
            arr[x][col]=0;  //backtracking
            
        }
    }
    return false;
}
int main(){
    int n;
    cin>>n;
    int** arr=new int*[n];
    for(int i=0;i<n;i++){
        arr[i]=new int[n];
        for(int j=0;j<n;j++){
            arr[i][j]=0;

        }
    }
    if(nqueen(arr,0,n)){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                cout<<arr[i][j]<<"";
            }cout<<endl;
        }
    }


    return 0;
}

**8.11 (Game: nine heads and tails)

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;




void decToBinary(int n)
{
    // array to store binary number 
    int binaryNum[3][3];
    
    //converting to binary 
    for (int i = 0; i < 3; i++) 
    {
        for (int j = 0; j < 3; j++)
        {
            binaryNum[i][j] = n % 2;
            n = n / 2;

        }
     }       

    // printing binary> array in reverse order 
    for (int i = 3-1; i >= 0; i--){
        for (int j = 3 - 1; j >= 0; j--)
        {
            if (binaryNum[i][j] == 0)
                cout << "H" << " ";
            else
                cout << "T" << " ";
        }
        cout << endl;
    }
    
 }

int main()
{
    int n;
    cout << "Enter a decimal number between 1 and 512 ";
    cin >> n;

    decToBinary(n);
    return 0;
}

#include<iostream>
using namespace std;

int sum(int arr[], int a);

int main() {
    int arr[1000], n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        cout << sum(arr, n);
    }
}
int sum(int arr[], int a) {
    int i;
    sum = 0;
    for (i=0; i<n; ++i) {
        sum += arr[i];
    }
    return sum;
}#include<iostream>
using namespace std;

int sum(int arr[], int a);

int main() {
    int arr[1000], n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        cout << sum(arr, n);
    }
}
int sum(int arr[], int a) {
    int i;
    sum = 0;
    for (i=0; i<n; ++i) {
        sum += arr[i];
    }
    return sum;
}

(Display the Sundays in a month) Write a program that prompts the user to enter the month and first day of the month, and displays all the Sundays in that month. For example, if the user entered the month 7 for July, and the first day 4 for Wednesday, your program should display the following output: The first day of this month is Wednesday! ... Next Sunday of this month is on 26

#include <iostream>
#include<cmath>
#include<ctime>
#include<string>
#include <iomanip>
#include <fstream>

using namespace std;

int main()
{
	cout << "enter the month ";
	int month;
	cin >> month;
	cout << "Enter The First Day Of The Month ";
	int firstDay;
	cin >> firstDay;
	int nextSunday = 1;
	
		switch (firstDay)
		{
			
		case 1: nextSunday += 7;
			cout << "The first day of this month is sunday "<<endl;
			while (nextSunday < 30)
			{
					cout << "Next Sunday of this month is on " << nextSunday << endl;
									nextSunday += 7 ;
			}
			break;

		case 2: nextSunday += 6;
			cout << "The first day of this month is monday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 3: nextSunday += 5;
			cout << "The first day of this month is tuesday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 4: nextSunday += 4;
			cout << "The first day of this month is wednesday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 5: nextSunday += 3;
			cout << "The first dayof this month is thursday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 6: nextSunday += 2;
			cout << "The first day of this month is friday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;
		case 7: nextSunday += 1;
			cout << "The first day of this month is saturday " << endl;
			while (nextSunday < 30)
			{
				cout << "Next Sunday of this month is on " << nextSunday << endl;
				nextSunday += 7;
			}
			break;

		}
		
}

#c++ #algorithms #interviewquestions #arrays

Kadane’s Algorithm

int maxSubArraySum(int a[], int size) 
{ 
int max_so_far = 0, max_ending_here = 0; 
for (int i = 0; i < size; i++) 
{ 
	max_ending_here = max_ending_here + a[i]; 
	if (max_ending_here < 0) 
		max_ending_here = 0; 

	/* Do not compare for all elements. Compare only 
		when max_ending_here > 0 */
	else if (max_so_far < max_ending_here) 
		max_so_far = max_ending_here; 
} 
return max_so_far; 
}

Factorial Small Number | ZS

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define ll long long
#define take(n) ll int n;cin>>n
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;

int main()
{
    // Zubin Shah
    int N;
    cin>>N;
    while(N--)
    {
        take(n);
        vector<int> vect;
        vect.pb(1);
        ll carry=0;
        int number_of_digits=1;
        rep(i,2,n+1){
            rep(j,0,number_of_digits){
                ll temp=(vect[j]*i)+carry;
                vect[j]=temp%10;
                carry=temp/10;
            }
            while(carry>0){
                ll temp=carry%10;
                vect.pb(temp);
                carry/=10;
                number_of_digits++;
            }
        }
        rrep(i,number_of_digits-1,0){
            cout<<vect[i];
        }
        cout<<endl;
    }


return 0;
}

Multi Add with malloc

vector* sum( vector* v, int n ) {
    vector* r = ( vector* )( malloc( sizeof( vector ) ) );
    for( i = 0; i < n; i++ ) {
        r = add( r, v + i );
    }
    
    return r;
}

Add vector con malloc

typedef struct __vector {
    int x;
    int y;
} vector;

vector* add( vector* a, vector* b ) {
    vector* r = ( vector* )( malloc( sizeof( vector ) ) );
    r->x = a->x + b->x;
    r->y = a->y + b->y;
    
    return r;
}

a = a ^ b;
b = a ^ b;
a = a ^ b;

#include <iostream>

using namespace std;

int main()
{
    cout<<"Hello World";

    return 0;
}

Minimum maximum in Array

// O(n) Linear search
void MinMaxValue(vector<int>arr)  {
    int mini = arr[0], maxi = arr[0];
    for(int i=1;i<arr.size();i++)   {
        if(arr[i]<mini) 
          mini = arr[i];
        if(arr[i]>maxi) 
          maxi = arr[i];
    }
    cout<<mini<<" "<<maxi;
}

// TWO POINTER APPROCH
void reverseString(vector<char>& s) {
  int start=0,end=s.size()-1;
  while(start<end)
    swap(s[start++],s[end--]);
}

Merge without extra space

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ull unsigned long long
using namespace std;
void merge(int *arr1,int *arr2,int n, int m){
    int i=0,j=0,k=0;
    int maxi=INT_MIN;
    rep(i,0,n) maxi=max(arr1[i],maxi);
    rep(i,0,m) maxi=max(arr2[i],maxi);
    maxi++;
    while(i<n && j<m){
        int x=arr1[i]%maxi;
        int y=arr2[j]%maxi;
        if(x<y){
            if(k<n)  arr1[k]+=x*maxi;
            else  arr2[k-n]+=x*maxi;
            k++;
            i++;
        }
        else{
            if(k<n)  arr1[k]+=y*maxi;
            else arr2[k-n]+=y*maxi;
            k++;
            j++;
        }
    }
    while(i<n){
        int x=arr1[i]%maxi;
        if(k<n) arr1[k]+=x*maxi;
        else arr2[k-n]+=x*maxi;
        k++;
        i++;
    }
    while(j<m){
        int x=arr2[j]%maxi;
        if(k<n) arr1[k]+=x*maxi;
        else  arr2[k-n]+=x*maxi;
        k++;
        j++;
    }
    rep(i,0,n) arr1[i]=arr1[i]/maxi;
    rep(i,0,m) arr2[i]=arr2[i]/maxi;
}
int main()
{
    int N;
    cin>>N;
    while(N--)
    {
        int n,m;
        cin>>n>>m;
        int *arr1=new int[n];
        int *arr2=new int[m];
        rep(i,0,n) cin>>arr1[i];
        rep(i,0,m) cin>>arr2[i];
        merge(arr1,arr2,n,m);
        rep(i,0,n) cout<<arr1[i]<<" ";
        rep(i,0,m) cout<<arr2[i]<<" ";
        cout<<endl;
    }


return 0;
}

uint64_t rdtsc() {
  uint32_t hi, lo;
  __asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
 
  return ( (uint64_t)lo)|( ((uint64_t)hi)<<32 );
 }

#include<iostream>
using namespace std;

int main(){
  int n;
  cin >> n;
  cout << "Hello!" << n;
  return 0;
}

Browse more snippets >>