提交时间:2024-01-21 14:07:50

运行 ID: 120963

#include <cstdio> using namespace std; char ch[300],be,af,f,p; int main() { int p1,p2,p3,i = 0,j,k; scanf("%d%d%d%s",&p1,&p2,&p3,ch); while (ch[i]) { be = ch[i - 1]; af = ch[i + 1]; f = ch[i]; if (f == '-' && af > be && (be >= '0' && af <= '9' || be >= 'a' && af <= 'z')) { for (p3 == 1?j=be+1:j=af-1; p3 == 1?j<af:j>be; p3 == 1?j++:j--) { p = j; if (p1 == 2) { p = (p >= 'a') ? p - 32 : p; } else if (p1 == 3) { p = '*'; } for (k = 0; k < p2; k++) { printf("%c",p); } } } else { printf("%c",f); } i++; } return 0; }