int fun3(int g, int h) {
if (g > h) {
return fun4(g - 1, h + 1);
} else {
return h - g;
}
}
int main()
{
int i;
for (i = 0; i < 256; i++)
chartest[i].c = i;
chartest[0].c = 0; /* chartest-done */
Fun1(foo1);
Fun2(foo2);
Fun3(foo3);
Fun4(foo4);
Fun5(foo5);
Fun6(foo6);
Fun7(foo7);
Fun8(foo8);
Fun9(foo9);
Fun10(foo10);
Fun11(foo11);
Fun12(foo12);
Fun13(foo13);
Fun14(foo14);
Fun15(foo15);
Fun16(foo16);
Fun17(foo17);
Fun18(foo18);
/* An (almost-)infinite loop that first clears all the variables and then
calls each function. This "hack" is to make testing random
functions easier - "advance funN" is guaranteed to have always
been preceded by a global variable clearing zed call.
We don't let this run forever in case gdb crashes while testing,
we don't want to be left eating all cpu on the user's system. */
for (i = 0; i < 1000000; ++i)
{
zed ();
L1 = fun1();
L2 = fun2();
L3 = fun3();
L4 = fun4();
L5 = fun5();
L6 = fun6();
L7 = fun7();
L8 = fun8();
L9 = fun9();
L10 = fun10();
L11 = fun11();
L12 = fun12();
L13 = fun13();
L14 = fun14();
L15 = fun15();
L16 = fun16();
L17 = fun17();
L18 = fun18();
}
return 0;
}
void fun4(char* str, int i, int j)
{
if(i <= j)
{
fun4(str, i+1, j);
fun2(str, i, j, 1);
}
}
int main() {
int m, n;
fun4();
while(~scanf("%d%d", &m, &n)) {
printf("%d\n", fun(m, n));
}
return 0;
}
int main(void)
{
fun1();
fun2();
fun3();
fun4();
return 0;
}
int main()
{
int num;
printf("please enter a number ：");
scanf("%d",&num);
printf("fun 1 return %d\n",fun1(num));
printf("fun 2 return %d\n",fun2(num));
printf("fun 3 return %d\n",fun3(num));
printf("fun 4 return %d\n",fun4(num));
return 0;
}
int main() {
XXX;
fun1();
XXX;
volatile int a = fun2();
XXX;
volatile int b = fun3(a);
XXX;
volatile int c = fun4(a, b);
XXX;
volatile int d = fun5(0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15);
XXX;
return 0;
}
void test1 () {
struct V {
float x = 1.0f;
float GetX() const { return x; }
V() {}
} const v;
Class c;
const Class cc;
Fun< int (int) > fun0;
Fun< int (int) > fun1(&Twice);
Fun< int (int) > fun2(&Class::Twice);
Fun< int () > fun3(&VoidParam);
Fun< int () > fun4(&Class::VoidParam);
Fun< int () > fun5(&Class::VoidParamConst);
Fun< void(int&) > fun6(&Class::Void);
Fun< int (int) > fun7((Functor()));
auto fun8(RetFun());
Fun< float (int, int) > fun9([=](int i, int j) {return float(i/j);});
Fun< float (int, int) > fun10(fun9);
Fun< float () > fun11([v](){return v.GetX();});
Fun< void() > vd;
try {
fun0(9); //must throw
assert(false);
} catch(...) {}
fun0 = fun1;
assert(fun0(2) == fun1(2));
assert(fun1(2) == 4);
assert(fun2(c, 3) == 6);
assert(fun5(cc) == 2);
assert(fun7(6) == 18);
assert(fun8(7) == 21);
assert(fun9(10,4) == float(10/4));
assert(fun10(20, 8) == fun9(20, 8));
assert(fun11() == 1.0f);
//void return type
int i = 0;
fun6(c, i);
assert(i == 1234);
}
int main(void) {
int N, M,i ,j ,k , m , n;
char *str;
//char a[8] = "ABCDEFG";
//printf("%s\r\n", a);
//fun4(a,2,3);
//printf("%s\r\n", a);
int a,b,c;
while(scanf("%d", &N) != EOF)
{
if(scanf("%d", &M) != EOF)
{
if(NULL == (str = (char*)malloc(sizeof(char)*(N+1))))
{
return 0;
}
scanf("%s", str);
printf("%s\r\n", str);
char **array = (char**)malloc(sizeof(char*)*M);
for(i = 0; i < M; i++)
{
array[i] = (char*)malloc(sizeof(char)*20);
gets(array[i]);
gets(array[i]);
printf("%s\r\n", array[i]);
k = 0;
while(array[i][k] != ' ')
k++;
printf("k = %d \r\n", k);
while(array[i][k] == ' ')
k++;
printf("k = %d \r\n", k);
if(array[i][k] == '1')
{
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
a = array[i][k] -'0';
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
b = array[i][k]-'0';
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
c = array[i][k];
printf("%d %d %c\r\n",a,b,c);
fun1(str,a,b,c);
}
else if(array[i][k] == '2')
{
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
a = array[i][k]-'0';
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
b = array[i][k]-'0';
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
c = array[i][k]-'0';
fun2(str,a,b,c);
}
else if(array[i][k] == '3')
{
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
a = array[i][k]-'0';
fun3(str,a,N);
}
else if(array[i][k] == '4')
{
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
a = array[i][k]-'0';
while(array[i][k] != ' ')
k++;
while(array[i][k] == ' ')
k++;
b = array[i][k]-'0';
fun4(str,a,b);
}
}
printf("%s",str);
}
}
return 0;
}
int
main (void)
{ /* main.1 */
fun4 (); /* main.2 */
return 0; /* main.3 */
} /* main.4 */
int fun3() {
set_bp();
return fun4();
}
