Pagini recente » Borderou de evaluare (job #2021878) | Cod sursa (job #927220) | Cod sursa (job #2761080) | Cod sursa (job #272704) | Cod sursa (job #923889)
Cod sursa(job #923889)
#include <fstream>
#include <iostream>
#include <cstring>
using namespace std;
ifstream f("text.in");
ofstream g("text.out");
int main(){
char T[2000001];
long i;
long cuv=0;
long lit=0;
long lung;
bool ok;
while (!f.eof()){
f.getline(T,2000000,' ');
ok=0;
lung=strlen(T);
for (i=0;i<=lung;i++){
if ((((T[i]>='a')&&(T[i]<='z'))||((T[i]>='A')&&(T[i]<='Z')))||((T[i]>='0')&&(T[i]<='9'))){
lit++;
ok=1;
}
if (T[i]=='-'){
if (((T[i-1]>='a')&&(T[i-1]<='z'))&&((T[i+1]>='a')&&(T[i+1]<='z')))
cuv++;
else if (((T[i-1]>='a')&&(T[i-1]<='z'))&&((T[i+1]>='A')&&(T[i+1]<='Z')))
cuv++;
else if (((T[i-1]>='A')&&(T[i-1]<='Z'))&&((T[i+1]>='a')&&(T[i+1]<='z')))
cuv++;
else if (((T[i-1]>='A')&&(T[i-1]<='Z'))&&((T[i+1]>='A')&&(T[i+1]<='Z')))
cuv++;
else if (((T[i-1]>='0')&&(T[i-1]<='9'))&&((T[i+1]>='0')&&(T[i+1]<='9')))
cuv++;
}
}
if (ok)
cuv++;
}
f.close();
cout<<cuv;
g<<lit/cuv;
g.close();
return 0;
}