UVA 621(secret search)

Solve in C:

#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
    int i,n;
    char s[1000];
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s",s);
        int len=strlen(s);

        if(strcmp(s,"1")==0||strcmp(s,"4")==0||strcmp(s,"78")==0)
            printf("+\n");

        else if(s[len-1]=='5'&&s[len-2]=='3')
            printf("-\n");

        else if(s[0]=='9'&&s[len-1]=='4')
            printf("*\n");

        else if(s[0]=='1'&&s[1]=='9'&&s[2]=='0')
            printf("?\n");


    }


}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.