char *tinypiece(void){
while(1){
/* fprintf(stderr, "%s", global_tmp);*/
/* if(strstr(global_tmp, "AK084006.1")) sw=1; */
/* cp1=strstr(global_tmp,"Query:");*/
/* if (cp1!=NULL) break;*/
if(strncmp(global_tmp,"Query:", 6)==0) break;
if (strncmp(global_tmp,"Query= ", 7)==0) {
/* fprintf(stderr, "found BLAST\n"); */
return "B";
}
if (strncmp(global_tmp," Score =", 8)==0 || global_tmp[0]=='>'
|| strstr(global_tmp,"Database:")!=NULL) {
return "N";
}
fileend=fgets_wrap(0, global_tmp,MAXLETTER-1,fin);
if(fileend==NULL) return NULL;
}
/* get qstart and qstop */
get_numbers(global_tmp,&qstart,&qstop);
fileend=fgets_wrap(__LINE__, global_tmp,MAXLETTER-1,fin);
fileend=fgets_wrap(__LINE__, global_tmp,MAXLETTER-1,fin);
if(fileend==NULL) return NULL;
/* get dstart and dstop */
get_numbers(global_tmp,&dstart,&dstop);
/*printf("qstart=%ld, qstop=%ld, dstart=%ld, dstop=%ld\n",*qstart,*qstop,*dstart,*dstop);*/
return "1";
}
t_graphe *parcours_largeur(t_graphe* graphe, int s)
{
int *visite;
int *visite2;
int *names;
t_graphe *T;
t_ch_ch_int *ttmp;
t_ch_int *tmp;
T = init(GO);
visite = get_visite(graphe->taille);
visite2 = get_visite(graphe->taille);
names = get_numbers(graphe);
visite[get_index(s, names, graphe->taille)] = 2;
for (ttmp = graphe->graphe; ttmp != NULL; ttmp = ttmp->next)
{
if (visite[get_index(ttmp->number, names, graphe->taille)] == 2)
{
visite[get_index(ttmp->number, names, graphe->taille)] = 1;
for (tmp = ttmp->liste; tmp != NULL; tmp = tmp->next)
if (visite[get_index(tmp->number, names, graphe->taille)] == 0)
{
ajouterArc(T, ttmp->name, tmp->name, tmp->data);
visite[get_index(tmp->number, names, graphe->taille)] = 2;
}
ttmp = graphe->graphe;
}
}
return (T);
}
main(){
make_linked_list();
get_numbers();
get_scale();
calculate_sum();
print_result();
getch();
}
Autocorrect::Autocorrect(){
// get dictionary: fills global dictionary list
get_dictionary();
get_numbers();
}
int main(int argc, char *argv[])
{
int num1, num2, a, b, result, quit;
quit = 0;
while(result = get_numbers(&num1, &num2, &quit))
{
if(result == 1)
{
if(num1 % 2 == 0)
{
if(num1 % 4 != 0)
printf("Bachelor Number.\n");
else
{
if(num1 >= 0)
printf("%d %d\n", num1 / 4 + 1, num1 / 4 - 1);
else
printf("%d %d\n", -1 - num1 / 4, 1 - num1 / 4);
}
}
else
if(num1 >= 0)
printf("%d %d\n", num1 / 2 + 1, num1 / 2);
else
printf("%d %d\n", -num1 / 2, 1 - num1 / 2);
}
else if(result == 2)
{
if(num2 >= 0 && num1 >= 0)
{
num2 = (num2 + 2) / 4;
num1 = (num1 + 1) / 4;
printf("%d\n", num2 - num1);
}
else if(num2 > 0 && num1 < 0)
{
num2 = (num2 + 2) / 4;
num1 = (2 - num1) / 4;
printf("%d\n", num1 + num2);
}
else if(num2 <= 0 && num1 <= 0)
{
num2 = (1 - num2) / 4;
num1 = (2 - num1) / 4;
printf("%d\n", num1 - num2);
}
}
if(quit)
break;
}
return 0;
}
int main(int argc,char *argv[]){
int *rows[ROWS];
int i,j;
char s[ROWS*3];
for(i=0;i<ROWS;i++){
gets(s);
rows[i]=get_numbers(s,i+1);
}
//printf("The highest sum by recursion is %d\n",get_highest_sum_recursive(rows,0,0,ROWS));
printf("The highest sum by bottom-up is %d\n",get_highest_sum(rows,ROWS));
return 0;
}
// The sentence may contain several operations.
// mFoundWord will be gauranteed to be part of the sentence (b/c it was from evaluate_sentence() )
int Parse_One_Statement( Sentence& mSentence, float& first_number, float& second_number, float& final_answer )
{
string tmp;
final_answer=0.0;
int result = mSentence.regex_find(Plus_expression);
if (result) {
// printf("Found PLUS\t");
get_numbers( mSentence.m_sentence.regex_matches, first_number, second_number );
final_answer = first_number + second_number;
return result;
}
result = mSentence.regex_find(Minus_expression); // will find any matching multiply Word too.
if (result)
{
// printf("Found MINUS\n");
get_numbers( mSentence.m_sentence.regex_matches, first_number, second_number );
final_answer = first_number - second_number;
return result;
}
result = mSentence.regex_find( Multiply_expression );
if (result) {
get_numbers( mSentence.m_sentence.regex_matches, first_number, second_number );
final_answer = first_number * second_number;
return result;
}
result = mSentence.regex_find( Divide_expression );
if (result) {
get_numbers( mSentence.m_sentence.regex_matches, first_number, second_number );
if (second_number!=0.0)
final_answer = first_number / second_number;
else
final_answer = FLT_MAX;
return result;
}
return result;
}
int main(){
srand(time(0));
get_numbers();
hits = 0;
misses = 0;
writes = 0;
access_file();
printf("hits: %d, misses: %d, writes: %d\n", hits, misses, writes);
//printf("num read: %d in %lf\nnum write: %d in %lf\n", bytes_read, read_time/CLOCKS_PER_SEC, bytes_write, write_time/CLOCKS_PER_SEC);
//double mbps_r = (bytes_read/read_time)*CLOCKS_PER_SEC/(1000000);
//double mbps_w = (bytes_write/write_time)*CLOCKS_PER_SEC/1000000;
//printf("Read MB/s: %lf\tWrite MB/s: %lf\n", mbps_r, mbps_w);
}
static gboolean
newer_version (const gchar *v1,
const gchar *v2,
gboolean with_micro)
{
gboolean newer = FALSE;
gint major1, minor1, micro1;
gint major2, minor2, micro2;
if (v1 == NULL || v2 == NULL)
return FALSE;
if (with_micro)
{
get_numbers (v1, &major1, &minor1, µ1);
get_numbers (v2, &major2, &minor2, µ2);
}
else
{
get_numbers (v1, &major1, &minor1, NULL);
get_numbers (v2, &major2, &minor2, NULL);
}
if (major1 > major2)
{
newer = TRUE;
}
else if (minor1 > minor2 && major1 == major2)
{
newer = TRUE;
}
else if (with_micro && micro1 > micro2 && minor1 == minor2)
{
newer = TRUE;
}
return newer;
}
void add_entry()
{
int slot;
int curr_char;
char in_char;
slot = find_free ();
if ( slot == -1 )
{
printf ("\nDatabase full !!");
return;
} /* if */
printf ("Enter name ----> ");
gets (account[slot].name);
printf ("Enter street ----> ");
gets (account[slot].street);
printf ("Enter city ----> ");
gets (account[slot].city);
printf ("Enter deposit ----> ");
scanf ("%f", &account[slot].balance);
fflush(stdin);
printf ("Enter phone number { (ac)num-numm } ---->(");
get_numbers(&account[slot].phonenum[0],3);
printf(")-");
get_numbers(&account[slot].phonenum[3],3);
printf("-");
get_numbers(&account[slot].phonenum[6],4);
printf("\n");
printf ("Enter SS number { ###-##-#### } ---->");
get_numbers(&account[slot].ssnum[0],3);
printf("-");
get_numbers(&account[slot].ssnum[3],2);
printf("-");
get_numbers(&account[slot].ssnum[5],4);
printf("\n");
} /* add_entry */
int main(void)
{
int i,j;
int square[ROWS][COL];
get_numbers(square);
printf("Your square is\n");
for (i = 0; i < ROWS; i++){
for (j = 0; j < COL; j++){
printf("%d ", square[i][j]);
}
printf("\n");
}
return 0;
}
t_info *parseur_argv(int ac, char **av)
{
t_info *info;
if (ac < 5)
{
printf("Error : Too few arguments entered\nPlease enter at least 4\n");
exit (84);
}
else
{
info = malloc(sizeof(t_info));
info->flags = get_flags(ac, av);
info->numbers = get_numbers(ac, av);
check_ratio(ac, av);
return (info);
}
}
int calc_connexes(t_graphe* graphe, t_ch_ch_int** conx)
{
t_ch_ch_int *ttmp;
int *visite;
int *names;
int count;
count = 0;
visite = get_visite(graphe->taille);
names = get_numbers(graphe);
*conx = xmalloc(sizeof(**conx));
for (ttmp = graphe->graphe; ttmp != NULL; ttmp = ttmp->next)
if (visite[get_index(ttmp->number, names, graphe->taille)] != 1)
count += add_row(connex_of(graphe, ttmp->name, &visite, names), conx, compare_ens);
free(names);
free(visite);
return (count);
}
main() {
struct tm tm;
struct timeval t0, t1;
char mdate[20];
char mtime[20];
time_t t;
suseconds_t ut0, ut1;
/* Get current time */
gettimeofday(&t0, NULL);
t=t0.tv_sec;
ut0=t0.tv_usec;
localtime_r(&t, &tm);
strftime(mdate, 128, DATE_FORMAT, &tm);
strftime(mtime, 128, TIME_FORMAT, &tm);
printf("\n\n%s %s - Start of MOR Auto-Dialer Cron script.\n", mdate, mtime);
read_config();
if (!mysql_connect())
return 0;
if ((get_campaigns(mtime) < 0) || (total_campaigns == 0))
return 0;
get_numbers();
execute_numbers();
mysql_close(&mysql);
gettimeofday(&t1, NULL);
ut1=t1.tv_usec;
printf("End of MOR Auto-Dialer Cron script.\nTotal campaigns: %i, total numbers: %i\nExecution time: %f s\n\n", total_campaigns, total_numbers, (float) (ut1-ut0)/1000000);
//gets(NULL);
}
static void
array_tests(void)
{
int m[2][3][4] =
{
{{1, 2, 3, 4}, {-1, -3, -5, -7}, {0, 2, 4, 6}},
{{1, -2, 3, -4}, {2, 3, 5, 7}, {-4, -1, -14, 4114}}
};
int c[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int c2[] = {10, 100, 200};
int c3[20];
vector_t vs[2] = {{1, -2, 3}, {4, -5, -6}};
cps_t cps;
cpsc_t cpsc;
cs_t *cs;
int n;
int ca[5] = {1, -2, 3, -4, 5};
doub_carr_t *dc;
int *pi;
pints_t api[5];
numbers_struct_t *ns;
refpint_t rpi[5];
if (!old_windows_version)
{
const char str1[25] = "Hello";
ok(cstr_length(str1, sizeof str1) == strlen(str1), "RPC cstr_length\n");
}
ok(sum_fixed_int_3d(m) == 4116, "RPC sum_fixed_int_3d\n");
ok(sum_conf_array(c, 10) == 45, "RPC sum_conf_array\n");
ok(sum_conf_array(&c[5], 2) == 11, "RPC sum_conf_array\n");
ok(sum_conf_array(&c[7], 1) == 7, "RPC sum_conf_array\n");
ok(sum_conf_array(&c[2], 0) == 0, "RPC sum_conf_array\n");
ok(sum_conf_ptr_by_conf_ptr(1, c2, c) == 45, "RPC sum_conf_ptr_by_conf_ptr\n");
ok(sum_conf_ptr_by_conf_ptr(3, c2, c) == 345, "RPC sum_conf_ptr_by_conf_ptr\n");
c2[0] = 0;
ok(sum_conf_ptr_by_conf_ptr(3, c2, c) == 300, "RPC sum_conf_ptr_by_conf_ptr\n");
ok(sum_unique_conf_array(ca, 4) == -2, "RPC sum_unique_conf_array\n");
ok(sum_unique_conf_ptr(ca, 5) == 3, "RPC sum_unique_conf_array\n");
ok(sum_unique_conf_ptr(NULL, 10) == 0, "RPC sum_unique_conf_array\n");
get_number_array(c3, &n);
ok(n == 10, "RPC get_num_array\n");
for (; n > 0; n--)
ok(c3[n-1] == c[n-1], "get_num_array returned wrong value %d @ %d\n",
c3[n-1], n);
ok(sum_var_array(c, 10) == 45, "RPC sum_conf_array\n");
ok(sum_var_array(&c[5], 2) == 11, "RPC sum_conf_array\n");
ok(sum_var_array(&c[7], 1) == 7, "RPC sum_conf_array\n");
ok(sum_var_array(&c[2], 0) == 0, "RPC sum_conf_array\n");
ok(dot_two_vectors(vs) == -4, "RPC dot_two_vectors\n");
cs = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(cs_t, ca[5]));
cs->n = 5;
cs->ca[0] = 3;
cs->ca[1] = 5;
cs->ca[2] = -2;
cs->ca[3] = -1;
cs->ca[4] = -4;
ok(sum_cs(cs) == 1, "RPC sum_cs\n");
HeapFree(GetProcessHeap(), 0, cs);
n = 5;
cps.pn = &n;
cps.ca1 = &c[2];
cps.n = 3;
cps.ca2 = &c[3];
ok(sum_cps(&cps) == 53, "RPC sum_cps\n");
cpsc.a = 4;
cpsc.b = 5;
cpsc.c = 1;
cpsc.ca = c;
ok(sum_cpsc(&cpsc) == 6, "RPC sum_cpsc\n");
cpsc.a = 4;
cpsc.b = 5;
cpsc.c = 0;
cpsc.ca = c;
ok(sum_cpsc(&cpsc) == 10, "RPC sum_cpsc\n");
ok(sum_toplev_conf_2n(c, 3) == 15, "RPC sum_toplev_conf_2n\n");
ok(sum_toplev_conf_cond(c, 5, 6, 1) == 10, "RPC sum_toplev_conf_cond\n");
ok(sum_toplev_conf_cond(c, 5, 6, 0) == 15, "RPC sum_toplev_conf_cond\n");
dc = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(doub_carr_t, a[2]));
dc->n = 2;
dc->a[0] = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(doub_carr_1_t, a[3]));
dc->a[0]->n = 3;
dc->a[0]->a[0] = 5;
dc->a[0]->a[1] = 1;
dc->a[0]->a[2] = 8;
dc->a[1] = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(doub_carr_1_t, a[2]));
dc->a[1]->n = 2;
dc->a[1]->a[0] = 2;
dc->a[1]->a[1] = 3;
ok(sum_doub_carr(dc) == 19, "RPC sum_doub_carr\n");
HeapFree(GetProcessHeap(), 0, dc->a[0]);
HeapFree(GetProcessHeap(), 0, dc->a[1]);
HeapFree(GetProcessHeap(), 0, dc);
dc = NULL;
make_pyramid_doub_carr(4, &dc);
ok(check_pyramid_doub_carr(dc), "RPC make_pyramid_doub_carr\n");
free_pyramid_doub_carr(dc);
ok(sum_L1_norms(2, vs) == 21, "RPC sum_L1_norms\n");
memset(api, 0, sizeof(api));
pi = HeapAlloc(GetProcessHeap(), 0, sizeof(*pi));
*pi = -1;
api[0].pi = pi;
get_numbers(1, 1, api);
ok(api[0].pi == pi, "RPC conformant varying array [out] pointer changed from %p to %p\n", pi, api[0].pi);
ok(*api[0].pi == 0, "pi unmarshalled incorrectly %d\n", *api[0].pi);
if (!old_windows_version)
{
ns = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, FIELD_OFFSET(numbers_struct_t, numbers[5]));
ns->length = 5;
ns->size = 5;
ns->numbers[0].pi = pi;
get_numbers_struct(&ns);
ok(ns->numbers[0].pi == pi, "RPC conformant varying struct embedded pointer changed from %p to %p\n", pi, ns->numbers[0].pi);
ok(*ns->numbers[0].pi == 5, "pi unmarshalled incorrectly %d\n", *ns->numbers[0].pi);
HeapFree(GetProcessHeap(), 0, ns);
}
HeapFree(GetProcessHeap(), 0, pi);
pi = HeapAlloc(GetProcessHeap(), 0, 5 * sizeof(*pi));
pi[0] = 3; rpi[0] = &pi[0];
pi[1] = 5; rpi[1] = &pi[1];
pi[2] = -2; rpi[2] = &pi[2];
pi[3] = -1; rpi[3] = &pi[3];
pi[4] = -4; rpi[4] = &pi[4];
ok(sum_complex_array(5, rpi) == 1, "RPC sum_complex_array\n");
HeapFree(GetProcessHeap(), 0, pi);
}
