Pagini recente » Istoria paginii metoda-greedy-si-problema-fractionara-a-rucsacului | Istoria paginii runda/f11-fast-competition | Monitorul de evaluare | Cod sursa (job #2771853) | Cod sursa (job #1130720)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("text.in");
ofstream g("text.out");
int k , s , ok;
char c;
int main()
{
while(f.get(c))
{
if (ok==0)
if ((c>='a' && c<='z') || (c>='A'&&c<='Z'))
ok =1;
if(ok==1)
if ((c>='a' && c<='z') || (c>='A'&&c<='Z'))
k++;
else {s++; ok=0;}
}
g<<k/s;
return 0;
}