1 solutions

  • 0
    @ 2025-3-3 16:33:15

    C :

    #include<stdio.h>
    #include<stdlib.h>
    #include<string.h>
    #include<ctype.h>
    #include<math.h>
    char s[10001],t[1001],tmp[1],smx[10001];
    int main(){	
     	gets(s);
     	int len = strlen(s),i,j,sum=0,n=0,mx=0;
        for(i=0;i<len;i++){
           if(i==0 && s[i]!=' ' || i>0 && s[i]!=' ' && s[i-1]==' '){
           		memset(t,0,sizeof(t));
           		for(j=i;j<len && s[j]!=' ';j++){
           			tmp[0] = s[j];
           			strcat(t,tmp);
           			sum++;
    			}
    			if(strlen(t)>mx){
                    mx = strlen(t); 
                    memset(smx,0,sizeof(smx));
                    strcat(smx,t);
                }
                n++;
    	   }
        }
        printf("%d\n%.1lf\n%s",n,sum*1.0/n,smx);
    	return 0;
    }
    
    

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    
    string s,w,ma;
    int i,c,len;
    double v;
    int main() {
    	getline(cin,s);
    	
    	for(i = 0;i < s.size();i++){
    		if(s[i] != ' '){
    			w = w + s[i];
    			
    			if(i == s.size() - 1 || s[i+1] == ' '){
    				c++;
    				len = len + w.size();
    				//cout<<w<<endl;
    				if(w.size() > ma.size()){
    					ma = w;
    				}
    				w = "";
    			}
    		}
    	}
    	
    	cout<<c<<endl;
    	cout<<fixed<<setprecision(1)<<len * 1.0 / c<<endl;
    	cout<<ma;
    	
    	
    }
    
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		String str = sc.nextLine();
    		String str1 = "" + str.charAt(0);
    		for(int i = 0;i <str.length()-1;i++) {
    			if(str.charAt(i) == ' ' && str.charAt(i+1) == ' ') {
    				continue;
    			}else {
    				str1 += str.charAt(i+1);
    			}
    		}
    		String str2 = str1.trim();
    		String[] arr = str2.split(" ");
    		System.out.println(arr.length);
    		double count = 0;
    		for(int i = 0;i < arr.length;i++) {
    			count += arr[i].length();
    		}
    		System.out.println(String.format("%.1f", count / arr.length));
    		int lenght = arr[0].length();
    		int index = 0;
    		for(int i = 1 ;i < arr.length;i++) {
    			if(arr[i].length() > lenght) {
    			lenght = arr[i].length();
    				index = i;
    			}
    		}
    		System.out.println(arr[index]);
    	}
    
    }
    
    
    • 1

    Information

    ID
    10554
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By