Tag: Codeforces Round #407 (Div. 2)

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

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

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

#include<stdio.h> int main() { int n,k; scanf("%d%d",&n,&k); int a,i,m=0; for(i=0;i<n;i++) { scanf("%d",&a); if(a%k==0) m+=a/k; else m+=a/k+1; } printf("%d",(m+1)/2); return 0; }