Codeforces-Codes/125_B.cpp at master · hatred/Codeforces-Codes · 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
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>

using namespace std;
string mapper(char c)
{
	map<char,string>p;

	p['>'] = "1000";
	p['<'] = "1001";
	p['+'] = "1010";
	p['-'] = "1011";
	p['.'] = "1100";
	p[','] = "1101";
	p['['] = "1110";
	p[']'] = "1111";

	return p[c];
}

int power(long long a,long long b,long long mod)
{
	if(b==0)
		return 1;

	long long pow = power(a,b/2,mod);
	if(b%2==0)
	{
		return (pow*pow)%mod;
	}
	else
	{
		return (2*pow*pow)%mod;
	}
}

int main()
{
	string s;
	getline(cin,s);

	string bin;

	for(int i=0;i<(int)s.length();i++)
	{
		bin = bin + mapper(s[i]);
	}
	long long sum = 0;
	int index = 0;
	for(int i=(int)bin.length()-1;i>=0;i--)
	{
		if(bin[i]=='0')
		{
			index++;
			continue;
		}
		sum+=power(2,index,1000003);
		index++;
	}
	sum = sum % 1000003;
	cout<<sum<<endl;

	return 0;
}