A.chuanpai
#include<bits/stdc++.h>
using namespace std;
#pragma warning(disable:4996)
const double eps = 1e-6;
typedef long long ll;
#define debug(x) cout<<#x<<": "<<(x)<<endl;
#define lfeq(a,b) (abs((a)-(b)) < eps)
int mod = 1e9 + 7;
int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
bool sol() {
int k;
cin >> k;
int cnt = 0;
for (int i = 1; i <= k / 2; ++i) {
if (i <= 6 && k - i <= 6) {
cnt++;
}
}
cout << cnt << endl;
return true;
}
int main() {
//freopen("../in1.txt", "r", stdin);
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
sol();
}
return 0;
}
H.Nihongo wa Muzukashii D
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable:4996)
const double eps = 1e-6;
typedef long long ll;
#define debug(x) cout<<#x<<": "<<(x)<<endl;
#define lfeq(a,b) (abs((a)-(b)) < eps)
int mod = 1e9 + 7;
int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
bool sol() {
vector<vector<string>> a = {
{ "chimasu","rimasu",/*"imasu",*/ },
{ "mimasu", "bimasu","nimasu"},
{ "kimasu" },
{ "gimasu" },
{ "shimasu" },
};
string s;
cin >> s;
int i = 0;
int j = 0;
if (s == "ikimasu") {
cout << "itte" << endl;
return true;
}
vector<string> arr = { "tte","nde","ite","ide","shite" };
for (i = 0; i < a.size(); ++i) {
for (j = 0; j < a[i].size(); ++j) {
int pos = s.rfind(a[i][j]);
if (pos != string::npos) {
s = s.substr(0,pos);
s += arr[i];
cout << s << endl;
return true;
}
}
}
return true;
}
int main() {
//freopen("../in1.txt", "r", stdin);
int t = 0;
cin >> t;
for (int i = 0; i < t; ++i) {
sol();
}
return 0;
}
K K-skip Permutation
#include <bits/stdc++>
using namespace std;
#pragma warning(disable:4996)
const double eps = 1e-6;
typedef long long ll;
#define debug(x) cout<<#x<<": "<<(x)<<endl;
#define lfeq(a,b) (abs((a)-(b)) < eps)
int mod = 1e9 + 7;
int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
int main() {
//freopen("../in2.txt", "r", stdin);
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 1; i <= k; ++i) {
for (int j = 0; j *k + i <= n; ++j) {
++cnt;
if (cnt < n) {
cout << j * k + i << " ";
}
else {
cout << j * k + i;
}
}
}
return 0;
}
M.True Story
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5+10;
int s[maxn],t[maxn],p[maxn],n,m,x,p0;
int main()
{
cin >> n >> m >> x >> p0;
for(int i=1;i<=n;i++) scanf("%d",&s[i] );
for(int i=1;i<=m;i++) scanf("%d",&t[i] );
for(int i=1;i<=m;i++) scanf("%d",&p[i] );
int mx = p0, ans = 0;
for(int i=0;i<=m;i++) mx = max( mx,p[i]-t[i] );
for(int i=1;i<=n;i++) ans += (1ll*mx*s[i]>=x);
cout << ans;
}