字符串毒瘤题,细节很多,写了差不多一个小时才推出来。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
|
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; typedef long long ll; int k; inline int () { int x=0;char c=' '; while(c<='0' || c>='9') c=getchar(); while(c>='0' && c<='9') { x=x*10+c-'0'; c=getchar(); } return x; } string s,t[10]={"-|| ||-"," | | ","- |-| -", "- |- |-"," ||- | ", "-| - |-","-| -||-", "- | | ","-||-||-","-||- |-"}; int main() { cin>>k>>s; for (int p=0;p<7;p++){ if (p==2 || p==5) continue; if (p%3==0){ for (int i=0;i<s.size();i++){ putchar(' '); for (int j=0;j<k;j++){ cout<<t[s[i]-48][p]; } if(i!=s.size()-1) printf(" "); } putchar('n'); } else{ for(int q=0;q<k;q++){ for (int i=0;i<s.size();i++){ cout<<t[s[i]-48][p]; for (int j=0;j<k;j++){ putchar(' '); } cout<<t[s[i]-48][p+1]; if(i!=s.size()-1) putchar(' '); } putchar('n'); } } } return 0; }
|
近期评论