pat乙级 1026-1030

//1
#include<stdio.h>
int main(){
double c1,c2;
scanf("%lf%lf",&c1,&c2);
long long c3;
c3=(c2-c1)/100+0.5;
int h,m,s;
h=c3/3600;
m=c3%3600/60;
s=c3%60;
printf("%02d:%02d:%02d",h,m,s);
return 0;
}
//2
#include<stdio.h>
#include<math.h>
int main(){
int n;
char c;
scanf("%d %c",&n,&c);
int i,cnt=0;
int m=sqrt((n+1)/2);
int t=n-(m*m*2-1);
for(i=m,cnt=0;i>1;i--,cnt++){
for(int j=0;j<cnt;j++)
printf(" ");
for(int j=0;j<2*i-1;j++)
printf("%c",c);
printf("\n");
}
for(i=1,cnt;i<=m;i++,cnt--){
for(int j=0;j<cnt;j++)
printf(" ");
for(int j=0;j<2*i-1;j++)
printf("%c",c);
printf("\n");
}
printf("%d",t);
return 0;
}
//3
#include<bits/stdc++.h>
using namespace std;
struct node{
char name[6];
int year,month,day,number;
};
bool cmp(node a,node b){
if(a.year!=b.year) return a.year<b.year;
else if(a.month!=b.month ) return a.month<b.month;
else return a.day<b.day;
}
int main(){
long n;
scanf("%ld",&n);
node q[n];
vector<node> v;
for(int i=0;i<n;i++){
scanf("%s",q[i].name);
scanf("%d/%d/%d",&q[i].year,&q[i].month,&q[i].day);
q[i].number=1;
if(q[i].year>2014||(q[i].year==2014&&q[i].month>9)
||(q[i].year==2014&&q[i].month==9&&q[i].day>6)
||q[i].year<1814||(q[i].year==1814&&q[i].month<9)
||(q[i].year==1814&&q[i].month==9&&q[i].day<6))
q[i].number=-1;
if(q[i].number==1)
v.push_back(q[i]);
}
sort(v.begin(),v.end(),cmp);
int m=v.size();
printf("%d",m);
if(m!=0)
printf(" %s %s",v[0].name,v[m-1].name);
return 0;
}
//4
#include<bits/stdc++.h>
using namespace std;
int main(){
string s1,s2,ans;
cin>>s1>>s2;
for(int i=0;i<s1.length();i++)
if(s2.find(s1[i])==string::npos&&ans.find(toupper(s1[i]))==string::npos)
ans+=toupper(s1[i]);
cout<<ans;
return 0;
}
//5
#include<bits/stdc++.h>
using namespace std;
int cmp(int a,int b){
return a<b;
}
int main(){
int n;
long p;
scanf("%d%ld",&n,&p);
long s[n];
for(int i=0;i<n;i++)
scanf("%ld",&s[i]);
sort(s,s+n,cmp);
int t=0,max=0;
for(int i=0;i<n;i++){
for(int j=i+t;j<n;j++){
if(s[j]<=s[i]*p){
t=j-i+1;
if(t>max)
max=t;
}else{
break;
}
}
}
cout<<max;
return 0;
}