2016年09月_eeetttzhangji

原创创新实验室第二周解题报告

A - 人见人爱A^BCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionInputOutput

2016-09-28 21:06:25 337

原创装载问题回溯法解决

我只输出是不是能装得下，没有保存最优解决方案#include#include#define MAXSIZE 50int heigh[MAXSIZE];int MAX=0;int high=0;int c1,c2;void loading(int c1,int t,int n);int main(){int n,i,sumheigh=0;mem

2016-09-25 16:18:47 588

原创二分查找基于有序数组返回下标

我用的递归#includeint binary_search(int *a,int low,int high,int k);int main(){int a[8]={1,2,3,4,5,6,7,8};printf("%d\n",binary_search(a,0,7,7));return 0;}int binary_search(int *a,i

2016-09-25 15:23:01 516

原创素数筛选欧拉筛选

#include#includeconst int N = 1000000 + 5;int prime[N], check[N];int ptot;/*欧拉筛法进行素数筛选*/void filter(int n); int main(){memset(prime, 0, sizeof(prime));memset(check, 0, sizeof(chec

2016-09-25 14:49:07 361

原创阿牛的EOF牛肉串遗憾的是超时了

利用0-1背包问题的方法解决#include#define MAX 50int x[MAX]; //当前答案 int bestx[MAX]; //最佳答案 int n; //排列的长度 int num=0;void PrintPerm(int t);int main(){while(~scanf("%d",&n)){num=0;Pri

2016-09-24 13:12:08 263

原创求任意数列的全排列

利用递归求解#includevoid PrintPerm(int *a,int *b,int n,int m,int cur);int main(){ int n,m,i,a[100],b[20]; printf("please input n\n"); scanf("%d",&n); for(i=0;i scanf("%d",&b[i]); PrintPe

2016-09-23 19:23:37 586

原创 1002. A+B for Polynomials (25)

网上看了一些解决方法，很多太笨，时间复杂度太高，要么就思路复杂，这样的代码是要不得的，一看就不是搞ACM得，不废话，直接上代码。#includeint main(){ double a[10000]={0},b[10000]={0},c[10000]={0},coe; int line1,line2; int i,j; int exp,max=0,min=10000,n

2016-09-23 15:04:48 233

原创题目集合

B - 分拆素数和Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionInputOutput

2016-09-22 20:54:03 509

原创 max sum

J - Max SumCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionInputOutput

2016-09-21 20:17:12 272

原创 complete the world

A - Complete the WordCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus DescriptionInput

2016-09-21 14:09:35 229

原创叠筐

E - 叠筐Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionInputOutput

2016-09-20 19:42:41 274

原创 003 个位数统计

刚开始没看到1000位，用了整数类型来存放数据，不过，才知道用字符串。#includeint main(){char a[1001];gets(a);char *p=a;int num[10]={0};while(*p){num[*p-'0']++;p++;}for(int i=0;iif(num[i]!=0)printf("%d:%d\

2016-09-17 20:14:25 254

原创 002 打印沙漏

#includevoid print2(int n,char c);void print1(int n,char c);int main(){int n,i=3,sum=0,k;char c;scanf("%d %c",&n,&c);if(n!=0){for(i;;i+=2){sum+=i;if((sum*2+1)>n)break;

2016-09-17 19:50:19 218

原创 1055 集体照

#include#include#include#include#include using namespace std;int j=0;typedef struct skt{ char name[30]; int high;}photo;bool comp(const photo node1,const photo node2){ if(node1.high!

2016-09-17 12:14:33 213

原创 1058 选择题

#include#include#includetypedef struct skt{int score;int a;char c[20];}subject;int main(){int studentnum,choicenum,i,j,sum,max=0,k=0,h=0;char temp[100];int fg[100

2016-09-15 21:27:13 334

原创排序需要多个判断条件的解决方法

