OJ Board

#include <stdio.h>
typedef long long ll;
int convert(int n,int b)
{
int p=1,sum=0;
while(n)
{
sum+=((n%10)*(p));
n/=10;
p*=b;
}
return sum;
}

int high(int n)
{
int hig=0,a;
while(n)
{
a=n%10;
if(hig<a)
hig=a;
n/=10;
}
return hig;
}
int main()
{
int t,a,b,c,max,d,i;
scanf("%d",&t ...

#include <stdio.h>
#include <algorithm>
using namespace std;
struct node{
int a,b;
}arr[10];

int main()
{
for(i=0;i<10;i++)
{
arr[i].a=i+10;
arr[i].b=i+12;
}
int it=(int)(upper_bound(arr,arr+10,10)-arr);
printf("the position is %d");
}


Do not work

Have any tricky
I think it is a normal Number theory.

But i get WA