Sponsors

Tag: C language

Codeforces Round #408 (Div....

#include <stdio.h> #include <string.h> #include <stdbool.h> #include <assert.h> #define clr(ar) memset(ar, 0, sizeof(ar)) #define...

Codeforces Round #408 (Div....

#include <iostream> #include <string> #include <vector> #include <map> #include <queue> #include <algorithm> #include <numeric> #include <climits> using...

Codeforces Round #408 (Div....

#include <limits.h> #include <stdio.h> #include <stdlib.h> #define N 300000 struct E { int i,...

Codeforces Round #408 (Div....

#include <stdio.h> #define N 1000000 int main() { static int hole; int n,...

April Fools Contest 2017,...

#include<cstdio> int main() { int ans=0,a=0; char c; scanf("%d",&ans); while (scanf("%c%d",&c,&a) != EOF) { if (c=='+')...

April Fools Contest 2017,...

#include <stdio.h> #include <string.h> int main(){ int i, num, flag=0; char str; scanf("%s", str); num...

April Fools Contest 2017,...

#include<stdio.h> int main(){ int a, i, n, max=0; scanf("%d", &n); ...

April Fools Contest 2017,...

#include<stdio.h> int main(void) { unsigned x, y, result = 0; scanf("%u", &x); do { y...

April Fools Contest 2017,...

#include<stdio.h> int main(void) { int mas = {4, 22, 27, 58, 85,...

Codeforces Round #407 (Div....

#include<bits/stdc++.h> using namespace std; int n,k,f; bitset<2001> dp; int main() { cin>>n>>k; for(int i=1,t;i<=k;i++) { scanf("%d",&t); f=1; } dp=1; int now=0; for(int i=1;i<=1000;i++) { now^=1; dp.reset(); for(int...

Codeforces Round #407 (Div....

#include<bits/stdc++.h> #define ll long long using namespace std; ll in; vector<int>adj; ll ans=0; bool g; int...

Codeforces Round #407 (Div....

#include <iostream> #include <map> using namespace std; map<long long, int> was; map<long long,...

Advertisement

spot_img