Pagini recente » Istoria paginii winter-challenge-2008/runda-2/solutii | Istoria paginii runda/asdf | Istoria paginii usaco-nov-2005-divizia-gold | Cod sursa (job #1694754) | Cod sursa (job #1694005)
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
int i=0,lungime=0,cuv=0;
char sir[100];
cin.get(sir,99);
cout<<sir;
while(i<=strlen(sir))
{
if(sir[i]>='A' && sir[i] <= 'Z' || sir[i] >= 'a' && sir[i] <= 'z')
lungime++;
if(sir[i] == '\0')
cuv++;
if(sir[i] == ' ')
cuv++;
if((sir[i] == '-' &&(sir[i-1]>='A' && sir[i-1] <= 'Z' || sir[i-1] >= 'a' && sir[i-1] <= 'z')))
cuv++;
i++;
}
cout<<endl;
cout<<lungime<<endl;
cout<<cuv<<endl;
cout<<lungime/cuv;
return 0;
}
//Lasa-ma in pace, ca am invatat azi noapte toata ziua!