Wednesday, 13 January 2016

Solution of UVA 13012 :: LIVE ARCHIVE 7211 :: Identifying Tea


Before seeing the solution make sure that you tried enough. Don’t paste the whole code, just find out the logic. If you stuck in trouble, just inform me on comment.

/**Bismillahir Rahamnir Rahim.**/

#include <stdio.h>
int main()
{
    int n, m , i, cnt=0;
    while(scanf("%d", &n)!=EOF)
    {
        for(i=0, cnt=0; i<5; i++)
        {
            scanf("%d", &m);
            if(m==n) cnt++;
        }
        printf("%d\n", cnt);
    }
    return 0;
}

0 comments:

Post a Comment

Note: only a member of this blog may post a comment.