OJ Board

#include <bits/stdc++.h>
using namespace std;
char Grid[1000][1000];
int ans[100000];
int n , m , ANS;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,-1,1,1,-1,-1,1};
bool Check(int i ,int j){
for(int a =0; a<4 ; a++){
if(Grid[i+dx[a]][j+dy[a]]=='_') return false;
}
return true;
}
void DFS(int i ...

I have solved this problem using DP , but i cant figure out how it become Binomial coefficient.

try to avoid memset

Check the case
input output

#include <bits/stdc++.h>
int main()
{
char cas[10];
int ca , x=0;
gets(cas);
ca=atoi(cas);
while(ca--)
{
char line[10010];
char final_[10010];
char final_1[10010];
char final_2[10010];
char final_3[10010];
gets(line);
int len = strlen(line) ;
int j=0;

for(int i=0; i< len; i++)
if ...

i think working with double for this problem is so risky.

after adding 1e+9, get accepted . why they dnt use special judge ? or why in ques they dnt mention that no special judge for this ques ?

input

10
oieurfndskjbnz000000157986216nvknMANC
idufjdklmvlkue342494832674921487
76583hjfkshgkiKJDNHFKJSkjsdnksi
iutioerniIHGFSDHuyeuiu735982347kkj
nnvnvnnv
a
0
A
0001AA
BBNAaaa9


Output

Case 1: 16k
Case 2: 234789dklu
Case 3: JKhijs
Case 4: 37Hek
Case 5: nv
Case 6: empty
Case 7: empty
Case 8 ...

write another function who can calculate the max length , then just call from main . dont know why this way reduce time , its work for me.

#include <stdio.h>
#define EPS 1e-18
int main()
{
int ca;
scanf("%d",&ca);
while(ca){
long double Ha,Hb,Hc,area;
scanf("%Lf %Lf %Lf",&Ha,&Hb,&Hc);
area=((Ha*Hb*Hc)/(Ha*Hc+Ha*Hb+Hb*Hc))*((Ha*Hb*Hc)/(Ha*Hc-Ha*Hb+Hb*Hc))*((Ha*Hb*Hc)/(Ha*Hc+Ha*Hb-Hb*Hc))*((Ha*Hb*Hc)/(-Ha*Hc+Ha*Hb+Hb*Hc));
if ...

how to reduce the run time ?? i get accepted 0.690s