20250802
/*#include <stdio.h>
int n, d[110];
int f ()
{
int max=d[0],loc=1,i;
for (i=0;i<n;i++)
{
if (d[i]>max)
{
loc=i+1;
max=d[i];
}
}
return loc;
}
int main()
{
scanf("%d", &n);
for(int i=0; i<n; i++)
scanf("%d", &d[i]);
printf("%d", f());
return 0;
}
*//*
#include <stdio.h>
int n, d[100010], k;
int f ()
{
int i,loc=-1;
for (i=1;i<=n;i++)
{
if (d[i]==k)
{
loc=i;
break;
}
}
return loc;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d", &k);
printf("%d\n", f(k));
}*///*********************
/*#include <stdio.h>
///쉬는시간 아님
int n, a, b, d[1010];
long long int subsetsum(int a,int b)
{
long long int sum=0,i;
for (i=a;i<=b;i++)
{
sum+=d[i];
}
return sum;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d%d", &a, &b);
printf("%lld\n", subsetsum(a, b));
}*//*
#include <stdio.h>
int n, k, d[1010];
int lower_bound(int k)
{
int i,lov=n+1;
for (i=1;i<=n;i++)
{
if (d[i]>=k)
{
lov=i;
break;
}
}
return lov;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d", &k);
printf("%d\n", lower_bound(k));
}*/
#include <stdio.h>
int