Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (C) Pavel and barbecue Solution in C/C++
#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if (used) return; used = 1; dfs(pp); } int main() { int n, i, sum, cnt; static int bb; scanf(“%d”, &n); for (i …