Codeforces 26A Almost Prime

A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long int ll;


//Int data type
#define sc1(a)              scanf("%d", &a)
#define sc2(a, b)           scanf("%d %d", &a, &b)
#define sc3(a, b, c)        scanf("%d %d %d", &a, &b, &c)
#define sc4(a, b, c, d)     scanf("%d %d %d %d", &a, &b, &c, &d)

//Long Data type
#define scl1(a)             scanf("%lld", &a)
#define scl2(a, b)          scanf("%lld %lld", &a, &b)
#define scl3(a, b, c)       scanf("%lld %lld %lld", &a, &b, &c)
#define scl4(a, b, c, d)    scanf("%lld %lld %lld %lld", &a, &b, &c, &d)

#define mx 1000005
#define mod 1000000007
#define pf(a) cout<<a<<endl

ll arr[1001];

int main()
{
    ll n,m,i,j=0,k=0,t,a=0,b,c,ck=0,dk=0;

    scl1(n);

    for(i=2; i<=n; i++){
        if(arr[i]==0){
            for(j=i; j<=n; j+=i)
                arr[j]++;
        }

      if(arr[i]==2)
        ck++;
    }
    cout<<ck<<endl;
}