USACO training训练题解【1】

/*
ID: tominute
PROG: namenum
LANG: C++
*/
#include
#include
#include

using namespace std;

int main() {
FILE *fp,*dict,*fout;
int i,n,k=0,state=0;
char t[20],d[20];
int num[20];
int para[20]={0};
char test[20]={'\0'};
char phone[8][4]={"ABC","DEF","GHI","JKL","MNO","PRS","TUV","XYZ"};
fp=fopen("namenum.in","r");
fout=fopen("namenum.out","w");
fscanf(fp,"%s",t);
fclose(fp);
n=strlen(t) ;
for(i=0;i=0){
for(i=0;i=0;k--){
para[k]++;
if(para[k]==3){
para[k]=0;
}
else break;
}
}
k=0;
}
if(state==0)
fprintf(fout,"NONE\n");
fclose(fout);
//cout<

/*
ID: tominute
PROG: palsquare
LANG: C++
*/
#include
#include
#include

using namespace std;
int coun=0;
void conv(int base,int num,char out[20]){
char outnum[20];
int yu;
if(num==0){
coun=1;
out[0]=0;
}
else{
for(int i=0;num!=0;i++){
yu=num%base;
num=num/base;
if(yu<10)
outnum[i]=yu+48;
else
outnum[i]=yu+55;
coun++;
}
for(int i=0;i

/*
ID: tominute
PROG: dualpal
LANG: C++
*/
#include
#include
#include

using namespace std;
int coun=0;
void conv(int base,int num,char out[33]){
char outnum[33];
int yu;
if(num==0){
coun=1;
out[0]=0;
}
else{
for(int i=0;num!=0;i++){
yu=num%base;
num=num/base;
if(yu<10)
outnum[i]=yu+48;
else
outnum[i]=yu+55;
coun++;
}
for(int i=0;i=2){
geshu++;
fprintf(fout,"%d\n",i);
}
k=0;
}
fclose(fout);
getchar();
return 0;
}

/*
ID: tominute
PROG: milk
LANG: C++
*/
#include
#include
#include

using namespace std;
long int farmer[5000][2];
int main() {
FILE *fp,*fout;
int i=0,j,m;
long int n,temp,count=0,total=0;
fp=fopen("milk.in","r");
fout=fopen("milk.out","w");
fscanf(fp,"%d %d",&n,&m);
for(i=0;in){
farmer[i][1]=n-count+farmer[i][1];
break;
}
}
for(j=0;j<=i;j++){
total=total+farmer[j][0]*farmer[j][1];
}
//cout<

/*
ID: tominute
PROG: barn1
LANG: C++
*/
#include
#include
#include

using namespace std;
void test(int *flag,int p,int q,int *START,int *END){
int start,end,len=0;
for(int j=p;j<=q;j++){
if(flag[j-1]==1){
start=j;
j++;
while((flag[j-1]==0)&&(j<=q)){
j++;
}
end=j;
j=start;
if(len<=end-start-1){
*END=end;
*START=start;
len=end-start-1;
}
}
}
}
int main() {
FILE *fp,*fout;
int i=0,j,m,s,c,total=0,END,START,count=0,temp;
int stall[200],mem[50][2];
int flag1[200]={0};
int outflag[200]={1};
fp=fopen("barn1.in","r");
fout=fopen("barn1.out","w");
fscanf(fp,"%d %d %d",&m,&s,&c);
for(i=0;istall[j]){
temp=stall[i];
stall[i]=stall[j];
stall[j]=temp;
}
}
}
for(i=0;i

/*
ID: tominute
PROG: crypt1
LANG: C++
*/
#include
#include
#include

using namespace std;
int prime[10];
int test(int *test,int digit,int num){//1 false;0 ture
int flag=0;
for(int k=0;k=0){
for(j=0;j<3;j++){
mul[j]=prime[index[j]];
}
if(mul[2]!=0){
for(j=0;j=1)continue;//test the leading digit
flag=test(temp1,n,3);
if(flag>=1)continue;//test the first partial mul
//cout<=1||(prime[k]==0)))continue;//test the leading digit
flag=test(temp2,n,3);
if(flag>=1)continue;//test the second partial mul
out[0]=temp1[0];
out[1]=(temp1[1]+temp2[0])%10;
flag=(temp1[1]+temp2[0])/10;
out[2]=(temp1[2]+temp2[1]+flag)%10;
flag=(temp1[2]+temp2[1]+flag)/10;
out[3]=(temp2[2]+flag)%10;
flag=(temp2[2]+flag)/10;
if(flag>=1)continue;//test the leading digit
flag=test(out,n,4);
if(flag>=1)continue;//test final mul
count++;
}
}
}
for(i=2;i>=0;i--){
index[i]++;
if(index[i]==n){
index[i]=0;
}
else break;
}
}
fprintf(fout,"%d\n",count);
//cout<

/*
ID: tominute
PROG: milk3
LANG: C++
*/
#include
#include
#include
#include
#include

using namespace std;

int main(void)
{
int a,b,c,left[21]={0},a1,b1,c1,flag,count=0,out[21]={0},r;
ifstream fin("milk3.in");
FILE *fout;
fout=fopen("milk3.out","w");
fin >>a>>b>>c;
fin.close();
c1=c;a1=0;b1=0;left[c1]=1;
for(int i=0;i<5000000;i++){
r=rand()%6;
switch(r){
case 0:if(c1>(a-a1)){c1=c1-(a-a1);a1=a;}//c->a
else{a1+=c1;c1=0;}
if(a1==0)left[c1]=1;
if(a1>(b-b1)){a1=a1-(b-b1);b1=b;}//a->b
else{b1+=a1;a1=0;}break;
case 1:if(c1>(b-b1)){c1=c1-(b-b1);b1=b;}//c->b
else{b1+=c1;c1=0;}
if(a1==0)left[c1]=1;
if(b1>(a-a1)){b1=b1-(a-a1);a1=a;}//b->a
else{a1+=b1;b1=0;}break;
case 2:	if(a1>(c-c1)){a1=a1-(c-c1);a1=a;}//a->c
else{c1+=a1;a1=0;}
if(a1==0)left[c1]=1;break;
case 3:if(b1>(c-c1)){b1=b1-(c-c1);b1=b;}//b->c
else{c1+=b1;b1=0;}
if(a1==0)left[c1]=1;break;
case 4:	if(a1>(b-b1)){a1=a1-(b-b1);b1=b;}//a->b
else{b1+=a1;a1=0;}break;
case 5:if(b1>(a-a1)){b1=b1-(a-a1);a1=a;}//b->a
else{a1+=b1;b1=0;}break;
}
}
for(int i=0;i<21;i++){
if(left[i]==1){out[count]=i;count++;}
}
for(int i=0;i<(count-1);i++){
fprintf(fout,"%d ",out[i]);
}
fprintf(fout,"%d\n",out[count-1]);
fclose(fout);
//cout<<"end"<