Cod sursa(job #2120291)
Utilizator | Data | 2 februarie 2018 11:42:18 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
const int nmax=100000;
int n;
long double sol[nmax+5];
void slove(int st,int dr,long double ans)
{
if(st==dr)
{
sol[st]+=ans;
sol[d]
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
sol[i]=-1;
return 0;
}
/**
**/