weixin_61153108的博客

#include<iostream>using namespace std;int n, temp, num, t;int main(){ for (int i = 1; i <= n; i++) { t = i; while (t) { //取个位数 temp = t % 10; if (temp == 0 || temp == 1 || ...

#include<iostream>using namespace std;int w, m, n;//w:排长 m:小 n:大int a[10010][10010];int main(){ cin >> w >> m >> n; if (m > n) { swap(n, m); } int num = 1; //先给数组赋值 for (int i = 1; i <= n/w+1; ...

#include<iostream>#include<math.h>using namespace std;int n, zuo, you, a[60],num;int main(){ //不管他的碰头就掉头，因为碰头掉头可以看做是双方交换身份 cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 2; i <= n;...

#include<iostream>using namespace std;const int M = 10010;int arr[M];int N;int Max,Min;int num = 0;int main(){ cin >> N; num += N; for (int i = 1; i <= N; i++) { cin>>arr[i]; } for (int i = 1;...

#include<iostream>using namespace std;string s1, s2;int sum;int temp;int flag;//两行硬币不同的个数一定是偶数//如果是第2个与第4个不同//则需要换的个数为4-2（从左到右把相邻不同的硬币相隔的数累加起来就是答案）int main(){ cin >> s1; cin >> s2; for (int i = 0; i < s1.size()...

#include<iostream>using namespace std;const int N = 1005;string s;int n[26];int main(){ cin >> s; for (int i = 0; s[i] != '\0'; i++) { n[s[i] - 'a']++; } int max = 0; int num = 0; //倒序是为了使相同的次数下得到的字母是最小的 for (int i = 25; i &...

1，01背包问题#include<iostream>using namespace std;const int i = 1000;int w[i], v[i];int f[i][i];int main(){ int N, V;//N件物品，背包容量V cin >> N >> V; for (int i = 1; i <= N; i++) {//输入数据 cin >> v[i...

#include<iostream>using namespace std;int main(){ const int Max = 100; int a[Max]; //给数组输入赋值 int i = 0; int num = 1;//矩阵的数量 for (; i < Max;num++,i++) { cin >> a[i];//每个矩阵的规模 if (a[i] == 0)...