2015.
把前天做过的题再做一遍,发现报了错,然后注意到了细节:)
#include<iostream> using namespace std; int main() { int n, m; int count = 0, sum = 0; int i,j=0; int a[100],b[100]; while (cin >> n >> m) { a[0] = 2; for (i = 1; i < n; i++) a[i] = 2 + a[i - 1]; sum = 0; count = 0; j = 0; for (i = 0; i < n; i++) { count++; sum += a[i]; if (count == m) { count = 0; b[j++] = sum/m; sum = 0; } } if (n%m != 0) { b[j++] = sum / (n%m);//最后一个数可能不存在,所以为最后一个数的输出考虑,要加一 } for (int a = 0; a < j-1; a++) { cout << b[a] << " "; } cout << b[j-1] << endl; } }
2016.
#include<iostream> using namespace std; int main() { int n; int a[100]; int x,i; int min,Index,temp; while (cin >> n) { if (n == 0) return -1; for ( i = 0; i < n; i++) { cin >> x; a[i] = x; } min = a[0],Index=0; for (i = 0; i < n; i++) { if (a[i] < min) { min = a[i]; Index = i; } } /*temp = a[Index]; a[Index] = a[0]; a[0] = temp;*/ temp = a[0]; a[0] = min; a[Index] = temp; for (i = 0; i < n - 1; i++) { cout << a[i] << " "; } cout << a[n - 1] << endl; } }
2017.
#include<iostream> #include<string> using namespace std; int main() { int n,count=0; string s; while (cin >>n ){ while (n--){ cin >> s; char str[1000]; count = 0; strcpy(str, s.c_str()); for (int i = 0; i < s.length(); i++) { if (str[i] >= '0'&&str[i] <= '9') count++; } cout << count << endl; } } }
2018.
递归 今年的等于去年的数量加三年前的数量
#include<iostream> #include<string> using namespace std; int cow(int x) { if (x < 4) return x; else return cow(x - 1) + cow(x - 3); } int main() { int n; while (cin >> n){ if (n == 0) return -1; cout << cow(n)<< endl; } }
循环
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int f1, f2, f3, f;
while (cin >> n){
if (n == 0)
return -1;
f1 = f2 = f3 = 0;
f = 1;
for (int i = 1; i < n; i++)
{
f += f3;
f3 = f2;
f2 = f1;
f1 = f;
}
cout << f + f1 + f2 + f3 << endl;
}
}
2041
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n,m;
int a[40];
while (cin >> n){
while (n--){
cin >> m;
a[1] = 0;
a[2] = 1;
a[3] = 2;
for (int i = 4; i < 41; i++)
{
a[i] = a[i - 1] + a[i - 2];
}
cout << a[m] << endl;
}
}
}