hdu 2060
斯诺克，读懂题意直接模拟
#include<stdio.h>
int main(){
int N;
int i,a[];
a[]=;
for(i=;i<=;i++){
a[i]=(-i)*i/;
}
for(i=;i<=;i++){
a[i]=a[i-]+;
}
while(scanf("%d",&N)!=EOF){
for(i=;i<=N;i++){
int L,SP,SO;
scanf("%d%d%d",&L,&SP,&SO);
if(a[L]>=SO-SP) printf("Yes\n");
else printf("No\n");
}
}
return ;
}
hdu 2061
求GPA并判断有没有挂科，直接模拟
#include<stdio.h>
#include<string.h>
int main(){
int N;
while(scanf("%d",&N)!=EOF){
for(int i=;i<=N;i++){
int K,j;
scanf("%d",&K);
double C[],S[];
char q[];
bool f=;
for(j=;j<=K;j++){
scanf("%s%lf%lf",q,&C[j],&S[j]);
if(!f&&S[j]<&&S[j]>=)f=;
}
if(f)printf("Sorry!\n");
else{
double GKP=,s=;
for (j=;j<=K;j++){
GKP+=S[j]*C[j];
s+=C[j];
}
GKP=GKP*1.0/s;
printf("%.2lf\n",GKP);
}
if(i!=N){
printf("\n");
}
}
}
return ;
}
hdu2062
#include<stdio.h>
#include<string.h>
int main()
{
long long a[],i;
a[]=;
for(i=;i<=;i++) a[i]=(i-)*a[i-]+;
long long n,m;
while(scanf("%I64d%I64d",&n,&m)!=EOF){
long long b[],k=m,l=n,t,s;
memset(b,,sizeof(b));
for(;k>;){
t=(k-)/a[l]+;
s=;
for (t;t>;t--){
s++;
while (b[s]) s++;
}
b[s]=;
printf("%I64d",s);
k=(k-)%a[l];
if (k==) printf("\n");
else printf(" ");
l--;
}
}
return ;
}