forked from keysangyonthan/SPOJsolvent
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSubstring.cpp
57 lines (44 loc) · 957 Bytes
/
Substring.cpp
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
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int n = 2;
int findValB(string &t)
{
int sum = 0;
int l = t.length();
for(int i = 0; i < l; i++)
sum = sum + (t[i] - 48)*pow(2,i);
return sum;
}
int findValA(string &t, int l, int h)
{
int sum = 0;
for(int i = l, j = 0; i <= h; i++, j++)
sum = sum + (t[i] - 48)*pow(2,j);
return sum;
}
int main()
{
int lengthB, lengthA, valB, valA;
int flag;
string A[n], B[n];
for(int i = 0; i < n; i++)
cin >> A[i] >> B[i];
for(int i = 0; i < n; i++)
{
flag = 0;
lengthA = A[i].length();
lengthB = B[i].length();
valB = findValB(B[i]);
for(int j = 0; j <= lengthA - lengthB; j++)
{
if(findValA(A[i],j,(j+lengthB)) == valB)
{
flag = 1;
break;
}
}
cout << flag << endl;
}
}