while (first < last && !( (stu[last].sumscore > stu[0].sumscore) || (stu[last].sumscore == stu[0].sumscore && stu[last].moral > stu[0].moral) || (stu[last].sumscore == stu[0].s

2016-09-15 16:55:49 355

原创 *1014 福尔摩斯的约会

#includechar * week[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};int main(){int i;char a[61],b[61],c[61],d[61];char *pa=a,*pb=b;gets(a);gets(b);gets(c);gets(d);for(pa,p

2016-09-11 11:44:27 208

原创 1013 数素数

#include#includeint isPrime(int n);int main(){int n,m,i,num=0;scanf("%d%d",&n,&m);for(i=2;;i++){if(n==1){i--;break;}else{if(isPrime(i)){num++;}if(num==n

2016-09-11 09:50:08 203

原创数组顺序移动

数组移动可以看做数组倒序，先把0到n-m-1的倒序，再把n-m到n-1倒序，再把整个数组倒序。就是这么的简洁！！！

2016-09-10 17:29:27 298

原创 1001 A+B Format

1001. A+B Format (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueCalculate a + b and output the sum in standard

2016-09-08 22:34:54 225

原创 1038 统计同成绩的同学

#includeint main(){ int fenshu[101]={0},chafen=0; int num=0,temp=0; scanf("%d",&num); for(int i=0;i<num;i++) { scanf("%d",&temp); if(0100) fenshu[temp]

2016-09-06 23:08:22 306

原创 1039 到底买不买

#include#includeint main(){int i,j;int num1=0,num2=0;char a[1001];char b[1001];gets(a);gets(b);for(i=0;b[i];i++)for(j=0;a[j];j++){if(a[j]==b[i]){a[j]='+';b[i]='+';

2016-09-06 22:41:35 250

原创 1040 有几个PAT

#include #include int main() { char str[100001]; gets(str); int numT = 0; int numAT = 0; int numPAT = 0; for(int i = strlen(str) - 1; i >= 0; --i) { //从字符串后面向前遍历 if(str[i]

2016-09-06 22:02:35 221

原创 1041 考试座位号

#include#includetypedef struct skt{char a[15];int first;int last;}student;int main(){int n,i,k,t,j;scanf("%d",&n);student * p;p=(student *)malloc(n*sizeof(n));for(i

2016-09-06 13:35:37 306

原创 1042 字符统计

#includeint main(){int a[200]={0};int i,k,max=0;char b[1001];gets(b);char *p=b;while(*p){if(*p>='A' && *p{*p=*p-'A'+'a';a[*p]++;}else if(*p>='a' && *p{a[*p]++;}

2016-09-05 23:18:56 289

原创 1043 输出PATest

#includeint main(){char a[1000];gets(a);int num_P=0,num_A=0,num_T=0,num_e=0,num_s=0,num_t=0;char * p=a;while(*p){if(*p=='P')num_P++;else if(*p=='A')num_A++;else if(*p=='T

2016-09-05 21:35:55 326

原创 1044 火星文

#include#includechar * a[13]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec" };char * b[13]={0,"tam", "hel","maa","huh","tou","kes","hei","elo","syy","lok","m

2016-09-04 23:16:33 355 1

原创 1045 快速排序

#include#includeint comp(const void * a,const void * b){return *(int *)a- *(int *)b;}int main(){int n,i,j,k,g=0;int * a;int * b;int tag;scanf("%d",&n);a=(int *)m

2016-09-04 20:56:00 320

原创 1046 划拳

#includeint main(){int n,i;scanf("%d",&n);int a1,a2,b1,b2;int ah=0,bh=0;for(i=0;i{scanf("%d%d%d%d",&a1,&a2,&b1,&b2);if(a2!=a1+b1 && b2==a1+b1)ah++;else if(a2==a1+b1 && b2!=

2016-09-04 11:33:04 290

原创 1047 编程团体赛

#includeint main(){int n;int a[1000]={0};int i;int temp;scanf("%d",&n);int num,va,sourse;for(i=0;i{scanf("%d-%d %d",&num,&va,&sourse);a[num]+=sourse;}for(i=1;i{if(a

2016-09-04 11:03:33 274

原创 1048 数字加密

#include#includeint main(){char a[100],b[100];char c[100];char d[13]={'0','1','2','3','4','5','6','7','8','9','J','Q','K'};int n=0;int len1,len2;int k=1;scanf("%s %s",a,b);le

2016-09-04 09:42:12 500 1

原创 1053 住房空置率

#includeint main(){ int n,d,num,k,day,i,j; double e,ee; int vacancy=0,pro_vacancy=0; scanf("%d%lf%d",&n,&e,&d); for(i=0;i<n;i++) { day=0; scanf("%d",&num); for(j=0;j<num;j++

2016-09-03 15:43:56 313

原创 1054 求平均值

#include#include#includeint judge(char str[]);int main(){ int n; int i; char a[10]; int count=0; double val,sum=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s",a); if(j

2016-09-03 15:42:10 368

原创 1052 卖个萌

#include #include char hand[10][5],eye[10][5],mouse[10][5];int get_symbol(char p[][5]) { char c,i=0,j=0; while( (c=getchar()) !='\n') { if( c == '[') { while(

2016-09-02 21:55:31 511 1

原创 1050 螺旋矩阵

#include#include#includeint chushu(int n);int comp(const void * a,const void * b) //从大到小排序{return *(int *)b-*(int *)a;}int main(){int n;int i,j;int * a;int ** b;

2016-09-02 19:54:14 260

Accepted ALL lve