How do I solve the following question

Question

1.00/5 (1 vote)

See more:

Given a number n find out how many fragments of the given number is divisible by 11 for example:

Input:

1215598
Output:

4
The numbers 55,121,12155,15598 are continuous fragments of the number which are divisible by 11.

I want to write a program in C++ to do the same but I am unable to figure out an efficient and suitable way.

What I have tried:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int DivisibilityByEleven(int num);
int num;
int main()
{
   int result=DivisibilityByEleven(num);
   return 0;
}

int DivisibilityByEleven(int num)
{
    int counter=0;
    cin>>num;   
    vector<int> arr;
    while(num!=0)
    {
        int temp=num%10;
        num=num/10;
        arr.push_back(temp);
    }     
    reverse(arr.begin(),arr.end());
    for(int i=0;i<arr.size();i++)
    {
        cout<<arr[i];
    }

    if(num%11==0)
    {
        counter++;
    }
}

Posted 12-Sep-18 1:50am

Member 13970073

Updated 22-Apr-21 9:12am

Add a Solution

Comments

CHill60 12-Sep-18 7:57am

What is wrong with the code you already have?

Member 13970073 12-Sep-18 8:18am

it is just taking the integer value into an array
I need to break it up in fragments

3 solutions

Solution 3

#include<stdio.h>

int DivisibilityByELeven(int num)
{
     int d=0;
     int temp;
     for(int i=num;i>0;i=i/10)
     {
     	d++; //Counting the number of digits in the parameter/
	 }
	 printf("%d\n",d);
     if(d==2)
     {
     	if(num%11==0)
		 {
		 	return 1;
		 }
	 }
	 else
	 {
	 
	 int c=0; //count variable
	 int div=100;
      temp=num;
      int count=0;
	 while(temp>0)
	 {
	 	while(count<d)
	 	{
	 		
			int r= temp%div;
	 		if(r%11==0)
	 		{
	 			printf("%d\n",r);
	 			c++;
			 }
			 count++;
			 div *=10;
		 }
		 d--;
		 temp=temp/10;
		 count=0;
		 div=10;
	 }
	 return c;
    }
}
int main()
{
	int num;
	scanf("%d",&num);
	int res= DivisibilityByELeven(num);
	printf("%d",res);
}

Posted 22-Apr-21 9:12am

Member 15165604

Updated 22-Apr-21 9:13am

v2

Comments

CHill60 22-Apr-21 17:18pm

An uncommented, unexplained code dump is not a good solution. Giving someone a ready-baked answer for their homework doesn't help them really. Doing all that over 2 years after they needed the answer...priceless

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Accepted Answer · 2018-09-12T02:29:00

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Think about the task: how many "contiguous fragments" of the input number are there?
The minimum size of a fragment is 2 (or it's not divisible by 11) and the maximum is the whole number length of 7 (or if that is not allowed then one less - 6)
Which means that all the contiguous fragments are:

C#

12, 21, 15, 55, 59, 98,
121, 215, 155, 559, 598,
1215, 2155, 1559, 5598,
12155, 21559, 15598,
121559, 215598,
1215598

They are easy to work out with a pair of nested loops.
Then all you have to do is check each fragment for divisibility, and that's trivial: the modulus operator "%" will do that for you!
Try it yourself, you may find it is not as difficult as you think!

If you meet a specific problem, then please ask about that and we will do our best to help. But we aren't going to do it all for you!

CPallini · Accepted Answer · 2018-09-12T02:28:00

I would use the string representation of the number:

C++

#include <iostream>
#include <sstream>

using namespace std;

// get the integer corresponding to the substring starting at 'pos', having length 'len'
int slice_to_int(const string & str, size_t pos, size_t len)
{
  istringstream iss(str.substr(pos, len));
  int n;
  iss >> n;
  return n;
}

int main()
{
  int n = 1215598;

  ostringstream oss;
  oss << n;

  string s = oss.str(); // get the string representation of the number

  size_t len = s.length();
  size_t count = 0;

  for (size_t i = 0; i<len-1; ++i)
  {
    for (size_t j = 2; j <= (len - i) ; ++j)
    {
      int k = slice_to_int( s, i, j);
      if ( (k % 11) == 0)
      {
        ++count;
      }
    }
  }

  cout << "count = " << count << endl;
}

How do I solve the following question

3 solutions

Solution 2

Solution 1

Solution 3

Add your solution here

Preview 0