code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
class Graph1 {
public:
static const int INF = 1000000000;
int V, E; vector<vector<int> > G;
Graph1() : V(0), E(0), G(vector<vector<int> >()) {}
Graph1(int v) : V(v), E(0), G(vector<vector<int> >(v)) {}
Graph1(vector<vector<int> > g) : V(g.... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
float c=0.0;
vector<float> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
for(int i=0;i<n;i++)
{
c+=(1.0/(v[i]*1.0));
}
cout<<(1/c*1.0)<<endl;
return 0;
} | 0 | 76,360,413 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned l... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 92,887,510 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
using namespace std;
#define ... | #include<bits/stdc++.h>
using namespace std;
vector<int> a(100000);
int main(){
int n; cin >> n;
for(int i=0; i<n; i++){
int z; cin >> z;
a[i] = z-1;
}
bool flg = true;
int pos = a[0];
int res=1;
while(true){
if(pos == 1){
break;
}else if(res >= n)... | 0 | 50,232,427 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w; cin >> h >> w;
vector<string>s(h);
rep(i, h) cin >> s[i];
vect... | #include<stdio.h>
int main(void)
{
int i,a,b,c,w;
scanf("%d %d %d",&a,&b,&c);
w=0;
for(i=a;i<=b;i++){
if(i==c){
w++;
}
}
if(w==0){
printf("No\n");
}
else{
printf("Yes\n");
}
return 0;
} | 0 | 39,738,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int N;
string S;
cin >> N;
cin >> S;
int result = 0;
for(int num = 0; num <= 999; num++)
{
int num1 = num / 100;
int num2 = num / 10 - num1 * 10;
int num3 = num % 10;
int p1 =... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
long minimum = 1000000, maximum = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++){
long a;
cin >> a;
minimum = min(a, minimum);
maximum = max(a, maximum);
sum += a;
}
cout << minimum << " " << maximum << " " << sum... | 0 | 80,896,386 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string str,manyStr,longStr;
map<string, int> m;
int cnt = 1;
int length = 0;
while(cin >> str){
m[str]++;
}
for(auto it = m.begin(); it != m.end(); it++){
if(it->first.size() > length){
length = it->first.size();
long... | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
long long n,i,b,mn[100010];
pair<long long,long long> a[100010];
long long ans[100010];
cin >> n;
for(i=1;i<=n;i++){
cin >> b;
a[i] = make_pair(b,i);
ans[i] = 0;
}
a[0] = make... | 0 | 32,069,084 |
#include<bits/stdc++.h>
#define I64 "%I64d"
#define RAN(v)v.begin(),v.end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
template<class T>
inline void upd1(T&a,T b){a>b?a=b:0;}
template<class T>
inline void upd2(T&a,T b){a<b?a=b:0;}
struct ano{
operator ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 0 | 90,720,182 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... | 0 | 67,255,189 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,r;
cin >> s >> r;
int res = 0;
for(int i=0;i<s.size();i++){
if(s.at(i) != r.at(i)) res++;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n = 1 << n;
vector<int> A(n);
for(int &x : A) { cin >> x; }
vector<pair<int, int>> dp(n, {INT32_MIN, INT32_MIN});
int sol = INT32_MIN;
for(int i = 1; i < n; ++i) {
set<int> choices;
for(int mask = 1; mask <= i; mask <<= 1) ... | 0 | 71,453,107 |
#include<cstdio>
int main(void){
while(true){
int n, x;
int i, j, k;
int ans = 0;
scanf("%d %d", &n, &x);
if(n == 0 && x == 0) break;
for(i = 1; i <= n; i++){
for(j = i + 1; j <= n; j++){
for(k = j + 1; k <= n; k++){
... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a,a+5);
cout << a[4];
for(int i = 1; i < 5; i++){
cout << " " << a[4-i];
}
cout << endl;
} | 0 | 698,935 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vl = vector<ll>;
Vl f(ll n) {
Vl v;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.emplace_back(i);
if (i * i != n) v.emplace_back(n / i);
}
}
sort(v.begin(), v.end());
return v;
}
#define ts(x) to_string(x).s... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <iomanip>
#include <cassert>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(true){
string s;
getline(cin, s);
i... | 0 | 49,975,739 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
string str;
int numOfCmd;
string cmd;
int from, to;
string rep;
cin >> str >> numOfCmd;
for(int i=0; i<n... | #include <iostream>
#define r(i) for(int i=0; i<10; i++)
using namespace std;
int main(){
int n;
while(cin >> n){
int a,b,c,d;
int cnt = 0;
r(a)r(b)r(c)r(d){
if(a+b+c+d == n) cnt++;
}
cout << cnt << endl;
}
return 0;
} | 0 | 5,369,686 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a<=c)
{
if(b<=c)
{
cout<<"0";
}
else
{
if(b>=d)
{
cout<<(d-c);
}
else
... | 0 | 100,473,250 |
#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>
#incl... | #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 | 23,742,926 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main()
{
cin >> a >> b;
cout << ((a % 2) && (b % 2) ? "Odd" : "Even") << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int u, k, p;
for(int i=0; i<n; i++) {
cin >> u >> k;
vector<int> dest;
for(int j=0; j<k; j++) {
cin >> p;
dest.push_back(p);
}
vector<int>::iterator it... | 0 | 67,397,733 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
vector<ll> vec;
int n;
bool judge(){
bool f=true;
for(int i=0;i<n;i++){
if(vec[i]>=n) f=false;
}
return f;
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
ll a;
cin>>a;
vec.push_bac... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1, 0);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < 41; i++) {
if (i == k) break;
vector<int> imos(n, 0);
for (int j = 0; j < n; j++) {
int l = ma... | 0 | 5,475,156 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int T1, T2, TS;
T1 = A * 60 + B;
T2 = C * 60 + D;
TS = T2 - T1;
... | #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... | 0 | 56,380,951 |
#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>;
int main() {
int A,B,C;
cin >> A >> B >> C;
cout << max(C-(A-B), 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 54,871,809 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
char ch;
int num[26] = {0};
while(scanf("%c", &ch) != EOF){
if(ch >= 'A' && ch <= 'Z'){
ch += 'a' - 'A';
num[ch - 'a']++;
}else if(ch >= 'a' && ch <= 'z'){
num[ch - 'a']++;
}
}
for(int i = 0; i < 26; i++){
cout << (char)(i + 'a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
int modPow(long long a, long long n, long long p) {
if (n == 0) return 1;
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
long long t = ... | 0 | 29,266,966 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(void){
int apple,pie;
cin >> apple >> pie;
int ans = floor((apple*3+pie)/2);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 84,437,733 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef long double ld;
int INF = 100100101;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s[n], tmp;
map<string,int> mp;
char end;
rep(i,... | #include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_ba... | 0 | 35,808,776 |
#include<iostream>
#include<cstring>
using namespace std;
void print(char str[],int length,int begin)
{
for(int i = 0;i < length;i++)
{
cout << str[(begin + i) % length];
}
cout << endl;
}
int main()
{
char inputStr[200] = {'\0'};
int length = 0;
int index = 0;
while (true)
{
cin >> inputStr;
if(strcmp(i... | #include <cstdio>
#include <algorithm>
int main()
{
int n, k;
scanf("%d%d", &n, &k);
int x[50], y[50];
for (int i = 0; i < n; ++i)
{
scanf("%d%d", x + i, y + i);
}
long long ans = 9e18;
for (int a = 1; a < n; ++a)
{
for (int b = 0; b < a; ++b)
{
for (int c = 1; c < n; ++c)
{
... | 0 | 93,195,376 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,D,A;
cin>>N>>D>>A;
vector<pair<int64_t,int64_t>> p(N);
vector<int64_t> q(N+1);
for(int i=0;i<N;i++){
int64_t a,b;
cin>>a>>b;
p[i]=make_pair(a,b);
q[i]=a;
}
q[N]=167167167167;
sort(p.begin(),p.end());
sort(q.begin(),q.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
map< int,... | 0 | 87,508,354 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | #include "bits/stdc++.h"
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back
#define DEBUG false
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<int,ll>;
cons... | 0 | 6,655,399 |
#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<un... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
templa... | 0 | 66,502,821 |
#include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
t... | #include<bits/stdc++.h>
using namespace std;
struct point{
double x, y;
};
void koch(int n, point p1, point p2){
point p3, p4, p5;
double rad60=M_PI*60.0/180.0;
if(n==0) return;
p3.x=(2.0*p1.x+p2.x)/3.0;
p3.y=(2.0*p1.y+p2.y)/3.0;
p4.x=(p1.x+2.0*p2.x)/3.0;
p4.y=(p1.y+2.0*p2.y)/3.0;
p5.x=(p4.x-p3.x)*co... | 0 | 31,051,581 |
#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 repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include<bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) REP(i,0,(n))
typedef long long ll;
using namespace std;
int main() {
ll N, sum = 0;
cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
sum += A[i];
}
ll k = sum / (N * (N + 1) / 2);
if (k * N * (N ... | 0 | 78,198,311 |
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
class Node {
private:
int key;
Node *p_next = NULL;
Node *p_prev = NULL;
public:
Node(int k);
void linkNext(Node *n);
void linkPrev(Node *n);
Node *getNext();
Node *getPrev();
bool hasKey(int k);
void printKey();
};
Node::Node(int... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 1,201,940 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll a[n];
rep(i,n) cin >> a[i];
sort(a,a+n)... | 0 | 79,277,046 |
#include <iostream>
using namespace std;
int main() {
int h,w;
scanf("%d %d",&h,&w);
while( h!=0 || w!=0) {
cout << string(w,'#') << endl;
for(int i=1;i<h-1;i++)
{
cout << "#" + string(w-2,'.') + "#" << endl;
}
if(h>1) {
cout << string(w,'#') << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k;
vector <int> v;
for (int i = 0; i < n; ++ i) {
int x; cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
auto chk = [&] (int forbid) ... | 0 | 2,968,344 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
array<int, 3> a;
for (int& i : a) cin >> i;
sort(a.begin(), a.end());
if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2]) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s; cin>>s;
bool flg=true;
while(flg){
flg=false;
int dream = s.rfind("dream");
int dreamer = s.rfind("dreamer");
int erase = s.rfind("erase");
... | 0 | 35,553,228 |
#include<iostream>
#include<stack>
#include<string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <stdio.h>
#include <iomanip>
#include <math.h>
#define fast(); ios_base::sync_with_stdio(0);cin.tie(0);
#define rep(i, n) for(int i= 0; i < n; ++i)
using namespace std;
int gcd(int a, int b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w, d; cin >> h >> w >> d;
vector <pair <ll, ll>> v(h*w, pair <ll, ll> ());
rep(i, h) {
rep(j, w) {
ll a; cin >> a;
... | 0 | 4,316,912 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, M;
cin >> N >> M;
vector<int> fromSt... | #include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int main() {
char str[1201];
fgets(str, sizeof(str), stdin);
for (int i = 0; i < strlen(str); i++){
if (str[i] >= 97 && str[i] <= 122)
str[i] -= 32;
else if (str[i] >= 65 && str[i] <= 92)
st... | 0 | 66,228,145 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
int* mallocint(int si)
{
return (int*) malloc(si * sizeof(int));
}
int* inputint(int n)
{
int *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
_LL _f[100004];
int main()
{
int n, m;
... | #include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using ll=long long;
int main() {
int N,M; cin>>N>>M;
priority_queue<int> q;
for (int i = 0; i < N; i++){
int A; cin>>A;
q.push(A);
}
for (int i = 0; i < M; i++){
if(q.size()){
int tmp=q.top();
... | 0 | 97,288,857 |
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#include <ostream>
#include <bitset>
#include <list>
#include <deque>
#include <complex>
#include <cassert>
#include <cstring>
#include <cstdio>
#include <cfloa... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 40,555,303 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
vector<vector<int>> x(n+1,vector<int>(n+1)),
y(n+1,vector<int>(n+1));
for(int i=0;i<n;i++){
if(i==0)x[n][i]=abs(z-a[n-1... | #include <bits/stdc++.h>
typedef long long ll;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
typedef std::pair<std::string,ll> psl;
#define INF INT_MAX
#define INF_L LONG_MAX
#define INF_LL LLONG_MAX
#define MOD 1000000007
#define REP(ii,jj,nn) for (ll ii=jj;ii<(nn);ii++)
#define RREP(ii,nn,jj) for (ll ... | 0 | 14,555,256 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N;
cin >> N;
vector<pair<int, int>> red(N), blue(N);
vector<vector<int>> G(N... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &a, int b) { if (a > b) a = b; }
const int INF = 1<<29;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int> > dp(S.size()+1, vector<int>(T.size()+1, INF));
dp[0][0] = 0;
for (int i = 0; i <= S.size()... | 0 | 47,907,517 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s,t; cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
bool ok... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((... | 0 | 93,188,767 |
#ifdef __APPLE__
#include "bits:stdc++.h"
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
auto scan = []{ static LL a; scanf("%lld", &a); return a;};
string s, noxs;
LL toid(char c){
return c - 'a';
}
LL dp[300000] = {0};
int main() {
cin >> s;
map<LL,LL>... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 +7;
signed main(){
int n,k,a,b;
cin >>n>>k;
vector<int> k0;
k0.push_back(k);
int t=1;
while(k>=(1<<t)){
if(k&(1<<t))k0.push_back((k -(1<<t))|((1<<t)-1));
t++;
}
int ans[k0.size()]={};
fo... | 0 | 2,844,930 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <array>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
using namespace std;
using ll... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | 0 | 98,754,565 |
#include <bits/stdc++.h>
using namespace std;
void turn(int &vx, int &vy){
int x, y;
x = vx;
y = vy;
vx = -y;
vy = x;
}
int main(){
int x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2;
int vx, vy;
vx = x2 - x1;
vy = y2 - y1;
turn(vx, vy);
x3 = x2 + vx;
y3 = y2 + vy;
turn(vx, vy);... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | 0 | 65,277,253 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include<algorithm>
#include<sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
int main() {
ll h, w;
cin >> h >> w;
vector<ll> s(3);
if (h < w)... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 0 | 7,077,746 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
ll n;
cin >> n;
set... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()... | 0 | 59,597,031 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) ... | 0 | 45,961,012 |
#include<bits/stdc++.h>
using namespace std;
int N, K;
int main() {
int a;
cin >> N >> K;
int sum = 0;
for (int i=0; i<K; i++) {
cin >> a;
sum += a;
}
sum >= N ? cout << "Yes\n" : cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 24,953,214 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if((y-2*x)%2==0&&(y-2*x)/2>=0&&(4*x-y)%2==0&&(4*x-y)/2>=0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> grid(h);
for(int i = 0; i < h; i++) cin >> grid.at(i);
vector<vector<int>> dp(h, vector<int> (w, 100000));
if(grid.at(0).at(0) == '#') dp.at(0).at(0) = 1;
else dp.at(0).at(0) = 0;
for(int i = 0; i < h; i++)... | 0 | 35,339,862 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
string flag;
cin >> c;
flag = "consonant";
if (c == 'a' || c == 'i') {
flag = "vowel";
}
if (c == 'u' || c == 'e') {
flag = "vowel";
}
if (c == 'o') {
flag = "vowel";
}
cout << flag << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(A) (A).begin(), (A).end()
const ll MOD = 1000000007;
ll modpow(ll n, ll r) {
ll... | 0 | 70,391,314 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,total = 0;
cin >> a >> b;
for (int i = a; i < b+1; i++) {
string str = to_string(i);
if (str.at(0) == str.at(4) && str.at(1) == str.at(3)) {
total++;
}
}
cout << total << endl;
} | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<limits>
#include<numeric>
#include<math.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repi(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define in(x) cin >> x
... | 0 | 66,994,628 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n,m;
cin>>n>>m;
vector<vector<int>> dp(n+1, vector<int> (m+1 , 100000));
vector<string> str(n);
for(int i=0;i<n;i++)
cin>>str[i];
dp[1][1] = (str[n-1][m-1] == '#') ? 1: 0;
for(int i=1;i<=n;i++)
{
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
vector<int> num(1000);
num[0] = 0;
for (int i = 1; i < 1000; i++) {
if (i%3 == 0) {
num[i] = 20*10 + num[i-1];
} else {
num[i] = 19*5 + 20*5 + num[i-1];
}
}
... | 0 | 9,277,847 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <sstream>
#include<set>
#include<stack>
using name... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
long long N ,count = 0;
cin >> N;
vector<string> st(N);
map<string,long long> str;
froop1(0,N){
string s;
cin >> s;
sort(s.begin(),s.end());
st.at(... | 0 | 3,627,747 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 2000000000
#define infLL 2000000000000000000
#define MAX 1000002
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define pf(a) printf("%d ", a)
#define pfl(a) printf("%lld\n", a)
#define Case(t) printf("Case %d: ", t)
#define p... | #include<bits/stdc++.h>
using namespace std;
int main()
{
char a[100005];
scanf("%s",&a);
int n=strlen(a);
int p=0,q=0;
for(int i=0; i<n-1; i++)
{
if(a[i]==a[i+1])
{
q=i+1;
break;
}
}
for(int i=0; i<n-2; i++)
{
if(a[i]==a[i+2])
... | 0 | 100,780,033 |
#include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 2,207,459 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#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 fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> gr;
int n, q;
struct DSU{
vector<int> par, siz;
int n;
DSU(int n_) {
int n = n_ + 1;
par.resize(n);
siz.resize(n);
fill(siz.begin(), siz.end(), 1);
iota(par.begin(), par.end(), ... | 0 | 41,461,556 |
#include<bits/stdc++.h>
#define ll long long int
#define l(i,a,b) for(ll i=a;i<b;i++)
using namespace std;
int main(){
string s;
cin>>s;
if(s[2]==s[3]&&s[4]==s[5]) cout<<"Yes\n";
else cout<<"No\n";
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a,b;
while(cin>>a>>b)
{
if(a+b==15)
{
cout<<'+'<<endl;
}
else if(a*b==15)
{
cout<<'*'<<endl;
}
else
... | 0 | 100,532,145 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string com;
string str;
string str_p;
string str_temp;
int n;
int a,b;
cin >> str;
cin >> n;
for(int i=0; i<n; ++i) {
cin >> com;
if(com=="print") {
cin >> a >> b;
cout << str.substr(a,b-a+1) << endl;
} else if(com=="reverse") ... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> a;
void input() {
cin >> N;
a.resize(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
}
void solve() {
input();
int d = 0;
for (auto ai : a)
d = max(d, ai);
map<int, int> cnt;
for (auto ai : a)
++cnt... | 0 | 18,615,888 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vec... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(... | 0 | 87,972,430 |
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int x, y, H, W, r;
cin >> W >> H >> x >> y >> r;
if (r <= x && x <= (W - r) && r <= y && y <= (H - r)) cout << "Yes" << endl;
else cout << "No" << end... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pcc = pair<char, char>;... | 0 | 5,215,610 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, y;
cin >> n >> y;
int res1 = -1, res2 = -1, res3 = -1;
for(int i=0; i<=n; i++){
for(int j=0; i+j<=n; j++){
int k=n-i-j;
int total = 10000*i+5000*j+1000*k;
if(total==y){
res1 = i;
res2 = j;
res3 = k;
}
}
}
cout << res1 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int gcd(int a, int b) {
return b ? gcd(b, a%b) : a;
}
int main(){
int N, K; cin >> N >> K;
ll Max = 0;
vector<ll> V(N);
for(int i = 0; i < N; i++) {
cin >> V[i];
... | 0 | 73,081,068 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
long long min=0,max=0,total=0;
int x,n;
cin >>x;
for (int i=1; i<=x; i++) {
cin >> n;
if(i==1){
min =n;
max=n;
total=n;
}else {
if(n<min){
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
string s, t; cin >> s >> t;
int n = s.size();
map<char, in... | 0 | 24,849,436 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_ba... | 0 | 21,919,932 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
string str;
while(getline(cin, str)){
if(str==".") break;
stack<char> st;
for(int i=0;i<str.size();i++){
if(str[i]=='('||str[i]=='[') st.push(str[i]);
if(str[i]==')'){
if(!st.empty()&&st.top()=='(') st.pop();
e... | 0 | 69,661,069 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
map<int, set<int>> G;
int N, M;
int dfs(int c, int p, int cnt) {
if (cnt == 2) {
if (c == N - 1) {
return true;
}... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | 0 | 73,191,460 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double N,K;
cin >> N >> K;
double p = 0;
for(double i=1; i<=N; i++)
{
double temp = 1.0 / N ;
int point = i;
while(point < K){
temp *= 0.5;
point *= 2;
}
p += temp;
}
co... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 0 | 87,299,438 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int m... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 61,151,762 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
ret... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,y;
cin >> n >> y;
int tth=n,fth=0,th=0;
bool ok=false;
for(int i=0;i<=n;i++){
tth=i;
for(int j=0;j<=n-i;j++){
fth=j;
th=n-i-j;
if(tth*10000+fth*5000+th*1000==y){
ok=true;
break;
}
}
if(ok)
... | 0 | 60,440,998 |
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <cstring>
#include <cmath>
using namespace std;
#define MAXA 1001
#define MAXB 1001
#define MAXH 1000000001
#define MAXW 301
#define INF (1LL << 50)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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 int IN... | 0 | 35,664,596 |
#include<iostream>
int main(){std::string S,T;std::cin>>S>>T;puts(~(S+S).find(T)?"Yes":"No");} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | 0 | 70,538,234 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
string s;
cin>>n>>k>>s;
vector<pair<long long,long long>> line;
int now;
int cnt=0;
for(int i=0;i<n;i++){
int hoge=s.at(i)-'0';
if(i==0){
now=hoge;
cnt++;
continue;
}
if(now!=hoge... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | 0 | 25,894,122 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> h(n+1);
for(int i = 0; i < n; i++) cin >> h[i];
h[n] = h[n-1]+1;
int ans = 0;
for(int i = 1, start = 0; i <= n; i++){
if(h[i-1] >= h[i]){
;
}else{
if(i-... | 0 | 71,323,688 |
#include <iostream>
using namespace std;
int main()
{
int n,x,s;
while(cin >> n >> x, n+x)
{
s=0;
for(int i=1;i<n-1;++i)
for(int j=i+1; j<n;++j)
{
int k = x - i- j;
if(k>=1 && k<=n && k > i && k > j) ++s;
}
cout << s << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 0 | 60,147,782 |
#include<iostream>
int main(){
int a, b, c, x;
std::cin >> a >> b >> c;
if(a == b)
x = c;
else if(b == c)
x = a;
else
x = b;
std::cout << x << std::endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | 0 | 92,109,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a, b, c;
set<int> s;
int x;
for(int i = 0; i < n; i++){
cin >> x;
c.push_back(x);
if(i % 2 == 0){
a.push_back(x);
s.insert(x);
}
else{
b.... | #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;
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmax(... | 0 | 92,296,214 |
#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 INF = 1001001001;
int a[12][12];
int main() {
int N;
cin>>N;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(4*i+7*j==N){cout<<"Yes"<<endl;return 0;}
}
... | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | 0 | 2,330,529 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B) {
cout << (A-1)*(B-1) << endl;
}
int main() {
ll A;
cin >> A;
ll B;
cin >> B;
solve(A, B);
ret... | #include <bits/stdc++.h>
using namespace std;
int n , k;
int add (int a , int b) {
a = (a % k + k) % k;
b = (b % k + k) % k;
return (a + b) % k;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1 ;i <= n ;i++)
cin >> a... | 0 | 8,100,050 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'a') {
cout << "vowel" << endl;
}
else if (c == 'i') {
cout << "vowel" << endl;
}
else if (c == 'u') {
cout << "vowel" << endl;
}
else if (c == 'e') {
cout << "vowel" << endl;
}
else if (c == 'o')... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 3,740,376 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n;
ll ans;
vector<ll> aa(100);
vector<ll> maxk(100);
int main() {
ll a,b,c,d,h,i,j,k,l,m,x,y;
ans = 1000;
cin >> n;
for(i=1;i<=n;i++) cin >> aa[i];
maxk[0] = 1000;
for(i=1;i<=n;i++) {
... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 0 | 6,869,388 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | #include<bits/stdc++.h>
using namespace std;
vector<long long>adj[100005];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long... | 0 | 64,222,395 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,a,b;
cin >> k >> a >> b;
bool e = false;
for(int i=a;i<=b;i++){
if(i % k == 0) e = true;
}
if(e == true) cout <<"OK" << endl;
else cout << "NG" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
string s; cin >> s;
ll k; cin >> k;
int n = s.size();
bool flag = true;
ll sum =... | 0 | 30,448,510 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
# define ll long long
# define int long long
# define endl "\n"
#define g... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 34,560,200 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<bitset>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#def... | #include<bits/stdc++.h>
using namespace std;
struct Node{
int right,left,parent;
Node(){ right=-1;left=-1;parent=-1; }
};
int main(){
int n;
scanf("%d",&n);
Node tree[n];
int id,k,c;
for(int i=0;i<n;++i){
scanf("%d%d",&id,&k);
if(k){ scanf("%d",&c); tree[id].left=c; tree[c].p... | 0 | 72,182,107 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long N,M,L =1; cin >> N >> M;
long a[N];
for (int i =0; i<N; i++) {
cin >> a[i]; a[i] /=2; L = lcm(L,a[i]);
}
for (int i =0; i<N; i++) {
if (L / a[i] % 2 ==0) {
cout << 0 << endl;
return 0;
}
}
long ans;
if (M % (2*L) >=L... | #include<iostream>
#include<queue>
#include<string.h>
using namespace std;
char map[1005][1005];
char map1[1005][1005];
int a[1005][1005];
int m,n,q,num=0;
int main()
{
int x,y;
cin>>m>>n>>q;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
x=i;
y=j;
ma... | 0 | 65,176,604 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef pair<int,int> P;
int n;
int S[10001],E[10001];
int f[216005];
int main(){
while(scanf("%d",&n),n){
memset(f,0,sizeof(f));
for(int i=0;i<n;i++){
int s1,h1,m1,s2,h2,m2;
... | #include<iostream>
using namespace std;
int main(){
int H;
int W;
for (;;){
cin >> H >> W;
if (H == 0 && W == 0){
return 0;
}else{
for (int b = 0; b < H; b++){
for (int c = 0; c < W; c++){
if (c == 0){
cout << "#";
}
else if (c == W-1){
cout << "#";
}
else if (b =... | 0 | 17,106,166 |
#include <bits/stdc++.h>
using namespace std;
void solve () {
int n;
cin >> n;
unordered_map<string, long long> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
ans += p.s... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloa... | 0 | 56,015,269 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b;
ll ans;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> a >> b;
for (int i = 0; i < 45; i++) {
ll start;
if (a % (1ll << i) == 0) start = a;
else {
start = a + ((1ll << i) - (a % (1ll << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < n; i ++)
#define rep1(i, n) for (int i=1; i <= n; i ++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
vector<vector<long long> > dp(305, vector<long long>(305, 300000000000));
int main() {
int N, K; cin >> N >> K;
... | 0 | 47,531,049 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
for(int i=1;i<n;i++){
int tmp = (n-1)/i;
ans += tmp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 31,034,391 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#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 SORT(s) sort((s).begin(),(s).... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main(){
int n;
cin >> n;
vector... | 0 | 39,227,238 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<queue>
#include<functional>
using namespace std;
namespace MyLib {
#define ALL(a) a.begin(),a.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define debug(x) if(1)cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
int main(void){
int n;
cin >> n;
int a[n];
for(int i = 0... | 0 | 37,363,735 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(... | 0 | 45,322,767 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin >> n >> m >> x >> y;
vector<int> p(n);
vector<int> q(m);
for(int i = 0; i < n; i++){
cin >> p[i];
}
for(int i = 0; i < m; i++){
cin >> q[i];
}
int count = *max_element(p.begin(),p.end())+1;
if(count <= *min_element(q.b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define OUT(x) cout << (x) << endl;
#define OUTA(a, n) \
REP(i, n) { cout << (a[i]) << (i == n - 1 ? "\n" : " "); }
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL... | 0 | 12,205,202 |
#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>;
int main(void){
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
ll n;
cin >> n;
ll t0, x0, y0;
cin >> t0 >> x0 >> y0;
ll count = 0;
ll check = 0;
if (n == 1){
if (abs(x0) + abs(y0) != 1) check = 1;
}
else{
while(count ... | 0 | 1,231,640 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
n--;
int c = 0;
for (int a = 1; a <= n; ++a)
c += n/a;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> edge[1000010];
int n,poi[1000010],u,v;
void dfs(int u,int fa)
{
poi[u]=0;
for(auto v : edge[u])
{
if(v==fa) continue;
dfs(v,u);
poi[u]^=poi[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;++i)
{
... | 0 | 2,146,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#includ... | 0 | 27,199,080 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
ll n1;
cin>>n1;
if(n1<1200)cout<<"ABC";
else cout<<"ARC";
}
int ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int MOD = 100... | 0 | 32,464,550 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(void){
char S[10];
int S1, S2, S3;
scanf("%s", S);
S1 = (S[0] - 48) * 1000 + (S[1] - 48) * 100 + (S[2] - 48) * 10 + (S[3] - 48);
if(S[5] == '0')
S2 = S[6] - 48;
else
S2 = (S[5] - 48) * 10 + (S[6] - 48);
if(S[8] == '0')
S3 = S[9] - 48;
els... | 0 | 62,280,089 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const double PI = acos(-1);
void koch(int n, pair<double,double> p1, pair<double,double> p2){
if( n==0 )
return;
pair<double,double> s, t, u;
double th = PI*60/180;
s.first = (2.0*p1.first+ 1.0*p2.first)/3.0;
s.seco... | 0 | 10,524,689 |
#include <iostream>
#include <cstdio>
using namespace std;
double fx (double d, double x)
{
if (x == 0) return 0;
else return d * x * x + fx(d, x - d);
}
int main(void)
{
double d, x;
while (cin >> d) {
x = 600;
printf("%.0f\n", fx(d, x - d));
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | 0 | 88,630,904 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,h;
cin>>n>>h;
int a[n],b[n];
ll x = 0;int c=0;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}
sort(a,a+n);
sort(b,b+n,greater<int>());
for(int i=0;i<n;i++)
if(b[i]>a[n-1]){
x += b[i];
c++;
if(x>=h)
{
cout<<c<<"... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
string o,e;
cin >> o >> e;
vector<char>s(o.size()+e.si... | 0 | 71,602,580 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
vector<int>a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin(),a.end(),greater<>());
cout<<a[0]-a[2]<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <bitset>
using namespace std;
int n;
vector<int> graph[500000];
int col[500000];
int sz[500000];
void dfs(int v)
{
col[v] = 1;
sz[v] = 1;
for (auto u : graph[v])
{
if (col[u] == 0)
{
dfs(u);
... | 0 | 41,779,738 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define substr(s,f,t) (s.substr(f-1,t-f+1))
#define ALL(a) (a).begin(),(a).end()
#define Yes(hog... | 0 | 64,964,149 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N,M;
cin >> N >> M;
vector<long long>A(N);
long long num = 0;
map<long long, long long>mp;
long long ans = 0;
mp[0] = 1;
for (int i = 0;i<N;++i) {
cin >> A[i];
num += A[i];
num %= M;
mp[num]++;
}
for (auto itr = mp.begin(); itr != mp... | #include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long int> ;
bigint dp[300011] ;
int main(){
FAST_IO ;
dp[0] = 1 ... | 0 | 51,834,842 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.