![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT_PAT (Basic Level) Practise
赛亚人_1
开通博客发表自己的一些编程代码以及学习的一些感受,希望各位朋友能给予我一些宝贵的建议。
展开
-
1044_火星数字
#include#include#include#include#includeusing namespace std;int main(){ map m; m["tret"]=0; m["jan"]=1;m["feb"]=2;m["mar"]=3;m["apr"]=4;m["may"]=5;m["jun"]=6; m["jly"]=7;m["aug"]=8;m["sep原创 2015-10-15 10:20:20 · 1199 阅读 · 0 评论 -
1002_写出这个数 (20)
#includechar ch[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};void output(int n){ if(n>=10) { output(n/10); printf(" %s",ch[n%10]); } else if(n0) { printf("%s",ch[n]);原创 2015-01-30 19:55:03 · 1455 阅读 · 0 评论 -
1035_插入与归并(25)
#include#include#includeint cmp(const void *a,const void *b){ return *((int *)a)-*((int *)b);}int isSort(int *a,int low,int high){ int i; for(i=low;i<high-1;i++) if(a[i]>a[i+1]) break; if原创 2015-03-07 09:45:52 · 1447 阅读 · 0 评论 -
1021_个位数统计 (15)
#includeint main(){ int a[10]; char str[1001]; int i; while(~scanf("%s",str)) { for(i=0;i<10;i++) a[i]=0; for(i=0;str[i]!='\0';i++) a[str[i]-'0']++; for(i=0;i<10;i++) if(a[i]!=0) p原创 2015-02-11 18:29:21 · 395 阅读 · 0 评论 -
1025_反转链表 (25)
#include#includetypedef struct Node{ int address; int data; int next;}Node;void reverse(Node *a,int k,int i){ int j; Node temp; for(j=i*k;j<i*k+k/2;j++) { temp=a[j]; a[j]=a[2*k*i+k-j-原创 2015-02-11 23:52:07 · 756 阅读 · 0 评论 -
1020_月饼 (25)
#include#includetypedef struct Yue{ double weight; double price; double avg;}Yue;int cmp(const void *a,const void *b){ return ((Yue *)b)->price*((Yue *)a)->weight - ((Yue *)a)->price*((Yue *原创 2015-02-11 17:43:26 · 1122 阅读 · 0 评论 -
1022_D进制的A+B (20)
#includevoid verse(int a,int d){ if(a!=0) { verse(a/d,d); printf("%d",a%d); }}int main(){ int a,b,d; int i; while(~scanf("%d%d%d",&a,&b,&d)) { if(d10) continue; a+=b; if(a==0)原创 2015-02-11 19:48:01 · 417 阅读 · 0 评论 -
1019_数字黑洞 (20)
#include#includeint cmp(const void *a,const void *b){ return (*(int *)b)-(*(int *)a);}int main(){ int a[4]; int n,m,result; while(~scanf("%d",&result)) { if(result=10000) continue; a[0]原创 2015-02-10 23:01:30 · 340 阅读 · 0 评论 -
1018_锤子剪刀布 (20)
#includeint main(){ int n,i; int a,b,count[6]; char s[2]; int win,equal,fail; while(~scanf("%d",&n)) { getchar(); if(n100000) continue; win=equal=fail=0; count[0]=count[1]=count[2]=cou原创 2015-02-10 21:50:33 · 580 阅读 · 0 评论 -
1024_科学计数法 (20)
#include#includeint main(){ char str[10000],sign1,sign2,temp; int i,zhishu,a,len; scanf("%c%d.%[^E]%c%c%d",&sign1,&a,str,&temp,&sign2,&zhishu); if(sign1=='-') printf("-"); if(sign2=='-') {原创 2015-02-11 21:12:00 · 419 阅读 · 0 评论 -
1034_有理数四则运算(20)
#includeint gong(long long a,long long b){ long long r,min,max; min=(a>b)?b:a; max=(a>b)?a:b; r=max%min; while(r) { max=min; min=r; r=max%min; } return min;}void print(long long a,lo原创 2015-03-07 09:43:57 · 3323 阅读 · 0 评论 -
1033_旧键盘打字(20)
#include#include#includeint main(){ int i,j,len; char str1[100010],str2[100010]; while(gets(str1)!=NULL) { gets(str2); len=strlen(str2); for(i=0;str1[i]!='\0';i++) { if(str1[i]=='+'原创 2015-02-19 10:04:47 · 610 阅读 · 0 评论 -
1043_输出PATest
#include#include#includeusing namespace std;int main(){ string str; int cnt[6]; int i,min; while(cin>>str) { cnt[0]=count(str.begin(),str.end(),'P'); cnt[1]=count(str.begin(),str.end()原创 2015-10-14 22:07:24 · 347 阅读 · 0 评论 -
1045_快速排序
#include#include#includeusing namespace std;int main(){ int a[100001]; int b[100001]; int c[100001]; int N,i,cnt,max; while(cin>>N) { for(i=0;i<N;++i) { cin>>a[i]; b[i]=a[i];原创 2015-10-15 11:42:07 · 1162 阅读 · 0 评论 -
1039_到底买不买
#include#includeusing namespace std;int main(){ char str1[1001],str2[1001]; int a1[128],a2[128]; int m,n,flag; while(cin>>str1>>str2) { m=n=0; flag=0; memset(a1,0,sizeof(a1)); memse原创 2015-10-13 23:16:03 · 294 阅读 · 0 评论 -
1042_字符统计
#include#include#include#includeusing namespace std;int main(){ string str; int a[33],t,index; while(getline(cin,str)) { memset(a,0,sizeof(a)); for(int i=0;i<str.length();++i) { i原创 2015-10-14 17:51:21 · 413 阅读 · 0 评论 -
1040_有几个PAT
#include#include#includeusing namespace std;const int N=1000000007;int main(){ string str; int result; int cntP,cntT; while(cin>>str) { result=0; cntP=0; cntT=count(str.begin(),str.原创 2015-10-13 23:36:03 · 290 阅读 · 0 评论 -
1041_考试座位号
#include#include#includeusing namespace std;struct Stu{ char name[15]; int a,b;};bool cmp(const Stu &s1,const Stu &s2){ if(s1.a<s2.a) return true; return false;}int main(){ int N原创 2015-10-14 17:24:54 · 299 阅读 · 0 评论 -
1036_跟奥巴马一起编程
#includeusing namespace std;int main(){ int a,t,i,j; char c; while(cin>>a>>c) { if(a>20||a<3) continue; t=(a+1)/2; for(i=0;i<a;i++) cout<<c; cout<<endl; for(i=1;i<t-1;i++) {原创 2015-10-12 22:36:07 · 299 阅读 · 0 评论 -
1037_在霍格沃茨找零钱
#includeusing namespace std;//1037. 在霍格沃茨找零钱(20)int main(){ int a1,b1,c1; int a2,b2,c2; int sum,sum1,sum2; char c; while(cin>>a1>>c>>b1>>c>>c1>>a2>>c>>b2>>c>>c2) { sum2=a1*17*29+b1*29+c1原创 2015-10-12 22:54:22 · 314 阅读 · 0 评论 -
1038_统计同成绩学生
#include#include#include#includeusing namespace std;int main(){ int a[101]; int i,t,n,m; int y[10001]; while(cin>>n) { memset(a,0,sizeof(a)); for(i=0;i<n;++i) { cin>>t; ++a[t]原创 2015-10-12 23:56:01 · 332 阅读 · 0 评论 -
1027_打印沙漏(20)
#include#includeint main(){ int n,k,i,j; char e; while(~scanf("%d",&n)) { getchar(); scanf("%c",&e); k=sqrt((n+1)/2); for(i=k;i>0;i--) { for(j=k;j>i;j--) printf(" "); for(j=原创 2015-02-17 20:25:01 · 1297 阅读 · 0 评论 -
1031_查验身份证(15)
#includeint main(){ int n,i,j,k; int sum,weight[17]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2}; char yan[11]={'1','0','X','9','8','7','6','5','4','3','2'}; char str[100][20]; while(~scanf("%d",&n))原创 2015-02-18 16:01:54 · 2696 阅读 · 0 评论 -
1026_程序运行时间(15)
#includeint main(){ int C1,C2,f; while(~scanf("%d%d",&C1,&C2)) { f=(C2-C1+50)/100; printf("%02d:%02d:%02d\n",f/3600,f/60%60,f%60); } return 0;}原创 2015-02-17 20:23:40 · 393 阅读 · 0 评论 -
1011_A+B和C (15)
#includetypedef struct Num{ long A; long B; long C;}Num;int main(){ int i,T; Num a[10]; while(~scanf("%d",&T)) { for(i=0;i<T;i++) scanf("%ld%ld%ld",&a[i].A,&a[i].B,&a[i].C); for(i=0原创 2015-02-06 15:55:25 · 353 阅读 · 0 评论 -
1010_一元多项式求导 (25)
#include#includetypedef struct Num{ int x; int y;}Num;int main(){ Num a[2001]; int i=0,j,k=0; while(scanf("%d%d",&a[i].x,&a[i].y)!=EOF) i++; for(j=0;j<i;j++) if(a[j].y) { a[k].x*=a[原创 2015-02-06 15:39:10 · 448 阅读 · 0 评论 -
1004_成绩排名 (20)
#include#includetypedef struct Student{ char name[11]; char xuehao[11]; int score;}Student;int main(){ int n,i,max,min,x,y; Student *Stu; while(~scanf("%d",&n)) { if(n<1) continue; St原创 2015-01-30 20:38:03 · 395 阅读 · 0 评论 -
1001_害死人不偿命的(3n+1)猜想 (15)
#includeint Num(int n){ int sum=0; while(n!=1) { if((n&1)==0) n=n>>1; else n=(3*n+1)>>1; sum++; } return sum;}int main(){ int n; while(~scanf("%d",&n)) { if(n1000) continue; pri原创 2015-01-30 19:09:25 · 333 阅读 · 0 评论 -
1003_我要通过!(20)
#includeint main(){ int x,y,z; int n,i,j; char str[101]; while(~scanf("%d",&n)) { if(n=10) continue; for(i=0;i<n;i++) { scanf("%s",str); x=y=z=0;j=0; while(str[j]=='A') { x++原创 2015-01-30 20:21:55 · 566 阅读 · 0 评论 -
1009_说反话 (20)
#includevoid output(char *str,int n){ int t=n,flag=n; while(str[n]!='\0'&&str[n]!=' ') n++; if(str[n]==' ') { output(str,n+1); while(t<n) printf("%c",str[t++]); if(flag!=0) printf("原创 2015-01-31 10:54:07 · 2787 阅读 · 0 评论 -
1006_换个格式输出整数 (15)
#includeint main(){ int a,b,c; int n,i; while(~scanf("%d",&n)) { if(n=1000) continue; a=n/100; b=n/10%10; c=n%10; for(i=0;i<a;i++) printf("B"); for(i=0;i<b;i++) printf("S"); for原创 2015-01-30 22:22:26 · 394 阅读 · 0 评论 -
1005_继续(3n+1)猜想 (25)
#include#include#includeint Clz(int m,int n){ while(m!=1) { if(m==n) return 1; if((m&1)==0) m=m>>1; else m=(3*m+1)>>1; } return 0;}int compAs(const void *a,const void *b){ return *(i原创 2015-01-30 21:59:46 · 627 阅读 · 1 评论 -
1008_数组元素循环右移问题 (20)
#include#includevoid reverse(int *a,int low,int high){ int temp; while(low<high) { temp=a[low]; a[low]=a[high]; a[high]=temp; low++; high--; }}int main(){ int n,m,i; int *a; whi原创 2015-01-30 22:54:40 · 584 阅读 · 0 评论 -
1012_数字分类 (20)
#include#includeint main(){ int N; int i,*a; int a1,a2,a3,a4,a5; float a_4; int select,flag; while(~scanf("%d",&N)) { if(N1000) continue; a=(int *)malloc(N*sizeof(int)); a1=a2=a3=a4=a5原创 2015-02-06 16:18:53 · 640 阅读 · 0 评论 -
1014_福尔摩斯的约会 (20)
#includeint main(){ char s[7][4]={"MON","TUE","WED","THU","FRI","SAT","SUN"}; char str1[61],str2[61],str3[61],str4[61]; int i,flag,h; while(scanf("%s",str1)!=EOF) { scanf("%s%s%s",str2,str3,s原创 2015-02-07 22:32:30 · 941 阅读 · 0 评论 -
1017_A除以B (20)
#includeint main(){ char s[1001]; int sum[1001],result[1001]; int b,i,j; while(~scanf("%s%d",s,&b)) { for(i=0;s[i]!='\0';i++) sum[i]=s[i]-'0'; j=0; while(j<i-1) { result[j]=sum[j]原创 2015-02-10 21:01:08 · 298 阅读 · 0 评论 -
1016_部分A+B (15)
#includeint main(){ int A,B,a,b; int m,n; while(~scanf("%d%d%d%d",&A,&a,&B,&b)) { m=0,n=0; while(A) { if(A%10==a) m=m*10+a; A/=10; } while(B) { if(B%10==b) n=n*10+b; B/=1原创 2015-02-10 19:19:32 · 421 阅读 · 0 评论 -
1023_组个最小数 (20)
#includeint main(){ int a[10]; int i,j,k; while(~scanf("%d",&a[0])) { for(i=1;i<10;i++) scanf("%d",&a[i]); for(k=1;k<10;k++) if(a[k]!=0) { printf("%d",k); a[k]--; break;原创 2015-02-11 19:48:43 · 468 阅读 · 0 评论 -
1032_挖掘机技术哪家强(20)
#include#include#includetypedef struct B{ int x,y;}B;int main(){ int i,n,max,k; int *a; B *b; while(~scanf("%d",&n)) { a=(int *)malloc((n+1)*sizeof(int)); b=(B *)malloc(n*sizeof(B));原创 2015-02-18 16:19:19 · 626 阅读 · 0 评论 -
1029_旧键盘(20)
#include#include#includeint main(){ char str1[81],str2[81],str3[81]; int i,j; while(~scanf("%s%s",str1,str2)) { str3[0]='\0'; j=0; for(i=0;str1[i]!='\0';i++) str1[i]=toupper(str1[i]);原创 2015-02-17 20:29:23 · 480 阅读 · 0 评论