原创 PAT(Basic Level)_1032_挖掘機技術哪家強

#include<stdio.h> int main(){ int sum[100001]={}; int N,team,score; scanf("%d",&N); while(N--){

原创 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

原创 PAT(Basic Level)_1028_人口普查

#include<stdio.h> #include<string.h> struct Tip{ char name[10]; int year; int month; int day; };

原创 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<=

原创 PAT(Basic Level)_1029_舊鍵盤

#include<stdio.h> int main(){ char str1[100],str2[100]; scanf("%s%s",str1,str2); char *p1=str1,*p2=st

原创 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]

原创 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

原创 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=

原创 PAT(Basic Level)_1019_數字黑洞

#include<iostream> #include<algorithm> using namespace std; int main(){ int N; cin>>N; int n[4],A,B;

原创 PAT(Basic Level)_1030_完美數列

#include<cstdio> #include<algorithm> using namespace std; int main(){ int i,j; int N; scanf("%d",&N)

原创 PAT(Basic Level)_1021_個位數統計

#include<stdio.h> #include<string.h> int main(){ char str[1001]; gets(str); int cnt[10]={},len=strlen

原创 PAT(Basic Level)_1015_德才論

#include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; struct Stu{ int id; int eq;

原创 PAT(Basic Level)_1024_科學計數法

#include<stdio.h> #include<string.h> int main(){ char str[20000],*p1,*p2; gets(str); if(str[0]=='-')

原创 PAT(Basic Level)_1023_組個最小數

#include<stdio.h> int main(){ int num[10]={}; for(int i=0;i<10;i++){ scanf("%d",num+i); }

原创 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=