1000: A+B
#include<iostream>
using namespace std;
int main()
{
long long a,b;
long long s=0;
cin>>a>>b;
s=a+b;
cout<<s;
}
1002: Hello World!
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"Hello World!";
return 0;
}1003: 阶乘的和
#include<stdio.h>
int main()
{
long long sum=0,m=1;
int i,num;
scanf("%d",&num);
for(i=1;i<=num;i++)
{
m*=i;
sum+=m;
}
printf("%lld",sum);
return 0;
}
1004: 水仙花数
#include<stdio.h>
int main()
{
int i;
int a,b,c;
for(i=100;i<1000;i++)
{
a=i/100;
b=i/10%10;
c=i%10;
if(a*a*a+b*b*b+c*c*c==i)
{
printf("%d ",i);
}
}
return 0;
}1007: 反弹
#include<stdio.h>
int main(){
int i,size;
double high,sum=0.0;
scanf("%lf %d",&high,&size);
for(i=1;i<=size;i++){ //用for（）循环来模拟反弹的过程，
//注意不要忘了最后的反弹反弹高度以及开始落下的距离
//其他的中间过程都是两倍的反弹高度。
if(i==1){
sum+=high; //第一次落地时
}
else{
sum+=high*2; //中间过程都是两倍的反弹高度。
}
high=high/2; //反弹高度
}
printf("%.2lf %.2lf",high,sum);
return 0;
}
1008: 猴子吃桃
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,s;
s=0;
cin>>a;
for(int i=0;i<a-1;i++){
s=2*(1+s)+1;
}
s++;
printf("%d",s);
}
1010: 排序(选择、冒泡、插入)
#include<bits/stdc++.h>
using namespace std;
int a[20];
int main(){
for(int i=0;i<10;i++){
cin>>a[i];
}
sort(a,a+10);
for(int i=0;i<10;i++){
cout<<a[i]<<endl;
}
}1011: 插入数字
#include <stdio.h>
int main()
{
int a[10];
int i,m,l;
for(i=0; i<9; i++){
scanf("%d", &a[i]);
}
scanf("%d", &m);
i=8;
while(i>=0 && a[i]>m){
a[i+1]=a[i];
i--;
}
i++;
a[i]=m;
for(i=0;i<10;i++)
printf("%d\n", a[i]);
return 0;
}
1015: 对称平方数
//求0-256平方是否为对称数
//此题另一解法：该数平方得反序数等于该数
#include<stdio.h>
int count(int x){
int num = 0;
if(x==0)
return 1;
while(x!=0){
x = x/10;
num++;
}
return num;
}
int main(){
int q, num, a[10];
for(int i=0; i<=256; i++){
q = i*i; //i的平方得多少
num = count(q); //平方后得位数
for(int j=0; j<num; j++){
a[j] = q%10; //将平方后的每一位对应存入数组a
q = q/10;
}
for(int k=0; k<=num/2; k++){
if(a[k] != a[num-k-1])
break;
if(num==1)
printf("%d\n", i);
else if(k==num/2-1)
printf("%d\n", i);
}
}
} 1016: 百万富翁
print(3000000)
print(8376528)1017: 加法等式
#include <stdio.h>
int main(){
for(int a=1;a<=9;a++){
for(int b=1;b<=9;b++){
for(int c=0;c<=9;c++){
int sum1=100*a+10*b+c;
int sum2=100*b+10*c+c;
if(sum1+sum2==532){
printf("%d %d %d",a,b,c);
}
}
}
}
return 0;
}1020: 邮票
print(82)1021: 阿姆斯特朗数
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,fn,i,sum;
for(n = 1;n < 1000;n++)
{
sum = n;
fn = 0;
while(0 < sum)
{
i = sum % 10;
fn += i * i * i;
sum = sum / 10;
}
if(n == fn)
{
printf("%d\t",n);
}
}
printf("\n");
return 0;
}1026: 找数
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[11];
for(int i=0;i<10;i++){
cin>>a[i];
}
int left=0,right=9;
int c=0;
while(left<=right){
int m=(left+right)/2;
c++;
if(a[m]==99){
cout<<m<<endl<<c;
break;
}
if(a[m]>99){
right=m-1;
}
if(a[m]<99){
left=m+1;
}
}
}1030: 雷劈数
#include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=1000;i<10000;i++){
int a = i/100;
int b = i%100;
int c = a+b;
if(c*c==i){
cout<<i<<endl;
}
}
}1031: 回文
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,a;
cin>>s;
if(s.length()%2==0){
for(int i=0;i<s.length();i++){
if(s[i]==s[s.length()-1-i]){
a="TRUE";
}
else{
a="FALSE";
break;
}
}
}
else{
for(int i=0;i<(s.length()-1)/2;i++){
if(s[i]==s[s.length()-1-i]){
a="TRUE";
}
else{
a="FALSE";
break;
}
}
}
cout<<a;
}1032: 计算1
print(-600.45)1033: 计算2
a = (3*9+15)/3.1
b = round(a,2)
print(b)1034: 人机对话1
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
if(b=="female")
{
cout<<a<<",a girl";
}
else if(b=="male")
{
cout<<a<<",a boy";
}
else
{
cout<<"Typo";
}
}1036: 判断成绩等级
#include <bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
if(a>=86)
printf("very good");
if(a>=60 and a<=85)
printf("good");
if(a<60)
printf("bad");
}1037: ascii码
#include<bits/stdc++.h>
using namespace std;
int main() {
char c;
cin>>c;
int x = c;
cout<<x;
}
1038: 输出ascii码对应的字符
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
printf("%c",n);
}1039: 判断字符
n=input()
if n>='a'and n<='z':
print('lower')
if n>='A'and n<='Z':
print('upper')
if n>=0 and n<=9:
print('delit')1040: 大小写转换
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin>>c;
if(c >= 'A' && c <= 'Z'){
c = c + 32;
} else{
c = c - 32;
}
cout<<c;
return 0;
}
1041: 数字和
#include<iostream>
using namespace std;
int main(){
int m,n;
cin>>n;
int sum = 0;
for(int i=1;i<=n;i++)
{
cin>>m;
sum+=m;
}
cout<<sum<<endl;
return 0;
}
1042: 简单加密
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
if(str == "ENDOFINPUT"){
break;
}
getline(cin,str);
for(int i = 0; i < str.size(); ++i){
if('A' <= str[i] && 'Z' >= str[i]){
str[i] = (str[i] - 'A' - 5 + 26) % 26 + 'A';
}
}
cout<<str<<endl;
getline(cin,str);
}
return 0;
}
1043: 浪尖数
#include<bits/stdc++.h>
using namespace std
int main(){
int b;
cin>>b;
int a[b];
for(int i=0;i<b;i++){
cin>>a[i];
}
int x,y,z,c=0;
for(int i=0;i<b-2;i++){
x=a[i];
y=a[i+1];
z=a[i+2];
if(y>x&&y>z){
c+=1;
}
}
cout<<c;
}1044: 看完动漫要几天?
#include <bits/stdc++.h>
using namespace std;
int fun(string s){
int h=(s[0]-'0')*10+(s[1]-'0');
int m=(s[3]-'0')*10+(s[4]-'0');
return h*60+m;
}
int main(){
int n;
string s1,s2;
cin>>n>>s1>>s2;
int x=fun(s2)-fun(s1);
if(n%x==0){
cout<<n/x<<endl;
}
else{
cout<<n/x+1<<endl;
}
}1045: 判断质数
#include <iostream>
using namespace std;
int n;
long long a[1001];
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int m = a[i];
bool is = true;
for(long long j=2;j*j<m;j++){
if(m%j==0){
is = false;
break;
}
}
if(is){
cout<<"yes"<<endl;
}
else{
cout<<"no"<<endl;
}
}
}1046: 找书python
#从n本书里面，找m本
n = int(input())
a = []
for i in range(n):
bh = int(input())
a.append(bh)
m = int(input())
b = []
for i in range(m):
bh = int(input())
b.append(bh)
#找书
for bh in b:
left = 0
right = n-1
find = 0
while left <= right:
mid = (left + right)//2
if a[mid] == bh:
print(mid+1)
find = 1
break
if a[mid] > bh:
right = mid-1
if a[mid] < bh:
left = mid+1
if find == 0:
print('no')
1047: 自动修正
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin,s);
for(int i=0;i<s.length();i++){
if(s[i]>='a'&&s[i]<='z'){
printf("%c",s[i]-'a'+'A');
}
else{
printf("%c",s[i]);
}
}
}1048: 凯撒密码
#include<bits/stdc++.h>
using namespace std;
char a[50];
int main(){
int n;
cin>>n>>a;
for(int i=0;i<strlen(a);i++){
if(a[i]>='a'&&a[i]<=122-n){
printf("%c",a[i]+n);
}
else{
printf("%c",a[i]-122+96+n);
}
}
} 1049: 笨小猴
#include<iostream>
#include<cmath>
#include<cstring>
char a[201];
int mxx(int y)
{
if(y==1||y==0)return 0;
if(y==2)return 1;
else
{
for(int i=2;i<y;i++)
if(y%i==0)return 0;
return 1;
}
}
using namespace std;
int main()
{
int m,n,i=0,j=0,k=0,max=0,min=100;
char c,x[101],y[101];
scanf("%s",a);
m=strlen(a);
for(i=0;i<m;i++)
{
n=0;
for(j=0;j<m;j++)
{
if(a[i]==a[j])
n++;
}
if(n>max)
max=n;
if(n<min)
min=n;
}
if(mxx(max-min)==1)
printf("Lucky Word\n%d",max-min);
else
printf("No Answer\n%d",0);
return 0;
}
1050: 牛吃牧草2
print(5)1051: 牛吃牧草3
print(4)1054: 计算邮资
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int x;
char y;
int s;
cin>>x>>y;
if(x<=1000)
s=8;
else
s=8+ceil((x-1000)/500.0)*4;
if (y=='y')
s=s+5.0;
cout<<s;
return 0;
}
1055: 归并排序
#include<bits/stdc++.h>
using namespace std;
int a[100001];
int b[100001];
int n;
void f(int left,int right){
if(left==right){
}
else if(left+1==right){
if(a[left]>a[right]){
int temp=a[left];
a[left]=a[right];
a[right]=temp;
}
}
else{
int middle=(left+right)/2;
f(left,middle);
f(middle+1,right);
int i=left;
int j=middle+1;
for(int k=left;k<=right;k++){
if(i>middle){
b[k]=a[j];
j++;
continue;
}
if(j>right){
b[k]=a[i];
i++;
continue;
}
if(a[i]<a[j]){
b[k]=a[i];
i++;
continue;
}
if(a[i]>=a[j]){
b[k]=a[j];
j++;
continue;
}
}
for(int i=left;i<=right;i++){
a[i]=b[i];
}
}
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
f(0,n-1);
for(int i=0;i<n;i++){
printf("%d\n",a[i]);
}
}1056: 高精度加法
a=int(input())
b=int(input())
print(a+b)1057: 高精度减法
a=int(input())
b=int(input())
print(a-b)1059: 快速排序
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a[100005];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++)
cout << a[i] <<"\n";
return 0;
}1060: 打印直角三角形
for i in range(1,6,1):
print("*"*i)
1061: 打印倒立直角三角形
print("*"*5)
print("*"*4)
print("*"*3)
print("*"*2)
print("*"*1)
1062: 三个好朋友
#include<bits/stdc++.h>
using namespace std;
int main(){
string name1,name2,name3;
cin>>name1>>name2>>name3;
cout<<name1+","+name2+" and "+name3+" are good friends";
}1064: 求最小值
#include<bits/stdc++.h>
using namespace std;
int n,x;
vector<int>a;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
a.push_back(x);
}
int mina=a[0];
for(int i=0;i<n;i++){
mina=min(a[i],mina);
}
cout<<mina;
}
网址：谷歌浏览器搜：112.124.15
扫一扫
5823
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
