Pagini recente » Cod sursa (job #2378918) | Cod sursa (job #431457) | Cod sursa (job #1145595) | Cod sursa (job #2890246) | Cod sursa (job #1867906)
/*#include <iostream>
#include <fstream>
using namespace std;
char sir[100];
int n=0;
int n_litere_identice(){
int contor=0;
for(int i=1;i<=n;i++) {
//cout<<i<<' '<<n-i+1<<' '<<sir[n-i+1]<<endl;
if(sir[i]==sir[n-i+1]) {
contor++;
}else{
return contor;
}
}
return contor;
}
int main()
{
ifstream f("ene.in");
ofstream g("ene.out");
char litera;
while(f>>litera){
if('A'<=litera && litera<='Z') {
n++;
sir[n]=litera;
}
}
g<<n_litere_identice();
f.close();
g.close();
return 0;
}
*/
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
int main() {
ifstream f("text.in");
ofstream g("text.out");
char sir[10000000];
f.getline(sir,10000000);
int n=strlen(sir),contor_cuvinte=0,contor_litere;
for(int i=0;i<=n;i++) {
if(('a'<=sir[i]&&sir[i]<='z') || ('A'<=sir[i] && sir[i]<='Z')) {
contor_litere++;
}else if((('a'<=sir[i-1]&&sir[i-1]<='z') || ('A'<=sir[i-1] && sir[i-1]<='Z')) &&!(('a'<=sir[i]&&sir[i]<='z')||('A'<=sir[i] && sir[i]<='Z'))){
contor_cuvinte++;
}
}
g<<contor_litere/contor_cuvinte;
f.close();
g.close();
}