#include<bits/stdc++.h>
using namespace std;
string s;
int main(){
int n, ans = 0;
cin >> n;
cin >> s;
int len = s.length();
for(int i = 0; i < len; i++){
ans += (s[i]-'0')*pow(n,len-i-1);
}
...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《L2-DAY11》 | 226字 | 48.0分钟 | 100% | 58 CPM | 17 次 | 1 | 不及格，加强练习！ |
| The wrong word this time: } | |||||||
| Inspirational quotes: 惊奇就是科学的种子。 ——爱迪生 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005