Pagini recente » Cod sursa (job #1800483) | Cod sursa (job #3231805) | Cod sursa (job #600209) | Cod sursa (job #178326) | Cod sursa (job #1441116)
#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())
{
getline(fin, 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");
fout << (lettercount / wordcount) << endl;
fout.close();
return 0;
}