【解题报告】【比赛复现】洛谷入门赛 #17 题解

• 洛谷入门赛 #17 题解
  • Before
  • A 食堂
  • B 数学选择题
    • After
  • C 风球
  • E 式神考核
    • After
  • F 表格处理
    • After
  • G 基因
    • After
  • 方程求解
  • 结语

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int a, b, r, v, m;
int main() {
	scanf("%d%d%d%d%d", &a, &b, &r, &v, &m);
	printf("%d %d %d\n", (b + 4 * a) * r, (b + 6 * a) * v, (b + 6 * a) * m);
	return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int a, b, c, d, m, jd, kn, jf; 
int ze(int x) {
	if(x > 0) return x;
	return 0;
}
int main() {
	scanf("%d%d%d%d%d", &a, &b, &c, &d, &m);
	jd = 5 * c;
	kn = 20 * d;
	jf = 20 * b - kn;
	if(jd <= m) printf("%d\n", ze(jd - jf));
	else printf("%d\n", ze(jd + kn - jf));
	return 0;
} 

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int a[9], x, y, z;
int main() {
	for(int i = 1; i <= 8; ++i) {
		scanf("%d", a + i);
		if(a[i] >= 41) ++x;
		if(a[i] >= 63) ++y;
		if(a[i] >= 118) ++z;
	}
	if(z >= 1) puts("10");
	else if(y >= 4) puts("8");
	else if(x >= 4) puts("3");
	else puts("1");
	return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e7;
double n, s, m, ttt, i, np;
int main() {
	scanf("%lf%lf%lf", &n, &s, &m);
	double t = N / n, qd = t * (n - m);
	for(i = 1; i <= m; ++i) if(qd + 0.5 * t * i > s) break;
	ttt = qd + 0.5 * t * (--i);
	if(ttt < s) np = s - ttt;
//	cout << m << " " << i << endl;
	printf("p%d(+%d) f%d l%d\n", (int)(n - m), (int)ceil(np), (int)i, (int)(m - i));
	return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int n, m, a[2005][2005], b[2005][2005], c[2005][2005];
int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= 2 * n; ++i) for(int j = 1; j <= 2 * m; ++j) scanf("%d", a[i] + j);
	for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) b[i][j] = a[2 * i - 1][2 * j] + a[2 * i][2 * j] + a[2 * i][2 * j - 1] + a[2 * i - 1][2 * j - 1];
	for(int i = 1; i <= m; ++i) for(int j = 1; j <= n; ++j) c[i][j] = b[j][i];
	for(int i = 1; i <= m; ++i) {
		for(int j = 1; j <= n; ++j) printf("%d ", c[i][j]);
		putchar('\n');
	}
	return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int T, n;
ll ans;
string s;
bool charity(char c) {return (c == 'A' || c == 'T' || c == 'C' || c == 'G'); }
char cirtus(char c) {
	if(c == 'A') return 'T';
	if(c == 'T') return 'A';
	if(c == 'C') return 'G';
	if(c == 'G') return 'C';
}
int main() {
	scanf("%d", &T);
	while(T--) {
		cin >> n >> s;
		s = " " + s;
		for(int i = 1; i <= n; ++i) {
//			cout << s[i] << " " << n - i + 1;
			if(!charity(s[i])) {ans = 0; break; }
			if(s[i] == cirtus(s[n - i + 1])) ans += i;
		}
		printf("%lld\n", ans);
		ans = 0;
	}
	return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define MyWife Cristallo
using namespace std;
const int N = 1e5 + 5;
int n, q, x, y, z, l, r, ans[2005], a[2005];
int main() {
	scanf("%d%d", &n, &q);
	for(int i = 1; i <= n; ++i) {
		scanf("%dx%d=%d", &x, &y, &z);
		a[(z - y) / x] = 1;
	}
	for(int i = 1; i <= 2000; ++i) ans[i] = ans[i - 1] + a[i];
	for(int i = 1; i <= q; ++i) {
		scanf("%d%d", &l, &r);
		printf("%d\n", ans[r] - ans[l - 1]);
	}
	return 0;
}