【openjudge 计算概论(A)】[基础编程练习(控制成分)]
来源:互联网 发布:园林设计专业知乎 编辑:程序博客网 时间:2024/04/30 15:44
1:找和为K的两个元素
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[1010],n,k;int main(){int i,j;scanf("%d%d",&n,&k);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=1;i<n;++i) for(j=i+1;j<=n;++j) { int x=a[i]+a[j]; if(x==k) {printf("yes\n"); return 0;} }printf("no\n");return 0;}
2:求满足条件的3位数
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,ans;int main(){scanf("%d",&n);int i=10;while(n) { ans=i*i; int sum=ans; int x=sum/100; sum%=100; int y=sum/10,z=sum%10; if(x==y||x==z||y==z) n--; i++; }printf("%d\n",ans);return 0;}
3:简单算术表达式求值(运算符前后可能有空格)
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char ch[10];int a,b,tt;int main(){do{ch[++tt]=getchar();if(ch[tt]==' ') tt--;}while(ch[tt]!='\n');if(ch[3]=='+') { a=(ch[1]-'0')*10+ch[2]-'0'; b=(ch[4]-'0')*10+ch[5]-'0'; printf("%d\n",a+b); return 0; }if(ch[3]=='-') { a=(ch[1]-'0')*10+ch[2]-'0'; b=(ch[4]-'0')*10+ch[5]-'0'; printf("%d\n",a-b); return 0; }if(ch[3]=='*') { a=(ch[1]-'0')*10+ch[2]-'0'; b=(ch[4]-'0')*10+ch[5]-'0'; printf("%d\n",a*b); return 0; }if(ch[3]=='/') { a=(ch[1]-'0')*10+ch[2]-'0'; b=(ch[4]-'0')*10+ch[5]-'0'; printf("%d\n",a/b); return 0; }if(ch[3]=='%') { a=(ch[1]-'0')*10+ch[2]-'0'; b=(ch[4]-'0')*10+ch[5]-'0'; printf("%d\n",a%b); return 0; }}
4:完美立方
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{int a,b,c,d;}ans[500];int tot,n;int tmp(node x,node y){if(x.a<y.a) return 1;if(x.a>y.a) return 0;if(x.b<y.b) return 1;if(x.b>y.b) return 0;if(x.c<y.c) return 1;if(x.c>y.c) return 0;if(x.d<y.d) return 1;return 0;}int main(){int i,j,k,h;scanf("%d",&n);for(h=2;h<=n;++h) { int sum=h*h*h,m=min(sum,n); for(i=2;i<=m;++i) for(j=i;j<=m;++j) { int s=i*i*i+j*j*j; if(s>sum) break; for(k=j;k<=m;++k) { int ss=i*i*i+j*j*j+k*k*k; if(ss==sum) {tot++; ans[tot].a=h; ans[tot].b=i; ans[tot].c=j; ans[tot].d=k; break;} if(ss>sum) break;} } }sort(ans+1,ans+tot+1,tmp);for(i=1;i<=tot;++i) printf("Cube = %d, Triple = (%d,%d,%d)\n",ans[i].a,ans[i].b,ans[i].c,ans[i].d);return 0;}
5:求特殊自然数
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[5],b[5],opt;inline bool check(){for(int i=1;i<=3;++i) if(a[i]!=b[i]) return 0;return 1;}int main(){int i;scanf("%d",&opt);for(i=81;i<=342;++i) { int x=i,y=i; a[1]=x%9; x/=9; a[2]=x%9; x/=9; a[3]=x%9; x/=9; b[3]=y%7; y/=7; b[2]=y%7; y/=7; b[1]=y%7; y/=7; if(check()) break; }if(opt==1) printf("%d\n",i);if(opt==2) printf("%d%d%d\n",b[1],b[2],b[3]);if(opt==3) printf("%d%d%d\n",a[3],a[2],a[1]);return 0;}
6:称体重(手玩)
#include<cstdio>using namespace std;int main(){printf("s 10\n");printf("z 20\n");printf("q 40\n");printf("l 50\n");return 0;}
7:比饭量(手玩)
#include<cstdio>using namespace std;int main(){printf("BCA\n");return 0;}
8:最长平台
#include<cstdio>#include<cstring>using namespace std;int num[5010],n,maxn;int main(){int i;while(scanf("%d",&n)==1&&n) { memset(num,0,sizeof(num)); maxn=0; for(i=1;i<=n;++i) { int x;scanf("%d",&x);num[x]++;if(num[x]>maxn) maxn=num[x]; }printf("%d\n",maxn); }return 0;}
0 0
- openjudge 计算概论基础编程练习(控制成分)
- 【openjudge 计算概论(A)】[基础编程练习(控制成分)]
- 【openjudge 计算概论(A)】[基础编程练习(运算成分)]
- 【openjudge 计算概论(A)】[基础编程练习(数据成分)]
- 【openjudge 计算概论(A)】[基础编程练习2]
- 【openjudge 计算概论(A)】[基础编程练习1]
- 【openjudge 计算概论(A)】[编程练习(数组练习)]
- 【openjudge 计算概论(A)】[编程练习(字符串)]
- 【openjudge 计算概论(A)】[指针练习]
- 【openjudge 计算概论(A)】[函数递归练习(4)]
- 【openjudge 计算概论(A)】[函数递归练习(3)]
- 【openjudge 计算概论(A)】[函数递归练习(2)]
- 【openjudge 计算概论(A)】[函数递归练习(1)]
- 【openjudge 计算概论(A)】[ 函数与字符串练习(2)]
- 【openjudge 计算概论(A)】[函数与字符串练习(1)]
- 【openjudge 计算概论(A)】[结构体与链表练习]
- openjudge 计算概论 函数与字符串练习(1)2:字符串排序
- openjudge 计算概论-数组练习-错误侦测
- Django模板举例代码
- CCF 201612-2 火车购票 JAVA实现
- Hadoop家族技能图谱
- iText7---Adding low-level content添加低层级内容
- I Hate It
- 【openjudge 计算概论(A)】[基础编程练习(控制成分)]
- poj2299Ultra-QuickSort(树状数组+离散化)
- python中使用elasticsearch做为搜索引擎
- Micro Focus COBOL multi-thread programming
- LeetCode #416: Partition Equal Subset Sum
- codeforces 512C (最大流)
- 税控盘发票查询系统
- uva11572
- Java知识结构图谱