code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
double sum = 0;
rep(i, n) {
cin >> x[i];
cin >> u[i];
}
rep(i,... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 9223372036854775807;
ll N, K;
vector<ll > X;
vector<ll > Y;
ll check(ll x1, ll x2, ll y1, ll y2){
ll c... | 0 | 55,137,126 |
#include <iostream>
using namespace std;
int H,W,D;
char A[2000][2000];
int main(){
cin >> H >> W >> D;
for(int i=0;i<2000;i++){
for(int j=0;j<2000;j++){
if((i/D)%2==0 && (j/D)%2==0) A[i][j] = 'R';
if((i/D)%2==0 && (j/D)%2==1) A[i][j] = 'Y';
if((i/D)%2==1 && (j/D)%2==0) A[i][j] = 'G';
if((i/D)%2==1 && (... | #include<iostream>
#include<vector>
using namespace std;
vector<int> ans;
int main(){
while(1){
int n,a,b,c,x;
cin >> n >> a >> b >> c >> x;
if(n + a + b + c + x == 0) break;
int y[100];
int count = -1;
int reel = 0;
for(int i = 0;i < n;i++){
cin >> y[i];
}
for(int i = 0;i <= 10000;i++){
if(x =... | 0 | 100,897,704 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,cnt;
int main()
{
scanf("%d",&n);long long ans=0;
for(int i=1,w;i<=n;i++)
{
scanf("%d",&w),ans+=w>>1;
if(!w)ans+=cnt>>1,cnt=0;
else cnt+=w&1;
}
ans+=cnt>>1;
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a,x=0,y=0,b,z=0,z2=0;
cin>>n;
ll l1[n+2];map<ll,ll>m1,m2;
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i&1){
m1[l1[i]]+... | 0 | 81,666,799 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
long long cycle = a+b;
long long ret = (n/cycle)*a;
n%=cycle;
if(n<a) ret+=n;
else ret+=a;
cout<<ret;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 100010;
int main() {
... | 0 | 37,154,092 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end(... | 0 | 46,351,560 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
long long x,y,z;cin>>x>>y>>z;
int k; cin>>k;
long long a[x];
long long b[y];
long long c[z];
vector<long long> ko;
for(int i = 0;i<x;i++) cin >>a[i];
for(in... | #include<bits/stdc++.h>
#define fr(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define rf(i,j,p) for(int i=p;i>=j;i--)
#define vi vector<int>
#define vll vector<long long>
#define ll long long
#define hmm "\n"
#define sp " "
#define srt(v) sort(v.begin()... | 0 | 83,081,363 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n, L;
ll a[100000];
int main() {
cin >> n >> L;
for(int i = 0; i < n; i++){
cin >> a[i];
}
if(a[0] + a[1] >= L){
cout << "Possible" << endl;
for(int i = n - 1; i >= 1; i--)cout << i << endl;
return 0;
}
if(a[n - 1] + a[n ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(void)
{
string s, t;
cin >> s >> t;
int len = s.length();
map<char, set<int>> mps, mpt;
for (int i = 0; i < len; ++i)
{
mps[s[i]].insert(i);
mpt[t[i]].insert(i);
}
map<char, bool> cs, ct;
for... | 0 | 76,293,323 |
#include "bits/stdc++.h"
using namespace std;
int main() {
double L;
cin >> L;
printf("%.10f\n", (L / 3.0)*(L / 3.0)*(L / 3.0));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int mpow(int base, int exp);
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unordered_ma... | 0 | 95,260,776 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<int> g[200005];
int d[200005];
void dfs(int x, int p) {
for (int i : g[x]) if (i != p) {
d[i] += d[x];
... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = ll(1e9)+7;
const ll inf = ll(5e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
vo... | 0 | 79,996,383 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
using namespace std;
#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++)
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % ... | 0 | 74,611,075 |
#include <bits/stdc++.h>
#define pan(i,n) for(int i=0;i<n;i++)
#define pans(i,n,a) for(int i=a;i<n;i++)
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define INF 1000000007
#define PI 3.141592653
#define inf 100007
#define P pair<ll,ll>
using namespace std;
int main(){
... | #include <iostream>
#include <vector>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
vector<vector<int>> dist(10, vector<int>(10, -1));
for(int i = 0; i < N; ++i) {
int a, b, c;
cin >> a >> b >> c;
dist[a][b] = dist[b][a] = c;
... | 0 | 70,324,709 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, c=1;
string S;
cin >> N >> S;
for (int i=0; i<N-1; i++) {
if (S[i]!=S[i+1]) {c++;}
}
cout << c << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>A;
for(int i=0;i<N;i++){
int x;
cin>>x;
A.push_back(x);
}
int dp[N+2];
dp[1]=0;
if(N==1){
cout<<0<<endl;
return 0;
}
dp[2]=abs(A[1]-A[0]);
if(N==2){
... | 0 | 95,766,869 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll A[100010];
int main()
{
... | #include<iostream>
using namespace std;
long long fact(int x)
{
long long g=1;
for(int i=2;i<=x;i++)
{
g*=i;
g%=1000000007;
}
return g;
}
int main()
{
string s;
long long k,n,l=0,ans=1;
cin>>n;
cin>>s;
n*=2;
for(int i=0;i<n;i++)
{
k=l%2;
if((s[i]=='B' && k==1) || (s[i]=='W' && k==0))
{
ans*=l;... | 0 | 13,474,031 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=1e5+9;
int main()
{
FASTINOUT;
string s;
cin>>s;
sort(s.begin(),s.end());
if (s[0]=='a'&&s[1]=='b'&&s[2]=='c')
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
string s;
cin>>s;
int n=s.length(),flag=0,i;
if(n%2==0)
n=n-2;
else
n=n-1;
while(1) {
for (i = 0; i < n/2; i++) {
if(s[i]!=s[n/2+i]) {
flag = 1;
... | 0 | 15,183,817 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef array<int, 2> duo;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
templa... | #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();
int K;
void f(int &mine, int &others... | 0 | 9,423,242 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int m, n_min, n_max;
while(1) {
cin >> m >> n_min >> n_max;
if(m + n_min + n_max == 0) break;
vector<int> P(m);
for(int i = 0; i < m; i++) {
cin >> P[i];
}
int... | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef unsig... | 0 | 57,730,572 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<ll, int, int, int, int, int, int, int>T;
#define PI 3.14159265358979
const int MAX = 510000;
const int MOD = 10000000... | #include <iostream>
#include <vector>
int main(void){
int K, N, ans=0;
std::cin >> K >> N;
std::vector<int> A(N);
for (int i = 0; i<N; ++i){
std::cin >> A.at(i);
}
ans = A.at(0) + K - A.at(N-1);
for (int i=1; i<N; ++i){
int tmp = A.at(i) - A.at(i-1);
if (tmp > ans) an... | 0 | 48,458,080 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define ... | 0 | 30,670,195 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include<iostream>
using namespace std;
int main(){
int a;
cin >> a;
while(a != 0){
int coin = 0;
a = 1000-a;
if(a>=500){
coin++;
a-=500;
}
while(a>=100){
coin++;
a -= 100;
}
if(a>=50){
coin++;
a-=50;
}
while(a>=10){
coin++;
a-=10... | 0 | 92,435,225 |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define tc ll t; cin >> t; while (t--)
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define s... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define ll long long
bool pairCompare(const pair<int, int> & f, const pair<int, int> & s)
{
return f.first < s.first;
}
int main()
{
int ans;
string s;
cin >>... | 0 | 93,662,740 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | #include <iostream>
#include <string>
using namespace std;
class Dice{
private:
int dice_bk[6];
public:
Dice();
int corocoro();
};
Dice::Dice()
{
for(int i = 0; i < 6; i++)
cin >> dice_bk[i];
}
int Dice::corocoro()
{
int dice[6];
int top, front;
int mem, tmp;
for(int i = 0; i < 6; i++)
dice[i] = dice_b... | 0 | 45,438,246 |
#include<iostream>
#include<numeric>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<climits>
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define mkp make_pair
#define pll pair<ll,ll>
#define rep(i,from... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int MAX_N = 100000;
int N;
vector<int> G[MAX_N];
int match[MAX_N];
bool used[MAX_N];
bool dfs(int v) {
if (used[v]) {
return false;
}
used[v] = true;
for (int u : ... | 0 | 26,507,189 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
cin>>n>>k;
vector<long long> tower(n);
vector<long long> tallest(n,-1);
for(long long i=0;i<n;i++){
cin>>tower.at(i);
tallest.at(i)=max(tallest.at(max((long long)0,i-1)),tower.at(i));
}
long l... | #include <iostream>
using namespace std;
int main(void) {
int m = 0;
int f = 0;
int r = 0;
while(cin >> m >> f >> r){
if(m == -1 && f == -1 && r == -1)
break;
int total = m + f;
if(m == -1 || f == -1){
cout << "F\n";
}else if(total >= 80){
... | 0 | 100,072,087 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll INF = (1LL << 63);
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)arra... | #include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | 0 | 100,255,478 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define eb emplace_back
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 233;
char s[maxn];
int op[maxn];
int main()
{
int n;cin>>n;
scanf("%s",s+1);... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | 0 | 35,062,375 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define p_b push_back
#define e_b emplace_back
#define m_p make_pair
#define m_t make_tuple
usin... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 0 | 5,579,097 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, h;
cin >> n;
int max_h = 0, ans = 0;
for(int i = 0; i < n; +... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 62,762,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v... | #include <iostream>
using namespace std;
long long a[55],b[55],c[55],d[55];
int main(void){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(int i=0;i<m;i++){
cin>>c[i]>>d[i];
}
for(int i=0;i<n;i++){
long long minute=1000000000;
int ans=-1;
... | 0 | 99,168,906 |
#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;
int memo[90005];
int main()
{
int h, w, d;
cin >> h >> w >> d;
map<int, pair<int, int>> mp;
rep(i,h){
rep(j,w){
int a;
cin >> a;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1e9+7
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n) cin >> a[i];
rep(i,m) cin >> b[i];
for(int i=0;i<=n-m;i++... | 0 | 43,106,490 |
#include <iostream>
#include <vector>
constexpr int MOD = 1000000007;
using namespace std;
int main()
{
int n;
cin >> n;
if (n < 3)
{
cout << 0 << endl;
return 0;
}
vector<int> dp(n + 1);
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
for (int i = 3; i < n + 1; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const ll INFL = 1LL << 60;
const int INFI = (1 << 30);
int N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if ... | 0 | 83,987,730 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<char> A){rep(i,A.size()){cout << A[i];}cout << endl;}
int main(){
ll q,h,s,d,n;
cin >> q >> h >> s >> d;
cin >> n;
q *= 4;h *= 2;
s = min(q,s)... | #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 deb(x) cerr << #x <<": " << x << '\n';
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long double ld;
typedef long long ll;
int main(){
ios;
l... | 0 | 61,362,184 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge {
int to;
ll cost;
};
using Graph = vector<vector<Edge>>;
vector<ll> dist;
void bfs(const Graph &G, int s) {
const ll INF = 1e15;
dist.assign((int)G.size(), INF);
queue<int> que;
que.emplace(s);
dist[s] = 0... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define ll long long
bool FLAG = 0;
#define debug(x) if (FLAG) {cerr << #x << " =... | 0 | 31,216,359 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int a=N%10;
int b=N%100-a;
int c=N-b-a;
if(a==7||b==70||c==700){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
const int M=300000;
typedef long long int ll;
using namespace std;
ll n,x;
set<ll> s;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
s.insert(x);
}
if(s.size()==n)
{
cout<<"YES";
} else cout<<"NO";
} | 0 | 41,674,928 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
using namespace std;
#define umap unordered_map
#define uset unordered_set
#define ll long long
#define lll long long
#define pb push_back
#define... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define S... | 0 | 86,404,829 |
#include<iostream>
#define pb push_back
#define inf 0x3f3f3f3f
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define mem(a,val) memset(a,val,sizeof(a))
#define mkp make_pair
#define speed ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int main(){
int x,ans=0;
cin>>x;
for(int i=1 ;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x,y,z,k;cin >>x>>y>>z>>k;
vector<long long> a(x),b(y),c(z),ab,abc;
for (int i=0;i<x;i++) cin >> a[i];
for (int i=0;i<y;i++) cin >> b[i];
for (int i=0;i<z;i++) cin >> c[i];
for (int i=0;i<x;i++) {
for (int j=0;j<y;j++) {
ab.push_back... | 0 | 84,865,645 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[3];
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+4);
if(a[1]==a[2]) cout<<a[3];
else cout<<a[1];
cout<<endl;
return 0;
} | #include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
const char *comparator =
( a < b ) ? "<" :
( a > b ) ? ">" :
"==";
std::cout
<< "a "
<< comparator
<< " b"
<< std::endl;
return 0;
} | 0 | 73,429,676 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair<long long,long long>;
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin >> n >> m;
vector<int> valppp(n);
vector<int> valppm(n);
vector<int> valpmp(n);
vector<int> valpm... | 0 | 100,413,296 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #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)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, do... | 0 | 83,984,949 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str,fc,p;
int q,i=0,a,b;
cin>>str>>q;
for(;i<q;i++){
cin>>fc>>a>>b;
switch(fc[2]){
case 'i':
cout<<str.substr(a,b-a+1)<<endl;
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 0 | 96,552,408 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n_a = 0, n_b = 0;
for(int i = 0; i < 3; i++) {
char c;
cin >> c;
if(c == 'A') {
n_a++;
}
else {
n_b++;
}
}
if(n_a == 0 || n_b == 0) {
cout << "No\n";
}
... | 0 | 85,656,115 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n),b(n);
for(int i=0; i<n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(),b.end());
int max_value = b[b.size()-1];
int sec_value = b[b.size()-2];
for(int i=0; i<n; i++) {
if(max_value==sec_value){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii... | 0 | 45,078,618 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 87,649,661 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
... | #include<iostream>
using namespace std;
char getGrade(int m,int f,int r){
int sum = m+f;
char grade;
if(m==-1||f==-1){
grade='F';
}else if(80<=sum){
grade='A';
}else if(65<=sum&&sum<80){
grade='B';
}else if(50<=sum&&sum<65){
grade='C';
}else if(30<=sum&&sum<50){
if(50<=r)grade='C';
e... | 0 | 76,934,557 |
#include <bits/stdc++.h>
using namespace std;
int A[128];
char B[1001];
int conv(const string &a) {
int res = 0;
for(int i = 0; i < a.size(); ++i) {
int d = 1;
if(isdigit(a[i])) {
d = a[i++] - '0';
}
res += d * A[a[i]];
}
return res;
}
string conv(const int x) {
string res;
for(int i =... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 65,284,528 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<l... | #include <cstdint>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define SIZE 10000
static vector<uint32_t> graph[SIZE];
static vector<uint32_t> connected_num(SIZE, 0);
static queue<uint32_t> q;
static vector<uint32_t> sorted;
int32_t main()
{
uint32_t V, E;
cin >> V >> E;
for (uint3... | 0 | 84,434,363 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,n) ... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
struct pnt{
int cost, y, x;
};
vector<vector<in... | 0 | 38,848,096 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while( true ){
int n;
int ma = 0;
int mi = 0;
cin >> n;
if(n == 0){
break;
}
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
const int dx[] = { 1, -1, 0, 0, 1, 1, -1, -1 };
const int dy[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
const char dir[] = {'D', 'U', 'R', 'L'};
void Fast() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); }
void File()
{
#ifndef ON... | 0 | 98,210,523 |
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scan(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No");
#define YES(flag) cout<<((flag)? "YES":"NO");
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll ... | 0 | 93,753,314 |
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
int n,x,i;
list <int> a;
list<int>::iterator it;
string com;
cin>>n;
for(i=0;i<n;i++){
cin>>com;
if(com=="deleteFirst") a.pop_front();
else if(com=="deleteLast") a.pop_back();
else{
cin>>x;
if(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<int>>;
ll inf=300000000000000000;
const double PI = 3.14... | 0 | 88,170,546 |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#define ll long lo... | #include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<string>
#include<math.h>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
using namespace std;
const int INF=100000000;
int main(){
int ... | 0 | 62,900,155 |
#include<iostream>
#include<vector>
#include<queue>
#include<string>
int main(){
std::vector<int> tiles;
std::queue<int> unvisited_tile_q;
int width, height, counter, pos;
std::string line;
while(true){
std::cin >> width >> height;
if( width == 0 && height == 0 ) break;
tiles... | #include <stdio.h>
#include <vector>
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) for(int (i) = (n) - 1; (i) >= 0; --(i))
using lli = long long int;
std::vector<int> A;
int main(void){
int n; scanf("%d", &n);
A.resize(n); REP(i, n) scanf("%d", &A[i]... | 0 | 19,708,260 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;
#define mod 1000000007
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
#define read(x) freopen("in.txt","r",stdin);
#define write(x) freopen("out.txt","w",stdout);
#define Fast ios_base::sync_... | #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 | 48,548,349 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
string O,E; cin >... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 83,316,117 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B,C;
cin>>A>>B>>C;
bool Q=false;
for(int i=1;i<10000000;i++){
if((A*i)%B==C){
Q=true;
break;
}
}
if(Q){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int next(int a, int b, int c, int x){
return (a*x+b)%c;
}
int main(void){
while(true){
int n, a, b, c, x, ri[110];
cin >> n >> a >> b >> c >> x;
if((n+a+b+c+x)==0) break;
for(int i=0;i<n;++i){
cin >> ri[i];
}
... | 0 | 90,910,658 |
#include<stdio.h>
int main( ){
int n,b,f,r,v,a[4][3][10]={};
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d %d %d",&b,&f,&r,&v);
a[b-1][f-1][r-1]+=v;
if(a[b-1][f-1][r-1]<0){
a[b-1][f-1][r-1]=0;
}
}
for(int j=0;j<4;j++){
for(int p=0;p<3;p++){
for(int q=0;q<10;q++){
printf("... | #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 = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 0 | 30,227,336 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N;
map<string,ll> B;
map<string,ll> A;
for(ll i=0;i<N;i++) {
string s;
cin>>s;
B[s]++;
}
cin>>M;
for(ll i=0;i<M;i++) {
string t;
cin>>t;
A[t]++;
}
ll ans=0;
... | #include <bits/stdc++.h>
using namespace std;
bool compare(const vector<long long> &a, const vector<long long> &b) {
return atan2(a[1], a[0]) < atan2(b[1], b[0]);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<vector<long long>> coords;
for (int i = 0; i ... | 0 | 98,023,527 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n; cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
vector<vector<int>> alphs(n, vector<int>(26, 0));
for (int i = 0; i < n; ++i) {
for (int ... | #include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define rep(i,n) for(int i = ... | 0 | 34,801,993 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cs;
cin >> A >> B >> cs;
int ans = 0;
if(A <= cs) {
ans++;
}
if(cs <= A + B) {
ans++;
}
if(ans == 2) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include<iostream>
#include<algorithm>
#include<utility>
#define MAX 10000
using namespace std;
int compare(pair<int,int> a,pair<int,int> b)
{
return a>b;
}
int main()
{
int N,M;
while(cin>>N>>M&&N)
{
int d,p;
int P=0;
pair<int,int> pd[MAX];
int i;
for(i=0;i<N;i++)
{
cin>>d... | 0 | 29,659,139 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll amari = 1000000007;
#define rep(n,x) for(ll ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int MOD = 1e9 + 7;
int main()
{
int N; cin >> N;
vector<int> A(N), B(N), mi(N, 1), ma(N, 2e9);
for (auto &a : A) cin >> a;
for (auto &b : B) cin >> b;
for (int i = 0; i < N; i++) {
int prev = (i == 0 ? 0 : A[i-1])... | 0 | 48,309,514 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, m, x, y, big = -1e9, small = 1e9 + 2;
cin >> n >> m >> x >> y;
bool war = false;
for(int i = 0; i < n; ++i){
int element;
cin >> element;
big = max(big, element);
}
int z = big + 1;
for(int i = 0; i < ... | #include <iostream>
using namespace std;
int main(void){
long Num, Value, Min, Max, Sum;
std::cin >> Num;
Sum = 0;
for(long i = 0; i < Num; i++){
std::cin >> Value;
if(i == 0){
Min = Value;
Max = Value;
} else{
if(Value < Min) Min = Value;
... | 0 | 61,797,883 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main(){
int n,a,b;
cin >> n >> a >> b;
int p[n];
REP(i,n){
cin >> ... | #include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
signed main()
{
int K,N;
cin>>N>>K;
vector<int> memo[100000];
for(int i=0;i<N;i++)
{
int t,d;
cin>>t>>d;
t--;
memo[t].emplace_back(d);
}
vector<ll> q1,q2;
fo... | 0 | 5,179,826 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int MAX_V=10;
int d[10][10];
int V;
const int INF=100000000;
void warshall_floyd(){
for(int k = 0; k < V; k++){
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<int>a(N);
vector<int>b(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i) >> b.at(i);
}
vector<int>c(M);
vector<int>d(M);
for (int i = 0; i < M; i++) {
cin >> c.at(i) >> d.at(i);
}
vector<int>A(M);
fo... | 0 | 13,657,340 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
int ans = 0;
for (int i = 0; i < h; i++) cin >> s[i];
for (int i = 0; i < (1<<h); i++) {
for (int j = 0; j < (1<<w); j++) {
int count = 0;
for (int x = 0; x < h; x++)... | 0 | 32,406,002 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <math.h>
#include <vector>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
int maxa=a;
if(b>maxa) maxa=b;
else if(c>maxa) maxa=c;
if (maxa==a) cout<<a*10+b+c;
else if(maxa==b) cout<<b*10+a+c;
else if(maxa==c) c... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void){
while(1){
string s;
vector<char> v;
getline(cin, s);
if(s[0] == '.') break;
int ptr = 0;
bool correct = true;
while(correct && ptr < s.length()){
switch( s[ptr] ){
case '(' :
... | 0 | 68,508,777 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
int ans = 0;
for (int i = 1; i < N; i++){
if (a[i - 1] == a[i]){
ans++;
a[i] = 0;
}
}
cout << ans;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | 0 | 75,709,059 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct edge {
ll to;
ll cost;
};
int n;
vector<vector<edge>> g;
vector<ll> d;
void dfs(ll s, ll di, ll pa = -1) {
d[s] = min(d[s], di);
for (auto t : g[s]) {
if... | 0 | 28,922,037 |
#include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <sstream>
#include <string>
#include <climits>
#include <set>
#include <array>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <map>
#include <utility>
using namespace std;
int main()
{
st... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 36,193,185 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
const int mod = 1000000007;
int dp[100005][2];
int m... | #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 | 84,747,291 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,count=0;
cin >> n;
vector<ll>a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(),a.end());
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
vector<ll>x(n-1),y(n-1);
... | 0 | 75,676,502 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1ll << 60;
int main() {
int h, n, a, b;
cin >> h >> n;
vector<ll> dp(h + 1, INF);
dp[0] = 0;
rep(i, n) {
cin >> a >> b;
rep(j, h) dp[min(j + a, h)] = min(dp[min(j + a, h)]... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s1, s2; cin >>s1 >> s2;
int N=s1.size(), M = s2.size();
int dp[1010][1010];
for(int i=0; i<=N; i++){
for(int j=0; j<=M; j++){
if(i==0) dp[i][j]=j;
else if(j==0) dp[i][j]=i;
else dp[i][j]=100100;
... | 0 | 31,897,801 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO... | 0 | 7,282,824 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #include <iostream>
#include <numeric>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin >> n && n > 0){
int lst[n];
for(int i=0;i<n;i++){
cin >> lst[i];
}
int max;
max = lst[0];
for(int i=1;i<n;i++){
if(max < lst[i]){
... | 0 | 24,899,429 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define print(x) cout << #x << '=' << x << endl
int main()
{
long long a,b,c,d;
long long ans1,ans2,ans3,ans4;
cin >> a >> b >> c >> d;
ans1 = a*c;
ans2 = a*d;
ans3 = b*c;
ans4 = b*d;
cout << max(ans1 , max(ans2 , max(ans3,... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string str[10]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
int b=0,c=0;
for(int j=0;j<s.size();j++){
if(s[j]=='0'){
if(b)... | 0 | 51,066,969 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 0 | 92,941,690 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 41,347,433 |
#include <bits/stdc++.h>
#define N 100010
using namespace std;
int main(){
int n,a[N],i,j,ansa,ansb;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ansa=a[n-1];
for(i=n-2;i>=0;i--)
{
if(!i)
ansb=a[i];
if(min(a[i],a[n-1]-a[i])>=min(a[i-1],a[n-1]-a[i-1]))
{
ansb=a[i];
break;
}
}
cout<<ansa... | #include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#defi... | 0 | 42,224,523 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, suf = 0, pre = 0, mid = 0;
vector<long long> a;
int main() {
cin >> n >> k;
a.resize(n);
for (auto &p : a) cin >> p;
for (int i = k; i < n; ++i)
if (a[i] > 0) suf += a[i];
for (int i = 0; i < k; ++i) mid += a[i];
long long res = 0;
for (int... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M && (N|M)) {
vector<pair<int, int> > vec;
int expect = 0;
for(int i=0; i<N; i++) {
int d, p;
cin >> d >> p;
vec.push_back(make_pair(p, d));
expect += d * p;
... | 0 | 47,487,382 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef v... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | 0 | 94,594,517 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=s.size()-1;i>=1;i--){
if(i%2){
continue;
}
string t=s.substr(0,i/2);
if(t==s.substr(i/2,i/2)){
cout<<i<<endl;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP... | 0 | 84,181,299 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int a, b, c;
cin >>a >> b >> c;
bool ok = false;
if (a == 1) ok = true;
for (int i = 1;... | #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>;
void kaibun(string &S, string &ans) {
rep(i,S.size()/2) {
if (S.at(i) != S.at(S.size() - 1 - i)) {
ans = "No";
}
}
}
int main() {
string S;
... | 0 | 86,969,271 |
#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<P>A(N);
rep(i,N)cin >> A[i].first >> A[i].second;
sort(A.begin(),A.end());
ll ans = 0;
rep(i,N){
while(A[i].second){
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=... | 0 | 57,811,614 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int count=3;
if(a==b){
count--;
}
if(a==c)
count--;
if(b==c)
count--;
if(count==0){
count=1;
}
cout<<count;
} | #include <iostream>
#include <vector>
#include <climits>
#include <set>
using namespace std;
static const int MAX = 50000;
int main()
{
int n, m;
set<int> coins;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
coins.insert(c);
}
vector<int> dp(MAX + 1, INT_M... | 0 | 6,685,750 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
constexpr ll INF = 1LL << 62;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll H, W, N;
cin >> H >> W >> N;
unordered_map<ll, ll> m;
for (ll i = 0; i < N; i++) {
ll a, b;
cin ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 0 | 23,580,450 |
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
r... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 24,408,692 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
const int INF = 1e18, MOD = 998244353;
signed main() {
int n, cnt = 0, ans = 0, a;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>a;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax... | 0 | 26,998,033 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
int n, f[105];
int main() {
scanf("%d", &n);
int mn = 1e9;
for(int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
f[x]++;
mn = min(mn, x);
}
if(f[mn] > 2) {
printf("Impossible\n");
return 0;
}
int up = 2 * mn - (f[mn] == 2);
for(int i = mn + 1; i <= up; i++... | 0 | 4,047,664 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll a = 0;
if(x > 0){
if(y <= -x){
a = - y - x + 1;
}
else if(y >= x){
a = y - x;
}
else if(... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector < string > arr(n);
for (int i = 0; i < n; ++i)
cin >> arr[i];
for (int i = 0; i < n-1; ++i)
for (int j = n-1; j > i; --j) {
if (arr[j] < arr[j-1]) ... | 0 | 63,556,307 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
char C;
map<char, long> MA;
while (cin >> C) MA[C]++;
long ans = 1;
for (auto ma : MA) (ans *= (ma.second + 1)) %= 1000000007;
cout << ans - 1 << "\n";
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for(int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for(auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T>
ist... | 0 | 100,595,577 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
const int MOD = 1e9+7;
const int MX = 2e5+5;
const ll INF = 1... | #include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+5;
int h,s[maxn];
int parent(int i)
{
return i/2;
}
int left(int i)
{
return i*2;
}
int right(int i)
{
return i*2+1;
}
int main()
{
scanf("%d",&h);
for(int i=1;i<=h;i++){
scanf("%d",&s[i]);
}
for(int i=1;i<=h... | 0 | 12,309,182 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include <iostream>
#include <stdio.h>
#include <numeric>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int m[4][3][10]={};
for(int i=0;i<n;++i){
int b,f,r,v;
cin>>b>>f>>r>>v;
b=b-1;
f=f-1;
r=r-1;
m[b][f][r]+=v;
}
for(int i=... | 0 | 83,609,845 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifd... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | 0 | 61,084,560 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll n;
cin>>n;
ll ans=n+2;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll t=i+n/i-2;
ans=min(ans,t);
}
}
cout<<ans;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int 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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 0 | 44,235,821 |
#include <bits/stdc++.h>
using namespace std;
#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++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
double PI = acos(-1);
class Dice{
int t;... | 0 | 52,498,345 |
#include <iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=n;i>0;i/=10){
sum+=i%10;
}
if(n%sum)
cout<<"No";
else
cout<<"Yes";
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int N;
i... | 0 | 17,200,838 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
u... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll int
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 0 | 97,057,233 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long x,y;
cin>>x>>y;
long long z=abs(x-y);
if(z>=2)cout<<"Alice";
else cout<<"Brown";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
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(a > b){a = b; return ... | 0 | 39,696,517 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll int
#define mod 1000000007
map<string, int> m;
int main()
{
FAST;
ll n;
cin >> n;
ll x;
ci... | #include<stdio.h>
int main ()
{
for(int i=1;i<10;i++){
for(int z=1;z<10;z++){
printf("%dx%d=%d\n", i, z, i*z);
}}
getchar();return 0;
} | 0 | 17,388,035 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 44,327,370 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,m,i,ans;
cin >> n >> m;
if(n*2<=m){
ans=n;
m=m-n*2;
ans+=m/4;
}else{
ans=m/2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | 0 | 19,949,749 |
#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... | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template... | 0 | 37,668,378 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.