ACM
HOH_mizukun
这个作者很懒,什么都没留下…
展开
-
PAT(Basic Level)_1051_复数乘法
#include<stdio.h>#include<math.h>int main(){ double R1,P1,R2,P2,R,P,A,B; scanf("%lf%lf%lf%lf",&R1,&P1,&R2,&P2); R=R1*R2; P=P1+P2; A=R*cos(P); B=R*sin(P); if(A<0) A=((int)(原创 2017-07-27 13:31:33 · 512 阅读 · 0 评论 -
PAT(Basic Level)_1030_完美数列
#include<cstdio>#include<algorithm>using namespace std;int main(){ int i,j; int N; scanf("%d",&N); double p; scanf("%lf",&p); int nums[100000]; for(i=0;i<N;i++){ scanf原创 2017-07-25 10:23:01 · 246 阅读 · 0 评论 -
PAT(Basic Level)_1029_旧键盘
#include<stdio.h>int main(){ char str1[100],str2[100]; scanf("%s%s",str1,str2); char *p1=str1,*p2=str2; int flag[100]={}; while(true){ if(*p1==*p2){ if(*p1) p1++,原创 2017-07-25 10:18:57 · 291 阅读 · 0 评论 -
PAT(Basic Level)_1028_人口普查
#include<stdio.h>#include<string.h>struct Tip{ char name[10]; int year; int month; int day;};int cmp(const Tip &A,const Tip &B){ if(A.year!=B.year) return A.year-B.year; if(A.原创 2017-07-25 10:17:56 · 392 阅读 · 0 评论 -
PAT(Basic Level)_1027_打印沙漏
#include<stdio.h>int main(){ int N; char ch; scanf("%d %c",&N,&ch); int k=1; while(2*k*k-1<=N) k++; k--; for(int i=k;i>0;i--){ for(int j=k-i;j>0;j--){ putc原创 2017-07-25 10:15:45 · 239 阅读 · 0 评论 -
PAT(Basic Level)_1026_程序运行时间
#include<stdio.h>int main(){ int a,b,h,m,s; scanf("%d%d",&a,&b); b=(b-a+50)/100; h=b/3600; m=b/60%60; s=b%60; printf("%02d:%02d:%02d",h,m,s); return 0;}原创 2017-07-25 10:14:00 · 370 阅读 · 1 评论 -
PAT(Basic Level)_1025_反转链表
#include<stdio.h>int main(){ int data[100000]; int next[100000]; int fore[100000]; int P,N,K; scanf("%d%d%d",&P,&N,&K); int addr; for(int i=0;i<N;i++){ scanf("%d",&add原创 2017-07-24 03:36:20 · 520 阅读 · 0 评论 -
PAT(Basic Level)_1024_科学计数法
#include<stdio.h>#include<string.h>int main(){ char str[20000],*p1,*p2; gets(str); if(str[0]=='-') putchar('-'); p1=p2=str+1; while(*(++p2)!='E'); *(p2++)=0; int coe; ssc原创 2017-07-24 03:34:15 · 381 阅读 · 0 评论 -
PAT(Basic Level)_1023_组个最小数
#include<stdio.h>int main(){ int num[10]={}; for(int i=0;i<10;i++){ scanf("%d",num+i); } for(int i=1;i<10;i++){ if(num[i]){ putchar(i+'0'); num[i原创 2017-07-24 03:32:22 · 254 阅读 · 0 评论 -
PAT(Basic Level)_1022_D进制的A+B
#include<stdio.h>int main(){ int A,B,D; scanf("%d%d%d",&A,&B,&D); int sum=A+B,stk[32],cnt=0; while(sum){ stk[cnt++]=sum%D; sum/=D; } if(cnt){ while(cnt--原创 2017-07-24 03:30:49 · 273 阅读 · 0 评论 -
PAT(Basic Level)_1021_个位数统计
#include<stdio.h>#include<string.h>int main(){ char str[1001]; gets(str); int cnt[10]={},len=strlen(str); for(int i=0;i<len;i++){ cnt[str[i]-'0']++; } for(int i=0;i<10;i原创 2017-07-24 03:29:00 · 300 阅读 · 0 评论 -
PAT(Basic Level)_1020_月饼
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;struct Cake{ double amount; double total; double price;}list[1000];int cmp(Cake &A,Cake &B){ return A.price>B原创 2017-07-24 03:27:14 · 289 阅读 · 0 评论 -
PAT(Basic Level)_1019_数字黑洞
#include<iostream>#include<algorithm>using namespace std;int main(){ int N; cin>>N; int n[4],A,B; while(true){ n[0]=N/1000; n[1]=N/100%10; n[2]=N/10%10;原创 2017-07-24 03:26:06 · 227 阅读 · 0 评论 -
PAT(Basic Level)_1018_锤子剪刀布
#include<iostream>using namespace std;int main(){ int N; char A,B; int tie=0; int AC=0,AJ=0,AB=0; int BC=0,BJ=0,BB=0; cin>>N; while(N--){ cin>>A>>B; if(A==B){原创 2017-07-24 03:24:24 · 267 阅读 · 0 评论 -
PAT(Basic Level)_1017_A除以B
#include<stdio.h>#include<string.h>int main(){ char A[1001],Q[1001],*q=Q; int B,R=0; scanf("%s %d",A,&B); int len=strlen(A); for(int i=0;i<len;i++){ R=R*10+A[i]-'0';原创 2017-07-24 03:22:54 · 342 阅读 · 0 评论 -
PAT(Basic Level)_1016_部分A+B
#include<stdio.h>#include<string.h>//using namespace std;int main(){ char A[11],B[11],DA,DB; scanf("%s %c %s %c",A,&DA,B,&DB); int da=DA-'0',db=DB-'0',a=0,b=0; for(int i=0;i<strlen(A);i原创 2017-07-24 03:21:15 · 294 阅读 · 0 评论 -
PAT(Basic Level)_1015_德才论
#include<cstdio>#include<cstdlib>#include<algorithm>using namespace std;struct Stu{ int id; int eq; int iq; int sum; int type;};int cmp(const Stu &a,const Stu &b){ if(a.type!原创 2017-07-23 09:02:52 · 328 阅读 · 0 评论 -
PAT(Basic Level)_1014_福尔摩斯的约会
#include<stdio.h>#include<string.h>int main(){ char str1[61],str2[61],str3[61],str4[61]; char week[7][5]={"MON","TUE","WED","THU","FRI","SAT","SUN"}; scanf("%s%s%s%s",str1,str2,str3,str4);原创 2017-07-23 09:01:27 · 320 阅读 · 0 评论 -
PAT(Basic Level)_1031_查验身份证
#include<stdio.h>int main(){ int N; scanf("%d\n",&N); char str[20],ch; int sum,right,cnt=0; int Q[]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2}; int M[]={'1','0','X','9','8','7','6','原创 2017-07-25 10:24:39 · 255 阅读 · 0 评论 -
PAT(Basic Level)_1032_挖掘机技术哪家强
#include<stdio.h>int main(){ int sum[100001]={}; int N,team,score; scanf("%d",&N); while(N--){ scanf("%d%d",&team,&score); sum[team]+=score; } score=-1; for(i原创 2017-07-25 10:26:05 · 299 阅读 · 0 评论 -
PAT(Basic Level)_1033_旧键盘打字
#include<stdio.h>#include<string.h>int main(){ char str[100001]; int key[300]={},len; gets(str); len=strlen(str); for(int i=0;i<len;i++){ key[str[i]]=1; if(str[i]>='原创 2017-07-25 10:27:39 · 289 阅读 · 0 评论 -
PAT(Basic Level)_1050_螺旋矩阵
#include<cstdio>#include<cmath>#include<algorithm>#include<functional>using namespace std;int main(){ int N,m,n,nums[10000]; scanf("%d",&N); for(int i=0;i<N;i++){ scanf("%d",num原创 2017-07-27 13:30:27 · 335 阅读 · 0 评论 -
PAT(Basic Level)_1049_数列的片段和
#include<stdio.h>int main(){ int N; scanf("%d",&N); double sum=0,tmp; for(int i=0;i<N;i++){ scanf("%lf",&tmp); sum+=tmp*(i+1)*(N-i); } printf("%.2lf",sum); ret原创 2017-07-27 13:29:02 · 315 阅读 · 0 评论 -
PAT(Basic Level)_1048_数字加密
#include<stdio.h>#include<string.h>int main(){ char astr[101],bstr[101],str[101]; scanf("%s %s",astr,bstr); int alen=strlen(astr),blen=strlen(bstr); int i=0,j=0,k=0,odd,tmp; for(;i<b原创 2017-07-27 13:27:29 · 316 阅读 · 0 评论 -
PAT(Basic Level)_1047_编程团体赛
#include<stdio.h>int main(){ int n,team,memb,score,list[1001]={}; scanf("%d",&n); while(n--){ scanf("%d-%d %d",&team,&memb,&score); list[team]+=score; } team=0;原创 2017-07-27 13:25:08 · 254 阅读 · 0 评论 -
PAT(Basic Level)_1046_划拳
#include<iostream>using namespace std;int main(){ int n,win=0,lost=0,a,b,c,d; cin>>n; while(n--){ cin>>a>>b>>c>>d; if(b==d) continue; if(b==a+c) win++; if(d=原创 2017-07-27 13:23:56 · 266 阅读 · 0 评论 -
PAT(Basic Level)_1045_快速排序
#include<stdio.h>#include<limits.h>#include<stdlib.h>int cmp(const void *a,const void *b){ return *((int*)a)-*((int*)b);}int main(){ int nums[100000],n; scanf("%d",&n); for(int i=0;i原创 2017-07-26 18:05:37 · 280 阅读 · 0 评论 -
PAT(Basic Level)_1044_火星数字
#include<stdio.h>#include<string.h>int main(){ int n,tmp,t1,t2; char str[10],s1[5],s2[5]; char mars1[][5]={"tret","tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou"};原创 2017-07-26 18:02:56 · 286 阅读 · 0 评论 -
PAT(Basic Level)_1043_输出PATest
#include<stdio.h>#include<string.h>int main(){ char str[10001]; gets(str); char arr[]="PATest"; int cnt[6]={}; int len=strlen(str),i; for(i=0;i<len;i++){ switch(str[i]){原创 2017-07-26 18:01:42 · 272 阅读 · 0 评论 -
PAT(Basic Level)_1042_字符统计
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int main(){ int cnt[26]={}; char str[1001]; cin.getline(str,1001); int len=strlen(str); for(int i=0;i<len;i+原创 2017-07-26 18:00:19 · 309 阅读 · 0 评论 -
PAT(Basic Level)_1041_考试座位号
#include<stdio.h>#include<string.h>struct Stu{ char id[15]; int b;}list[1001];int main(){ int n,m,a,b; char str[15]; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%s %d原创 2017-07-26 17:58:55 · 380 阅读 · 0 评论 -
PAT(Basic Level)_1040_有几个PAT
#include<stdio.h>#include<string.h>int main(){ char str[100001]; gets(str); int cntP=0,cntPA=0,cntPAT=0; int len=strlen(str); for(int i=0;i<len;i++){ if(str[i]=='P') cntP++;原创 2017-07-26 17:57:46 · 312 阅读 · 0 评论 -
PAT(Basic Level)_1039_到底买不买
#include<stdio.h>#include<string.h>int main(){ char str[1001]; int cnt[300]={},len; gets(str); len=strlen(str); for(int i=0;i<len;i++){ cnt[str[i]]++; } gets(str);原创 2017-07-26 17:56:34 · 268 阅读 · 0 评论 -
PAT(Basic Level)_1038_统计同成绩学生
#include<stdio.h>int main(){ int cnt[101]={},n,tmp; scanf("%d",&n); while(n--){ scanf("%d",&tmp); cnt[tmp]++; } scanf("%d",&n); while(n--){ scanf("%d",&t原创 2017-07-26 17:55:20 · 296 阅读 · 0 评论 -
PAT(Basic Level)_1037_在霍格沃茨找零钱
#include<stdio.h>int main(){ long pg,ps,pk,ag,as,ak,dk; scanf("%ld.%ld.%ld %ld.%ld.%ld",&pg,&ps,&pk,&ag,&as,&ak); pk=(pg*17+ps)*29+pk; ak=(ag*17+as)*29+ak; dk=ak-pk; if(dk<0){原创 2017-07-26 17:52:06 · 291 阅读 · 0 评论 -
PAT(Basic Level)_1036_跟奥巴马一起编程
#include<iostream>using namespace std;int main(){ int n; char ch; cin>>n>>ch; for(int i=0;i<n;i++){ cout<<ch; } cout<<endl; for(int i=(n+1)/2-2;i>0;i--){ cout原创 2017-07-26 17:50:35 · 360 阅读 · 0 评论 -
PAT(Basic Level)_1035_插入与归并
#include<iostream>#include<algorithm>using namespace std;bool ifequal(int a[],int b[],int n){ for(int i=0;i<n;i++){ if(a[i]!=b[i]){ return false; } } return tru原创 2017-07-25 10:37:06 · 352 阅读 · 0 评论 -
PAT(Basic Level)_1034_有理数四则运算
#include<stdio.h>long abs(long a){ return (a>=0)?a:-a;}long gcd(long x,long y){ long t; while(y){ t=x%y; x=y; y=t; } return x;}void print_num(long a,long b原创 2017-07-25 10:30:28 · 382 阅读 · 0 评论 -
PAT(Basic Level)_1013_数素数
#include<stdio.h>#include<math.h>int main(){ int M=1,N=10000; scanf("%d%d",&M,&N); int prime[10001]={0,2},num=1,i,j=2,flag,tmp; while(1){ flag=0; num+=2; tmp=sqr原创 2017-07-23 08:56:59 · 242 阅读 · 0 评论 -
PAT(Basic Level)_1012_数字分类
#include<stdio.h>int main() { int N, num; int A1 = 0; int A2 = 0, A2_flag = 0, A2_odd = 1; int A3 = 0; int A4 = 0, A4_cnt = 0; int A5 = 0; scanf("%d", &N); while (N--) {原创 2017-07-23 08:54:14 · 211 阅读 · 0 评论