PTA
Fly dream
青岛工学院
展开
-
PTA-水仙花
#include<stdio.h>#include<math.h>int main(){ int a,b=1,i,c,d,j,sum=0,n; scanf("%d",&n); {for(i=1;i<=(n-1);i++) b=b*10;} for(i=b;i<=(b*10);i++){ ...原创 2018-11-01 01:16:59 · 2708 阅读 · 0 评论 -
最佳情侣身高
#include<stdio.h>int main(){ char c; double a; int n,i; scanf("%d",&n); for(i=0;i<=n;i++) {scanf("%c%lf",&c,&a); if(c=='M') printf("%.2lf",a/1.0..原创 2018-10-27 13:59:34 · 757 阅读 · 0 评论 -
7-3 组个最小数 (20 分)
#include <bits/stdc++.h>using namespace std;int main() { int a[50]; int n, i = 0, j = 0,t; //scanf("%d", &n); for (; i < 10; i++) scanf("%d", &a[i]); if (a[0] == 0) { ...原创 2018-11-07 20:39:24 · 1606 阅读 · 0 评论 -
7-4 输出数组元素 (15 分)
#include <bits/stdc++.h>using namespace std;int main() { int a[10]; int n, i = 0, j = 0,b; scanf("%d", &n); for (; i < n; i++) scanf("%d", &a[i]); for (i = 0; i < n ...原创 2018-11-07 22:17:50 · 3149 阅读 · 0 评论 -
青工 黄金二 7-4 猴子选大王 (20 分)
#include<stdio.h>static int c, d;int dw(int a[], int n){ int i = 0; if (d == n - 1) for (i = 1; i <= n; i++) { if (a[i] == 0) return i; } else { for (i = 1; i <= ...原创 2018-11-20 11:38:48 · 522 阅读 · 0 评论 -
PTA 7-15 计算圆周率 (15 分)
#include<stdio.h>#include<stdlib.h>static double b;//固定b的值;double fun(int n,double a){ for (double i = 1,j=1,k=1; i <= n; i++)// 18 { j *= i; k *= ((2 * i) + 1); b = j / ...原创 2018-12-06 16:28:52 · 1697 阅读 · 0 评论 -
二叉树的先序创建和前中后遍历
#include<iostream>using namespace std;typedef struct BitNode{ char data; BitNode* lchild; BitNode* rchild;}*BiTree;void CreatBitNode(BiTree& T){ char ch; cin >> ch; if (c...原创 2019-05-29 08:56:33 · 208 阅读 · 0 评论