code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve16(int a, int b) {
vector<int> v;
REP(i,a) {
int j;
ci... | #include <iostream>
#include <bitset>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int min = 10000000;
for (int tmp = 0; tmp < (1 << N); tmp++) {
int D = 1;
bitset<10> s(tmp);
for (int i = 0; i < N; i++) {
if (s.test(i)) {
D = D * 2;
... | 0 | 91,985,366 |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i < (ll)(n); ++i)
#define INF 5000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
int ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
map<char,int> m;
cin >> ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define F... | 0 | 84,903,809 |
#include <bits/stdc++.h>
using namespace std;
void getPerms(int index, int limit, vector<string>& v, vector<int>& visited, string cur)
{
if(index == limit)
{
v.push_back(cur);
return;
}
for(int i = 0; i < limit; ++i)
{
if(visited[i] == 0)
{
visited[i] = 1;
getPerms(index+1, limit, v, visited, cur + t... | #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (long ... | 0 | 74,202,586 |
#include<stdio.h>
#include <string.h>
int main(){
char kata[101];
int angka;
scanf("%d", &angka);
scanf("%s", &kata);
int panjangKata = strlen(kata);
if(panjangKata>angka){
kata[angka] = '\0';
for(int i=0; kata[i] != '\0'; i++){
printf("%c", kata[i]);
}
printf("...");
}
else {
printf("%s", kata);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
map<string, int> T;
string S;
int N;
cin >> N;
for(int i = 0; i < N; i++){
cin >> S;
T[S]++;
}
int M;
cin >> M;
for(int i = 0; i < M; i++){
cin >> S;
T[S]--;
}
int ans = 0;
map<string... | 0 | 45,268,062 |
#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>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 1010
ll x[N],y[N],n;
int NOE(){
cout<<-1<<endl;
return 0;
}
int main(){
cin>>n;
set<bool> sl,sr;
lol... | 0 | 60,793,046 |
#include <cstdio>
#include <cstring>
int main(){
int ans;
char s[2000];
while (1) {
ans = 0;
scanf("%s", s);
if (s[0] == '0') {
break;
}
for (int i = 0; i < strlen(s); i++) {
ans += s[i] - '0';
}
printf("%d\n", ans);
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <array>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int p[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
struct R {
R() ... | 0 | 12,100,770 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
map<ll, int> MP;
rep(i, 0, N){
ll tmp;
cin >> tmp;
MP[tmp]++;
}
... | #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 a,b,c,d;
cin >> a >> b >> c >> d;
int l=a+b,r=c+d;
string message;
if(l<r){
message="Right";
}else if(l>r){
message="Left";
}else{
message="Balanc... | 0 | 47,368,891 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 45,449,796 |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int x,y;
int main(void){
scanf("%d%d",&x,&y);
bool flag=false;
for(int i=0;i<=x;i++){
if(i*2+(x-i)*4==y){
flag=true;
}
}
printf("%s\n",flag?"Yes":"No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
double pi = 3.14159265358979;
ll r(ll x, ll y) {
if (y == 0) return 1;
else if (y % 2 == 0) return r(x, y/2) * r(x, y/2);
else return x * r(x, (y-1)/2) * r(x, (y-1)/2);
}
int main() {
ll n, p;
cin >> n >> p;
vector<... | 0 | 19,126,612 |
#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(){
int n;
cin >> n;
string s;
cin >> s;
int a = 0;
int b = 0;
int mina = 0;
int maxb = 0;
rep(i, n){
if(s.at(i) == '('){
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int... | 0 | 31,011,012 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N=1e5+5;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define point complex<double>
ll mod=1e9+7;
ll inf=2e18;
double eps=1e-10;
double pi=acos(-1);
double dot(point a, point b)... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define Rep(i,n) for(ll i = 0; i <= n; i++)
#define REp(i,n) for(ll i = 1; i < n; i++)
#define REP(i,n) for(ll i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#d... | 0 | 2,729,829 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
ci... | #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... | 0 | 55,389,753 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
typedef double DOUBLE;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REP... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
long long A[100000];
long long diff_A[100000];
long long x[100000];
long long y[1000... | 0 | 21,433,619 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, w[110];
int sum = 0;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
int mini = sum;
int s1 = 0, s2;
for (int i = 0; i < n; i++) {
s1 += w[i];
s2 = sum - s1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int main(){
int N;cin>>N;
vector<pair<ll,int>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first;
A[i].second=i;
}
sort(all(A));
rever... | 0 | 74,944,267 |
#include<cstdio>
long long x,y;
long long ww(long long a)
{
if(a<0)a=-a;
return a;
}
int main()
{
scanf("%lld%lld",&x,&y);
if(ww(x-y)<2)
printf("Brown\n");
else printf("Alice\n");
} | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
long long tmpmax(vector<long long>s, int n){
long long tmpmax = -1e9;
rep(i,n){
tmpmax = max(tmpmax, s.at(i));
}
return tmpmax;
}
int main(){
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
r... | 0 | 21,640,739 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
const int mod = 998244353, maxn = 1e5+10;
int N, M, K;
int h[maxn], dp[maxn];
int main()
{
memset(dp, 0x3f,sizeof(dp));
scanf("%d %d", &N, &K);
for(int i = 1; i <= N; i++)
scanf("%d", ... | 0 | 41,573,789 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | #include <iostream>
#include <string>
using namespace std;
int R, S, P;
int tokuten(char t){
if(t == 'r') return R;
if(t == 's') return S;
if(t == 'p') return P;
}
char kachite(char t){
if(t == 'r') return 'p';
if(t == 's') return 'r';
if(t == 'p') return 's';
}
string dasute(int R, int S, int P){
int a[]... | 0 | 88,984,490 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
set<int> S;
S.insert(a);
S.insert(b);
S.insert(c);
cout << S.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | 0 | 9,845,672 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c, k;
cin >> a >> b >> c >> k;
if (k % 2 == 0) {
cout << a - b << '\n';
} else {
cout << b - a << '\n';
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int x,n;
cin >> x >> n;
if (n == 0) {
cout << x << endl;
return 0;
}... | 0 | 80,963,369 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,b,r,count=0,res;
cin >> n >> b >> r;
count = n/(b+r);
res = b*count;
n %= (b+r);
if((n-b)<=0) res += n;
else res += b;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 79,307,860 |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <class T> inline ... | #include <iostream>
using namespace std;
int main()
{
int n, debt = 100000;
cin >> n;
for (int i = 0; i < n; i++) {
debt *= 1.05;
if (debt % 1000 != 0) {
debt += 1000 - debt % 1000;
}
}
cout << debt << endl;
return 0;
} | 0 | 52,206,739 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
cin>>a>>b;
l=max(a,b);
r=min(a,b);
p=16-(a+b);
x=p/2;
if(p%2==1){
x++;
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
string s,t;
cin>>s>>t;
int i=0;
int c=0;
int j=0;
int ans=10000;
int tmp=0;
while(true){
if(i>s.length())break;
if(j>=t.length()){
if(tmp<ans)ans=tmp;
tmp=0;
j=0;
c+=1;
... | 0 | 100,339,244 |
#include <iostream>
#include <sstream>
#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 <cfloat>
using namespace std;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
map<int, int> M;
for(int i=0; i<N; i++) {
int x;
cin >> x;
M[x]++;
}
ll ans = 0;
ll count = 0;
for(auto m:M) {
... | 0 | 85,566,021 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N + 2, 0);
int sum = 0;
rep(i, 1, N + 1) cin >> A.at(i);
rep(i, 0, N + 1) sum += abs(A.at(i + 1) - A.at... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
using namespace std;
int main(){
int N,M;
cin >> N;
vector<string> S(N);
for(int i=0; i<N; i++){
cin >> S[i];
}
cin >> M;
vector<string> T(M);
for(int j=0; j<M; j++){
cin >> T[j];
}
set<str... | 0 | 3,238,244 |
#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() {
int N, R;
cin >> N >> R;
if(N >= 10) cout << R << endl;
else cout << R + (100*(10-N)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 80,503,451 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long a,b,c,d,n;
cin >> a >> b >> c >> d >> n;
b = min(a*2,b);
c = min(b*2,c);
d = min(c*2,d);
cout << (n/2)*d+(n%2)*c << endl;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++)
{
cin>>a[i];
}
ll sum=0,cur=1000,i,j;
for(i=0;i<n;)
{
for(j=i+1;j<n;j++)
{
ll temp=a[j]-a[j-1];
if(temp<0 )
{
... | 0 | 37,312,423 |
#include<bits/stdc++.h>
using namespace std;
long long t,s,p,n,h,a[100005],b[100005];
int main(){
cin>>n>>h;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
t=max(t,a[i]);
}
sort(b+1,b+n+1);
reverse(b+1,b+n+1);
for(int i=1;i<=n;i++){
if(b[i]<t) break;
s+=b[i];
if(s>=h){
cout<<i;
return 0;
}
p=i;
}
l... | #include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(... | 0 | 96,311,982 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,i,t=0,h=0;
string tstr,hstr;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> tstr >> hstr;
if(tstr==hstr){
t++;h++;
}
else if(tstr>hstr)t+=3;
else h+=3;
}
cout <<t<<' '<<h<<endl;
return 0;
} | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string s; cin >> s;
int K; cin >> K;
i... | 0 | 76,441,705 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
cin >> n >> d;
vector<vector<int> > x(n, vector<int>(d));
for (int i = 0; i < n; i++) for (int j = 0; j < d; j++) cin >> x[i][j];
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define ll long long
using namespace std;
void file(){
#ifn... | 0 | 25,362,621 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const int SIZE = 51;
char a[SIZE][SIZE];
char b[SIZE][SIZE];
int n, m;
bool isContained(){
for (int i=0;i<=n-m; i++)
for (int j=0; j<=n-m; j++){
int isEqual = true;
for (int x=0; x<m; x++)
... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf ... | 0 | 18,891,787 |
#include <iostream>
using namespace std;
int G[101][101];
int main() {
int n;
cin >> n;
fill(G[0], G[101], 0);
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
G[u][v] = 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N, K;
cin >> N >> K;
vector<int> H(N);
int64_t sum = 0;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
sum += H.at(i);
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
int64_t sum2 = 0;
if (K < N) {
for (int i = 0; i ... | 0 | 90,759,207 |
#include <iostream>
#include <numeric>
using namespace std;
long long gcd(long long a,long long b){
long long tmp;
if(a > b){
while(b != 0){
tmp = b;
b = a%b;
a = tmp;
}
return a;
}else{
while(a != 0){
tmp = a;
a = b%a;
b = tmp;
}
return b;
}
}
long long lcm(long long a,long long b){
... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N,D;
cin>>N>>D;
vector<vector<int>> vec(N,vector<int>(D));
for(int i=0;i<N;i++){
for(int j=0;j<D;j++){
cin>>vec[i][j];
}
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
... | 0 | 74,980,071 |
#include <cstdio>
#include <string.h>
using namespace std;
namespace {
const size_t kHashSize = 244140624;
class Dictionary {
public:
Dictionary() : table_(new int[kHashSize]) {
ps_[0] = 1;
for (int i = 1; i < 12; ++i) {
ps_[i] = 5 * ps_[i - 1];
}
}
~Dictionary() { delete[] table_; }
void ins... | #include <iostream>
using namespace std;
int a,b;
int main(){
while(1){
cin>>a>>b;
if(a==0 && b==0){
break;
}
int dp[25][25]={},n=0,xi=0,yi=0,k[50][50]={};
cin>>n;
for(int i=1;i<=n;i++){
cin>>yi>>xi;
k[yi][xi]=-1;
}
if(k[1][1]!=-1){
dp[1][1]=1;
}
for(int y=1;y<=a;y++){
for(int x=1;x<=b;x++){
if(k... | 0 | 65,244,794 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
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... | 0 | 68,468,207 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define maxN 100007
usin... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
#include <stack>
using namespace std;
#define COUT(x) c... | 0 | 20,874,010 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
void solve(ll N, vector<ll> H) {
int ma{};
int ans{};
for(auto i=0; i!=N; ++i) {
if (ma <= H[i]) {
ma = H[i];
++ans;
}
}
cout << ans << endl;
}
int main() {
ll N;
cin >> N;
vector<ll> H(N);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#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)
#define ALL(x) (x).begi... | 0 | 98,995,411 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 59,142,590 |
#include<iostream>
using namespace std;
int main()
{
int a=0,b=0,c=0;
cin>>a>>b>>c;
if(b>a&&c>b)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #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;
template<typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int infI=1e9+5;
const long long infL=1e16;
const in... | 0 | 27,684,460 |
#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 <iostream>
#include <algorithm>
using namespace std;
int main(void) {
string s, t, c;
int q, a, b;
cin >> s >> q;
for (int i = 0; i < q; i++) {
cin >> c >> a >> b;
if (c == "replace") {
cin >> t;
s.replace(a, b - a + 1, t);
}
if (c == "rev... | 0 | 67,729,706 |
#include <bits/stdc++.h>
using namespace std;
void insert(vector<int> &p_q,int last,int val){
p_q.push_back(val);
last++;
int last_p = (last-1)/2;
while(last >= 0 && p_q[last] > p_q[last_p]){
swap(p_q[last],p_q[last_p]);
last = last_p;
last_p = ((last-1)/2);
}
}
void make_hea... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#defi... | 0 | 45,191,870 |
#include<iostream>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
int a, total=0;
rep(i,m){
std::cin >> a;
total += a;
}
std::cout << (total > n ? -1 : n-total) << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, c, k; cin >> n >> c >> k;
priority_queue<int, vector<int>, greater<int>> arrival;
priority_queue<int,... | 0 | 11,028,705 |
#include<bits/stdc++.h>
using namespace std;
long long int f[100005][3];
long long int a[100006],a1[100005],a2[100005];
int main()
{
long long int mod,t,k=0,i,m,n,x,j=0,l,c=0,r=0,w,s,d=0,sum=0,mul,mx1,mx,s1=10000000,s2=0;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>a[i]>>a1[i]>>a2[i];
}
f[n+1][0]=f[n... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <numeric>
#include <cmath>
#include <stdio.h>
using namespace std;
int main()
{
int n, m; cin >> n >> m;
v... | 0 | 856,787 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> x(10);
int i = 0;
for(; i < 10; i++) cin >> x[i];
sort(x.begin(), x.end());
for(i = 9; i > 6; i--) cout << x[i] << endl;
} | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int n,d,x[10][10],i,j,t,ans=0;
double sum=0,num;
cin>>n>>d;
for(i=0;i<n;i++){
for(j=0;j<d;j++){
cin>>x[i][j];
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
for(t=0;t<d;t++){
sum+=pow(x[i][t]-x[j][t],2);
}
num=sqrt(sum);
if(f... | 0 | 25,316,828 |
#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%.8lf\n", sqrt( (x2-x1) * (x2-x1) + (y2-y1) * (y2-y1) ) );
return 0;
} | #include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(i=0;i<(n);i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int inputValue(){... | 0 | 45,296,111 |
#include <stdio.h>
int main (){
int n,r,z;
scanf ("%d %d", &n, &r);
z = 100 * (10 - n);
if (n < 10){
printf ("%d\n", r + z);
}
else if (n >= 10){
printf ("%d\n", r);
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
#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##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using namespace std;
using P... | 0 | 55,464,381 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int f[3] = {0, 0, 0};
for(char x : s){
if(x == 'a') f[0] = 1;
else if(x == 'b') f[1] = 1;
else if(x == 'c') f[2] = 1;
}
if(f[0]&&f[1]&&f[2]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i) = 0; (i) <(n); (i)++)
#define so(v) sort(v.begin(),v.end())
using ll = long long;
using vi=vector<int>;
using vii=vector<vi>;
const int MAX = 510000;
const int MOD = 1000000007;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return(b);
}... | 0 | 71,938,342 |
#include <iostream>
#include <numeric>
int main() {
long long n, x;
std::cin >> n >> x;
std::cout << 3LL * (n - std::gcd(n, x)) << '\n';
return 0;
} | #include<iostream>
#include<list>
using namespace std;
int main(){
list<int> l;
int commands;
char command[20];
int data;
cin >> commands;
for(int i=0;i<commands;i++){
cin >> command;
if(command[0]=='i'){
cin >> data;
l.push_front(data);
}else if(command[6]=='F'){
l.pop_front();
}else if(command[... | 0 | 63,148,553 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
const double PI=3.1415926535897932;
ll N, L, Q, ans=0, tmp=0;
vector<ll> A;
vector<vector<ll>> C;
string S;
signed main(){
cin >> N;
C.resize(20,... | #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
#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++)... | 0 | 1,357,443 |
#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>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
Graph G(N);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
a--;
G[i].push_back(a);
}
vector<int> dist(... | 0 | 26,517,640 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #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;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int ... | 0 | 24,696,267 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int a[N],b[N],c[N];
int dp[N][3];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i]>>b[i]>>c[i];
for(int i=1;i<=n;i++){
dp[i][0] = max(dp[i-1][1]+b[i],dp[i-1][2]+c[i]);
dp[i][1] = max(dp[i-1][0]+a[i],dp[i-1][2]+c[i]);
dp[i][2] = max(d... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 11,128,359 |
#include <vector>
#include <string>
#include <iostream>
using tree_t = std::vector<std::vector<int>>;
void dfs(int s, tree_t & tree, long long * counter, int * is_calculated) {
is_calculated[s] = true;
const auto sub_tree { tree[s] };
for (std::size_t i = 0, elements = sub_tree.size(); i < elements; ++i) {
... | #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() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
vector<vector<int>> s(m);
rep(i, m) {
cin >> k[i];
s[i] = vector<int>(k[i]);
rep(j, k[i]) {
... | 0 | 92,198 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char ch;
cin>>ch;
if(ch >= 'a')cout<<"a"<<endl;
else cout<<"A"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,n,a;
cin >> x >> n;
vector<int> p(n);
vector<int> arr(101, 1);
for(int i=0; i<n; i++){
cin >> a;
arr.at(a) = 0;
}
int j=1, check = 1;
if(arr.at(x)==1){
cout << x << endl;
return 0;
}
while(check==1){
if(x+j > 100){
... | 0 | 85,462,380 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int n,minimum,tmp;
scanf("%d",&n);
int table[n][n];
int data[n][2];
for(int i=0;i<n;i++){
for(int k=0;k<n;k++)table[i][k] = 0;
scanf("%d %d",&data[i][0],&data[i][1]);
}
for(int i=n-2;i>=0;i--){
for(int k=0;k<=i;k++){
if(i==n-2){
... | #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()
const int MAX_N = 1000010;
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = ... | 0 | 40,076,091 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
constexpr auto M = 1000000007L;
int64_t powm(int64_t x, int64_t y) {
if (y == 0) {
return 1;
}
if (y == 1) {
return x;
... | #define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <utility>
#include <climits>
#include <vector>
#include <map>
#include <queue>
using namespace std;
#define ll long long
const int MOD = 1000000007;
const string SPACE = " ";
ll max(ll a, ll... | 0 | 71,430,551 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(int qtd, char* nome[])
{
ios::sync_with_stdio(false);
cin.tie(0);
map<string, int> mp;
string s1, s2;
cin >> s1 >> s2;
cin >> mp[s1] >> mp[s2];
string t;
cin >> t;
mp[t]--;
cout << mp[s1] << ' ' << mp[s2] << endl;
return 0;
} | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
const int mod = 1e9 + 7;
vector<int> cnt(26);
ll get(int idx, ll cur) {
if(idx == 26) {
return cur % mod;
}
ll ans = get(idx + 1, cur);
ans += get(idx + 1, (cur * cnt[idx]) % mod);
return ans % mod;
}
void solveCase() {
int n;
... | 0 | 17,043,254 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long m,n;
cin>>n>>m;
vector<long long> v(n+1);
v[0]=0;
for(int i=0;i<n;i++){
cin>>v[i+1];
}
for(int i=0;i<n;i++){
v[i+1]+=v[i];
}
for(int i=0;i<=n;i++){
v[i]=v[i]%m;
}
sort(v.begin(),v.end()... | 0 | 52,041,723 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct city {
int id;
int prefecture;
int birth;
string number;
};
bool id_cmp(const struct city& l, const struct city& r) { return l.id < r.id; }
bool birth_cmp(const struct city& l, const struct city& r) {
return l.birth < r.birth... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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 in... | 0 | 62,652,375 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++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 b) { if(a > b){ a... | #include <stack>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
string s;
cin >> s;
int l = 0, r = 0, n = s.size();
int i = 0;
while (s[i] == 'B')
++l, ++i, ++r;
while(i < n)
{
if ((s[i]... | 0 | 99,509,676 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
long double n;
cin>>n;
n=n/3;
n=n*n*n;
cout<<fixed<<setprecision(8)<<n;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n,m;
cin >> n>> m;
ll s[n],t[m];
for(int i=0;i<n;i++)cin >> s[i] ;
for(int i=0;i<m;i++)cin >> t[i];
ll dp[n+1][m+1];
memset(dp,0,sizeof(dp));
ll l[n+1][m+1];
memset(l,0,size... | 0 | 13,114,316 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
vector<int> l(2*n);
int sum =0;
rep(i,2*n){
cin >> l[i];
}
rep(i,2*n){
rep(j,2*n-i-1){
int temp;
if(l[j]>l[j+1]){
temp =l[j];
l[j] = l[j+1];
l[j+1]=t... | #include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int main() {
int64_t N, sum = 0;
cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
sum += A[i];
}
int64_t oneMove = N * (N + 1) / 2;
if (sum % oneMove) {
puts("NO");
return 0;
}
i... | 0 | 78,674,468 |
#include <bits/stdc++.h>
using namespace std;
char S[8080];
vector <int> X, Y;
bool D[8080];
int x, y;
void die() { printf("No\n"); exit(0); }
int main()
{
int i, d, s;
scanf("%s%d%d", S, &x, &y);
for(i=0; S[i] && S[i] != 'T'; i++);
x -= i;
if(!S[i] && (x || y)) die();
x = abs(x); y = abs(y);
for(d=1, s=0; S[i];... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int c = 0, max_c = 0;
vector<int> H(N);
for(int i=0; i<N; i++) {
cin >> H[i];
}
for(int i=0; i<N-1; i++) {
if(H[i] >= H[i+1]) c++;
else c = 0;
max_c = max(max_c, ... | 0 | 90,364,801 |
#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>
#include<t... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
long long K;
cin >> K;
string T = S + S;
string T_ = S + S + S;
long long N = S.size();
long long count = 0;
for (int i = 1; i < N; i++){
if (S[i] == S[i - 1]){
count++;
i++;
}
}
long lo... | 0 | 68,247,262 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> RailRoad, out;
int buf;
while(cin >> buf){
if(buf == 0){
buf = RailRoad[((int)RailRoad.size() - 1)];
out.push_back(buf);
RailRoad.pop_back();
}else{
RailRoad.push_back(buf);
}
}
for(vector<int>::iterator it = out.beg... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
ll n;
ll a;
ll b;
ll x = 0;
ll y = 0;
ll ans = 0;
cin >> n >> a >> b;
x = n % (a+b);
y = n / (a+b);
if (x ... | 0 | 91,607,952 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n;
cin >> s;
if(n%2 != 0){
cout << "No" << endl;
return 0;
}
for(int i=0; i<s.size()/2; i++){
if(s.at(i) != s.at(i+s.size()/2)){
cout << "No" << endl;
return 0;
... | #include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long... | 0 | 80,902,921 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>a(N);
map<int,int>Map;
for(int i = 0; i < N; i++) {
cin >> a[i];
Map[a[i]]++;
}
int ans = 0;
for(auto x:Map) {
int X = x.first;
int Y = x.second;
if(X <= Y) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for... | 0 | 30,558,974 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin >> n >> k;
vector<ll> a(n);
ll count = 0;
ll nowmax = 0;
for(i... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
vector<char>was(n ,'x');
for(int i=0;i<n;i++){
if(i-k >=0){
if(was[i-k]!='r... | 0 | 4,869,566 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
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; retu... | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | 0 | 87,233,654 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> A(N), B(N);
vector<int> C(N);
long long total = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 28,736,395 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<lli... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 35,814,124 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
int main(void) {
int N; cin >> N;
int P[N+10] = {0};
int count = 1;
for(int i=0; i<N; i++) {
cin >> P[i];
}
int min = P[0];
for(int i=1; i<N; i++) {
if(P[i]<min) {... | #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)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
for (int bit = 0; bit < (1 <<... | 0 | 65,363,722 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include<bits/stdc++.h>
using namespace std;
#define mx 1000000000000000000
#define ll long long int
ll a[40001000];
int main()
{
ll i,j,count =0,n;
cin>> n;
for(i=0;i<n;i++)
cin>> a[i];
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]!=a[i+1])
count=0;
else
{
count=1;
... | 0 | 64,426,585 |
#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<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
while(cin >> n){
bool prime[1000000] = {false};
prime[1] = true;
prime[2] = false;
int count = 0;
for(int j = 2; j * j <= n ; j++){
if(!prime[j]){
for (int k = 2; k*j <=... | 0 | 3,624,450 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,j,a,b,c,k;
cin>>a>>b>>c>>k;
if(b<=a)
{
while(k--)
{
b*=2;
if(b>a)break;
}
}
if(c<=b)
{
while(k--)
{
c*=2;
if(c>b)break;
}
}
... | #include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define llu unsigned long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define tc int... | 0 | 44,482,426 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int N; cin >> N;
ll ans = 0;
for(int i=1; i<N; i++){
an... | #include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __pr... | 0 | 12,629,708 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W, d; cin >> H >> W >> d;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cout << "RYGB"[((i - j + 1000) / d) % 2 * 2 + (i + j) / d % 2];
}
cout << '\n';
}
return 0;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<utility>
#include<functional>
#include<cmath>
#include<vector>
#include<map>
using std::min;
using std::max;
using std::swap;
using std::sort;
using std::reverse;
using std::random_shuffle;
using std::lower_bound;
using st... | 0 | 82,369,876 |
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
int count;
cin >> a;
cin >> b;
cin >> c;
int i=1;
for(i=a;i<=b;i++){
if(c%i == 0) {
count++;
}
}
cout << count << 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 | 12,291,207 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res = res * x % mod;
return res;
}... | 0 | 56,143,075 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,b,bb;
cin >> n >> m;
vector<int>p(m);
vector<vector<int>>a(m);
for(int i=0;i<m;i++){
cin >> b;
for(int j=0;j<b;j++){
cin >> bb;
a.at(i).push_back(bb-1);
}
}
for(int i=0;i<m;i++)
cin >> p.at(i);
bool ok=false;
... | #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() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) {
int x;
cin >> x;
a[x-1]++;
}
sort(a.begin(), a.end());
vector<int> s(n+1);
rep(i,n) s[i+1] = ... | 0 | 3,862,267 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
void solve()
{
string s; cin >> s;
ll n; cin >> n;
for(ll... | #include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
#define pb(x) push_back(x);
typedef long long int ll;
ll mod = 998244353;
ll hmaxii=0;
vector<ll>values[2*100000+1];
ll MAXN = 2*100000+1;
ll spf[2*100000+1];
ll diff,x,y,z;
ll flag=1;ll price[1001][1001];
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a; }
void... | 0 | 60,819,410 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
cout<<(n-1)/2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
long long M = 1e9+7;
long long power(long long a, long long p)
{
if(p==0) return 1;
long long ans= power(a,p/2);
ans =(ans * ans) % M;
if(p%2) ans = (ans*a) % M;
return ... | 0 | 7,874,317 |
#include<bits/stdc++.h>
using namespace std;
const int limit = 200050;
int main(){
int n;
cin >> n;
int a[limit];
for(int i = 0; i < n; i++){
cin >> a[i];
a[i] = a[i] - i - 1;
}
sort(a, a + n);
int b = (n % 2 == 0) ? a[n / 2 - 1] : a[(n + 1) / 2 - 1];
long long f = 0;
... | #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 | 59,043,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #include <iostream>
using namespace std;
int a[100][100];
int n;
int main() {
cin >> n;
int p,q,r;
for (int i=0; i<n; ++i) {
cin >> p >> q;
for (int i=0; i<q; ++i) {
cin >> r;
a[p][r] = 1;
}
}
for (int i=0; i<n; ++i) {
for (int j=0; j<n-1; ++j) {
cout << a[i+1][j+1] << " ";
}
cout << a[i+1][n]... | 0 | 16,133,967 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " ... | #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 | 19,205,361 |
#include <bits/stdc++.h>
#define NEWLINE '\n'
using namespace std;
typedef long long ll;
int main()
{
vector<int> v;
int n;
cin >> n;
v.resize(n * 2);
for (auto &it : v)
cin >> it;
sort(v.begin(), v.end());
int sum = 0;
for (int i = 0; i < n * 2; i += 2)
sum += v[i];
... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 0 | 60,036,411 |
#include <iostream>
using namespace std;
int main()
{
int n[10000], x[10000], i, m, a, b, c;
while (1) {
cin >> n[m] >> x[m];
if (n[m]==0 && x[m]==0) break;
m++;
}
int ans[m];
for (i=0; i<m; i++) ans[i]=0;
for (i=0; i<m; i++) {
for (c=n[i]; c>0; c--) {
for (b=c-1; b>0; b--) {
f... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<long long> L( N + 1 );
L[0] = 2;
L[1] = 1;
for( int i = 2; i <= N; i++ ) {
L[i] = L[i - 1] + L[i - 2];
}
long long ans = L[N];
cout << ans << endl;
} | 0 | 70,026,405 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
int N=S.size();
for(int i=0;i<=7;i++){
string T=S;
T.erase(i,N-7);
if(T=="keyence"){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | #include<stdio.h>
int main(){
while(1){
int a,b;
char aa[100],bb[100],d,dd[10000000];
scanf("%d",&a);
if(a==0) break;
for(int i=0;i<a;i++) scanf(" %c %c",&aa[i],&bb[i]);
scanf("%d",&b);
for(int i=0;i<b;i++)
{
scanf(" %c",&dd[i]);
... | 0 | 58,532,673 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
ll dp[3][1002][1002];
int main()
{
int n, m;
cin >> n >> m;
vector<ll> x[3];
rep(i,n){
ll a[3];
rep(cur,3){
cin >> a[cur];
x[c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int func(int time, int f){
int val;
for(int i = time; i <= time+f; i++){
if(i % f == 0){
val = i;
break;
}
}
return val;
}
int main(){
int N;
c... | 0 | 20,725,683 |
#include<bits/stdc++.h>
using namespace std;
vector<int>v[200004];
int main()
{
int n,x;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
v[x].push_back(i);
}
int cnt=0,prev=-1;
for(int i=1;i<=200000;i++)
{
if(v[i].size()==0) break;
sort(v[i].begin(),v[i].end());
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
const int INF=1001001001;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
int ans=0;
if(a<b){
ans += a;
}else ans += b;
if(c<d){
ans += c;
}else ans += d;
cout << ans << endl;
return 0;
} | 0 | 74,404,977 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int N, K;
cin >> N >> K;
ll ans = pow(N/K, 3);
if (K % 2 == 0) {
ans += pow((2*N/K+1)/2, 3);
... | #include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
#define all(c) ((c).begin()), ((c).end())
struct Graph {
int n;
vector<vector<int>> adj;
Graph(int n) : n(n), adj(n) { }
void addEdge(int u, int v) {
adj[u].push_back(v);
}
};
vector<int> topologicalSort(Graph g) {
vector... | 0 | 5,530,146 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
vector<int> P(m);
for(int i=0;i<m;i++){
cin>>P[i];
}
int gap = 0;
for(int i=n_min;i<=n_max;i++){
gap = max... | 0 | 67,116,387 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | #include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
int a[100003];
int main()
{
int N,x;
scanf("%d",&N);
while (N--)
{
int t;
scanf("%d",&t);
a[t]++;
a[t + 1]++;
a[t + 2]++;
}
x=*max_element(a + 2, a + 100000) ;
printf("... | 0 | 96,069,137 |
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<string.h>
using namespace std;
#define maxn 100010
#define MAX 1e15
#define INF 0x3f3f3f3f
struct node
{
int to,next;
long long w;
}edge[200000*2+100];
bool flag;
int k;
int head[maxn],visit[maxn];
long long dis[maxn];
void add_edge(int from,int to,l... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define tri pair<pll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#de... | 0 | 96,722,621 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_RE... | #include<stdio.h>
#define MAX 250
int n;
int A[MAX];
void printNode() {
for (int i = 1; i <= n; ++i) {
printf("node %d: key = %d, ", i, A[i]);
if (i/2 > 0) {
printf("parent key = %d, ", A[i/2]);
}
if (i*2 <= n) {
printf("left key = %d, ", A[i*2]);
}
... | 0 | 5,529,216 |
#include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int r = n*(n-1)/2 + m*(m-1)/2 ;
cout<<r;
return 0;
} | #include<iostream>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
string reverse(string str) {
string result = "";
for (int i = str.size()-1; 0 <= i; i--) {
result += str[i];
}
return result;
}
int main(){
string str;
int q;
string command;... | 0 | 22,956,015 |
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 0 | 30,269,754 |
#include<bits/stdc++.h>
#define inf ((1<<30)-1)
#define linf ((1<<62)ll-1)
#define LL long long
#define F(i,a,b,c) for(register int i=(a);(b);i=(c))
#define Fu(i,a,b) for(register int i=(a);i<=(b);++i)
#define Fd(i,a,b) for(register int i=(a);i>=(b);--i)
#define Fn(i,a) for(register int i=las[(a)];i;i=nex[i])
#define C... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
vector<string> grades;
while (true) {
int m, f, r;
fscanf(stdin, "%d %d %d", &m, &f, &r);
if (m == -1 && f == -1 && r == -1) { break; }
string grade;
int sum = m + f;
if (m == -1 || f == -1)... | 0 | 44,322,329 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n,m ;
cin>>n>>m ;
vector<int> h(n) ;
rep(i,n){
cin>>h[i] ;
}
vector<priority_queue<int>> adj(n) ;
rep(i,m){
int a,b ;
cin>>a>>b ;
a-- ;
b-- ... | #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) ... | 0 | 1,325,513 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
string s, res;
cin >> s;
int c... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 40,904,095 |
#include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
a%=2;
b%=2;
if(a==1&&b==1)cout<<"Odd";
else if(a==2&&b==2)cout<<"Even";
else cout<<"Even";
return 0;
} | #include<iostream>
#include<vector>
#define lli long long int
#include<climits>
#include<unordered_map>
#include<algorithm>
#include<bitset>
#include<map>
#include<cmath>
#include<queue>
#define pb push_back
#define N (int)(1e5)
using namespace std;
using namespace std;
int main()
{
int h,n;
int i,j;
cin>>h... | 0 | 15,466,637 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.