Codeforces Round #440 Div. 2 C. Maximum splitting

题目链接

题意：求一个数能分解成为最多多少个合数。

分析：我们希望分成的合数越小越好，而最小的合数是4，所以我们先按4分，不能整除4的话，我们进行分类讨论，把余数加到4上凑成合数就行了。

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<sstream>
#include<cstdlib>
#include<time.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define repp(i,n,a) for(int i=n;i>=a;i--)
#define ll long long
#define ull unsigned long long
#define mem(a,x) memset((a),(x),sizeof ((a)))//x只能是0或-1或false或true
#define debug(x) cout<<"X: "<<(x)<<endl
#define de cout<<"************"<<endl
#define lowbit(x) ((x)&(-x))
#define lson rt<<1
#define rson rt<<1|1
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/(__gcd(a,b))
#define inf 0x3f3f3f3f//1e9+6e7
#define Eps 1e-8
#define Mod 1e9+7
#define maxn 100010
const double pi = acos(-1.0);
using namespace std;

int main() {
    int q;
    cin >> q;
    int n;
    while(q--)
    {
        scanf("%d",&n);
        int t=n/4;
        if(n%4==0)
            {cout<<t<<endl;continue;}
        if(n%4==1)
        {
            if(t>=2)
                {cout<<t-1<<endl;continue;}
            else
                {cout<<"-1"<<endl;continue;}
        }
        if(n%4==2)
        {
            if(t>=1)
                {cout<<t<<endl;continue;}
            else
                {cout<<"-1"<<endl;continue;}
        }
        if(n%4==3)
        {
            if(t>=3)
                {cout<<t-1<<endl;continue;}
            else
                {cout<<"-1"<<endl;continue;}
        }
    }
    return 0;
}