spoj ICANDIES - Candies

Problem link


A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)


ll check(ll num)
{
    ll sara = 0;

         while(1){
            if(num < 1) break;
            if(num %3 == 0 && sara!=0) return num;

                num -= 5;
                sara += 5;

         }
         return -1;

}

int main()
{
    ll tc, t = 1, ck = 0;

    sc1(tc);

    for(ll i = 1; i <= tc; i++){
         ll num;
         sc1(num);

         printf("Case %lld: %lld\n", i, check(num));
    }

    return 0;
}