정보 셤범위 답

//1250

int f() {
    int idx = 1, MAX = d[0];
    for(int i=0; i<n; i++) {
        if(d[i] > MAX) {
            M = d[i];
            idx = i+1;
        }
    }

    return idx;
}

//1251

long long int f() {
    long long int MAX = 0;
    for(int i=1; i<=n; i++) {
        MAX = d[i]>MAX?d[i]:MAX;
    }

    long long int ans = MAX;
    for(int i=1; i<=n; i++) {
        if(d[i] < ans) {
            ans = d[i];
        }
    }

    return ans;
}

//1252

void f(int k) {
    if(x == 1) {
        printf("hello");
    } else {
        printf("world");
    }
}

//1253

void f(int k) {
    printf(k%2==0?"even":"odd");
}

//1254

void f(int n) {
    if((bool)n) {
        printf("true");
    } else {
        printf("false");
    }
}

//1255

void f(int k) {
    if(!k) {
        printf("zero");
    } else {
        printf("non zero");
    }
}

//1256

void f(int k) {
    if(!k) {
        printf("zero");
    } else {
        if(k>0) {
            printf("positive");
        } else {
            printf("negative");
        }
    }
}

//1257

void f(int k) {
    int count = 0;
    for(int i=2; i<k; i++) {
        if(k%i==0) {
            count++;
        }
    }

    if(k == 1 || count >= 1) {
        printf("composite");
    } else {
        printf("prime");
    }
}

//1258

void f(int k) {
    while(k--) {
        printf("love\n");
    }
}

//1259

void f(int k) {
    for(int i=1; i<=k; i++) {
        printf("*");
    }
}

//1260

bool zero(int k) {
    return !k;
}

//1261

bool zero(int k) {
    return !k;
}

bool plus(int k) {
    return k > 0 ? 1 : 0;
}

//1262

bool prime(int k) {
    int count = 0;
    for(int i=2; i<k; i++) {
        if(k%i==0) {
            count++;
        }
    }

    return !count;
}

//1263

char grade(int k) {
    if(k >= 90) {
        return 'A';
    } else if(k >= 80) {
        return 'B';
    } else if(k >= 70) {
        return 'C';
    } else if(k >= 60) {
        return 'D';
    } else {
        return 'F';
    }
}

//1264

long long int abs(long long int k) {
    return k >= 0 ? k : -k;
}

//1265

int sqrt(long long int k) {
    int ans = 0;
#include <stdio.h>

int a, b;

int gcd(int p, int q){ if(p==0) return q; return gcd(q%p, p);}

long long int lcm(int, int);

int main()
{
  scanf("%d%d", &a, &b);
  printf("%lld\n", lcm(a, b));
}

        return -1;
    } else {
        return i;
    }
}

//1267

int f(float k) {
    return (int)k;
}

//1268

double f(double k) {
    return k - (long long int)k;
}

//1269

long long int f(double k) {
    long long int t = (long long int)k;

    if(k<= t) {
        return t;
    } else {
        return t+1;
    }
}

//1270

long long int f(double x) {
  long long int t=(long long int)x;

  if(t>x) {
    return x-1;
  } else {
    return x;
  }
}

//1271

long long int f(int k) {
    long long int sum = 0;
    for(int i=1; i<=k; i++)
        sum += i;

    return sum;
}

//1272

long long int f(int k) {
    long long int sum = 1;
    for(int i=1; i<=k; i++)
        sum *= i;

    return sum;
}

//1273

int f(int k) {
    int count = 0;
    for(int i=1; i<=k; i++)
        if(k%i==0) count++;

    return count;
}

//1274

long long int f(long long int n) {
	while(n>9)
	{
		printf("%d", n%10);
		n /= 10;
	}
	return n;
}

//1275

long long int f(int p, int q) {
  return (long long int)p+q;
}

//1276

long long int f(long long int p, long long int q) {
    long long int MAX = p>q?p:q;
    long long int MIN = p<q?p:q;

    return MAX - MIN;
}

//1277

int max(int p, int q) {
    return p > q ? p : q;
}

//1278

int min(int p, int q) {
    return p < q ? p : q;
}

//1279

int mid(int p, int q, int k) {
    return p+q+k-max(p, max(q, k))-min(p, min(q, k));
}

//1280

int gcd(int a, int b) {
	int ans=0;
	for(int i=1; i<=100000; i++) {
		if(a%i==0 && b%i==0) {
			ans = i;
		}
	}

	return ans;
}

//1281

long long int lcm(int p, int q) {
    return p*q/gcd(p, q);
}

//1282

long long int pow(int a, int n)
{
	long long int ans = 1;
	if(a == 1) {
		ans = 1;
	} else {
		for(int i=1; i<=n; i++) {
			ans *= a;
		}
	}
	
	return ans;
}

//1283

long long int subsetsum(int a, int b)
{
	long long int ans=0;
	for(long long int i=a; i<=b; i++) {
		ans += d[i];
	}
	return ans;
}

//1284

int maxi(int a, int b) 
{
	int i = a;
	for (int j = a+1; j <= b; j++) 
		if (d[i] < d[j]) 
			i = j;
	return i;
}

//1285

int findi(int a)
{
	for (int i = 1; i <= n; i++) {
	    if (d[i] == a) {
            return i;    
        }
	}
	return -1;
}

//1286

int lower_bound(int k)
{
    int i, result=0;
    for(i=1; i<=n; i++) {
        if(d[i] >= k) {
            return i;
            break;
        }
    }
    return n+1;
}

//1287

int upper_bound(int k)
{
    int i, result=0;
    for(i=1; i<=n; i++) {
        if(d[i] > k) {
            return i;
            break;
        }
    }
    return n+1;
}