code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
vector<vector<int... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],b[N];
int main(){
int A,B,m,ans,Amin=1e5,Bmin=1e5;
cin>>A>>B>>m;
for(int i=1;i<=A;++i)
cin>>a[i],Amin=min(Amin,a[i]);
for(int i=1;i<=B;++i)
cin>>b[i],Bmin=min(Bmin,b[i]);
int x,y,c;
ans=Amin+Bmin;
for(int i=1;i<=m;++i){
cin>>x>>y>>c;
... | 0 | 91,814,704 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_wi... | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 100000;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<int> backet(MAX+1, 0);
for(int i = 0; i < n; i++) backet[a[i]]++;
int ansmax = 0;
int ans = 0;
for(int i = ... | 0 | 6,443,751 |
#include<iostream>
using namespace std;
char ans[2][10]={
"No\n",
"Yes\n"
};
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=0;
if(a<b)if(b<c)flag=1;
cout<<ans[flag];
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 30,609,361 |
#include<iostream>
#include<cstdio>
long long ans,sum[200050],arr[200050],xro[200050];
int n,l=1;
int main()
{
std::scanf("%d",&n);
for(register int i=1;i<=n;++i) std::scanf("%lld",&arr[i]),sum[i]=sum[i-1]+arr[i],xro[i]=xro[i-1]^arr[i];
for(register int r=1;r<=n;++r)
{
while((sum[r]-sum[l-1])!=(xro[r]^xro[l-... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a... | 0 | 26,172,339 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str1,str2,p;
char x;
int q,a,b;
getline(cin, str1);
cin >> q;
for (int i = 0; i < q; i++){
cin >> str2;
if (str2 == "replace"){
cin >> a >> b >> p;
for (int j = 0; j < p.length(); j++)
str1[j + a] = p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | 0 | 64,076,427 |
#include <iostream>
using namespace std;
int a, b;
bool shouldDrawWhite(int x, int y) {
if (y < 50) {
if (a == 0) {
return false;
}
if (y % 2 == 0 && x % 2 == 0) {
a--;
return true;
}
return false;
}
if (b == 0) {
return true;
}
if (y % 2 == 1 && x % 2 == 0) {
b--... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define dfs_black 1
#define dfs_white -1
#define pr pair
#define vt vector
#define fastio ios_base::sync_... | 0 | 16,776,127 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
using namespace std;
int main() {
int H, W, i, j;
string str[26][26];
string s = "snuke";
char w;
cin >> H >> W;
for (i = 0; i < H; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(int argc, char** argv) {
if (argc == 2 && atoi(argv[1]) == 123456789)
freopen("d:\\code\\cpp\\stdin", "r", stdin);
int n;
scanf("%d", &n);
int k=1;
while(k*(k-1)/2 < n)
k++;
i... | 0 | 13,700,778 |
#include<bits/stdc++.h>
#include<string>
signed main() {
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
std::string s(a,'0');
std::string t(w-a,'1');
std::string S(a,'1');
std::string T(w-a,'0');
for(int i=0;i<h;++i){
if(i<b){
printf("%s%s\n",s.c_str(),t.c_str());
}
else{
pr... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 31,889,361 |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const long long MAXN = 300005;
long long N, n, a[MAXN], cnt[MAXN];
long long sum[MAXN];
long long ans[MAXN];
bool check(long long k, long long x) {
long long pos = upper_bound(a + 1, a + n + 1, x) - a;
return sum[pos - 1] + (n - pos + 1) *... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
int n;
vector<vector<int>> v;
int main(){
cin>>n;
int k=0;
FOR(i,1,10000){
k+=i;
if(n<k){
cout<<"No"<<endl;
return 0;
}
if(n==k){
k=i;
... | 0 | 32,369,517 |
#include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
long long MOD = 1000000007;
long long INF = 1e18;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#d... | #include<bits
using namespace std;
int main(){
long long x,y;
cin >> x >> y;
long long temp = x;
long long ans = 0;
while(x <= y){
x = x * 2;
ans++;
}
cout << ans << endl;
} | 0 | 50,097,638 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int count=0;
if(s.size()+1==t.size()){
for(int i=0;i<s.size();i++){
if(s.at(i)==t.at(i))count++;
if(count==s.size()){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int n; cin >> n;
vector<int> a(n); rep(i, n) cin >> a[i];
ll ans = a[0]-1;... | 0 | 17,966,165 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll S;cin>>S;
cout<<0<<" "<<0<<" "<<1000000000<<" "<<1<<" "<<((S+1000000000-1)/1000000000)*1000000000-S<<" "<<(S+1000000000-1)/1000000000<<endl;
} | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int gcd(long long s,long long t){
if(s%t==0){
return t;
}
else{
return gcd(t,s%t);
}
}
int main(){
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long e=c*d/gcd(d,c);
long long ac=(a-1)/c,ad=(a-... | 0 | 768,059 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll Q, H, S, D;
ll N;
cin >> Q >> H >> S >> D >> N;
S = min(S, min(2*H, 4*Q));
cout << min(2*S, D)*(N/2) + (N%2)*S << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 94,686,409 |
#include<iostream>
using namespace std;
string inp;
char buff[6];
int main(){
std::cin >> inp;
inp.copy(buff, 6);
if(buff[2]==buff[3]&&buff[4]==buff[5]){
std::cout << "Yes";
}else{
std::cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if((A.at(0) == A.at(1)) && (A.at(1) == A.at(2))) {
cout << "No" << endl;
}
else if(A.at(0) == A.at(1)) {
if(A.at(2) == A.at(3)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else if... | 0 | 53,619,778 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | 0 | 18,721,465 |
#include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
a[i] -... | #include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 300005;
const ll inf = 10000000000000000;
... | 0 | 44,980,245 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void)
{
string str;
int sum;
int i;
while (1) {
cin >> str;
sum = 0;
for (i=0; str[i]!='\0'; i++) {
sum += (str[i] - '0');
}
if (sum == 0) {
break;
}
else {
cout << sum << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 17,547,636 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#def... | 0 | 35,984,826 |
#include<iostream>
using namespace std;
int ans;
void SofI(int num, int n) {
if (num > n * 9) { return; }
else if (num < 0) { return; }
else if (num != 0 && n == 0) { return; }
else if (num == 0) {
ans++;
return;
}
else {
for (int i = 0; i < 10; i++) {
SofI(num - i, n - 1);
}
}
}
int main(void) {
in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#def... | 0 | 97,523,420 |
#include<iostream>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int ans=0;
if (A>=B){
ans+=B;
}
else ans+=A;
if (C>=D){
ans+=D;
}
else ans+=C;
cout<< ans << endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define se second
const int N = 2e5+5;
string s;
int n,k,cst[3];
int cnt[N];
void solve(){
cin>>n>>k;
for(int i=0;i<3;i++)cin>>cst[i];
cin>>s;
for(int i=0;i<n;i++){
if(i<k)cnt[i] = 1;
else {
... | 0 | 66,269,344 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a... | 0 | 33,233,436 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 19,109,636 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1e9+7;
int main() {
int N;
vector<string> vec_s;
vector<int> vec_t;
string X;
cin >> N;
vec_s.resize(N);
vec_t.resize(N);
for (int i=0; i < N; i++) cin >> vec_s[i] >> vec_t[i];
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
... | 0 | 47,792,277 |
#include <cstdio>
int main()
{
int a,b,total;
scanf("%d %d",&a,&b);
if(a > b)
{
total = a - b;
}
else
{
total = 0;
}
printf("%d",total);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 20,525,560 |
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) c... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
ll n;
vector<ll> r(100), c(100);
vector<vector<ll> > dp(101, vector<ll>(101, -1));
int dfs(int v, int w) {
if(dp[v][w] != -1) {
return dp[v][w];
} else {
ll tmp = INT_... | 0 | 100,323,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
int X;
cin >> K >> X;
if (X<=K*500) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 37,936,682 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
... | 0 | 72,712,488 |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int a[4]={0},t;
for(int i=0;i<6;i++)
{
cin>>t;
a[t-1]++;
if(a[t-1]==3)
{
cout<<"NO";
return 0;
}
}
cout<<"YES";
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
a.emplace(a.begin(), 0);
a.emplace(a.end(), 0);
n += 2;
auto d = [&](int i, int j) {
return abs(a[i] - a[j]);
};
int su... | 0 | 59,542,553 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 2e5 + 100;
char s[N];
int main() {
scanf("%s", s + 1);
int num = 0;
long long ans = 0;
int n = strlen(s + 1);
for(int i = 1; i <= n; i++) {
if(s[i] == 'W') {
num++;
ans += i-num... | #include<iostream>
#include<string>
using namespace std;
int main(){
string n;
cin >> n;
for(int i=0; i<3; i++){
if(n.at(i) == '1'){
cout << '9';
}else{
cout << '1';
}
}
cout << endl;
return 0;
} | 0 | 12,644,110 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N;
cin >> N;
string M;
cin >> M;
ll ans;
ll r=0,g=0,b=0;
for(ll i=0;i<N;i++){
if(M[i]=='R'){
r++;
}
if(M[i]=='G'){
g++;
}
if(M[i]=='B'){
b++;
}
if(i==N-1){
ans=r*g*b;
}
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; i++)
{
d[i] = 0;
cin >> d[i];
}
int ans = 0;
for (int i = 0; i < N; i++)
{
for (in... | 0 | 80,947,628 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n,m,k;cin >>n>>m>>k;
bool flg=false;
for (int i = 0; i <=n; ++i) {
f... | 0 | 86,227,046 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,t,dot;
cin>>n>>x>>t;
dot=n/x;
if (n%x>0){
dot++;
}
cout<<dot*t;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 70,311,550 |
#include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+2,0);
for(int i=0;i<n;i++){
cin>>a[i+1];
}
int sum=0;
for(int i=0;i<n+1;i++){
sum+=abs(a[i+1]-a[i]);
}
for(int i=0;i<n;i++){
cout<<sum-abs(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | 0 | 26,853,443 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin >> A >> B >> C;
bool a=false;
if(A.at(A.size()-1)==B.at(0)){
if(B.at(B.size()-1)==C.at(0)) a=true;
}
if(a)cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 | 86,192,832 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
string s;
ll a[128];
ll ans;
int main()
{
cin>>s;
ll n = s.size();
for(ll i = 0; i < n; i++)
{
a[s[i]]++;
}
for(ll i = 'a'; i <= 'z'; i++)
{
ans -= a[i] * (a[i] - 1) / 2;
}
ans += n * (n ... | #include <iostream>
#include <stack>
using namespace std;
int main(){
string s;
while(getline(cin,s)){
if(s[0]=='.'&&s.size()==1)break;
stack<char> st;
int flag=1;
for(int i=0;i<s.size();i++){
if(s[i]=='(')st.push('(');
if(s[i]=='[')st.push('[');
if(s[i]==')'){
if(st.empty(... | 0 | 44,853,062 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <iostream>
#include <vector>
using namespace std;
int N;
vector <pair <int, int> > G[200005];
int root, Cost[200005], A[200005];
bool ok = 1;
void Read()
{
cin >> N;
for(int i = 1; i <= N; i++)
cin >> A[i];
for(int i = 1; i < N; i++)
{
int x, y;
cin >> x >> y;
G[... | 0 | 73,503,248 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin>>N>>M;
vector<vector<bool>>C(N,vector<bool>(N,false));
for(int i=0;i<M;i++){
int a,b; cin>>a>>b;
C[a-1][b-1]=true;
C[b-1][a-1]=true;
}
int count=1;
for(int i=1;i<N;i++)count*=i;
int ans=0;
vector<int>B(N);
for(int i=0;i... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 39,621,649 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#ifdef LOCAL
#include "/media/brayand/BrayanD/debugger.h"
#else
#define db(...) false
#define dbl(...) false
#define dbg(...) false
#endif
const int MAXN = 1e5 + 100;
bool mk[MAXN];
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pair;
const int INF = 0x3fffffff;
int N;
char S[200001];
int type[200001];
int dp[200001];
int nxt[200001];
queue<int> qs[200001];
vector<int> es[200001];
map<int, vector<int>> belong;
int main() {
scanf("%s", S);
N = strlen(S);
type[0] = 0;
b... | 0 | 39,632,656 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) ... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
#define rep(i,n) for (int i=0, i##_len=(n); i<i##_len; ++i)
#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)
template<class T>
bool chmax(T& a, const... | 0 | 69,059,429 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a+3);
int ans = 0;
ans += a[2]-a[1];
a[0] += ans;
a[1] += ans;
ans += ((a[2]-a[0])/2)+((a[2]-a[0])%2)+((a[2]-a[0])%2);
... | #include<iostream>
#include<list>
using namespace std;
int main()
{
list<int> l;
int n;
cin>>n;
char s[20];
int value;
for(int j=0;j<n;j++)
{
cin>>s;
if(s[0]=='i')
{
cin>>value;
l.push_front(value);
}else if(s[6]=='F')
{
... | 0 | 87,236,116 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for(int i=0; i<N; i++) {
int a;
cin >> a;
if(a>0)
pls.push_back(a);
else
... | #include <iostream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <numeric>
#include <cmath>
#include <cctype>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long dou... | 0 | 4,091,141 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
bool ac[100010]={false};
ll wa[100010]={};
ll ans=0;
for(ll i=0;i<k;i++){
ll x;string s;
cin>>x>>s;
x--;
if(ac[x]){
continue;
}
if(s=="AC"){
ac[x]=true;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T... | 0 | 72,307,740 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int NIL = -1;
struct Node { int parent, left, right;};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].parent ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -... | 0 | 13,758,444 |
#include <bits/stdc++.h>
int main() {
int h, w, d;
char t[] = { 'R', 'Y', 'G', 'B' };
std::cin >> h >> w >> d;
std::vector<std::vector<int>> b(500, std::vector<int>(500));
if (d % 2) {
for (int i = 0; i < 500; i++) {
for (int j = 0; j < 500; j++) {
b[i][j] = (i + ... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a... | 0 | 17,187,644 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i,n) cin >> h[i];
ll ans = 0;
for (ll i = 0; i < n;) {
ll t = 0, j = i+1;
for(; j < n;... | 0 | 91,666,824 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
int n = s.size();
rep(bit, 1 << n - 1)
{
int sum = s[0] - '0';
vector<char> op(n - 1);
rep(i, n - 1... | 0 | 255,807 |
#include<stdio.h>
int main(void) {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
if(x < y && y < z) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline v... | 0 | 25,381,796 |
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | #include<bits/stdc++.h>
using namespace std;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define TEST ll t;cin>>t;while(t--)
ll s... | 0 | 60,215,653 |
#include<iostream>
using namespace std;
int main(){
int num[100] = {0}, max = 0, input;
while(cin>>input){
num[input-1]++;
}
for(int i=0;i<100;i++){
if(max<num[i])
max = num[i];
}
for(int i=0;i<100;i++){
if(max == num[i])
cout << i+1 << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<map>
#define ran(x) (x).begin(),(x).end()
using namespace std;
int main() {
string s,t;
cin >> s;
for(int i = 0; i < s.size(); ++i) {
if(s[i] == 'B') {
if(t.size() > 0)
t.pop_back();
}
else
t.push_back(... | 0 | 39,789,212 |
#include<cstdio>
using namespace std;
const int maxn=10+2;
char str[maxn];
int main(){
scanf("%s",str+1);
if (str[1]=='Y'&&str[2]=='A'&&str[3]=='K'&&str[4]=='I') printf("Yes");
else printf("No");
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
for(int i = 0; i < s.size(); i++){
string tmp = s;
for(int j = 0; j < s.size(); j++){
tmp[j] = s[(j+i)%s.size()];
}
if(tmp == t){
puts("Yes");
... | 0 | 66,900,266 |
#include <iostream>
int main() {
int N, K;
std::cin >> N >> K;
int M = N * (N - 1) / 2 - K;
if (M < N - 1) {
std::cout << "-1\n";
return 0;
}
std::cout << M << "\n";
for (int i = 2; i <= N; i++)
std::cout << 1 << " " << i << "\n";
int count = N - 1;
for (int i... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
int a, b, c, d;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c >> d;
for(int i = 0; i <= d; i++)
for(int j = 0; j <= d - i; j++)
... | 0 | 26,364,589 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 10;
const int maxe = 100;
int ecnt;
struct Edge{
int to;
int val;
int nxt;
}edge[maxe];
int node[maxn];
void init()
{
memset(node,-1,sizeof node);
ecnt = 0;
}
void addedge(int from,int to,int val)
{
edge[ecnt].nxt = node[from];
ed... | 0 | 28,027,189 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 65,268,803 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
bool ans=true;
int x=0;
int y=0;
int t=0;
for(int i=0;i<n;i++)
{
int it,ix,iy;
cin>>it>>ix>>iy;
int tt=it-t;
int dd=abs(x-ix)+abs(y-iy);
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | 0 | 84,754,989 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a) for(int i=0;i<(a);++i)
#define clr(a,v) memset((a),(v),sizeof(a))
const int MAX_H = 24, MAX_M = 60, MAX_S = 60;
int n;
int S[MAX_H*MAX_M*MAX_S];
int main()
{
while( scanf( "%d", &n ), n )
{
clr( S, 0 );
rep( i, n )
{
int hh, mm, ss;
s... | #include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(true){
int n,m,p,all=0,y=-1;
scanf("%d%d%d",&n,&m,&p);
if(n==0) break;
rep(i,n){
int x;
scanf("%d",&x);
if(i+1==m) y=x;
all+=x*100;
}
if(y==0){
printf("0\n");
continue;
}
printf("%d\n",all*(... | 0 | 26,107,155 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans{0};
for(int i=0;i<3;i++){
if(s[i] == 'R') ans = 1;
}
for(int i=1;i<3;i++){
if(s[i-1] == s[i] && s[i] == 'R') ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, ... | 0 | 12,141,881 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <iomanip>
#include <map>
#include <queue>
#include <tuple>
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> P;
int main(){
int A[3][3];
for(int i=0;i<3; i++){
for(int j=0; j<3; j+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | 0 | 44,259,547 |
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long int li;
typedef long long ll;
typedef long double ld;
int main()
{
ll r, g, b, k;
cin >> r >> g >> b >> k;
ll s = 0;
while (g <= r)
{
g *= 2;
s++;
}
while (b <= ... | #include<bits/stdc++.h>
using namespace std;
int n, m, a[101], sum, temp, i, c;
int main()
{
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
temp = sum /(4*m) + (sum%(4*m)>0);
for(i=0;i<n;i++)
{
if(a[i]>=temp)
c++;
}
... | 0 | 79,844,206 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
using n... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
using pll = pair<long, long>;
#define fix20 ... | 0 | 82,130,036 |
#include<bits/stdc++.h>
using namespace std;
int mod=1e9+7;
int solve(vector<string>& graph, int R, int C){
vector<vector<int>> ans(R,vector<int>(C,0));
for (int i=0;i<R;i++){
if (graph[i][0]=='#') break;
else ans[i][0]=1;
}
for (int i=0;i<C;i++){
if (graph[0][i]=='#') break;
else ans[0][i]=1;
}
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 63,025,282 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 17,473,142 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,L,T;
int a[N],x[N],w[N];
int main()
{
scanf("%d%d%d",&n,&L,&T);
int rk=0;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i],&w[i]);
if(w[i]==1){
x[i]=... | 0 | 28,654,231 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18+7)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T,vector<T>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 25,581,925 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include<cstdio>
#include<stack>
using namespace std;
int main() {
int n;
stack<int> S;
while(~scanf("%d",&n)) {
if(n)
S.push(n);
else {
printf("%d\n",S.top());
S.pop();
}
}
return 0;
} | 0 | 76,949,328 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
string S;
vector<string> vc;
map<string, int> cnt;
while( cin ... | 0 | 61,965,536 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, type... | 0 | 34,084,576 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
bool hantei( vector<int>& x, vector<int>& y ) {
rep( Z, -100, 100+1 ) {
bool flag = true;
rep( i, 0, x.size() ) {
if ( x.at(i) >= Z ) flag = false;
}
rep( i, 0, y.size() ) {
if ( y.at(i) < Z ) fl... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#define NDEBUG
#include <cassert>
using namespace std;
#define TEST
#ifdef T... | 0 | 31,310,006 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans=0;
if(n>=10){
if(n>=1000){
if(n>=10000 && n!=100000){
ans += n-9999;
ans += 909;
} else if(n==100000){
ans = 90909;
} else {
ans += 909;
}
} else if(n>=100){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#def... | 0 | 27,451,955 |
#include <cstdio>
#include <cmath>
using namespace std;
int main (void)
{
int h, w;
int i, j;
while (scanf("%d %d", &h, &w) != EOF && h != 0 || w != 0){
for (i=0; i<h; i++){
for (j=0; j<w; j++){
if (j!=0 && j!=w-1){
if(i!=0 && i!=h-1)
printf(".");
else
printf("#");
}
else
... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
int main(){
cin.t... | 0 | 32,138,417 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
int i;
vector<bool> list(1e6, false);
for(i=1; count<n; i++){
count+=i;
list[i]=true;
}
int diff = count-n;
for(int j=i; j>0; j--){
if(j<=diff){
diff -= j;
... | #include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
int n;
int m;
vi a;
vector<set<int>> g;
void input() {
a.clear();
g.clear();
cin >> n >> m;
a.resize(n);
g.res... | 0 | 87,154,746 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5;
char s[2 * N + 5];
ll a[2 * N + 5], d[2 * N + 5];
const ll mod = 1e9 + 7;
int main()
{
ll n;
cin >> n;
getchar();
ll offset = 0;
d[0] = 1;
for (ll i = 1; i <= n * 2; i++)
{
scanf("%c", &s[i]);
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;
struct data{ int x, y, count; };
const int INF = 10000000;
int w, h, n;
int sx, sy;
int gx, gy;
int vx[] = { 1, 0, -1, 0, };
int vy[] = { 0, 1, 0, -1, };
char field[1001][1001];
int d[1001][1001][11];... | 0 | 42,921,298 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int b = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
int h;
cin >> h;
if (b <= h) cnt++;
b = max(b, h);
}
cout << cnt << endl;
} | #include<bits/stdc++.h>
using namespace std;
int se(char s){
int r;
if(s=='a'||s=='t'||s=='g'||s=='r'||s=='f'||s=='v'||s=='c'||s=='e'||s=='d'||s=='s'||s=='w'||s=='x'||s=='q'||s=='z'||s=='b')r=1;
else r=0;
return r;
}
int main(){
string s;
int i,r,j,sum;
while(cin>>s,s!="#"){
j=se(s[0]);
... | 0 | 10,126,390 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string O,E;
cin >> O >> E;
vector<char> o(O.size());
for (int i = 0; i < O.size(); i++) {
o.at(i) = O.at(i);
}
vector<char> e(E.size());
for (int i = 0; i < E.size(); i++) {
e.at(i) = E.at(i);
}
for (int i = 0; i < E.size(); i++) {
... | #include <iostream>
#include <vector>
#include <algorithm>
int const nmax = 300;
char v[1 + nmax][1 + nmax];
int main() {
int n;
std::cin >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
std::cin >> v[i][j];
int result = 0;
for(int h = -n + 1; h <= n - 1; h++) {
int valid = 1;
fo... | 0 | 91,780,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long sum = accumulate(A.begin(), A.end(), 0LL);
long long m = N * (N + 1) / 2;
if (sum % m != 0) {
cout << "NO" << e... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s; cin >> s;
bool a = 1, b = 1, c = 1;
if(s[0] != 'A')a = 0;
int cnt = 0;
for(int i = 2; i < s.length()-1;... | 0 | 33,640,546 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
char c[H][W];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> c[i][j];
}
}
int ans = 0;
for (unsigned short int h_bits = 0; h_bits < (1 << H); h_bits++) {
for (unsigned short in... | #include<iostream>
#include<vector>
using namespace std;
int n,k,m;
int ans=0;
vector<int>s(10);
void bfs(int nn,int sum,int min){
if(nn==0&&sum==0){
ans++;
return;
}
for(int i=min;i<10&&n>0;i++){
if(sum-i>=0){
bfs(nn-1,sum-i,i+1);
}
}
}
int main(){
while(... | 0 | 30,947,050 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 4,469,152 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <bitset>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <utility>
#include <functional>
#include <map>
#include <set>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 65,701,971 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<ll> a(n+1);
rep(i,n+1) cin>>a[i];
if(n==0){
if(a[0]==1) cout<... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 84,375,715 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unro... | #include <stdio.h>
int main (){
long long int n;
scanf ("%lld", &n);
long long int arr[n];
for (long long int i = 0; i < n; i++){
scanf ("%lld", &arr[i]);
}
for (long long int i = 0; i < n; i++){
if (arr[i] == 0){
printf("0\n");
return 0;
}
}
long long int sum = 1;
for (long long int i = 0; i < n; ... | 0 | 14,522,457 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string in;
int cnt[26];
for (int i = 0; i < 26; i++){
cnt[i] = 0;
}
while (1){
getline(cin, in);
if (in.empty()) break;
for (int i = 0; i < in.size(); i++){
for (int j = 0; j < 26; j++){
if (in[i] == 'A' + j || in[i] == 'a' + j){... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
const int maxm = 2e5+10;
typedef long long LL;
LL A[maxn]; int n, edgecnt, head[maxn];
struct edge{int v, nxt;} E[maxm];
inline int read()
{
int x = 0 , f = 1; char ch = getchar();
while(ch<'0'||ch>'9') {if(ch=='-')f*=-1;ch=getchar();}
w... | 0 | 26,554,616 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int n, m, x;
int c[20];
vector<vector<int>> v, ans;
vector<int> temp;
void rec(int idx){
if(idx >= n){
ans.push_back(temp);
return;
}
temp.p... | #include <bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0)
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define S second
#define F first
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 2e5 + ... | 0 | 72,240,182 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
cout << ((d + s - 1) / s <= t ? "Yes" : "No") << '\n';
return 0;
} | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define ort... | 0 | 62,415,081 |
#include<stdio.h>
int main(void){
char kazu[1001];
int kazu2[1001];
int t,wa=0;
for(;;){
scanf("%s",kazu);
if(kazu[0]=='0'){
break;
}
for(t=0;kazu[t]!='\n'&&kazu[t]!='\0';t++){
wa+=kazu[t]-'0';
}
printf("%d\n",wa);
wa=0;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
long long n, fn;
int main() {
cin >> n;
fn = 1;
for (int i = 0; n > 1; n--) {
fn *= n... | 0 | 78,354,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
ll K;
cin >> S;
cin >> K;
ll days = 5000000000000000;
char ans;
rep(i, S.size())
{
char c = S.at(i);
int num = (int)(c - '0');
... | #include<cstdio>
int vali[100100];
int a[1000][1000];
int main()
{
for(int i=1;i*(i-1)/2<=100000;++i)
vali[i*(i-1)/2]=i;
int n;
scanf("%d",&n);
if(!vali[n])
{
puts("No");
return 0;
}
puts("Yes");
printf("%d\n",vali[n]);
int t=1,l=2*n/vali[n];
for(int i=1;i... | 0 | 8,593,482 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
int taroPoint=0,hanakoPoint=0;
string taroCard,hanakoCard;
cin>>n;
for(int i=0;i<n;i++){
cin>>taroCard>>hanakoCard;
if(taroCard > hanakoCard){
taroPoint += 3;
}else if(taroCard < hanakoCard){
hanakoPoint += 3;
}else{
ta... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 90,532,668 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n+1),b(n+1);
for(ll i=1;i<=n;i++){
cin >> a[i] >> b[i];
}
ll ans=0;
ll times=0;
for(ll i=n;i>=1;i--){
ll tmp = (a[i]+times) % b[i];
if(t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int w,h,n;
cin >> w >> h >> n;
vector<vector<bool>> p(h, vector<bool>(w, true));
for(int i = 0; i < n; i++) {
int x,y,a;
cin >> x >> y >> a;
if(a==1){
for(int j = 0; j < h; j++) {
... | 0 | 84,649,864 |
#include <iostream>
#include <cstring>
using namespace std;
const int INF = -1;
int main()
{
int a, b;
while (cin >> a >> b, a || b) {
int n;
int dp[20][20] = {0};
dp[1][1] = 1;
cin >> n;
while (n--) {
int x, y;
cin >> x >> y;
dp[y][x] ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define REP(i, a, b) for(int i = a; i >= b; i--)
#define maxN 200005
#define inf (int) 1e9
#define mode (int) 10000... | 0 | 51,105,304 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int sum = 0;
for (auto c : s)
sum += c - '0';
cout << (sum % 9 == 0 ? "Yes" : "No");
} | #include<bits/stdc++.h>
using namespace std;
#define E end()
#define B begin()
#define sz size()
#define EM empty()
#define fi first
#define se second
#define cl clear()
#define sqr(a) (a*a)
#define mk make_pair
#define po pop()
#define pu push
#define pb push_back
#define pf push_front
#define pob pop_back()
#define p... | 0 | 21,798,075 |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
cout << (n - k + 1) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 86,702,080 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
do... | #include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
using ll = long long;
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < s.size(); ++i) {
int d = s[i] - '0';
if ... | 0 | 93,693,900 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int> > S(M);
int P[M];
for(int i=0;i<M;i++){
int k=0;
cin >> k;
S[i].resize(k);
for(int j=0;j<k;j++){
int s;
cin >> s;
S[i][j]=s... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 0 | 10,596,445 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int n;
cin >> n;
int sum = 0;
for(int i = 1; i<= n ;i++){
sum+=i;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define ... | 0 | 11,180,279 |
#include <cstdio>
long long n, m, a, x, y, M=1e9+7;
int main() {
int i;
scanf("%lld%lld", &n, &m);
for(i=0; i<n; i++) {
scanf("%lld", &a);
x += a * (i-(n-1-i));
}
x %= M;
for(i=0; i<m; i++) {
scanf("%lld", &a);
y += a * (i-(m-1-i));
}
y %= M;
printf("%lld", x*y%M);
return 0;
} | #include<iostream>
using namespace std;
void bubbleSort( int* a, int n )
{
for( int i = 0; i < n; i++ )
for( int j = n - 1; j >= i + 1; j-- )
{
if( a[j] < a[j-1] )
{
int t = a[j];
a[j] = a[j-1];
a[j-1] = t;
}
... | 0 | 100,576,812 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] && s[1] == s[2] ? "No" : "Yes") <<... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int H, W;
cin >> H >> W ;
while(H!=0 || W!=0){
for (int h = 0; h< H; h++){
for ( int w = 0; w < W; w++){
if (h==0 || h==H-1 ||w==0 ||w==W-1){
cout << '#';
... | 0 | 15,905,496 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
string s;
int c = 0;
cin >> s;
string t = s;
int a = s.size();
rep(i,a){
t[s.size() - i-1] = s[i];
}
int counts =0;
rep(i,a){
if(s[i] == t[i]) counts++;
}
if(counts != a) cout << ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int n;cin>>n;
vector<ll> a(n),b(n);
for(auto &i:a)cin>>i;
for(auto &i:b)cin>>i;
if(accumulate(a.begin(),a.end(),0ll)>... | 0 | 15,918,010 |
#include<iostream>
#include<vector>
using namespace std;
void func(int &y, int &m, int &d){
d++;
if(y%3==0){
if(d>20)m++,d=1;
}
else if(m%2==1){
if(d>20)m++,d=1;
}
else if(d>19)m++,d=1;
if(m>10)y++,m=1;
}
int main(void){
int n;
cin >> n;
while(n--){
int y,m,d;
cin >> y >> m >> d;... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n,i,l=1e4,m=0,c=1e9,j,s; cin>>n;
vector<ll>a;
for(i=0;i<n;i++)
{cin>>l; a.pb(l); }
sort(a.begin(),a.end());
for(i=a[0];i<=a[n-1];i++)
{ s=0;
for(j=0;j<n;j++)
{
... | 0 | 64,394,957 |
#include "bits/stdc++.h"
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
using LL = long long int;
using LD = long double;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, dou... | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 0 | 22,003,161 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
set<int> S;
for (int i=1; i<=N; i++){
S.insert(i);
}
for (int i=0; i<K; i++){
int d;
cin >> d;
for (int j=0; j<d; j++){
int e;
cin >> e;
S.erase(e);
}
}
cout << S.size() << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | 0 | 43,646,868 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie... | 0 | 17,448,408 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 34,763,433 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.