870C - Maximum splitting - CodeForces Solution


dp greedy math number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#define mod 1000000007
#define int long long
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define forF(i,a,b) for(int i=a;i<b;i++)
#define forB(i,a,b) for(int i=a;i>b;i--)
 
using namespace std;

void prob(){
	int n;
	cin>>n;
	if(n<=3 || n==5 || n==7 || n==11) cout<<-1;
	else if(n%2) cout<<n/4-1;
	else cout<<n/4;
}
 
int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t=1;
	cin>>t; //test cases
	while(t--) prob(),cout<<endl;
	return 0;
}


Comments

Submit
0 Comments
More Questions

1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers