PAT 1040 有几个PAT #include<stdio.h>#include<string.h>int main(void){ char str[100000]; int numT=0; int numAT=0; int numPAT=0; int i; gets(str); for(i=strlen(str)-1;i>-1;i--){ if(str[i]=='T'){ nu
PAT 1038 统计同成绩学生 #include<stdio.h>int main(void){ int n,k; int i; int num[101]={0}; int temp; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&temp); num[temp]++; } scanf(
PAT 1023 组个最小数(2) #include<iostream>#include<vector>using namespace std;int main(){ int i,j; int data[10]; vector<int>vec; for(i=0;i<10;i++) cin>>data[i]; for(i=1;i<10;i++){ if(data[i]!=0
PAT 1023 组个最小数 #include<stdio.h>#include<algorithm>using namespace std;int main(){ int i,j; int n; int cnt=0; int num[50]; int temp; for(i=0;i<10;i++){ scanf("%d",&n); for(
PAT 挖掘机技术哪家强 includeincludeusing namespace std;struct student { int a; int b; }; bool comp(student a,student b) { return a.a>=b.a; }int main() { int n; int i; int sum=0; int
PAT 1020 月饼 #include<stdio.h>#include<algorithm>using namespace std;struct yue{ double storage; double sumprice; double price;};bool comp(yue a,yue b){ return a.price>=b.price;}int main(){
PAT 1021 个位数统计 #include<stdio.h>#include<string.h>int main(){ int i; char a[1000]; int b[1000]; int cnt[10]={0,0,0,0,0,0,0,0,0,0}; gets(a); for(i=0;i<strlen(a);i++){ b[i]=a[i]-'
PAT 1021 个位数统计 #include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){ int i; int num; char a[1000]; int b[1000]; int count=1; gets(a); for(i=0;i<str
PAT 1019 数字黑洞 #include<stdio.h>#include<algorithm>using namespace std;int main(){ int n; int a[4]; int c,d,e; scanf("%d",&n); if((n/1000==n%1000/100)&&(n/1000==n%100/10)&&(n/1000==n%10))
PAT 1008 数组元素循环右移问题 #include<stdio.h>int main(){ int n,m; int i; int num[100]; scanf("%d %d",&n,&m); for(i=0;i<n;i++){ scanf("%d",&num[i]); } m=m%n; for(i=n-m;i<n;i++){ p
PAT 1002 写出这个数 #include<stdio.h>#include<string.h>int main(void){ const char *str[10]= {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"}; char number[102]; int i=0; int sum=0;
PAT 1005 继续(3n+1)猜想 #include<stdio.h>#include <algorithm>using namespace std;int main(){ int N; int n; int i,j; int number[2][100]; int number2[100]; scanf("%d",&N); for(i=0;i<N;i++){
PAT 1001 害死人不偿命的(3n+1)猜想 #include<stdio.h>int main(){ int n; int count=0; scanf("%d",&n); while(n!=1){ if(n%2==0){ n=n/2; count++; } else{ n=(3*
PAT 1007 素数对猜想 #include<stdio.h>#include<math.h>int main(){ int n; int i,j; int flag=1; int temp=2; int count=0; scanf("%d",&n); for(i=3;i<=n;i++){ for(j=2;j<=sqrt(i);j++){
PAT 1063 计算谱半径 #include<stdio.h>#include<math.h>int main(){ int n; int i; int a,b; int max=0; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%d",&a,&b); if((a*a+b*b)>=max) max=
PAT 1028 人口普查 #include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct str{ char name[6]; int year; int mon; int day;};bool comp(str a,str b){ if(a.year!=b.year)
PAT 1064 朋友数 #include<stdio.h>#include<iostream>#include <algorithm>using namespace std;int main(){ int n; int i; int count=0; int sum=0; scanf("%d",&n); int number[n]; int s[n];
PAT 1013 数素数 #include<stdio.h>#include<math.h> int main(){ int m,n; int i,j; int count=0; int flag=1; int flag2=0; scanf("%d%d",&m,&n); for(i=2;;i++){ for(j=2;j<=sqrt(i);j++){
PAT 1012 数字分类 #include<stdio.h>int main(){ int n; int i; int a1=0; int a11=0; int a2=0; int a22=0; int flag=1; int a3=0; double a4=0; double a44=0; int a5=0;; scanf(
PAT 1015 德才论 #include<stdio.h>#include<iostream>#include<algorithm>using namespace std;struct ss { int number; int de; int cai; };bool comp(ss a,ss b); int main(){ int N,l