Codeforces Round #138 (Div. 2)

A. Parallelepiped

#include <iostream>#include <cmath>using namespace std;int main(){    long long abc,ab,bc,ac,a,b,c;    cin>>ab>>bc>>ac;    abc=sqrt(ab*bc*ac);    a=abc/bc;    b=abc/ac;    c=abc/ab;    cout<<4*(a+b+c)<<endl;    return 0;}

B. Array

#include <iostream>#include <cstring>using namespace std;int main(){    int a[100005],inp[100005];    int n,k,i,m,l,r;    cin>>n>>k;        memset(inp,0,sizeof(inp));    for(i=1,m=0,l=1,r=1;i<=n;i++)    {        cin>>a[i];        if(m!=k)        {            if(inp[a[i]]==0) m++;            inp[a[i]]=i;            r=i;        }    }    for(i=1;i<=n;i++)    {        if(inp[a[i]]==i) {l=i;break;}    }    if(m==k) cout<<l<<" "<<r<<endl;    else    cout<<-1<<" "<<-1<<endl;    return 0;}