题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1001C语言源码：#includeint main(){ int a,b,top,i,s[10],flag; scanf("%d %d",&a,&b); a=a+b; top=0; flag=0; if(a<0) { a=-a; flag=1; } whil

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1041C语言源码：#include#define maxsize 10000int T[maxsize];int S[maxsize*10];int main(){ int n,i,x; for(i=0;i<maxsize;i++) T[i]=0; scanf("%d

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1044C语言源码：#include#define maxsize 100010int a[maxsize];int main(){ int sum,min,n,i,m,j; scanf("%d %d",&n,&m); min=-1; sum=0; for(i=1;i<=

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1045经典的DP题：最长递增子序列C语言源码：#includeint max(int a,int b){ return a>b?a:b;}int main(){ int N,M,L,i,j,Col[220],Str[10010],dp[10010],x,ma; sca

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1046C语言源码：#include#define maxsize 100010int T[maxsize];int main(){ int n,i,m,sum,j,min,temp; scanf("%d",&n); sum=0; for(i=1;i<=n;i++) {

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1047C语言源码：#include#include#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int S[2501][400];//这个太坑爹了，我一开始开到40000.

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1048C语言源码：#include#include#define maxsize 100000int T[maxsize];int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1049思路如下：从高位到低位遍历给定数字：若当前数字大于1，则该位出现1的次数为，（比其更高位数字组成的数字+1）*（10^比其低位的数字个数）；如32（3）23，若当前数字为加括号的3，则当前位出现1的个数为，（32+1）*（100）若当前数字等于1，则该位出现1的次数为，

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1050C语言源码：#include#include#define maxsize 10000char s1[maxsize],s2[maxsize];int T[maxsize];int main(){ int i,len; gets(s1); gets(s2); f

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1051思路：POP序列中某个值后面比它小的元素个数小于m，且必须是降序排列。C语言源码：#includeint main(){ int a[1010]; int n,m,k,i,min,j,num; scanf("%d %d %d",&m,&n,&k); while(

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1052PAT的数据卡的太蛋疼了：（1）并不是所有输入的节点都是链表上的节点；（2）若链表为空，输出0 -1.C语言源码：#include#include#define maxsize 100010typedef struct node{ int num,key,ne

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1053读题不认真，纠结了半天：Each path occupies a line with printed weights from the rootto the leaf in order其实针对最后输出排序：将路径(int)Stack[n]保存到(char)S[i]中，按字符

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1029C语言源码：#include#define maxsize 1000010long long s1[maxsize],s2[maxsize];int main(){ long long n1,n2,mid,i,j,k,x; scanf("%lld",&n1); fo

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1028C语言源码：#include#include#includetypedef struct student{ char ID[10]; char name[10]; int grade;}student;student stu[100010];int C;int

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1030C语言源码：#include#includetypedef struct node{ int length,cost;}node;node A[600][600];int visited[600];node T[600];int Stack[600][600];

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1040C语言源码：#include#includechar s[1010];int maxlen(int m,int n){ int i,j; i=m; j=n; while(i<j) { if(s[i]!=s[j]) return 0;

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1043想法是根据给的数列建二叉树根左子树右子树遍历根右子树左子树遍历若给的数列跟上述两个遍历得到的数列某个相等则YES，否则NOC语言源码：#include#includetypedef struct Bitree{ int data; struct B

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1042C语言源码：#include#includeint main(){ char s[55][10]={"O","S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13", "H1","H2","

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1008C语言源码：#includeint main(){ int n,sum,a[110],i; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); a[0]=0; sum=0; for(i=1;i<=n;i++)

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1002C语言源码：#includetypedef struct poly{ int exp; double coef;}poly;int main(){ poly x[30],y[30],z[30]; int k1,k2,i,j,k; scanf("%d",&k1);

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1006C语言源码：#include#include#define maxsize 1000typedef struct people{ char name[20]; int signin; int signout;}people;people p[maxsize];i

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1009C语言源码：#include#define maxsize 3000typedef struct poly{ int exp; double coef;}poly;poly a[maxsize],b[maxsize],c[maxsize],ans[maxsize],d

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1004C语言源码：#include#define maxsize 1000int T[maxsize];typedef struct family{ int top; int child[maxsize];}family;family f[maxsize];int

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1007C语言源码：#include#include#define maxsize 10010int main(){ int max,frontmax,rearmax,front,rear,sum; int n,i,a[maxsize]; scanf("%d",&n); f

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1010老是部分正确，先留着，以后再改C语言源码：#include#include#includeint main(){ long long a,b,radix; char s1[20],s2[20],s3[20]; int i,tag; scanf("%s %

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1011C语言源码：#include#includetypedef struct odd{ char s; double data;}odd;int cmp(const void *a,const void *b){ odd *aa=(odd *)a; odd *bb=

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1003有个测试点过不去，蛋疼。。。先放着，以后再改吧C语言源码：#include#include#define maxsize 600int E[maxsize][maxsize];int visited[maxsize];int shortest[maxsize]

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1005C语言源码：#include#include#define maxsize 110int main(){ char s[maxsize]; int stack[maxsize],top,i,x,len; scanf("%s",s); len=(int)strlen(

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1012提示：如果分数相同，排名相同。有重复排名是注意排名顺序，是1 2 3 3 5不是1 2 3 3 4。C语言源码：#include#include#include#includetypedef struct student{ int num; int C,E,M

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1013C语言源码：#include#include#define maxsize 1010typedef struct node{ int data; struct node *next;}node;node s[maxsize];int visited[maxsize

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1015将数字转成指定进制，再反序，判断原数和新数是否都是质数。C语言源码：#include#include#define maxsize 100000int T[maxsize];void pr(){ long long i,j; T[0]=1; T[1]=1;

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1038做的蛋都碎了，一开始自己写的比较函数，老是最后一个Case过不去。后来想了想直接比较字符串，就过了。#include#include#includechar s[10010][10];int cmp(const void *a,const void *b){ ch

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1027C语言源码：#includeint main(){ int a,b,c,i,x; char s[10]; s[7]=0; scanf("%d %d %d",&a,&b,&c); for(i=0;i<7;i++) s[i]='0'; s[0]='#'; i=2;