Tag: Codeforces Round #411 (Div. 1)

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

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...

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

#include <stdio.h> int n; int main() { scanf("%d",&n); if(n%4>1)return printf("NOn"),0; printf("YESn"); for(int i=1;i<n;i+=4) { if(n%4)printf("%d %dn%d %dn%d %dn",i+2,n,i+2,i+3,i+3,n); else printf("%d %dn",i+2,i+3); printf("%d %dn",i,i+2); printf("%d %dn",i+1,i+3); printf("%d %dn",i+1,i+2); printf("%d %dn",i,i+3); if(n%4)printf("%d %dn%d %dn%d...

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!