T1
#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
cin >> str;
for(auto &i:str)i+=3;
cout << str << endl;
return 0;
}
T2
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n,ans;
vector<int> primes;
bitset<N+50> vis(0);
void init(){
vis[0] = vis[1] = true;
int m = sqrt(N)+0.5;
for(int i = 2;i < m;i ++){
if(!vis[i]){
primes.push_back(i);
for(int j = i*i;j < N;j += i)vis[j] = true;
}
}
}
int main() {
cin >> n;
init();
for(auto i:primes){
if(i>n)break;
while(n%i==0)ans++,n/=i;
}
cout << ans << endl;
return 0;
}
T3
#include <bits/stdc++.h>
using namespace std;
unsigned long long n;
int main() {
cin >> n;n <<= 1;
cout << ceil(sqrt(n)) << endl;
return 0;
}
T4
#include <bits/stdc++.h>
using namespace std;
int n,m,ans;
const int N = 1e3+5;
int f[N],w[N],v[N];
int main() {
cin >> n >> m;
memset(f,0x80,sizeof(f));
f[0] = 0;
for(int i = 1;i <= m;i ++)cin >> w[i] >> v[i];
for(int i = 0;i <= n;i ++)
for(int j = 1;j <= m;j ++)
f[i+w[j]] = max(f[i+w[j]],f[i]+v[j]);
for(int i = 1;i <= n;i ++)ans=max(ans,f[i]);
cout << ans << endl;
return 0;
}
T5
#include <bits/stdc++.h>
#define R register
using namespace std;
int n,ans;
int a[100003],f[100003];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> a[0];
while(cin >> a[++n]);
n--;
for(R int i = 1;i <= n;i ++)
f[i] = 1;
for(R int i = n;i >= 1;i --)
for(R int j = i+1;j <= n;j ++)
if(a[j] <= a[i])
f[i] = max(f[i],f[j]+1);
ans = 0;
for(int i = 1;i <= n;i ++){
ans = max(ans,f[i]);
}
cout << ans << endl;
return 0;
}
T6
#include <bits/stdc++.h>
using namespace std;
int n,m,bx,by,cnt;
int maps[105][105];
int vis[105][105];
const int dir[4][2] = {{1,0},{0,1},{0,-1},{-1,0}};
void bfs(){
queue<pair<int,int>> que;
que.push(make_pair(bx,by));
while(que.size()){
pair<int,int> now = que.front();que.pop();
for(int i = 0;i < 4;i ++){
int tx = now.first + dir[i][0];
int ty = now.second + dir[i][1];
if(tx<1||ty<1||tx>n||ty>m||vis[tx][ty]||maps[tx][ty]==2)continue;
que.push(make_pair(tx,ty));vis[tx][ty] = 1;cnt++;
}
}
}
int main() {
cin >> n >> m;
for(int i = 1;i <= n;i ++){
for(int j = 1;j <= m;j ++){
cin >> maps[i][j];
if(maps[i][j] == 6)
bx = i,by = j,vis[i][j] = 1,maps[i][j] = 1;
}
}
bfs();
cout << ++cnt << endl;
return 0;
}