Marvelous Mazes UVA - 445
阿新 • • 發佈:2017-05-10
累加 == return include printf str string iostream log
#include<iostream> #include<stdio.h> #include<string> #include<cstring> #define maxn 150 using namespace std; char mapn[maxn][maxn]; int main() { char str[150]; while(gets(str)!=NULL) { int sum; for(int i=0;i<strlen(str);) { sum= 0; if(str[i] == ‘!‘) printf("\n"); while(str[i]>=‘0‘&&str[i]<=‘9‘)//數字累加,11累加為2 { sum += str[i] - ‘0‘; i++; } if(str[i] == ‘b‘) str[i] = ‘ ‘; for(int j=0;j<sum;j++) printf("%c",str[i]); i++; } printf("\n"); } return 0; }
Marvelous Mazes UVA - 445