Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- void nuskaitymas(int &n, string zod[]);
- int zod_sk(int n, string zod[]);
- int main()
- {
- string zod[1000];
- int n=0;
- nuskaitymas(n,zod);
- cout << n << endl;
- cout << zod_sk(n,zod);
- return 0;
- }
- void nuskaitymas(int &n, string zod[]){
- ifstream duom ("duom.txt");
- while(!duom.eof()){
- duom>>zod[n];
- n++;
- }
- return;
- }
- int zod_sk(int n, string zod[]){
- int maks=zod[0].length(),laik=0,laik1=0;
- int maks1=0,maks2=0;
- for(int i=1;i<n;i++){
- if(zod[i].length()>maks){
- maks=zod[i].length();
- }
- }
- for(int j=0;j<n;j++){
- for(int i=1;i<=maks;i++){
- if(zod[j].length()==i){
- laik++;
- laik1=i;
- }
- if (laik > maks1){
- maks1=laik;
- maks2=laik1;
- }
- laik=0;
- }
- }
- return maks2;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement