UVA 621 - Secret Research UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main() { int n,l; char s[10000]; while(scanf("%d",&n)==1) { while(n--) { scanf("%s",&s); l=strlen(s); if (strcmp(s,"1")==0||strcmp(s,"4")==0||strcmp(s,"78")==0) printf("+\n"); else if (s[l-2]=='3'&&s[l-1]=='5') printf("-\n"); else if (s[0]=='9'&&s[l-1]=='4') printf("*\n"); else if (s[0]=='1'&&s[1]=='9'&&s[2]=='0') printf("?\n"); } } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/621/621.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read