রবিবার, ২৮ আগস্ট, ২০১৬

UVA 494 - Kindergarten Counting Game

///...................SUBHASHIS MOLLICK....................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///.....................SESSION-(14-15)....................///
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<ctype.h>
#include<bits/stdc++.h>
using namespace std;
main()
{
    char a[10000];
    long i,l;
    while(gets(a))
    {
        long count=0;
        l=strlen(a);
        for(i=0;i<l;i++)
        {
        //printf("%c",a[i]);
            if(((a[i]>='a'&&a[i]<='z')||(a[i]>='A'&&a[i]<='Z'))&&((a[i+1]<'A'||a[i+1]>'Z')&&(a[i+1]<'a'||a[i+1]>'z')))
            {
                count++;
            }
        }
       printf("%ld\n",count);
    }
    return 0;
}

কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...