#include<iostream>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include <math.h> using namespace std; char a[];
long b;
long s;
int main(){
scanf("%s",a);
scanf("%d",&b);
int len = strlen(a);
s = ;
for(int i = ;i<len;i++)
{
s += (a[i]-) * pow(,len - i - );
}
//cout<<s<<endl;
cout<<s*b<<endl;
//printf("%s\n",a);
return ;
}
相关文章
- 09-19女士品茶 | The Lady Tasting Tea - 读书笔记
- 09-19Tea HDU - 5881
- 09-19D. Green and Black Tea
- 09-19Codeforces 571D - Campus(并查集+线段树+DFS 序,hot tea)
- 09-19Codeforces Round #311 (Div. 2)B. Pasha and Tea二分
- 09-19HDU 1288(Hat's Tea)
- 09-19HDU 6667 Roundgod and Milk Tea
- 09-19逆向中的Tea加解密算法案例
- 09-19Codeforces 571D - Campus(并查集+线段树+DFS 序,hot tea)
- 09-19Milk-Tea解析工具(DJ音乐解析)