## Codeforces Round #411 (Div. 1), problem: (F) Fake bullions Solution In JAVA

By |2017-07-24T02:11:25+06:00July 24th, 2017|Categories: C/C++, Programming||

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.StringTokenizer; public class Div1_411F { int numTV; int A; int B; ArrayList<Integer>[] tAList; boolean[][] tVAct; int[] numM; int cTime = 0; int[] disc; int[] low; ArrayDeque<Integer> stack = new ArrayDeque<Integer>(); ArrayList<ArrayList<Integer>> [...]

## Codeforces Round #411 (Div. 1), problem: (E) The same permutation Solution In C/C++

By |2017-07-24T02:09:41+06:00July 24th, 2017|Categories: C/C++, Programming||

#include <stdio.h> int n; int main() { scanf("%d",&n); if(n%4>1)return printf("NO\n"),0; printf("YES\n"); for(int i=1;i<n;i+=4) { if(n%4)printf("%d %d\n%d %d\n%d %d\n",i+2,n,i+2,i+3,i+3,n); else printf("%d %d\n",i+2,i+3); printf("%d %d\n",i,i+2); printf("%d %d\n",i+1,i+3); printf("%d %d\n",i+1,i+2); printf("%d %d\n",i,i+3); if(n%4)printf("%d %d\n%d %d\n%d %d\n",i,n,i,i+1,i+1,n); else printf("%d %d\n",i,i+1); } for(int i=1;i<n;i+=4) for(int j=i+4;j<n;j+=4) { printf("%d %d\n",i+3,j+2); [...]