Codeforces Round #425 (Div. 2) Archive

#include<bits/stdc++.h> #define oo 0x3f3f3f3f #define cl(x) memset(x, 0, sizeof(x)) #define mp make_pair #define fr first #define sc second #define pii pair<int, int> #define pb push_back #define mo 1000000007 #define maxn 510 typedef long long ll; …

#include<cstdio> #include<iostream> using namespace std; struct Edge{ int to,next; }e; int head,cnt=0; void add(int u,int v) { cnt++; e.to=v; e.next=head; head=cnt; } int anc; int dep; void dfs(int x,int fa) { for(int i=head;i!=0;i=e.next) { int …

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using D = double; using uint = unsigned int; template<typename T> using pair2 = pair<T, T>; #ifdef WIN32 #define LLD …

#include<iostream> #include<cstdio> #include<cstring> using namespace std; string s,t; int q; string str; int w; bool g; int main() { cin>>s; for(int i=0;i<s.size();i++) { g-‘a’]=true; } cin>>t; int lt=t.size(); int s=0; w=-1; for(int i=0;i<lt;i++) { if(t==’*’)w=i;else …

#include <cstdio> int main() { long long n, k; scanf(“%I64d%I64d”, &n, &k); puts((n / k) & 1 ? “YES” : “NO”); return 0; }