1:现在有 t 毫升肥宅快乐水，要均分给 n 名同学。每名同学需要 2 个杯子。现在想知道每名同学可以获得多少毫升饮料（严格精确到小数点后 3位），以及一共需要多少个杯子
#include<iostream>
#include<iomanip>
#include<string>
using namespace std;
int main(){
double a;
int b;
cin>>a>>b;
cout<<setprecision(3)<<fixed<<a/b<<endl<<b*2;
return 0;
}2:输入一个小写字母，输出其对应的大写字母。例如输入 q[回车] 时，会输出 Q
#include<iostream>
using namespace std;
int main(){
char a;
cin>>a;
cout<<char(a-32);
return 0;
}
3:学校和 yyy 的家之间的距离为 s 米，而 yyy 以 v 米每分钟的速度匀速走向学校。
在上学的路上，yyy 还要额外花费 10 分钟的时间进行垃圾分类。
学校要求必须在上午 8:00 到达，请计算在不迟到的前提下，yyy 最晚能什么时候出门。
由于路途遥远，yyy 可能不得不提前一点出发，但是提前的时间不会超过一天。
#include<iostream>
using namespace std;
int main()
{
double s, v;
int n, b, a;
n = 24 * 60 + 8 * 60;
cin >> s >> v;
float t = (s / v) + 10;
n -= t;
if (n >= 24 * 60)
{
n -= 24 * 60;
}
b = n % 60;
a = n / 60;
if (a < 10)
{
if (b < 10)
cout << "0" << a << ":" << "0" << b << endl;
else
cout << "0" << a << ":" << b << endl;
}
else
{
if (b < 10)
cout << a << ":" << "0" << b << endl;
else
cout << a << ":" << b << endl;
}
return 0;
}
4:简单的冒泡排序：
方案一：#include<iostream>
using namespace std;
int main()
{
int arr[9] = { 4,3,8,5,6,7,2,1,9 };
for (int i = 0; i < 9; i++)
{
cout << arr[i];
}
cout << endl;
for (int i = 0; i < 9-1;i++)
{
for (int j = 0; j < 9 - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < 9; i++)
{
cout << arr[i];
}
cout << endl;
return 0;
}
方案二（进阶版）：
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a[3];
int len = sizeof(a) / sizeof(a[0]);
cin >> a[0]; cout << " "; cin >> a[1]; cout << " "; cin >> a[2]; cout << " ";
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - i - 1; j++)
{
if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);
}
}
cout << a[0] << " "<< a[1]<<" " << a[2];
system("pause");
return 0;
}5：人比人，气死人；鱼比鱼，难死鱼。小鱼最近参加了一个“比可爱”比赛，比的是每只鱼的可爱程度。参赛的鱼被从左到右排成一排，头都朝向左边，然后每只鱼会得到一个整数数值，表示这只鱼的可爱程度，很显然整数越大，表示这只鱼越可爱，而且任意两只鱼的可爱程度可能一样。由于所有的鱼头都朝向左边，所以每只鱼只能看见在它左边的鱼的可爱程度，它们心里都在计算，在自己的眼力范围内有多少只鱼不如自己可爱呢。请你帮这些可爱但是鱼脑不够用的小鱼们计算一下
#include<iostream>
using namespace std;
int b[101];
int main()
{
int a[101];
int n;
cin >> n;
for (int i = 1; i <=n; i++)
cin >> a[i];
for(int i=1;i<=n;i++)
for (int j = i; j >= 1; j--)
{
if (a[j] < a[i])
b[i]++;
}
for (int i = 1; i <=n; i++)
cout << b[i] << " ";
return 0;
}
6：简单的元素逆置
#include<iostream>
using namespace std;
int main()
{
int arr[5] = { 1,2,3,4,5 };
for (int i = 0; i < 5; i++)
{
cout << arr[i] << " ";
}
cout << endl;
int start = 0;
int end = sizeof(arr) / sizeof(arr[0]) - 1;
while (start < end)
{
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
for (int i = 0; i < 5; i++)
{
cout << arr[i] << " ";
}
system("pause");
return 0;
}7：简单的逆向（reverse）应用：
#include<iostream>
using namespace std;
int main()
{
int s[]={9,2,3,4,5,6,7};
for(int i=0;i<7;i++)
{
s[i]-=s[(i+1)%7];
cout<<s[i]<<" ";
}
cout<<endl;
for(int i=6;i>=0;i--)
{
s[i]+=s[(i+1)%7];
}
for(int i=0;i<7;i++)
{
cout<<s[i]<<" ";
}
system("pause");
return 0;
}8：数字反转，
输入一个不小于 100 且小于 1000，同时包括小数点后一位的一个浮点数，例如 123.4 ，要求把这个数字翻转过来，变成 4.321并输出
#include<iostream>
#include<string>
using namespace std;
string a;
int main()
{
cin>>a;
for(int i=a.size()-1;i>=0;i--)
cout<<a[i];
system("pause");
return 0;
}9：
这一天，小鱼给自己的游泳时间做了精确的计时（本题中的计时都按 24 小时制计算），它发现自己从 a 时 b 分一直游泳到当天的 c 时 d 分，请你帮小鱼计算一下，它这天一共游了多少时间呢？
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
int e=c-a;
int f=d-b;
if(f<0)
{e--;f+=60;}
cout<<e<<" "<<f;
return 0;
}10：
八尾勇喜欢吃苹果。她现在有 m（1≤m≤100）个苹果，吃完一个苹果需要花费 t（0≤t≤100）分钟，吃完一个后立刻开始吃下一个。现在时间过去了 s（1≤s≤10000）分钟，请问她还有几个完整的苹果？
#include<iostream>
using namespace std;
int main()
{
int m, t, s;
int q;
cin >> m >> t >> s;
if(t==0)
{
cout<<0;
return 0;
}
q = s / t;
if(q>=m)
cout<<0;
else if(m%q)
{
if (s%t)
{
cout << m - (q + 1);
}
else
cout << m - q;
}
else
cout << m - 1;
return 0;
}11:一些整数可能拥有以下的性质：
- 性质 1：是偶数；
- 性质 2：大于 44 且不大于 1212。
#include<iostream>
using namespace std;
int main()
{
int x;
cin >> x;
if (x % 2 == 0 && x > 4 && x <= 12)
cout << 1<<" ";
else cout << 0<<" ";
if (x % 2 == 0 || (x > 4 && x <= 12))
cout << 1 << " ";
else cout << 0 << " ";
if (x % 2 != 0 && (x > 4 && x <= 12) || x % 2 == 0 && (x <= 4 || x > 12))
cout << 1 << " ";
else
cout << 0 << " ";
if (x % 2 != 0 && (x <= 4 || x > 12))
cout << 1 << " ";
else
cout << 0 << " ";
return 0;
}12：
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
float m, n, q;
cin >> m >> n;
q = m / (n*n);
if (q < 18.5)
cout << "Underweight";
else if (q >= 18.5&&q < 24)
cout << "Normal";
else if (q >= 24)
{
cout <<setprecision(6)<< q << endl;
cout << "Overweight";
}
return 0;
}13：
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a[3];
int len = sizeof(a) / sizeof(a[0]);
cin>>a[0]>>a[1]>>a[2];
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - i - 1; j++)
{
if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);
}
}
cout << a[0] << " "<< a[1]<<" " << a[2];
system("pause");
return 0;
}14：
#include<iostream>
using namespace std;
int main()
{
int a[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
int y, m;
cin >> y >> m;
if (y % 4 == 0 && y % 100 != 0 || y % 400 == 0)
{
a[2] += 1;
}
cout << a[m];
return 0;
}15：
#include<iostream>
using namespace std;
int main()
{
int x, y, s, day = 0;
int max = 0;
for (int i = 1; i < 8; i++)
{
cin >> x >> y;
s = x + y;
if (s > 8 && s > max)
{
max = s;
day = i;
}
}
cout << day;
return 0;
}16：
#include<iostream>
using namespace std;
int as,bs,cs,ans;
int main()
{
int a1, a2, b1, b2, c1, c2;
int n;
cin >> n;
cin >> a1 >> a2 >> b1 >> b2 >> c1 >> c2;
if (n%a1 == 0) as = (n / a1)*a2;
else as = (n / a1 + 1)*a2;
if (n%b1 == 0) bs = (n / b1)*b2;
else bs = (n / b1 + 1)*b2;
if (n % c1 == 0) cs = (n / c1)*c2;
else cs = (n / c1 + 1)*c2;
if (as < bs&&as < cs) ans = as;
if (bs < as&&bs < cs) ans = bs;
if(cs<as&&cs<bs) ans = cs;
cout << ans << endl;
return 0;
}17：
#include<iostream>
using namespace std;
int main()
{
int arr[3];
cin >> arr[0] >> arr[1] >> arr[2];
int len = sizeof(arr) / sizeof(arr[0]);
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - i - 1; j++)
{
if (arr[j] > arr[j + 1])
swap(arr[j], arr[j + 1]);
}
}
if (arr[0] + arr[1] <= arr[2])
{ cout << "Not triangle" << endl;
return 0;
}
else if (arr[0]*arr[0] + arr[1] * arr[1] == arr[2] * arr[2] )
cout << "Right triangle" << endl;
else if (arr[0]*arr[0] + arr[1] * arr[1] > arr[2]*arr[2] )
cout << "Acute triangle" << endl;
else if (arr[0]*arr[0] + arr[1]* arr[1]< arr[2]*arr[2] )
cout << "Obtuse triangle" << endl;
if (arr[0] == arr[1] || arr[2] == arr[1] || arr[0] == arr[2])
cout << "Isosceles triangle" << endl;
if (arr[0] == arr[1] && arr[1] == arr[2])
cout << "Equilateral triangle" << endl;
return 0;
}18:
#include<iostream>
using namespace std;
int main()
{
int n, s = 0;
int x;
cin >> x >> n;
for (int i = 1; i <= n; i++)
{
if (x != 6&&x!=7)
s += 250;
if (x ==7)
{
x = 1;
}
else
x++;
}
cout << s;
return 0;
}19:
#include<iostream>
#include<cmath>
using namespace std;
int h(int a, int b)
{
int l;
while (a%b)
{
l = a % b;
a =b ;
b = l;
}
return b;
}
int main()
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
int len = sizeof(a) / sizeof(a[0]);
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - i - 1; j++)
{
if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);
}
}
int y = h(a[0], a[2]);
int m = a[2] / y; int z = a[0] / y;
cout << z << "/" << m;
return 0;
}20：
#include<iostream>
using namespace std;
int main()
{
int a[10];
int s = 0;
for (int i = 0; i < 10; i++)
{
cin >> a[i];
}
int c;
cin >> c;
for (int i = 0; i < 10; i++)
{
if (a[i] <= c + 30)
{
s++;
}
}
cout << s;
return 0;
}21：
#include<iostream>
using namespace std;
int main()
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
int len = sizeof(a) / sizeof(a[0]);
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - i - 1; j++)
{
if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);
}
}
char A, B, C;
for (int i = 0; i < 3; i++)
{
char ch;
cin >> ch;
if (ch=='A')
cout << a[0] << " ";
if (ch=='B')
cout << a[1] << " ";
if (ch=='C')
cout << a[2] << " ";
}
return 0;
}22：
#include<iostream>
using namespace std;
int main()
{
char a[14];
char s[]= "0123456789X";
int j = 0; int k = 1; int t = 0;
cin >> a;
for (; j < 12; j++)
{
if (a[j] =='-') continue;
t += (a[j] - '0')*k++;
}
if (a[12]==s[t%11])
cout << "Right";
else
{
a[12] = s[t % 11];
cout << a;
}
system("psuse");
return 0;
}23：
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
int a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
for (int j = 0; j < n - i - 1; j++)
if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);
cout << a[0];
return 0;
}24:
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a[10000];
int n, k;
int l = 0, t = 0;
double c, d;
double q = 0, w = 0;
cin >> n >> k;
for (int i = 1; i <=n; i++)
a[i] = i;
for (int i = 1; i <= n; i++)
{
if (a[i] % k == 0)
{
l += a[i];
q++;
}
else
{
t += a[i];
w++;
}
}
c = l / q ;
d = t / w ;
cout << setprecision(1) << fixed << c << " " << d;
return 0;
}25:
#include<iostream>
using namespace std;
int main()
{
int long long a;
cin >> a;
int i = 1;
for (; a!= 1; )
{
a /= 2;
i++;
}
cout << i;
return 0;
}26:
#include<iostream>
using namespace std;
int main()
{
int n; int k = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n - i + 1; j++)
{
k++;
if (k < 10)
cout << "0" << k;
else
cout << k;
}
cout << endl;
}
return 0;
}27：（高精度题c++代码测试点通不过，python可以）
#include<iostream>
using namespace std;
unsigned long long f(int a)
{
if (a == 1)
return 1;
else
return (f(a - 1)*a);
}
int main()
{
int n;
cin >> n;
unsigned long long sum = 0;
for (int i = 1; i <= n; i++)
{
sum += f(i);
}
cout << sum;
return 0;
}28:
#include<iostream>
using namespace std;
int main()
{
int n, i, a, b, c = 0;
int x;
cin >> n >> x;
for (i = 1; i <= n; i++)
{
b = i;
while (b)
{
a = b % 10;
b = b / 10;
if (a == x)
c++;
}
}
cout << c;
return 0;
}29:
#include<iostream>
using namespace std;
int main()
{
int k; double sum = 0;
cin >> k;
for (double i = 1; ; i++)
{
sum += 1 / i;
if (sum > k)
{
cout << i;
return 0;
}
}
}30:
#include<iostream>
using namespace std;
int main()
{
int k, b = 0, c = 1;
cin >> k;
for (int i = 1; i <= k; i++)
{
k -= i;
b += c * c;
c++;
}
cout << b + k * c;
return 0;
}31:
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++)
sum += i;
cout << sum;
return 0;
}32:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
int k = 0;
int sum = 0;
int a[100000];
cin >> n;
for (int i = 2; ; i++)
{
if (sum + i > n) break;
bool flag = true;
for (int j = 2; j <= sqrt(i); j++)
{
if (i%j == 0)
{
flag = false;
break;
}
}
if (flag == true)
{
sum += i;
k++;
a[k - 1] = i;
}
}
for (int i = 0; i < k; i++)
cout << a[i] << endl;
cout << k;
return 0;
}