Codeforces_CompCodes/CHEFORA.cpp at main · masterishaan19/Codeforces_CompCodes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
#define exp pow(10,-9)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define daman ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#include <bits/stdc++.h>
using namespace std;
vector<lli>palin;
vector<lli>sumPalin;
lli createPalindrome(int input, int b)
{
    lli n = input;
    lli palin = input;

    n /= b;

    while (n > 0)
    {
        palin = palin * b + (n % b);
        n /= b;
    }
    return palin;
}

void generatePalindromes()
{
   	lli number;

    lli i = 1;
    while (1)
    {
    	number = createPalindrome(i,10);
        palin.push_back(number);
        i++;

        if(palin.size() == 100011)
        	return;
    }
}
lli fastpow(lli base,lli pow)
{
	lli res = 1;

	while(pow)
	{
		if(pow%2 == 1)
			res = ((res%mod)*(base%mod))%mod;

		base = ((base%mod) * (base%mod))%mod;
		pow /= 2;
	}
	return res;
}
main() {
//	getchar();
	daman;

	generatePalindromes();

//	for(int i=0;i<palin.size();i++)
//		cout<<palin[i]<<" ";

	sumPalin.push_back(1);

	for(int i=1;i<palin.size();i++)
		sumPalin.push_back(sumPalin[i-1] + palin[i]);

//	for(int i=0;i<palin.size();i++)
//		cout<<sumPalin[i]<<" ";

	int q;
	cin>>q;
	while(q--)
	{
		lli l,r;
		cin>>l>>r;

		lli sum = 0;

		sum = sumPalin[r-1] - sumPalin[l-1];

		lli res = fastpow(palin[l-1],sum);

		cout<<res<<"\n";
	}
}