Pagini recente » Cod sursa (job #3151252) | Cod sursa (job #2928383) | Cod sursa (job #3290133) | Cod sursa (job #2060112) | Cod sursa (job #1441121)
#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 line = " ";
if (fin.is_open())
{
string tmp;
while (fin)
{
getline(fin, tmp);
line += tmp;
line += " ";
}
fin.close();
}
int wordcount = 0;
int lettercount = 0;
bool newword = true;
for (int ii = 0; ii < line.length(); ++ii)
{
if ((line[ii] >= 'a' && line[ii] <= 'z') ||
(line[ii] >= 'A' && line[ii] <= 'Z'))
{
if (newword)
{
newword = false;
++wordcount;
}
++lettercount;
}
else
{
newword = true;
}
}
ofstream fout;
fout.open("text.out");
int result = 0;
if (wordcount > 0)
{
result = lettercount / wordcount;
}
fout << result << endl;
fout.close();
return 0;
}