#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
char x[100];
int s=0;//sm=0,n,a[1001],mx;
while(scanf("%s", x) == 1){
s+=strlen(x);
}
// for(int i=0;i<3;i++)cin>>a[i],sm+=a[i];
// mx=sm;
// for(int i=3;i<n;i++){
// cin>>a[i];
// sm+=a[i];
// if(a[i]+a[i-1]+a[i-2]>mx)mx=a[i]+a[i-1]+a[i-2];
// }
printf("%d",s);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
300 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
