Admin

1220 animes navigated

Why Everyone is Obsessed with the Rug Gripper Pads

Are you tired of dealing with...

curl-programming-lang 1.0.2

Introduction to curl-programming-lang 1.0.2 The open-source developer ecosystem continues to thrive with the introduction of...

Why Everyone is Obsessed with the Blind Spot Mirrors

Are you tired of dealing with...

Codeforces Round #384 (Div....

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

Codeforces Round #383 (Div....

#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <string.h> #define rank _ran using...

Codeforces Round #383 (Div....

#include <bits/stdc++.h> using namespace std; #define fo(i,a,b) for(int i=(a);i<(b);i++) #define MOD 1000000007 #define...

Codeforces Round #383 (Div....

#include <stdio.h> #include <string.h> int n,a,b,c,p; void dfs(int k,int col); int main(void) { ...

Codeforces Round #383 (Div....

#include<stdio.h> int n, m, maxW, p, w, b, prev, next,...

odeforces Round #383 (Div....

#include<stdio.h> int n, c, v; int gcd(long long a, long long...

Codeforces Round #383 (Div....

#include<stdio.h> int v; int main(){ int i,l,n,x; long long int r; scanf("%d%d",&n,&x); for(i=0;i<n;i++) { scanf("%d",&l); r=r+v; v++; } printf("%I64d",r); return 0; }

Codeforces Round #383 (Div....

#include<stdio.h> int main(){int n, a={6,8,4,2}; scanf("%d",&n); if(n) printf("n%d",a); else printf("n1"); return 0; }

Codeforces Round #382 (Div....

#include<iostream> #include<cstdio> #include<algorithm> #define N 3010 using namespace std; int n,m,f; struct ma{int x,y;}a; bool operator<(ma...

Codeforces Round #382 (Div....

#include <bits/stdc++.h> using namespace std; const int N=2e3+1; int n,m,x,y; bitset<N*2> a; int...

4 Tools For Creating...

  One way to communicate a lot of information is...

How to get rid...

yeezy boost 350 v2 zebra for saleyeezy boost 350...