code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev(v) rever... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 0 | 78,262,262 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>
#include<array>
using namespace std;
int main()
{
array<int,5> a;
for ( auto i = 0; i < 5; ++i )
cin >> a[i];
sort( a.begin(), a.end(), []( int x, int y ){ ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 75,561,036 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int n,m;
string dic[100000];
string words[100000];
map<string, string> mp;
while(true){
cin >> n;
if(n==0){
return 0;
}
string result = "";
for(int i=0;i<n;i++){
cin >>... | #include <unordered_set>
#include <cstdio>
#include <string>
int main() {
std::unordered_set< std::string > dict;
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
char cmd[7] = {0};
char word[13] = {0};
scanf("%s %s", cmd, word);
if (cmd[0] == 'i') {
dict.insert(word);
} else ... | 0 | 42,877,859 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
cout << (n < 1200 ? "ABC" : "ARC") << endl;
return 0;
} | #include <bits/stdc++.h>
#define EPS 1e-9
#define PI acos(-1)
using namespace std;
typedef long long ll;
const int maxn = 1e5+100;
const int mod = 1e9+7;
int a[maxn];
int vis[maxn];
ll f1[maxn],f2[maxn];
ll quick(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n%2==1)
{
ans=(ans*x)%mod;
... | 0 | 21,424,378 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
const int MAX_N = 5050;
long long N, K;
long long a[MAX_N];
bool can_make[MAX_N][MAX_N];
bool check(const int id... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 87,690,446 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define F(i,n) for(ll i=0;i<n;i++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repp(i,a,b) for(ll i=a;i>=b;i--)
#define pb ... | 0 | 24,168,028 |
#include<iostream>
using namespace std;
int main(){
bool tf=true;
int tedad[3]={1,1,1};
char str[4];
cin>>str;
for(int i=0;i<3;i++){
if(str[i]=='a'){
if(tedad[0]==1){
tedad[0]=0;
}
else{
tf=false;
break;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N, ans=0; cin>>N;
vector<ll> Z(N,0);
for(int i=0; i<N; i++){
ll A; cin>>A;
Z[i]=A;
}
for(int i=0; i<N-1; i++){
if(Z[i]<=Z[i+1]){
ans+=Z[i];
Z[i+1]-=Z[i];
Z[i]=0;
}
else if(Z[i]>Z[i+1]){
... | 0 | 8,757,615 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N);
long long ans = 0;
for(int i=0; i<N; i++) cin>>A[i];
for(int left = 0; left < N; ){
int right = left;
long long sum = 0;
while(A[right] != 0 && right < N){
sum += A[righ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 9,343,370 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
string... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | 0 | 7,565,153 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
for(int i=0;i<n/2;i++) swap(s[i],s[n-i-1]);
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define pf printf
#define sf(n) scanf("%d", &n)
#define sff(a,b) scanf("%d... | 0 | 36,706,383 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(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 (... | 0 | 70,666,482 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
string s;
cin>>s;
int len=s.size();
int cnt=0;
bool flag=true;;
if(s[0]!='A'){
flag=false;
}
for(int i=1;i<len;i++){
if(isupper(s[i])){
... | #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 char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 21,931,046 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> p;
const int INF = 1e9;
int main() {
int n; cin >> n; cout << n * n << endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m... | 0 | 91,435,367 |
#include<iostream>
#include<algorithm>
#include<set>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define mp make_pair
using namespace std;
typedef pair<int, int> P;
set<P>s; multiset<P>ms;
int h, w, n, ans[20];
signed main() {
cin >> h >> w >> n;
while (n--) {
int x, y; cin >> x >> y;
fo... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 71,381,425 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)ret... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | 0 | 66,213,904 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#... | 0 | 76,603,266 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int N;
std::vector<int> v;
std::cin >> N;
for(int i = 0 ; i < N ; i++){
int temp;
std::cin >> temp;
v.push_back(temp);
}
std::sort(v.begin(), v.end());
double resa = 0;
double ave = v[0];
for(int i = 0 ; i < (int)v.size... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#define Ns... | 0 | 29,369,182 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
int dp[101][100001];
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
dp[0][0] = 1;
for(int i = 1; i <= n; i++){
for(int j = ... | #include <bits/stdc++.h>
using namespace std;
const int nm = 1e5;
int n, m, p[nm], r[nm], a[nm], ans = 0;
vector<int> g[nm];
int root(int v) {
if (r[v] == v)
return v;
return root(r[v]);
}
void unite(int x, int y) {
int rx = root(x), ry = root(y);
if (rx == ry)
return;
if (a[ry] > a[rx])
swap(rx, ry);
r[ry]... | 0 | 20,978,119 |
#include<iostream>
using namespace std;
int main(void)
{
int l, r;
for(int i = 0; i < 81; i++)
{
l = i/9+1;
r = i%9+1;
cout << l << 'x' << r << '=' << l*r << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : ... | 0 | 74,355,199 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combinat... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> c(h,vector<char>(w));
for(int i=0; i<h; i++) for(int j=0; j<w; j++) cin>>c[i][j];
int ans=0;
for(int i=0; i<(1<<h); i++){
for(int j=0; j<(1<<w); j++){
... | 0 | 38,725,605 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
ll M;
cin >> N >> M;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
map<ll,int> mp;
ll R[N+1];
R[0] = 0;
mp[0]++;
ll an... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
ll n, y;
cin >> n >> y;
y /= 1000;
if (n > y)
{
cout <... | 0 | 78,983,209 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include <iostream>
using namespace std;
#include <cstdio>
#include <cmath>
class Dice{
public:
int face[6], facetmp[6];
Dice(void){
for (int i = 0; i < 6; i++){
face[i] = 0;
facetmp[i] = 0;
}
}
void move(char ch){
for (int i = 0; i < 6; i++) {
... | 0 | 91,458,220 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <iostream>
using namespace std;
int main(){
short int n , a , b , c , d ;
while( cin >> n ){
int num =0 ;
for( a=0 ; a<10 ; a++ )
for( b=0 ; b<10 ; b++ )
for( c=0 ; c<10 ; c++ )
for( d=0 ; d<10 ; d++ )
if( a+b+c+d == n )
num ++ ;
cout << num << endl;
}
} | 0 | 79,198,385 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int K, A, B; cin >> K >> A >> B;
if(A >= B-2 || A >= K) cout << K+1 <... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n... | 0 | 36,954,406 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 57,335,666 |
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<bitset>
using namespace std;
typedef bitset<60000> bi;
bool get(vector<int> v, int t) {
bi x;
x[30000] = 1;
for (int i = 0; i < v.size(); i++)x = (x << v[i]) | (x >> v[i]);
return x[30000 + t];
}
int main() {
string... | #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i ... | 0 | 29,528,572 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | #include <iostream>
int main () {
std::string a, b, c;
std::cin >> a >> b >> c;
if(a.substr(a.size()-1, 1) == b.substr(0, 1) && b.substr(b.size()-1, 1) == c.substr(0, 1)) {
std::cout << "YES" << std::endl;
}else {
std::cout << "NO" << std::endl;
}
} | 0 | 38,587,619 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for... | 0 | 4,472,783 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;
void addWordCount(const vector<string>& cards, map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, map<string, int>& wordCount);
int getMaxValue(const map<string, int>& wordCount);
int main() {
int n... | 0 | 78,931,015 |
#include <iostream>
#include <string>
using namespace std;
bool is_right(char c) {
static char right[] = "yuiophjklnm";
for (int i=0; right[i]; i++) {
if (c == right[i]) {
return true;
}
}
return false;
}
int main() {
bool was_right;
string input;
while (true) {
... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
cin>>n;
int a[n];
int count = 0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int minj = i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj =... | 0 | 30,484,944 |
#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<iostream>
#include<queue>
#include<cmath>
using namespace std;
class vec {
public:
double x;
double y;
vec(double nx, double ny) :x{nx}, y{ny} {}
};
class segment {
public:
vec start;
vec end;
segment(vec start, vec end) :start{start}, end{end} {}
};
vec operator+(vec v1, vec v2) {
return vec(v1.... | 0 | 33,475,617 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(n);i++)
#define rep2(i,n) for(long long i=1;i<=(n);i++)
#define rep3(i,i0,n) for(long long i=i0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool co... | 0 | 4,482,360 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 30,705,612 |
#include <iostream>
using namespace std;
int main() {
int a[100][100] = {{0}};
int n;
cin >> n;
int u, k, v;
for ( int i = 0; i < n; i++ ) {
cin >> u >> k;
for ( int j = 0; j < k; j++ ) {
cin >> v;
a[u - 1][v - 1] = 1;
}
}
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < n; j++ ) {
cout << a... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 18,229,264 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, a;
cin >> n;
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
int X = 100001;
int Y = 100001;
for(int i = 0; i < A; i++) {
cin >> a[i];
X = min(X,a[i]);
}
for(int i = 0; i < B; i++) {
cin >> b[i];
... | 0 | 65,686,823 |
#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
typedef long long ll;
int gcd(int a, int b){
if (a%b==0){
retu... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 54,944,023 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n;
cin >> n;
vecto... | #include <bits/stdc++.h>
using namespace std;
const int time_max = 86410;
int imos[time_max];
int time_split(char Tens_Place,char One_Place){
int return_num;
string s = {Tens_Place, One_Place};
stringstream ss;
ss << s;
ss >> return_num;
return return_num;
}
int main() {
while(1) {
i... | 0 | 78,709,659 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
long ans = (100 * (n - m) + 1900 * m) * (1 << m);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long K, std::vector<long long> A){
ll ans = 0;
ll right = 0;
while(true){
if(right == 0) right += K;
else right += K - 1;
ans ++;
if(right >= N) break;
}
cout << ans << en... | 0 | 36,489,646 |
#include<bits/stdc++.h>
using namespace std;
string rever(string s) {
string t(s.rbegin(), s.rend());
return t;
}
int main() {
string s, t, a, b, x, y;
cin >> s;
int n = s.size();
t = rever(s);
a = s.substr(0, (n-1)/2);
b = rever(a);
x = s.substr((n+1)/2);
y = rever(x);
if (s==t && a==b && x==y) c... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 23,270,868 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sidha(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define mod 1000000007
int solve(int n){
int dp[n+1];
dp[0]=0;
dp[1]=1;
for(int i=2;i<n+1;i++){
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
return dp[n];
}
int main(){
io... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> m,f,r;
int m1,f1,r1;
do{
cin>>m1>>f1>>r1;
m.push_back(m1);
f.push_back(f1);
r.push_back(r1);
}while (m1!=-1 || f1!=-1 || r1!=-1);
int i;
for (i=0;i<m.size()-1;i++){
char c;
... | 0 | 75,623,963 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
string s =to_string(n);
if(count(s.begin(),s.end(),'7')>0){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
return 0;
} | # include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <math.h>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define MAXN 100005
# define eps 1e-5
# define MAX... | 0 | 39,660,917 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #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(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi... | 0 | 83,714,787 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define umap unordered_map
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define MN(a,b,c) min(a,min(b,c))
#define pr pair<ll,ll>
#define F first
#define S second
#define mP... | 0 | 56,187,598 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll=long long;
using namespace std;
int main(){
ll a;
double b;
cin>>a>>b;
ll ib=100*b+0.5;
a*=ib;
a/=100;
cout<<a<<endl;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 34,432,510 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
#include <functional>
#include <numeric>
#include <stack>
#include <tuple>
using namespace... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int,int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main(){
int n;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R')r++... | 0 | 52,864,291 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int r;
cin >> r;
cout << ((r < 1200) ? "ABC" : (r < 2800) ? "ARC" : "AGC") << '\n';
... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | 0 | 32,535,363 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
ll N, H, W;
cin >> N >> H >> W;
int cnt=0;
for(int i=0; i<N; i++){
ll A, B;
cin >> A >> B;
if(A>=H && B>=W) cnt++;
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string s; cin >> s;
int left = 0;
int pointer = 0;
for (int i = 0; i < n; i++) {
if (0 < pointer) {
if (s[i] == '(') {
pointer++;
}
else {
pointer--;
}
}
else {
if (s[i] == '(') {
po... | 0 | 48,517,471 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int w,h,n; cin>>w>>h>>n;
vector<vector<int>> v(w,vector<int>(h));
rep(i,n){
int x,y,a; cin>>x>>y>>a;
if(a==1){
for(int i=0; i<x; i++){
for(int j=0; j<h; j++){
v[i][j]=1;
}
... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
string A,B;
cin >> A >> B;
if(A.size() > B.size()){
cout << "GREATER";
}
else if(A.size() < B.size()){
cout << "LESS";
}
else{
rep(i,A.size()){
if(A[i] > B[i... | 0 | 67,815,976 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | #include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define ceil(a,b) (((a)+(b)-1)/(b))
#define yn(i) ((i)?"Yes":"No")
#define chm... | 0 | 81,845,395 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
struct UnionFind {
private:
vector<int> uf;
size_t sz;
public:
UnionFind(size_t Size) {
uf.assign(Size, -1);
sz = Size;
}
int find(int x) { return (uf[x] < 0) ? x : uf[x] = find(uf[x]); }
bool same(int x, int y) { return find(x) == find(y); }
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int... | 0 | 59,319,587 |
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bit... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int pointT = 0, pointH = 0;
string taro, hanako;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> taro >> hanako;
int count = 0;
if( taro.size() > hanako.siz... | 0 | 89,321,519 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int mod = 1e9+7;
vector<int> a[30];
void solve() {
int n; string s; cin >> n >> s;
... | #include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define pi acos(-1)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int main()
{
fast
ll n,m,x,y,i,j,k,p,f=0,tc,cnt=0,sum=0,pro=1,mi=1e18,ma=-1e18;
string str;
char ch;
double d... | 0 | 4,149,682 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
ll a,b=0,c=0,d=0,e=0;
cin>>a>>b>>c;
if(a%b!=0){
d=(a/b)+1;
}
else{d=(a/b);}
cout<<c*d<<endl;
} | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 0 | 14,265,884 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF... | #include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
using namespace std;
const int MAX_N=200000;
int N;
int A[MAX_N],AC[MAX_N],S[MAX_N];
int main(){
cin >> N;
for(int i=0;i<N;i++){
cin >> A[i];
AC[i]=A[i];
}
sort(AC,AC+N,greater<int>());
for(int j=0;j<N;j++... | 0 | 37,145,735 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
ll l,r;
int ans = 0;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=0;i<k;i++){
l += i;
}
for(int i=n;i>n-k;i--){
r += i;
}
for(int i=k;i<=n+1;i++){
int add = (r-l+1)%mod;
ans = (ans+add)%mod;
l += i;
r +... | #pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int n,k,res,dp[N];
int qmi(int a,int b){
int res=1;
while(b){if(b&1LL) res=res*a%mod; a=a*a%mod; b>>=1LL;}
return res;
}
signed main(){
cin>>n>>k;
for(int ... | 0 | 97,971,836 |
#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];
}
sort(A.begin(), A.end());
cout << abs(A.back() - A.front()) << endl;
} | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 51,398,248 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,m;
cin>>n>>m;
char fi1[n][n];
char fi2[m][m];
rep(i,n){
rep(j,n){
... | 0 | 79,868,743 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const ll MAX = 1e18;
int ... | 0 | 98,301,579 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<string> vstr;
ty... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2>... | 0 | 25,336,759 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<string> S(10010);
cin >> N; int ans = 0;
int A = 0, B = 0, BA = 0;
for(int i=0; i<N; i++){
cin >> S[i]; int l = S[i].length();
for(int j=0; j<l-1; j++){
if(S[i][j] == 'A' && S[i][j+1] == 'B') ans++;
}
if(S[i][0] == '... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<ll> enum_divisors(ll n){
vector<ll> res;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
res.push_ba... | 0 | 52,950,379 |
#include<iostream>
#include <string>
#include <iomanip>
using namespace std;
int main()
{
double L;
cin >> L;
double x = L / 3;
cout << fixed << setprecision(20) << x * x * x << endl;
} | /*http:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while (cin>>n && n>0){
vector<int> s;
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
s.push_back(tmp);
}
sort(s.begin(),s.end());
cout... | 0 | 54,675,169 |
#include<iostream>
int n,i;main(){std::cin>>n;while((i*i+i)/2<n)i++;while(i){if(n-i>=0)std::cout<<i<<'\n',n-=i;i--;}} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
int C;
if (i % 2 == 0){
if (A % 2 == 1){
A--;
}
A = A/2;
B += A;
}
else {
if (B % 2 == 1){
B--;
}
B = B/2;
A += B;... | 0 | 55,257,965 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).... | #include <bits/stdc++.h>
using namespace std;
int64_t solve(int64_t H, int64_t W){
const int64_t S= H* W;
int64_t slice= min(H, W);
int64_t ans= slice;
for(int Wcut= W/3; Wcut<= W/3+ 1; Wcut++){
if(Wcut==0){ continue; }
else{
vector<int64_t> cross;
cross.emplace_back(H* Wcut);
int64_t ... | 0 | 24,527,665 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s,t;
cin>>s>>t;
if(s>t){
cout<<">"<<endl;
}
else if(s<t){
cout<<"<"<<endl;
}
else{
cout<<"="<<endl;
}
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
vector<ll> v;
void dfs(ll val, int len){
v.push_back(val);
if(len == 10) return;
int i = val%10;
for(int j = -1; j <= 1; j++){
if(i+j < 0 || i+j > 9) continue;
dfs(val*10+i+j, len+1);
... | 0 | 3,672,302 |
#include <iostream>
using namespace std;
class Dice {
public:
int face[6];
int getRightFace(int up, int front);
};
int Dice::getRightFace(int up, int front)
{
if ((up == face[1] && front == face[2]) ||
(up == face[2] && front == face[4]) ||
(up == face[3] && front... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | 0 | 94,608,511 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, K;
cin >> A >> B >> K;
if(K <= A){
cout << (A - K) << ' ' << B << endl;
}else if (K <= A + B){
cout << 0 << ' ' << (A + B - K) << endl;
}else{
cout << 0 << ' ' << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Point=pair<int, int>;
void solve() {
int h,w,n;
cin >> h >> w >> n;
set<Point> st;
for (int _ = 0; _ < n; _++) {
int x,y;
cin >> x >> y;
st.insert({x,y});
}
set<Point> trk;
vector<ll> cnt(10, 0);
... | 0 | 36,354,450 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> ar(n);
for(int i=0;i<n;++i)
{
cin>>ar[i];
}
vector<int> dp(n+1,0);
dp[1]=0;
dp[2]=abs(ar[1]-ar[0]);
for(int i=3;i<=n;++i)
{
dp[i]=min(dp[i-1]+abs(ar[i-1]-ar[i-2]),dp[i-2]+abs(ar[i-1]-ar[i-3]));
}
cout<<dp[n]<<'\n';... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 61,479,201 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int N, X;
cin >> N >> X;
long long int max_length=1;
int n=0;
vector<long long int> max_p_num(N+1, 0);
max_p_num[0] = 1;
while(n<N) {
max_length *= 2;
max_length += 3;
max_p_num[n+1] = m... | #include<bits/stdc++.h>
using namespace std;
void ans(bool b) {
cout << (b ? "Possible" : "Impossible") << endl;
exit(0);
}
int main() {
int64_t N;
cin >> N;
vector<int64_t> a(N);
for (int64_t& A : a) {
cin >> A;
}
int64_t one_num = count(a.begin(), a.end(), 1);
if (one_num =... | 0 | 62,222,852 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> mon(n);
for(int i = 0;i < n;... | #include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
unsigned X, Y, Z, K;
scanf("%u %u %u %u", &X, &Y, &Z, &K);
ull A[X];
for(int i = 0; i < X; ++i){
scanf("%llu", A + i);
}
ull B[Y];
for(int ... | 0 | 59,594,176 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | #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 | 14,697,118 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main(void)
{
char s[30][30][9];
int h, w,i,j;
scanf("%d %d", &h, &w);
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
scanf("%s", s[i][j]);
}
}
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (strcmp(s[i][j], "snuke"... | #include <iostream>
#include <algorithm>
using namespace std;
int min(int a,int b){
return a<b?a:b;
}
int main(void){
int a,b;
int ans = 0;
cin >> a >> b;
if(a > b){
int tmp = a;
a = b;
b = tmp;
}
for(int i=1;i<=b;i++){
ans = ans * 10 + a;
}
cout << an... | 0 | 99,274,490 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include <bits/stdc++.h>
using namespace std;
class unionfind {
vector<int> par;
public:
unionfind(int n) {
for (int i = 0; i < n; i++) {
par.push_back(i);
}
}
int find(int n) {
if (n == par.at(n)) return n;
return par.at(n) = find(par.at(n));
}
void merge(int m, int n) {
m = find(... | 0 | 8,004,911 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | #include <iostream>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int n;
pair<int,int> ps[100005];
bool cmp(const pair<int,int>&a,const pair<int,int>&b)
{
return a.first > b.first;
}
int main()
{
set<int> ss;
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&ps[i].first);
... | 0 | 65,344,423 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define ALL(a) a.begin(),a.end()
#define INIT(a,b) memset(a,b,sizeof(a))
using lint = long long int;
int main() {
int N, Q;
cin >> N >> Q;
dsu uf(N);
for_(i,0,Q) {
... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string ans = "No";
for(int i = 0; 4 * i <= n; i++) {
for(int j = 0;... | 0 | 65,723,277 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long H,W;
cin>>H>>W;
long ans=1234567890;
for(long i=0;i<H;i++){
long h1= i;
long h2 = (H-i)/2;
long h3 = H-h1-h2;
long s1 = h1*W;
long s2 = h2*W;
long s3 = h3*W;
long m=min(s1,min(s2,s3));
long M=max(s1,max(s2,s3));
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#defin... | 0 | 87,409,904 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a[n+1];
int b[n+1];
int cnt = 0;
rep(i, n)
{
cin >> a[i];
}
rep(i , n)
{
if(a[a[i]] == i)
cnt++;
}
cout << cnt / 2 << endl;
return (0);
} | 0 | 8,760,294 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class Card {
public:
uint8_t suit;
int32_t num;
Card() {
suit = 'S';
num = 1;
}
Card(string str) {
suit = str[0];
num = str[1] - 48;
}
};
bool operator< (const Card &c1, const Card &c2) {... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s; cin >> s;
for(int bit=0; bit<(1<<3); bit++){
string str = "";
str += s[0];
int cnt = s[0] - '0';
if(bit & (1<<0)){
cnt += s[1] - '0';
str += "+";
}else{
... | 0 | 89,239,820 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
type... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
long long res = 0;
int former = -1;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i == 0) {
former = a;
}
else {
if (former > a) {
res += form... | 0 | 76,001,494 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
char c[2][3];
rep(i, 2) rep(j, 3) cin >> c[i][j];
if (c[0][0] == c[1][2] && c[0][1] == c[1][1] && c[0][2] == c[1][0])
cout << "YES" << endl;
else
cout << "NO" << endl;
return ... | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | 0 | 67,480,702 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
ll s;
cin >> s;
ll x1, y1, x2, y2;
x1 =... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<queue>
#define _USE_MATH_DEFINES
#include<math.h>
#include<cmath>
#include<ctime>
#include<map>
#include<typeinfo>
#define R(i, n) for(int i = 0;i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)... | 0 | 47,750,579 |
#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... | #include <iostream>
#include "algorithm"
using namespace std;
int main() {
int n;
cin >> n;
int R[n];
int i = 0;
int c = 0;
int temp, min;
for (int i = 0; i < n; i++){
cin >> R[i];
}
for (int i = 0; i<n; i++){
min = i;
for (int j = i; j<n; j++){
if... | 0 | 4,688,332 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
switch (s[0])
{
case 'A':
putchar('T');
break;
case 'C':
putchar('G');
break;
case 'G':
putchar('C');
break;
case 'T':
... | 0 | 2,920,048 |
#ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vecto... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 76,832,138 |
#include<stdio.h>
#include<string.h>
#define N 100000000
char c[14];
int x[N];
int n;
int a(void);
int b(char);
void insert(void);
int find(void);
int main(){
char str[7];
int i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%s",str,c);
if(str[0]=='i'){
insert();
}
else if(str[0]=='f'){
if(find())... | #include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include... | 0 | 35,388,498 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,c,k;
cin >> n >> c >> k;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
ll ans=1;
int f=0;
for(int i = 1; i < n; i++) {
if(a[i]>a[f]+k){
f=i;
... | #include<stdio.h>
#include<string.h>
using namespace std;
#define M 1046527
#define L 14
#define NIL (-1)
char h[M][L],s[L],com[9];
int getchar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
return 0;
}
long long getkey(char str[]){
... | 0 | 12,084,194 |
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const int INF=1000000... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 92,933,841 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> cnt(10, 0);
for (int i = 0; i < 4; i++) {
int N; cin >> N;
cnt.at(N)++;
}
if (cnt.at(1) > 0 && cnt.at(9) > 0 && cnt.at(7) > 0 && cnt.at(4) > 0) {
cout << "YES" << endl;
}
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | 0 | 5,784,131 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int ans=1;
map<int,int> mp;
int... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
template <typename A, typename B>
s... | 0 | 39,824,120 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
int b=0;
for(int i=0;i<n;i++){
cin>>a.at(i);
b=max(b,a.at(i));
}
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(a.at(i)==b){
c++;
}
else{
d=max(d,a.at(i));
}
}
for(int i=0;i... | #include<bits/stdc++.h>
using namespace std;
int n,m,v,p,u,ans;
long long g,a[200005],sy,d,s[200005];
int main()
{
scanf("%d%d%d%d",&n,&m,&v,&p);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+n+1);
g=a[n-p+1];
for (int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
ans=p;
for (int i=1;i<=n-p;i++)
{
if (g>a[i]+... | 0 | 19,794,659 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n, r;
cin >> n >> r;
cout << r + 100 * (10 - min(n, 10));
}
int main()
{
fastio;
... | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define ull unsigned long long int
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define MOD 1000000007
#define MAXN 200005
using namespace std... | 0 | 25,647,146 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int res = INT_MAX;
for (int i = 0; i + 2 < (int)S.size(); i++)
{
int x = stoi(S.substr(i, 3));
res = min(res, abs(x - 753));
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pb push_back
using namespace std;
int main()
{
ll t,tp,mx=0,c=0,n,i,j,k;
cin >> n;
vl v(n+1,0);
for(i=1;i<=n;i++)
cin >> v[i];
set<ll> s;
s.insert(1);c=0;
i=1;
while(true)
... | 0 | 48,569,364 |
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int w,h,x,y,r;
w=h=x=y=r=0;
cin >> w;
cin >> h;
cin >> x;
cin >> y;
cin >> r;
if ((x-r >= 0) && (y-r >= 0) && (x+r <= w) &&(y+r <= h)) {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[201],s=0;
cin>>n;
for(int i=1;i<=2*n;i++) cin>>a[i];
sort(a+1,a+2*n+1);
for(int i=1;i<2*n;i+=2) s+=a[i];
cout<<s<<endl;
} | 0 | 84,032,785 |
#include <cstdio>
#define loop_input(fmt,...) while(~scanf(fmt,__VA_ARGS__))
int main() {
int a, b;
loop_input("%d%d", &a, &b) {
if (a == 0 && b == 0) break;
if (a > b) a ^= b ^= a ^= b;
printf("%d %d\n", a, b);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 24,615,118 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
string S, T;
int sn, tn;
vector<string> w;
void input() {
cin >> S >> T;
}
void solve(int i) {
string s = "";
rep(j, i) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
vector<vector<int>> v(4,vector<int>(4));
vector<vector<bool>> bin(4,vector<bool>(4,false));
for(int i=1; i<=3; i++)
for(int j=1; j<=3; j++)
cin >> v[i][j];
int n;... | 0 | 56,656,165 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
vector<int> a;
for (int i = 0; i < 3;i++)
{
int t;
cin >> t;
a.push_back(t);
}
vector<int>b;
b = a;
sort(a.begin(),a.end());
if (b == a && (a[0] != a[1] && a[1] != a[2]))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 16,314,180 |
#include <iostream>
using namespace std;
int main(){
int min,max,n,i;
int *data;
long sum;
cin>>n;
data= new int[n];
for (i=0;i<n;i++)cin>>data[i];
min=data[0];max=data[0];sum=data[0];
for (i=1;i<n;i++){
sum+=data[i];
if (min>data[i])min=data[i];
else if (max<data[i])ma... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nn cout << "\n";
ll dp[100000],ht[100000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t,a,b,i,j,c,d,e,f,n,k,m,w;
memset(dp,0,sizeof(dp));
cin... | 0 | 90,620,486 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[]={"SUN","MON","TUE","WED","THU","FRI","SAT"};
int main() {
int a,b,c;
while(cin>>a>>b>>c){
map<int,int>m;
m[a]++;
m[b]++;
m[c]++;
map<int,... | 0 | 52,023,044 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll calc(ll a){
if(a == -1) return 0;
if(a == 0) return 0;
if(a == 1) return 1;
if(a%2==0){
if((a / 2) % 2 == 0) return a^0;
else return a^1;
}els... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 88,276,666 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ITER(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int)((a).size())
... | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#defi... | 0 | 38,386,414 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100005;
int n,id[N];
LL d[N],size[N];
vector <int> e[N];
map <LL,int> Map,My;
int depth[N];
void dfs(int x,int d){
depth[x]=d;
for (auto y : e[x])
dfs(y,d+1);
}
bool check(int x,LL v){
if (v!=d[x])
return 0;
for (auto y : e[x])
if... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 79,618,506 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.