Sam and substrings


Problem Statement :


Samantha and Sam are playing a numbers game. Given a number as a string, no leading zeros, determine the sum of all integer values of substrings of the string.

Given an integer as a string, sum all of its substrings cast as integers. As the number may become large, return the value modulo 10^9 +7.

Example
n = '42'
Here n is a string that has 3 integer substrings: 4, 2, and 42. Their sum is 48, and 48 modulo{10^9 +7)=48.

Function Description

Complete the substrings function in the editor below.

substrings has the following parameter(s):

string n: the string representation of an integer
Returns

int: the sum of the integer values of all substrings in n, modulo 10^9 + 7
Input Format

A single line containing an integer as a string, without leading zeros.

Constraints

1 <= ncastasaninteger <= 2 x 10^5


Solution :



title-img 


                            Solution in C :

In C++ :






#include <iostream>
#include <string.h>
using namespace std;

#define MOD 1000000007

int main() {
	char num[200005];
	gets(num);
	int len = strlen(num);
	long long factor = 1, ans = 0;

	for (int i = len-1; i >= 0; --i) {
		long long tmp = (num[i]-'0') * (i+1) * factor % MOD;
		ans += tmp;
		ans %= MOD;
		factor = (factor * 10 + 1) % MOD;
	}
	printf("%d\n", ans);

	return 0;
}








In Java :






import java.util.Scanner;


public class Solution {

	static long mod = 1000000007;
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		char s[] = cin.next().toCharArray();
		long ten[] = new long[s.length + 2];
		
		ten[0] = 1;
		for (int i=1; i<ten.length; i++) {
			ten[i] = ten[i - 1] * 10 + 1;
			ten[i] %= mod;
		}
		
		long ans = 0;
		for (int i=0; i<s.length; i++) {
			ans += ((s[i] - '0') * ten[s.length - i - 1]) % mod * (i + 1) % mod;
			ans %= mod;
		}
		
		System.out.println(ans);
		cin.close();
	}

}








In C :





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

#define MAXLEN 200001
#define MODULUS 1000000007LL

int main() {
	long long total, multiplier, partialsum;
	char c;
	
	total = partialsum = 0;
	multiplier = 1;
	while (1) {
		c=getchar();
		if (c<'0' || c>'9') break;
		c -= '0';
		partialsum += multiplier * c;
		total = (total * 10 + partialsum) % MODULUS;
		multiplier++;
	}
	
	printf("%lld\n",total);
	return 0;
}








In Python3 :





import operator

MOD = 1000000007

s = input()
n = len(s)
a = []
p10 = 0
for i in range(n, 0, -1):
	p10 = (p10 * 10 + 1) % MOD
	a.append(p10 * i % MOD)

b = [ord(c) - ord('0') for c in s]
print(sum(map(operator.mul, reversed(a), b)) % MOD)








View More Similar Problems

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →

Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →