OJ Board

Hi , prove this trivial case: the correct outputs:

Why am i getting TLE?

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

#define MSG(a) cout<<#a<<"="<<a<<endl;
#define MAX 1000001

int prime[MAX];
void sieve(int n){
for(int i = 0;i<=n;i++){
prime[i]=1;
}

prime[0]=prime[1]=0 ...

HI

I got runtime Error , helpme plz , I'm novice
it's my code:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctype.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <map ...

help me please...

Thank you very much!!

#include <cstdio>
#include <iostream>
using namespace std;

inline long min(long a, long b, long c = -1){
if(c == -1)
return (a > b) ? b : a;
else
return (min(min(a,b),c));
}
int main(){
long i;
long num[10];
char order[4];
long x,y,z;
long op[4 ...