# Solution In C/C++

/Tag: Solution In C/C++

## Codeforces Round #381 (Div. 1), problem: (E) Gosha is hunting Solution in C/C++

By |2017-04-07T22:11:48+06:00November 27th, 2016|Categories: C/C++, Programming||

Hi guys , I just solved the fifth problem of round 381 , Hope you like it , feel free to comment any better solution .     #include <bits/stdc++.h> using namespace std; const int MAXN = 2007; pair<double,double> p[MAXN]; double dp[MAXN][MAXN]; int main(){ [...]

## Codeforces Round #381 (Div. 1), problem: (D) Recover a functional graph Solution in C/C++

By |2017-04-07T22:11:48+06:00November 27th, 2016|Categories: C/C++, Programming||

Hi guys , I just solved the fourth problem of round 381 , Hope you like it , feel free to comment any better solution .     #include<cstring> #include<cstdlib> #include<cstdio> #include<cmath> #include<iostream> #include<vector> #define N 310 #define pb push_back using namespace std; struct [...]

## Codeforces Round #381 (Div. 1), problem: (B) Alyona and a tree Solution in C/C++

By |2017-04-07T22:11:49+06:00November 27th, 2016|Categories: C/C++, Programming||

Hi guys , I just solved the second problem of round 381 , Hope you like it , feel free to comment any better solution .   #include<stdio.h> #include<stdlib.h> typedef long long unsigned llu; typedef unsigned u; u P[19][222222],S[222222],R[222222],A[222222]; u *G[222222],Ga[222222],Gi[222222]; llu W[19][222222]; void [...]

## Codeforces Round #381 (Div. 2), problem: (A) Alyona and copybooks Solution in C/C++

By |2017-04-07T22:11:49+06:00November 27th, 2016|Categories: C/C++, Programming||

Hi guys , I just solved the first problem of round 381 , Hope you like it , feel free to comment any better solution .   #include<stdio.h> int main() { int n,a[5]={0}; scanf("%d %d %d %d",&n,&a[1],&a[2],&a[3]); if (a[3]+a[3]<a[1]-a[3]) a[1]=a[3]+a[3]+a[3]; if (a[3]+a[2]<a[1]) a[1]=a[3]+a[2]; if [...]

## Codeforces Round #379 (Div. 2), problem: (B) Anton and Digits Solution In C/C++

By |2017-04-07T22:11:50+06:00November 16th, 2016|Categories: C/C++, Programming||

Hey guys I just tried the anton and digits problem , hope you might like my solution feel free to comment better solution . #include<bits/stdc++.h> using namespace std; int main() { long long int two, thr, fv, sx,ans, Min; ans=0; cin>>two>>thr>>fv>>sx; Min = two; [...]