CamelCase

                            Solution in C :

In   C++   :






#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;

int main() {
    string s;
    cin>>s;
    int count = 1;
    for (const char c : s) {
        if (c >= 'A' && c <= 'Z')
            ++count;
    }
    cout<<count<<endl;
}








In  Java  :




import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        int count = 1;
        for(int i = 0; i<s.length(); i++){
            char c = s.charAt(i);
            if(c>='A' && c<='Z') count++;
        }
        System.out.println(count);
    }
}









In   C  :






#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    char* s = (char *)malloc(10240 * sizeof(char));
    scanf("%s",s);
    int coun=0,i;
    for(i=0;i<strlen(s);i++)
    {
        if(s[i]>=65 && s[i]<=90){coun++;}
    }
    printf("%d\n",coun+1);
    return 0;
}








In   Python3  :




t = input()
uppercase = [x for x in t if x.isupper()]
print(len(uppercase)+1)