A. Sum of 2050
题意:稍微想下就出来了
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t;
ll n;
int main()
{
cin >> t;
while (t -- )
{
cin >> n;
if (n % 2050 != 0) puts("-1");
else
{
ll sum = n / 2050;
int dig = 0;
while (sum)
{
dig += sum % 10;
sum /= 10;
}
cout << dig << endl;
}
}
return 0;
}
B. Morning Jogging
就构造,这个数组的下标搞了我好久。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 10010;
struct node{
int dig;
int vis;
};
bool cmp(node a, node b){
return a.dig < b.dig;
}
int n, m, t;
node b[N];
node a[N];
int c[110][110];
int main()
{
cin >> t;
while (t -- )
{
cin >> n >> m;
memset(c, 0, sizeof c);
for (int i = 1; i <= n * m; i ++ )
{
cin >> b[i].dig;
a[i].dig = b[i].dig;
a[i].vis = i;
b[i].vis = 0;
}
sort(a + 1, a + n * m + 1, cmp);
for (int i = 1; i <= m; i ++ ) b[a[i].vis].vis = 1;
int idx = 0;
bool f;
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
{
if (b[(i - 1) * m + j].vis == 1)
{
idx ++;
c[i][idx] = b[(i - 1) * m + j].dig;
}
}
}
idx = 0;
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
{
if (!c[i][j])
{
for (int k = 1; k <= m; k ++ )
{
if (!b[(i - 1) * m + k].vis)
{
c[i][j] = b[(i - 1) * m + k].dig;
b[(i - 1) * m + k].vis = 1;
break;
}
}
}
}
}
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
{
cout << c[i][j] << ' ';
}
puts("");
}
}
return 0;
}
C. Fillomino 2
贪心准则:先向左走,走不了往下走。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505;
int n;
int pic[N][N];
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> pic[i][i];
for (int i = 1; i <= n; i ++ )
{
int x = i, y = i;
for (int j = 1; j < pic[i][i]; j ++ )
{
if (!pic[x - 1][y] && x - 1)
{
pic[x - 1][y] = pic[i][i];
x --;
}
else if (!pic[x][y + 1] && y + 1 <= n)
{
pic[x][y + 1] = pic[i][i];
y ++;
}
else
{
puts("-1");
return 0;
}
}
}
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= i; j ++ )
{
cout << pic[j][i] << ' ';
}
puts("");
}
return 0;
}
用BFS写的
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505;
int n;
int b[N];
int a[N][N];
int dx[] = {0, 1};
int dy[] = {-1, 0};
bool check(int x, int y)
{
if (x >= 1 && x <= n && y >= 1 && y <= n && a[x][y] == 0)
return 1;
return 0;
}
void bfs(int x, int y, int cnt, int k)
{
a[x][y] = k;
while (cnt)
{
for (int i = 0; i < 2; i ++ )
{
int tx = x + dx[i];
int ty = y + dy[i];
if (check(tx, ty))
{
a[tx][ty] = k;
x = tx;
y = ty;
cnt --;
break;
}
}
}
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ )
{
cin >> a[i][i];
b[i] = a[i][i] - 1;
}
for (int i = 1; i <= n; i ++ ) bfs(i, i, b[i], a[i][i]);
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= i; j ++ ) cout << a[i][j] << ' ';
puts("");
}
return 0;
}
DFS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505;
int n;
int vis[N][N];
int a[N][N];
bool check(int x, int y)
{
if (x >= 1 && x <= n && y >= 1 && y <= n && vis[x][y] == 0)
return 1;
return 0;
}
void dfs(int x, int y, int num, int cnt)
{
a[x][y] = num;
vis[x][y] = 1;
if (cnt == 0) return;
if (check(x, y - 1))
dfs(x, y - 1, num, cnt - 1);
else dfs(x + 1, y, num, cnt - 1);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> a[i][i];
for (int i = 1; i <= n; i ++ )
dfs(i, i, a[i][i], a[i][i] - 1);
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= i; j ++ ) cout << a[i][j] << ' ';
puts("");
}
return 0;
}