PAT实战 小白进阶

题目：1042 shuffling machine (20)（20 分）【洗牌程序】A given order is a permutation of distinct integers in [1, 54]. If the number at the i-th position is j, it means to move the card from position i to position...

#include<cstdio>struct acw{ char id[15]; char name[15]; int sorce;}F,M,temp;void init(){ F.sorce=-1,M.sorce=101;}int main(){ int N,i; char sex; init(); scanf("%d",&N); for...

#include<cstdio>#include<algorithm>#include<cstring>using namespace std;struct student{ char id[10]; int vir,tal,level; int sum; }stu[100010];//这里一定要注意，按照题干的要求，否则出现段错误。很难找...

#include<stdio.h>#include<string.h>int main(){ int i,j,n; scanf("%d",&n); getchar();//吸收换行符; char a[100][256];//构建100列（共有N句话），256行（每句话里面有多少字符） int minlen=256 ; for(i=0;i<n...

#include<cstdio>bool jud (int a[],int num){ int i; for(i=0;i<num/2;i++) { if(a[i]!=a[num-1-i]) { return false; } } return true;}//此题运用了判断回文数方法和整数转化为D进制方法； int main(){ int ...

#include<cstdio>#include<algorithm>#include<cstring>using namespace std;struct student{ int id; char name[10]; int sorce;}stu[100010];bool cmp1(student a,student b){ ret...

 第一次用vector写程序，的确比数组好用多了，慢慢熟悉，相信可以习惯。#include<cstdio>#include<cstring>#include<vector>#include<algorithm>using namespace std;const int N = 40010;const int M = 26 * 26 ...

#define _CRT_SECURE_NO_WARNINGS#include<iostream>#include<set>#include<cstdio>#include<map>#include<string>using namespace std;map<string, set<int>>mp

#define _CRT_SECURE_NO_WARNINGS //这一段是为了VS 2013 对scanf不报错做的声明；#include<algorithm>#include<cstdio>#include<vector>#include<cstring>using namespace std; char name[40010]...

本节a1063 的知识点有如下：set容器的构造和元素的插入  set<int> acw[51];    acw[i].insert(e); set容器的内容比较for (set<int>::iterator it = acw[a].begin(); it != acw[a].end(); it++)    {        if (acw[b].f...

实在抱歉这两天更新比较晚，而且缺更，因为复习考研要调整作息和日程规划，这对原本是学渣的我难度较大，花了几天的时间调整，慢慢进入了状态。九月八号就要pat考试了，代码书才看了一半，很慢，不过还是尽量相信自己，考试地点是在西交，上机环境我查了一下，之后VC6.0,VS2008,2013这三种，所以花时间把原来的devc++换成了vs2013，慢慢熟悉和适应这个过程。还有最重要的一点，唱晚，我爱...

本题运用的string中的.length(),.begin(),.erase()等方法； 本题思想是把数字串存为字符，对字符进行预处理和处理，依据字符形式进行相应的处理，例如0.0123、00123.456等数字。Sample Input 1:3 12300 12358.9Sample Output 1:YES 0.123*10^5Sample Input 2:3 ...

#include<iostream>#include<string>#include<map>using namespace std;int n, k;bool vis[3000] = { false };int G[3000][3000] = { 0 }, weigth[3000] = { 0 };int person = 0;map<...

#include<cstdio>struct acw{ char id[16] ; int hh,mm,ss;}first,last,temp;bool cmp (acw a,acw b){ if(a.hh!=b.hh ) return a.hh >b.hh ; if(a.mm!=b.mm ) return a.mm >b.mm ; else retu...

#include<cstdio>#include<cmath>#include<algorithm>using namespace std;bool xcmp(int a,int b){ return a>b;}void to_array(int a,int b[]){ //数字转化数组 for(int i=3;i>=0;i-...

#include<stdio.h>#include<string.h>int main(){ char a[100010]; int i,len,lp[100010]={0},rt=0; gets(a); len = strlen(a); if(a[0]=='P') { lp[0]=1; } for(i=1;i<len;i++) { l...

题目：1046 Shortest Distance (20)（20 分）【最短路径】The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.【案例...

题目：1065 a+b>c 64bit (20)（20 分）【加值溢出】Given three integers A, B and C in [-2^63^, 2^63^], you are supposed to tell whether A+B > C.【给出三个整数A,B,C，三者均有限制，[-2^63^, 2^63]，判断A+B是否大于C】Input Specification...

题目：1001 A+B Format (20)（20 分）【具有格式的a+b】Calculate a + b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four di...

题目：1002 a+b for polynomials (25)（25 分）【多项式的a+b形式】This time, you are supposed to find A+B where A and B are two polynomials.【计算两个多项式A+B的和】InputEach input file contains one test case. Each case occupies...

题目： 1009 Product of Polynomials (25)（25 分）【多项式的a*b形式】This time, you are supposed to find A*B where A and B are two polynomials.【这次，你需要去计算两个多项式A*B的产生式】Input Specification:Each input file contains one t...

#include<stdio.h>#include<string.h>int main(){ int i,j,n1,n2,n3; char b[40][40]; char a[100]; gets(a); int len=strlen(a); n1=(len+2)/3; n3=n1;n2=len+2-2*n1; //初始化数组 for (...

#include<cstdio>int main(){ int i,j,wtf[5]; char tit[3]={'W','T','L'}; double ans=1.0,b,temp; for(i=0;i<3;i++) { temp=-1; for(j=1;j<4;j++){ scanf("%lf",&b); if(b>te...

#include<stdio.h>#include<string.h>int hash1[10]={0};int hash2[10]={0};int jud(char a[],int len){ if(a[0]>='5'&&a[0]<='9') { return 0; //false代表不合格的进位大整数； } if(...

自测-1 打印沙漏 #include<cstdio>#include<cmath>int main(){ int n,x,i,j,k; char c; scanf("%d %c",&x,&c); n=sqrt(2.0*(x+1))-1; if(n%2==0) n--; int acw=x-(n+1)*(n+1)/2+1; /...

我宣布，c++天下第一，真的是好简单，寥寥数语就把程序描绘的淋漓尽致。Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each i...

#include<string.h>#include<stdio.h>struct p{ char id[15],password[15]; bool judge;}team[1005];void jud(p &a,int &count){ for(int i=0;i<strlen(a.password);i++){ if(a.p...

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct student{ char id[15] ; //考生学号 int sorce; //考生分数 int local_number; //考场号 int local...