int main() { int cases; scanf("%d",&cases); while(cases--) { intialize(); int dim; scanf("%d",&dim); while(dim--) { int num; scanf("%d",&num); if(arr[num%10]>=1) { count++; arr[num%10]++; } else arr[num%10]++; } printf("%d\n",count); } return 0; }
void main(void) { DDRE=0xFF; //DDRE |= (1<<PE3) | (1<<PE4) | (1<<PE5); //int x=63; intialize(); while(1) { servo(1,60); _delay_ms(500); servo(1,150); _delay_ms(500); } }
void f( ) { vector<int> v; // The following could result in v being initialized out of // sequence intialize(v) = prompt_user( ), prompt_user( ); }
int main(int argc, char *argv[]) { char str[MAX_LINE_LEN],query[MAX_QLEN]; char strtmp[MAX_LINE_LEN]; int i=0,j=0,k=0,count=0,count_l=1,count_b=0,m,z; int q_len=0,s_len=0,n=0,cq=0,p,sl; int q_index=0,arr[MAX_QLEN][MAX_QLEN]; char c,str2[MAX_LINE_LEN],q[MAX_QLEN]; ranker_t ranked[MAX_LINES_OUT]; double count_same=0.0,max_count=0.0; double count_s=0.0,max_c=0.0,count_al=0.0; q_len=strlen(argv[1]); inarr(arr,q_len); strcpy(query,argv[1]); intialize(ranked); /*Stage 0*/ while((c=getchar())!=EOF) { str[i]=c; i++; } s_len=strlen(str); if(q_len==0) { printf("Enter a valid query"); exit(EXIT_FAILURE); } if(q_len>MAX_QLEN) { printf("The query is too long"); exit(EXIT_FAILURE); } if(s_len==0) { printf("Enter a valid string"); exit(EXIT_FAILURE); } if(s_len>MAX_LINE_LEN) { printf("The string is too long"); exit(EXIT_FAILURE); } printf("S0: query = %s",query); printf("\n---\n"); /*Stage 1*/ for(i=0;str[i]!='\0';i++) { /*Stage 1*/ count_b++; if(str[i]!='\n') { strtmp[count++]=str[i]; } printf("%c",str[i]); /*Stage 2*/ for(j=0;query[j]!='\0';j++) { k=i; count_same=0.0; q_index=j; while(tolower(str[k])==tolower(query[q_index])&&str[k]!='\0'&& query[q_index]!='\0'&&str[k]!='\n'&& query[q_index]!='\n') { count_same++; k++; q_index++; } if(max_count<count_same) { max_count=count_same; } } if(str[i]=='\n') { strtmp[count]='\0'; ranking(ranked,strtmp,max_count,count_l); printf("S1: line %4d, bytes = %d\n",count_l,count_b-1); printf("S2: line %4d, score= %7.3f\n",count_l,max_count); printf("---\n"); count=0; strcpy(strtmp,""); count_l++; count_b=0; max_count=0; } } /*Stage 3*/ printf("-----------------------------------------------------\n"); printer(ranked); /*End of Stage 3*/ //Stage 4 starts here inarr(arr,cq); count_l=1; int count2=0.0;double score=0.0; n=0; for(i=0;str[i]!='\0';i++) { if(isalnum(str[i])) { str2[count2++]=str[i]; } if(str[i]=='\n') { str2[count2++]=str[i]; } } str2[count2]='\0'; sl=strlen(str2); count2=0; for(i=0;i<q_len;i++) { if(isalnum(query[i])) { q[count2++]=query[i]; } } cq=strlen(q); int tmpr=0,tmpc=0; for(i=0;str[i]!='\0';i++) { n++; for(j=0;q[j]!='\0';j++) { k=i; q_index=j; while((tolower(q[q_index]))==(tolower(str[k]))) { arr[j][q_index]++; q_index++; k++; } } if(str[i]=='\n') { if(DEBUG) { prinarr(arr,cq,q); } score=comparr(arr,n-1,cq); printf("S4: line %4d, score= %7.3f\n",count_l,score); printf("---\n"); count=0; strcpy(strtmp,""); count_l++; score=0.0; inarr(arr,cq); n=0; } } return 0; }