Pagini recente » Cod sursa (job #2777134) | Cod sursa (job #1822024) | Cod sursa (job #1472319) | Cod sursa (job #429146) | Cod sursa (job #1043029)
#include<iostream>
#include<cstring>
#include<fstream>
using namespace std;
int const MAX = 1024 * 1024 + 7;
char s[MAX];
char *sneaky = s + 1;
int WordCount(char s[])
{
int i = 0, k, Contor = 0, j = 0, F = 0;
k = strlen(s);
while (i < k)
{
if (isalpha(s[i]) == 0 && isalpha(s[i + 1]) != 0)
Contor++;
i++;
}
return Contor;
}
int main()
{
int i, sr, k = 0, z = 1;
ifstream g("text.in");
ofstream f("text.out");
g.get(sneaky, MAX - 1);
s[0] = ' ';
sr = strlen(sneaky);
for (i = 0; i < sr; i++)
{
if (isalpha(sneaky[i]))
k++;
}
f << k / WordCount(s);
}