https://www.luogu.com.cn/record/list?pid=P6745
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <cstdio>
using namespace std;
long long n=0,m=0,ans=0;
int main() {
cin>>n>>m;
if(n==0){
m++;
cout<<m;
return 0;
}
if(n==0 && m==0){
cout<<"0";
return 0;
}
cout<<"1";
if(m<10){
for(int i=1;i<=n-1;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100 && m>10){
for(int i=1;i<=n-2;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000 && m>100 ){
for(int i=1;i<=n-3;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000 && m>1000 ){
for(int i=1;i<=n-4;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000 && m>10000 ){
for(int i=1;i<=n-5;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000000 && m>100000 ){
for(int i=1;i<=n-6;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000000 && m>1000000 ){
for(int i=1;i<=n-7;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000000 && m>10000000 ){
for(int i=1;i<=n-8;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000000000 && m>100000000 ){
for(int i=1;i<=n-9;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000000000 && m>1000000000 ){
for(int i=1;i<=n-10;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000000000 && m>10000000000 ){
for(int i=1;i<=n-11;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000000000000 && m>100000000000 ){
for(int i=1;i<=n-12;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000000000000 && m>1000000000000 ){
for(int i=1;i<=n-13;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000000000000 && m>10000000000000 ){
for(int i=1;i<=n-14;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000000000000000 && m>100000000000000 ){
for(int i=1;i<=n-15;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000000000000000 && m>1000000000000000 ){
for(int i=1;i<=n-16;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000000000000000 && m>10000000000000000 ){
for(int i=1;i<=n-17;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<10000000000000000000 && m>1000000000000000000 ){
for(int i=1;i<=n-19;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<100000000000000000000 && m>10000000000000000000 ){
for(int i=1;i<=n-20;++i){
cout<<"0";
}
cout<<m;
return 0;
}
if(m<1000000000000000000000 && m>100000000000000000000 ){
for(int i=1;i<=n-21;++i){
cout<<"0";
}
cout<<m;
return 0;
}
return 0;
}