天梯周赛10-21

it2024-12-11  21

#include <bits/stdc++.h> //#pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") using namespace std; typedef long long ll; void init() { } void solve() { int n; cin>>n; getchar(); string s; for (int i = 0; i < n; ++i) { getline(cin,s); for(int j=0;j<s.size();j++) { if(s[j]=='T') { cout<<(int)(s[j-2]-'A'+1); } } } } int main() { int _=1; //cin>>_; while(_--) { init(); solve(); } return 0; } #include <bits/stdc++.h> //#pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") using namespace std; typedef long long ll; void init() { } void solve() { int a,b; cin>>a>>b; int x=a*b; while(x%10==0) x/=10; while(x) { cout<<x%10; x=x/10; } } int main() { int _=1; //cin>>_; while(_--) { init(); solve(); } return 0; } #include <bits/stdc++.h> //#pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") using namespace std; typedef long long ll; void init() { } void solve() { string s; cin>>s; int x=0; for(int i=0;i<2;i++) x=x*10+s[i]-'0'; int y=0; for(int i=0;i<2;i++) y=y*10+s[i+3]-'0'; if((x<=11)||(x==12&&y==0)) { cout<<"Only "<<s<<". Too early to Dang."; } else { x=x+(y!=0)-12; for (int i = 0; i < x; ++i) { cout<<"Dang"; } } } int main() { int _=1; //cin>>_; while(_--) { init(); solve(); } return 0; } #include <bits/stdc++.h> //#pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") using namespace std; typedef long long ll; void init() { } void solve() { int n; char c; string s; cin>>n>>c; getchar(); getline(cin,s); if(n<=s.size()) { int m=s.size(); for(int i=m-n;i<m;i++) { cout<<s[i]; } } else { for(int i=0;i<n-s.size();i++) cout<<c; cout<<s; } } int main() { int _=1; //cin>>_; while(_--) { init(); solve(); } return 0; }
最新回复(0)