Pagini recente » Cod sursa (job #999544) | Cod sursa (job #1995397) | Cod sursa (job #454887) | Cod sursa (job #1637356) | Cod sursa (job #1503387)
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char* argv[])
{
ifstream fin("text.in");
string text;
if (fin.is_open())
{
getline(fin, text);
fin.close();
}
int crtLen = 0;
int total = 0;
int nWords = 0;
int ii = 0;
while (ii < text.length())
{
while (ii < text.length() && ((text[ii] >= 'A' && text[ii] <= 'Z') ||
(text[ii] >= 'a' && text[ii] <= 'z')))
{
++ii;
++crtLen;
++total;
}
++nWords;
while ((ii < text.length()) && !((text[ii] >= 'A' && text[ii] <= 'Z') ||
(text[ii] >= 'a' && text[ii] <= 'z')))
{
++ii;
}
}
ofstream fout;
fout.open("text.out");
fout << (total / nWords) << endl;
fout.close();
return 0;
}