Timus Problem 1639 Solution

Timus Problem Solution

Timus Problem 1639 Solution

#include <stdio.h>

int main()

{

    int m,n,sum;

    while(scanf("%d %d",&m,&n)!=EOF){

        if(m>=1 && n==(m*m)){

            printf("[:=[first]");

        }

        else

        printf("[second]=:]");

    }

    return 0;

   

}

 

0 Comments

You may find interest following article