A - Coder
比较简单,就是算棋盘格子。
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int num = n * n;
if (num % 2 == 1) num ++;
printf("%d\n", num / 2);
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < n; ++ j) {
if (abs(i - j) % 2 == 0) printf("C");
else printf(".");
}
puts("");
}
}
}
B - Multitasking
没看懂,但还是做了半天弄出来了。经过多个操作后有序,标程真没懂。貌似不需要最小步数。
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
bool cmp(int a, int b) {
return a > b;
}
struct P {
int id, flag;
int i, j;
}cor[1000010];
bool cmp1(P a, P b) {
if (a.i != b.i) return a.i < b.i;
return a.j < b.j;
}
bool cmp2(P a, P b) {
return a.id < b.id;
}
int a[1010][110], b[1010][110];
int main() {
int n, m, _k;
cin >> n >> m >> _k;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
scanf("%d", &a[i][j]);
b[i][j] = a[i][j];
}
}
int p = 0;
for (int i = 0; i < n; ++ i) {
if (_k == 0)
sort(b[i], b[i] + m);
else
sort(b[i], b[i] + m, cmp);
for (int j = 0; j < m; ++ j) {
if (a[i][j] != b[i][j]) {
for (int k = j + 1; k < m; ++ k)
if (b[i][j] == a[i][k]) {
if (a[i][j] > b[i][j]) {
cor[p].i = j + 1;
cor[p].j = k + 1;
cor[p].id = p;
cor[p].flag = 0;
p ++;
for(int _i = 0; _i < n; ++ _i)
if (a[_i][j] > a[_i][k])
swap(a[_i][j], a[_i][k]);
}
else {
cor[p].i = k + 1;
cor[p].j = j + 1;
cor[p].id = p;
cor[p].flag = 0;
p ++;
for(int _i = 0; _i < n; ++ _i)
if (a[_i][j] < a[_i][k])
swap(a[_i][j], a[_i][k]);
}
}
}
}
}
cout << p <<endl;
for (int i = 0; i < p; ++ i) {
printf("%d %d\n", cor[i].i, cor[i].j);
}
}
C - Milking cows
其实只需要对头向右的牛,从左向右挤奶一次。因为头向左的奶牛的损失是必然发生的,无非是挤向右的牛损失向左的牛,挤向左的牛损失向右的牛。一样的道理。
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
int a[200010], one[200010];
int main() {
int n;
while (cin >> n) {
for (int i = 1; i <= n; ++ i) {
cin >> a[i];
}
one[0] = 0;
for (int i = 1; i <= n; ++ i) {
one[i] = one[i - 1] + a[i];
}
long long ans = 0;
for (int i = 1; i <= n; ++ i) {
if (a[i] == 0) ans += one[i];
}
cout << ans << endl;
}
}