## Codeforces Round #384 (Div. 2), problem: (D) Chloe and pleasant prizes Solution in C/C++

By |2017-04-07T22:11:47+06:00December 17th, 2016|Categories: C/C++, Programming||

#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define INF 1000000000000000 typedef long long LL; int n,sz,first[200010],next[400010],tail[400010],son[200010],bro[200010],vis[200010]; LL a[200010],s[200010],maxs[200010],maxs2[200010]; void addedge(int u,int v); void dfs(int u); int main(void) { //freopen("prize.in","r",stdin); //freopen("prize.out","w",stdout); scanf("%d",&n); int i; for(i=1;i<=n;i++) scanf("%I64d",&a[i]); int u,v; memset(first,0,sizeof(first)); for(sz=0,i=1;i<=n-1;i++) { [...]

## Codeforces Round #384 (Div. 2), problem: (C) Vladik and fractions Solution in C/C++

By |2017-04-07T22:11:47+06:00December 17th, 2016|Categories: C/C++, Programming||

#include<stdio.h> int main(){ long x; scanf("%ld",&x); if(x==1) printf("-1"); else printf("%ld %ld %ld",x,x+1,x*(x+1)); return 0; }

## Codeforces Round #384 (Div. 2), problem: (A) Vladik and flights Solution in C/C++

By |2017-04-07T22:11:47+06:00December 17th, 2016|Categories: C/C++, Programming||

#include<stdio.h> int main() { int i,j,n,a,b; char s[100003]; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s[a-1]==s[b-1]) { printf("0"); } else printf("1"); return 0; }