int main()
{
boost::shared_ptr<const MyStruct> q = boost::make_shared<const MyStruct>(100);
put(q);
std::function<void (int)> fn = [](int x) {std::cout << "x = " << x << std::endl;};
mmm(12345, fn);
int *p = nullptr;
foo(p);
const int* p2 = nullptr;
foo(p2);
int n = 100;
foo(n);
int& n1 = n;
foo(n1);
const int& n2 = n1;
foo(n2);
int a = 10;
const int b = 20;
funcA(a);
funcA(b);
funcB(a);
funcB(b);
func0(a);
//func0(b);
func1(a);
func1(b);
std::cout << "\n------------- mmmm2 -------------\n";
int x = 100;
mmmm2(x);
int *px = &x;
mmmm2(px);
const int* px2 = &x;
mmmm2(px2);
return 0;
}
float funcA(float input) {
float a=-2;
funcB(input);
count++;
a++;
return input;
}
main() {
#pragma omp parallel sections
{
#pragma omp section
(void) funcA();
#pragma omp section
(void) funcB();
}
}
int main(int argc, char const *argv[])
{
bin(funcA(2));
putchar('\n');
bin(funcB(4,4));
putchar('\n');
return 0;
}
int main()
{
#pragma omp parallel num_threads(4)
{
#pragma omp sections
{
#pragma omp section
(void) funcA();
#pragma omp section
(void) funcB();
} /* -- End of sections block -- */
} /* -- End of parallel region -- */
}
/**
* En ganska standard rekursiv funktion, alla möjliga sätt att lösa det på testas.
* När strängen blir abcde eller ABCDE har en lösning hittats och sedan kollas om det är bästa lösningen.
**/
int robocop(char s[5],int nrofmoves)
{
char str[6];
strcpy(str,s);
if(strcmp(str,"abcde") == 0 || strcmp(str,"ABCDE") == 0)
{
if(best > nrofmoves)
{
printf("%s nr: %d\n",str,nrofmoves);
best = nrofmoves;
limit = best;
return 0;
}
}
if(nrofmoves < limit)
{
robocop(funcB(str),nrofmoves+1);
robocop(funcS(str),nrofmoves+1);
}
return 0;
}
_Bool main() {
//Declare variables
int num;
printf("The game is afoot.\n");
printf("The little dog laughed, to see such sport\n");
printf("And the dish ran away with the spoon\n");
printf("Enter 1, 2, or 3, anything else will end program\n");
scanf("%d", &num);
if (num == 1) {
return funcA();
}
else if (num == 2) {
return funcB();
}
else if (num == 3) {
return funcC();
}
else {
printf("The game is no longer afoot.\n");
}
}
int main(void) {
/* A function wrapper to a member variable of a class */
CAnyData<int> dataA{2016};
std::function<int(CAnyData<int>&)> funcA = &CAnyData<int>::m_value;
std::cout << funcA(dataA) << std::endl;
/* A function wrappter to member function without parameter passing */
CAnyData<float> dataB{2016.1};
std::function<void(CAnyData<float>&)> funcB = &CAnyData<float>::print;
funcB(dataB);
/* A function wrappter to member function with passing a parameter */
std::function<void(CAnyData<float>&, float)> funcC =
&CAnyData<float>::printAfterAdd;
funcC(dataB, 0.1);
/* A function wrappter to member function generated by std::bind */
std::function<void(float)> funcD =
std::bind(&CAnyData<float>::printAfterAdd, &dataB, std::placeholders::_1);
funcD(0.2);
return 0;
}
int main()
{
int itr;
int nCount; /* 문제의 테스트 케이스 */
scanf("%d", &nCount); /* 테스트 케이스 입력 */
for(itr=0; itr<nCount; itr++)
{
printf("#testcase%d\n",itr+1);
max_a = 0;
max_b = 0;
min_a = 0;
min_b = 0;
int a, b;
scanf("%d %d", &a, &b);
funcA(a);
funcB(b);
printf("%d %d\n", min_a + min_b, max_a + max_b);
/*
알고리즘이 들어가는 부분
*/
}
return 0; /* 반드시 return 0으로 해주셔야합니다. */
}
void funcA()
{
funcB();
}
int funcA() {
return funcB();
}
int funcC() {
return funcB();
}
