code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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;
vector<int> to[200005];
int ans = 0;
class UnionFind
{
public:
vector<int> Parent;
UnionFind(int N)
{
Parent = vector<int>(N, -1);
}
int root(int A)
{... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> v1, v2, v3;
for(int i=0; i<N; i++) {
int a, b, c;
cin >> a >> b >> c;
v1.push_back(a);
v2.push_back(b... | 0 | 17,699,879 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
string s, t;
cin >> s >> t;
int N = s.size();
in... | 0 | 88,422,960 |
#include<stdio.h>
main(){long long n,i;scanf("%lld",&n);for(i=n;--n;)i*=n;printf("%lld\n",i);} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define... | 0 | 16,690,566 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<numeric>
#include<cctype>
using namespace std;
void sout(string* a, string* b) {
if (*a > * b) {
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 34,413,465 |
#include <cstdio>
int main(){
int i, j, n, u, k, v;
scanf("%d",&n);
int A[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
A[i][j]=0;
}
}
for(i=0;i<n;i++){
scanf("%d %d",&u,&k);
for(j=0;j<k;j++){
scanf("%d",&v);
A[u-1][v-1] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
int size = a.length();
int i;
int cnt = 0;
for (i = 0; i < size; i++){
if (a[i] == b[i]) {
cnt++;
}
}
if(cnt == size){
cout << "Yes" << endl;
}
else{
... | 0 | 39,290,787 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
#define all(v) v.begin(),v.end()
int p;
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);
}
ll l... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
map<long long, long long> divide(long long n){
map<long long, long long> res;
for(long long i = 2; i * i <= n; i++){
while(n % i == 0){
res[i]++;
n /= i;
}
}
if(n != 1) res[n] = 1;
retur... | 0 | 48,402,067 |
#include <iostream>
using namespace std;
int main() {
int n, mil = 196470;
cin >> n;
for(int i = 0; i < n; i++) {
int y, m, d, ans = mil;
cin >> y >> m >> d;
ans -= (y-1)*39*5 + (y-1)/3*5;
ans -= (m-1)*20;
if(y%3 != 0) ans += (m-1)/2;
ans -= d-1;
cout << ans << endl;
}
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } ret... | 0 | 47,789,475 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int,int> pi;
#define fi first
#define se second
typedef vector... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include<set>
using namespace std;
int main()
{
const int M = 1000005;
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<int> cnt(M);
for (int i = 0; i < N; ++i)
{
if (cnt[a[i]] != 0... | 0 | 79,384,945 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
printf("%d", 6 - A - B);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 27,347,545 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 0 | 52,751,473 |
#include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll res = 0, mx = 0;
for (int i = 0; i < N; i++) {
ll A;
cin >> A;
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int H,W;
scanf("%d %d",&H,&W);
for (int k=0;k<10000;k++){
if (H==0 && W==0){
break;
}
else{
for (int i=0;i<=H-1;i++){
for (int j=0;j<=W-1;j++){
printf("#");
}
... | 0 | 68,577,078 |
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pa... | 0 | 71,611,376 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
ll N, M; cin >> N >> M;
if(N == 1 && M == 1) {
cout << 1 << endl;... | #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 pair<int,int> P;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll cnt = 0;
rep(i,N-1){
ll n = (A[i]+A[i+1]) / 2;... | 0 | 68,494,189 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ar array
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,... | 0 | 5,916,569 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
using namespace std;
const int N = 1 << 18;
int a[N];
int f[N];
int g[N][2];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", a + i);
}
g[0][0] = 0;
g[0][1] = 0;
f[0] = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
vector<ll> a(1, 1), p(1, 1);
ll f(ll... | 0 | 49,290,510 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,coun=0;
cin>>n;
ll sum=n+100;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
coun++;
ll x= n/i;
if(i+x<sum)sum=(i+x);
}
}
if(coun==0)
cout<<n-1<<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
int w1, w2, h1, h2;
w1=0; w2=w; h1=0; h2=h;
for (int i=0; i<n; i++){
int x, y, a;
cin >> x >> y >> a;
if (a==1)
w1 = max(x,w1);
if (a==2)
w2 = min(x,w2);
if (a==3)
h1 = max(y,h1);... | 0 | 64,882,385 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
string s;
cin >> s;
string a = "";
int n = 0;
rep(i,s.size()){
if(s[i] == '1')a += '1';
else if(s[i] == '0')a += '0';
... | #include<iostream>
#include<vector>
#include<deque>
#define INF 1e8
using namespace std;
long long int K;
int main(void) {
cin>>K;
vector<int> d(K,INF);
vector<bool> used(K,0);
d[1] = 1;
deque<int> q;
q.push_front(1);
while(!q.empty()) {
int current = q.front();
q.pop_front()... | 0 | 82,611,475 |
#include <iostream>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <bitset>
#include <list>
#include <cstdio>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <... | #include <iostream>
#include<vector>
using namespace std;
int main() {
int a, b, c, index = 1;
cin >> a >> b >> c;
vector<bool> df(b-1);
while (true) {
int amari = a * index % b;
if (amari == c) {
cout << "YES" << endl;
return 0;
} else if (df[amari]) {
... | 0 | 7,135,001 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
cin>>n>>m;
vector... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 50,982,801 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
ll ss[MAXX];
int main()
{
FAST;
ll n;
cin >> n;
ll ans ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
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 % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long lon... | 0 | 40,055,060 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> s;
s.insert(n);
int x = 0;
for(int i=2; ; i++) {
if(n%2 == 0) n /= 2;
else n = 3*n + 1;
x = s.size();
s.insert(n);
if(x == s.size()) {
cout << i << endl;
break;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | 0 | 3,506,149 |
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi = vector<int>;
using vl= vector<ll>;
using vs=vector<string>;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a);}
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
ll... | #include <bits/stdc++.h>
using namespace std;
void main_sub(void);
int main(int argc, char *argv[]) {
cout << std::fixed << std::setprecision(12);
main_sub();
return 0;
}
using i64 = int64_t;
#ifndef USE_STRICT_INT
#define int i64
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x... | 0 | 78,877,203 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<stdlib.h>
using namespace std;
long long n;
long long *T;
void insert(long long a){
for(long long i = 0; i < n; i++){
long long j = (((a % n) + i * (1 + a % (n - 1))) % n);
if(T[j] == '\0'){
T[j] = a;
break;
}
}
}
string findx(lo... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X) {
if (N == 0) return 0;
vector<int> Y(N);
for (int i = 0; i < N; i++) cin >> Y[i];
int ANS = -1, NOW = 0;
for (int i = 0; i <= 10000; i++) {
if (X == Y[NOW]) NOW++;
if (NOW == N) {
AN... | 0 | 60,421,611 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #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 | 51,125,680 |
typedef long long ll;
typedef long double ld;
#define mod 1000000007
#define INF 1000000000
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<ll> leaf(n + 1);
for (int i = 0; i <= n; ++i) {
cin >> leaf[i];
}
if (leaf[0] >= 2) {
cout << -1... | #include <iostream>
int main()
{
int H,W,x,y,r;
bool in;
std::cin >> W;
std::cin >> H;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < 0 || x > W || y < 0 || y > H) {
in = false;
} else if ((y - r) < 0 || (y + r) > H) {
in = false;
} else if ((x - r) < 0 || ... | 0 | 29,422,436 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int h,w;
char arr[105][105];
int memo[105][105];
int f(int x,int y){
if(x==h && y==w){
return arr[h][w]=='#';
}
if(memo[x][y]!=... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const ll MOD = 1000000007;
const ll INF = 10e12;
using namespace std;
ll f1(ll tate, ll yoko)
{
if (tate < 3 || yoko < 3)
return INF;
else
{
ll l1 = tate / 3, l2 = tate / 3, l3 = tate / 3;
... | 0 | 86,824,213 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vect... | 0 | 24,727,118 |
#include<stdio.h>
int main(){
int n,i=0,j,a;
while(0==0){
scanf("%d",&n);
if(n==0){
break;
}
printf("Case %d: %d\n",i+1,n);
i++;
}
return(0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 33,644,537 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <cassert>
#define TEST_ASSERT(msg, cond) do { if (cond) { cout << msg << " => pass" << endl;} else { cout << msg << " => f... | 0 | 79,478,737 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#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 FOR(i,s,n) for(int i = s;i < (int)n;++i)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;--i)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, ... | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, m; cin >> n >> m;
int q; cin >> q;
vector<vector<int>> l(n), r(m);
for (; q; q--) {
int x, y; cin >> x >> y; x--; y--;
l[x].push_back(y); r[y].push_back(x);
}
int mxl = l[0].size();
for (int i = 1; i < n; i... | 0 | 14,788,444 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
LL K, A, B;
cin >> K >> A >> B;
if(A + 2 >= B){
cout << 1 + K <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
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& ... | 0 | 21,583,009 |
#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <stdio.h>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int ... | #include <iostream>
#include <string>
#include <cstring>
using namespace std;
int pop[24*3600+5];
inline int ss(char c) { return c-'0'; }
int stoi(string s) {
return (ss(s[0])*10+ss(s[1]))*3600 + (ss(s[3])*10 + ss(s[4]))*60
+ ss(s[6])*10 + ss(s[7]);
}
int main() {
int n;
string s,t;
while(cin>>n... | 0 | 15,859,001 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << (a+b-1)/b*c << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long x[3];
for(int i=0;i<3;i++)
cin>>x[i];
for(int i=0;i<2;i++){
if(x[i]-x[2]>0){
x[i]-=x[2];x[2]=0;}
else
{x[2]=x[2]-x[i];x[i]=0;}
}
cout<<x[0]<<" "<<x[1]<<endl;
return 0;} | 0 | 89,362,281 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int main() {
int N; cin >> N;
vector< pair<string, int> > ... | 0 | 90,968,469 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int h, w;
int main() {
cin>>h>>w;
ll ans = (ll)h*(ll)w;
if (h >= 3) {
if (h%3 == 0) ans = min(ans, 0LL);
else {
ans = min(ans, (ll)w);
}
}
if (w >= 3) {
if (w%3 == 0... | #include<iostream>
using namespace std;
int main(){
long long n,i,array[10000],max,min,total=0;
cin >> n;
for(i = 0; i < n; i++){
cin >> array[i];
}
max = array[0];
min = array[0];
for(i = 0; i < n; i++){
if(max < array[i]) max = array[i];
if(min > array[i]) min = arr... | 0 | 65,303,892 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N - 1);
vector<int> C(N - 2);
cin >> A.at(0);
int ans = abs(A.at(0));
for (int i = 1; i < N; i++) {
cin >> A.at(i);
B.at(i - 1) = abs(A.at(i) - A.at(i - 1));
ans += B.at(i - 1);
}
... | #pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | 0 | 30,601,964 |
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include<vector>
#include<iostream>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
long long int divide(long long int h,long long w){
if(h %2 == 0){
return (h/2)*w;
}
if(w %2 == 0){
return (w/2)*h;
}
long long int mi = min(h,w);
lo... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,j;
cin>>n>>j;
unordered_map<int,vector<int>> m;
for(int i=0;i<j;i++)
{
int a,b;
cin>>a>>b;
m[a].push_back(b);
m[b].push_back(a);
}
vector<int> ans(n+1,0);
int count=0;
queue<int> q;
q.... | 0 | 48,648,359 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc064_d.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <iostream>
using namespace std;
int main(){
int n,s,j,k;
int a[11][46];
for(int s=0;s<46;s++)
for(int n=0;n<11;n++)
a[n][s]=0;
n=s=0;
for(int i=0;i<1024;i++){
for(j=i,n=0;j>0;j/=2)
n += j%2;
for(j=i,s=0,k=0;j>0;j/=2,k++)
s += j%2*k;
a[n][s]++;
}
while(true){
... | 0 | 47,783,873 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second... | 0 | 67,962,274 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<functional>
#include<stack>
using namespace std;
int main() {
int m, f, r;
while (cin >> m >> f >> r) {
if (m < 0 && f < 0 && r < 0)break;
if (m < 0 || f < 0)cout << "F" << endl;
else {
if (m + f >= 80)cout << "... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int x = 1; x <= n; x++)
{
int s = 0;
int y = x;
while (y > 0)
{
s += y % 10;
y /= 10;
}
if (a <= s & s <= b)
{... | 0 | 88,384,821 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=10000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
string S;
ll K;
cin >> S >> K;
int cnt = 0;
char word = ' ';
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1') {
cnt++;
} else {
word = S[i];
... | 0 | 26,248 |
#include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
int count[26] = {};
char ch;
while( cin >> ch){
if( isalpha(ch)){
ch = tolower(ch);
count[ch - 'a'] += 1;
}
}
for(int i=0; i<26; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 23,121,658 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c,d;
cin>>a>>b>>c>>d;
std::deque<int> deq(10,0);
deq[a]=1;
deq[b]=1;
deq[c]=1;
deq[d]=1;
if (deq[1]==1&&deq[9]==1&&deq[7]==1&&deq[4]==1) {
cout<<"YES"<<endl;
} else {
cout<<"NO"<<endl;
}
} | #include <iostream>
int main() {
for( int i = 1 ; i <= 10000 ; i++ ) {
int x ;
std::cin >> x ;
if( x != 0 ) {
std::cout << "Case " << i << ": " << x << std::endl ;
} else {
break ;
}
}
} | 0 | 98,924,455 |
#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 <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 57,731,257 |
#include <bits/stdc++.h>
using namespace std;
int main(){long n,m=1e9+7,i=26;vector<int>a(26,0);cin>>n;string s;cin>>s;while(n--)a[s[n]-'a']++;n=1;while(i--)n=n*(a[i]+1)%m;cout<<n-1;} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int H,W,D;
cin >> H >> W >> D;
int A[H][W];
int X[H * W],Y[H * W];
rep(i,H){
rep(j,W){
cin >> A[i][j];
Y[A[i][j] - 1] = i;
X[A[i][j] - 1] = j;
... | 0 | 26,455,338 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
... | 0 | 37,348,118 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string a,b;
cin >> a >> b;
if(a<b)
cout << "<" << endl;
else if(a>b)
cout << ">" << endl;
else
cout << "=" << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000000000
#define INF 1000000
#define M 1000000007
#define PI 2 * acos(0.0)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool is_palindrome(string s){
ll j = s.length()-1;
ll i = 0;
while(i ... | 0 | 25,497,746 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = nu... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | 0 | 77,934,922 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
set<char>S;
cin>>s;
for(int i=0;i<3;i++)
{
S.insert(s[i]);
}
if(S.size()==3)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main()
{
ll N;
cin >>... | 0 | 50,949,375 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pw(x) (1LL << (x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ",... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | 0 | 29,651,480 |
#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<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | #include<iostream>
#include<string>
#define rep(i,start,n) for(int i=0 ; i < n ; i++)
using namespace std;
int main(){
int count[26]={0};
int x=0;
string sentence;
while(getline(cin,sentence)){
x = sentence.lengt... | 0 | 20,753,548 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
signed main() {
int N;
cin >> N;
int ans = N * (N + 1) * (N + 2) / 6;
rep(i, N - 1) {
int l, r;
cin >> l >> r;
if (l >... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 19,637,785 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
map<char, int> S;
for(int i = 0; i < 4; i++){
cin >> c;
S[c]++;
}
if(S.size() == 2 && S[c] == 2){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 100000000000000000
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(),_x.end()
#define f first
#define s second
#define pb push_back
void mahakal... | 0 | 9,084,982 |
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,area ;scanf("%d %d",&a,&b);area=(a-1)*(b-1);printf("%d",area);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n, m;
cin >> n;
vector<string> vec_n(n);
rep(i, n) cin >> vec_n[i];
cin >> m;
vector<string> vec_m(100);
rep(i, m) cin >> vec_m[i];
int max = -100;
... | 0 | 17,735,846 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 1005;
const int inf = 1e9;
#define singleCase
int h,n,a[N],b[N]... | 0 | 48,546,487 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int cnt[210000];
for(int i = 0; i < N; i++) {
int a;
cin >> a;
cnt[a-1]++;
}
sort(cnt, cnt+N);
int ans = 0;
for(int i = 0; i < N - K; i++) {
ans += cnt[i];
... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 93,704,059 |
#include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 28,862,300 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string s1, s2;
s1 = s.replace(5, 1, " ");
s2 = s1.replace(13, 1, " ");
cout << s2 << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | 0 | 37,869,098 |
#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 a, p;
cin >> a >> p;
p += a*3;
cout << p/2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int* A = new int[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int mini = i;
for (int j = i+1; j < N; j++) {
if (A[j] < A[mini]) {
mini = j;
}
}
if (... | 0 | 84,429,174 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string card, card_next;
int m;
int h;
while(1) {
getline(cin, card);
if(card == "-") break;
scanf("%d", &m);
int i = 0;
char nl;
for(i = 0; i < m; i++) {
scanf("%d%c", &h, &nl);
card_next = card.substr(h, ca... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 | 31,461,171 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> s(n);
rep (i, n)
cin >> s[i].first >> s[i].second;
ll ans = 0;
int index = 0, cnt = 0;
sort(s.begin(),... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(ve... | 0 | 11,626,810 |
#include <iostream>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
const int kNil = -1;
const int kMaxV = 110;
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_t... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
int a[200005];
int s[200005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i=0 ; i<n ; i++) {
scanf("%d", a+i);
}
if... | 0 | 60,302,374 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, y;
cin >> x >> y;
if(y == 1) puts("-1");
else if(x%2 == 0 && y == 2) puts("-1");
else if(x % y == 0) puts("-1");
else cout << x * (y - 1) << endl;
} | #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>;
#... | 0 | 21,862,184 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#define doubled( x ) (x * x)
int digit_count(int num);
using namespace std;
int main()
{
int N; cin >> N;
vector<int> data(3);
for(int i = 0; i < N; i++)
{
for(int j = 0; j < 3; j++)
{
cin >> data[j];
}
sort(data.be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;
string c1[36], c2[36];
cin >> N;
for(int i=0;i<N;i++) cin >> c1[i];
for(int i=0;i<N;i++) c2[i]=c1[i];
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(c1[j][... | 0 | 60,377,792 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
int main()
{
int a,b,c,d,e,k=0,s,a1,b1,c1,d1,e1,z[5];
cin>>a>>b>>c>>d>>e;
if (a%10==0)
k=k+a;
else
{
... | #include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
string input_line;
int *heights;
heights = new int[0];
int lineNum = 0;
while(cin)
{
getline(cin, input_line);
lineNum++;
int line = atoi(input_line... | 0 | 65,313,813 |
#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#define FOR(i,j,n) for (int i=(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define REPN(i,n) for (int i=(n);i>=0;i--)
#define I(n) scanf("%d", &(n))
#define pb(n) push_back((n))
#define mp(i,j) make_pair((i),(j))
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 78,914,750 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
for(int b=0;b<(1<<3);++b){
int ans = S[0] - '0';
for(int i=1;i<4;++i){
if(b & (1<<(i-1))){
ans += S[i] - '0';
}else{
ans -= S[i] - '0';
}
}
if (ans == 7){
for(int i=0;i<3;++i){
... | 0 | 26,163,867 |
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t k, a, b;
std::cin >> k >> a >> b;
if (b - a <= 2) {
std::cout << k + 1 << std::endl;
} else {
k -= a - 1;
std::cout << (b - a) * (k / 2) + (k % 2) + a... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | 0 | 55,158,193 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> k(N+1);
k.at(0) = 2;
k.at(1) = 1;
for(int i = 2; i <= N; i++) {
k.at(i) = k.at(i-1) + k.at(i-2);
}
cout << k.at(N) << endl;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb(x) push_back(x)
#define MP(x,y) make_pair(x,y)
using namespace std;
ll gcd(ll a,ll b)
{
if(a%b==0)
return b;
else
return gcd(b,a%b);
}
int hashe[5];
void solve()
{
int a,b;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>... | 0 | 4,170,932 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main(){
int N;
cin >> N;
vector<tuple<int, int, int>> A(N);
for( int i = 0; i < N; i++ ){
int a, b;
cin >> a >> b;
A.at(i) = make_tuple(a+b, a, b);
}
sort(A.rbegin(), A.rend());
int t... | 0 | 61,593,439 |
#include <bits/stdc++.h>
using namespace std;
long long x[10000010], y[10000010];
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lep(j, n) for (int j = 0; j < (n); j++)
#define reps(i, n) for (int i = 1; i < (n); i++)
#define leps(i, n) for (int j = 1; j < (n); j++)
#define all(x) (x).begin(), (x).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC optimize("O2")
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_... | 0 | 93,810,119 |
#include <iostream>
#include <string>
#include <utility>
#include <map>
using namespace std;
typedef pair<int, char> P;
P bCards[36];
P sCards[36];
P iCards[36];
void bubbleSort(int n){
for(int i=0; i<n; ++i){
int x = bCards[i].first;
for(int j=n-1; j>i; --j){
if(bCards[j].first < bCards... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ino freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout);
#define fr(i,n) for(i=0;i<n;i++)
#define frs(i,a,n) for(i=a;i<n;i++)
#define frv(i,n) for(i=n-1;i>=... | 0 | 34,401,680 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, btot = 0;
cin >> n;
vector<ll> t(n),a(n),b(n);
rep(i, n) {
cin >> a[i] >> b[i];
t[i] = a[i] + b[i];
btot += b[i];
}
sort(t.rbegin(), t.... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 | 43,405,902 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
using namespace std;
int n,cnt=1;
long long ans;
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 40,977,294 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
inline int inputi(){ int x; scan... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | 0 | 46,392,784 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 112345;
const long long MOD = 1e9 + 7;
long long n, m;
vector <long long> x;
vector <long long> y;
long long solve () {
long long ans = 0;
for (long long i = 1; i < n; ++i) {
long long temp = i * (n - i);
temp %= MOD;
ans += temp * (x[i] - x[i - 1])... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll H, W, M;
scanf("%lld %lld %lld... | 0 | 42,255,626 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define vcout(v) rep(i,v.size()) cout << v[i] << " "; cout << endl
#define mcout(m) rep(j,m.size()){vcout(m[j]);}
const ll MOD = 1e9 + 7;
int mainsolve(){
ll k;
cin >> k;
vector<l... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
bool cmp_f(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.first < y.first;
}
bool cmp_s(const pair<LL, LL> &x, const pair<LL, LL> &y)
{
return x.second > y.second;
}
int main() {
LL n;
LL a;
... | 0 | 49,217,314 |
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 70,329,302 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
string S;cin >> S;
if (S == "AAA" || S == "BBB") cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b;
cin >> a >> b;
ll ans = 0;
ll n = b - a + 1;
if (a % 2)
{
ans = a;
n--;
}
if (n % 2 == 0)
{
if ((n / 2) % 2 == 0)
{
ans = ans ^ 0;
}
e... | 0 | 37,052,967 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int N; cin >> N;
vector<int> c(N), s(N), f(N);
for(int i=0; i<N-1; i++) cin >> c[i] >> s[i] >> f[i];
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 0 | 11,582,136 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
string rotate = s;
for(long long i = 0; i < s.size(); i++){
rotate = rotate[rotate.size()-1] + rotate.substr(0, rotate.size()-1);
if(rotate == t){
printf("Yes\n");
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
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 ... | 0 | 3,106,946 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
constexpr ll INF = ll(1e+18) + 1;
int main() {
int A, B, C;
string ans = "NO";
cin >> A >> B >> C;
rep(b, B) {
if ((A*b)%B == C) {
ans = "YES";
break;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typen... | 0 | 1,263,117 |
#include <iostream>
#include <string>
using namespace std;
int main () {
string str;
cin >> str;
str.insert(4, " ");
cout << str << endl;
return 0;
} | #include <iostream>
using namespace std;
#include <math.h>
#include <cstdio>
int main()
{
double dis = 0.0 , x1 , x2 , y1 , y2 , f = 0.0;
cin >> x1 >> y1 >> x2 >> y2;
if( x1 >= x2 && y1 >= y2 ) f = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
else if( x1 <= x2 && y1 <= y2 ) f = ( x2 - x1 ) * ( x2 - x1... | 0 | 71,565,561 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int INF = 100000000;
ll i,j,k;
ll mod=1000000007;
int main(){
ll n,answer=0,answer2=0;cin>>n;
vector<ll> a(n+1),key(n+1);
for(i=1;i<=n;i++){cin>>a[i];}
for(i=1;i<=n;i++){key[i]=a[i]-i;}
sort(key.begin()+1,key.end());
double c... | 0 | 57,364,415 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int i = 0; i < N; i++) cin >> P[i];
for (int i = 0; i < N; i++) cin >> Q[i];
vector<int> perm(N);
for (int i = ... | #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<cstring>
#include<queue>
#include<cmath>
#include<functional>
#include<numeric>
#include<map>
using namespace std;
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define REPS(i, n) for(int i=1;i<=(int)(n);i++)
#define RREP(i, n) for(int i=(i... | 0 | 84,170,271 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,j,k,flag;
string s;
while(~scanf("%d",&n))
{
flag = 1;
cin >> s;
if(n%2)cout<<"No"<<endl;
else
{
for(i=0,j=n/2;i<n/2;i++,j++)
{
if(s[i]!=s[j]) flag = 0;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long x;
cin>>n>>x;
vector<long long>lyr(n+1);
vector<long long>p(n+1);
p[0]=1;
lyr[0]=1;
for(int i=1;i<=n;i++)
{
p[i]=(2*p[i-1])+1;
lyr[i]=(2*lyr[i-1])+3;
}
long long ans=0;
long long l=1;
long long r=lyr[n];
long ... | 0 | 42,962,548 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool f = false;
for (int j = a.size(); j >=0; j-=2) {
if (j%2 == 1 && f == false) {
f = true;
a.pop_back();
}
string b = a.substr(0, a.size()/2);
string c = a.substr(a.size()/2, a.size()-1);
if (b == c... | 0 | 91,822,369 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string a = "qwertasdfgzxcvb";
string b = "yuiophjklnm";
string s;
while (getline(cin, s)) {
if (s == "#") {
break;
}
if (s.size() == 1) {
cout << 0 << endl;
continue;
}
vector<int> c;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int ... | 0 | 84,659,096 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
if((N-1)*(N-2)/2<K){
cout << -1 << endl;
}else{
cout << N-1 + (N-1)*(N-2)/2 - K << endl;
int count = (N-1)*(N-2)/2 - K;
for(int i=2;i<=N;i++){
cout << 1 << " " << i << endl;
... | 0 | 29,093,470 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N];
int n, sz[N];
void dfs(int u, int par) {
sz[u] = 1;
int cnt = 0;
for (auto v: adj[u])
if (v ^ par) {
dfs(v, u);
sz[u] += sz[v];
cnt += sz[v] & 1;
}
if (cnt > 1) {
cout << "First\n";
exit(0);
}
}
inline void rea... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,ans,ml=1,mr=100000;
cin >> n >> m;
for(int i=0;i<m;i++)
{
int l,r;
cin >> l >> r;
ml=max(ml,l);
mr=min(mr,r);
}
ans = max(0,mr - ml + 1);
cout << ans << endl;
return 0;
} | 0 | 16,233,086 |
#include <bits/stdc++.h>
#define FOR(i, n) for(ll i = 0; i < n; i++)
#define FORR(i, n) for(ll i = n; i >= 0; i--)
#define FORS(i, m, n) for(int i = m;i < n;i++)
#define ALL(v) accumulate(v.begin(),v.end(),0)
#define SORT(v) sort(v.begin(),v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#define IN... | #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 | 96,960,280 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
map<string,int> kotoba;
bool ok=true;
int n;
cin >> n;
char old,now;
rep(i,n){
string s;
cin >> s;
if(kotoba[s]>0){
ok=false;
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#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++)
#define repr(e,x) for(auto& e:x)
usi... | 0 | 22,978,564 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | 0 | 69,910,546 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int num=x/100;
if(x<=105*num)cout << 1;
else cout << 0;
} | #include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long
#define t1(a) cout << #a << ":" << a << endl;
#define t2(a, b) cout << #a << ":" << a << " | " << #b << ":" << b << endl;
#define t3(a, b, c) cout << #a << ":" << a << " | " << #b << ":" << b << " | " << #... | 0 | 45,809,992 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<string, int> mp = {{"1", 0}, {"9", 0}, {"7", 0}, {"4", 0}};
string N;
bool ans = true;
for(int i = 0; i < 4; i++)
{
cin >> N;
auto itr = mp.find(N);
if(itr != mp.end())
mp.at(N)++;
}
map<string, int>::iterator it;
for(it = ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {... | 0 | 98,409,691 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int n, a[1 << 18], mx1[1 << 18], mx2[1 << 18];
int main() {
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", &a[i]);
mx1[i] = a[i];
}
for (int j = 0; j < n; ++j) {
for (int K = 1; K < (1 <... | #include<bits/stdc++.h>
using namespace std;
#define llu unsigned long long int
int main()
{
llu n,m,res=0,cnt=0,x,b,a,i;
cin>>n>>m;
vector<pair<long long int,long long int> > p(n);
for(i=0;i<n;i++)
{
cin>>a>>b;
p[i]=make_pair(a,b);
}
sort(p.begin(),p.end());
for(i=0;i<n;... | 0 | 28,314,479 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n; cin >> n;
int cnt = 0, a = 0, b = 0, ab = 0;
for (int i = 0; i < n; ++i) {
string s; cin >> s;
bool f = false;
for (int j = 0; j < s.size() - 1; ++j)
if (s.substr(j, 2) == "AB") ++cnt;
if (s.back() == 'A') ... | 0 | 27,086,675 |
#include <iostream>
using namespace std;
int main() {
string S="ABA";
cin >> S;
if(S[0]!=S[1]){
cout << "Yes";
}else if(S[1]!=S[2]){
cout << "Yes";
}else{
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | 0 | 4,123,967 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <tuple>
#include <numeric>
#include <cstdio>
#include <cmath>
using namespace std;
using ll = long long;
const int INF = 1e9;
int a, b, c;
int N, rtn... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 311,248 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long... | 0 | 10,023,554 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.