code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
printf("%d %d %lf\n", a / b, a % b, static_cast<double>(a) / b);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
using namespace std;
#define LL long long
#define LD long double
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pii pair<int,int>
#define pli pair<LL,in... | 0 | 21,525,646 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n, l, t;
ll p = 1;
cin >> n >> l >> t;
int pla[100100];
for(int i = 1; i <= n; i++) {
int x , w;
cin >> x >> w;
... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | 0 | 51,945,127 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double x1,x2,y1,y2,d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt(pow(x1-x2, 2) + pow(y1-y2, 2));
printf("%lf\n", d);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using VP = vector<P>;
#define rep(i, ss, ee) for (int i = (ss); i < (ee); ++i)
VP f(ll N) {
VP v;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll exp = 0;
while (N % a == 0) {
++exp;
N ... | 0 | 61,581,494 |
#include <bits/stdc++.h>
using namespace std;
bool isValid(int value, int a, int b){
int sum = 0;
while(value>0){
sum+=value%10;
value/=10;
}
if( (sum>=a) &&
(sum<=b)){
return true;
}else{
return false;
}
}
int main(){
int n,a,b;
cin >> n >> a ... | #include <bits/stdc++.h>
using namespace std;
char buf[100];
const char *data[10];
int main() {
data[0] = "";
data[1] = ".,!? ";
data[2] = "abc";
data[3] = "def";
data[4] = "ghi";
data[5] = "jkl";
data[6] = "mno";
data[7] = "pqrs";
data[8] = "tuv";
data[9] = "wxyz";
int t;
scanf("%d", &t);
whi... | 0 | 92,599,494 |
#include <bits/stdc++.h>
using namespace std;
#define fastio {\
ios::sync_with_stdio(0);\
cin.tie(0);\
}
#define file {\
freopen("io\\in.txt", "r", stdin);\
freopen("io\\out.txt", "w", stdout);\
freopen("io\\err.txt", "w", stderr);\
}
#ifdef LOCAL
#define debug(args...) {\
string _s(#args);\
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int maxn = 2000005;
void solve() {
ll n;
... | 0 | 9,974,704 |
#include<iostream>
int main(){
int n;
std::cin>>n;
int A[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
A[i][j]=0;
}
}
int tmp,s,e;
for(int i=0;i<n;i++){
std::cin>>s;
std::cin>>tmp;
for(int j=0;j<tmp;j++){
std::cin>>e;
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int H,W,T;
string s[10];
int main(){
int N,M;
cin>>N>>M;
vector<int> A(M);
for(int i(0);i<M;i++){
cin>>A[i];
}
sort(A.rbegin(),A.rend());
int num[10] = {0,2,5,5,4,5,6,3,... | 0 | 33,874,003 |
#include <bits/stdc++.h>
using namespace std;
vector<int> F, T;
string s;
int x, y;
set<int> dp[2];
int main(){
cin >> s >> x >> y;
s += 'T';
int cur = 0;
bool dir = 0;
bool firstturn = 1;
for(auto i : s){
if(i == 'T'){
if(firstturn){
dp[0].insert(cur);
firstturn = false;
}
else if(cur == 0)... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 25,083,682 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll n;
cin >> n;
ll res=0;
for(ll i=1;i*i<n;i++){
ll ans=(n-i)/i;
if((n-i)%i==0&&ans>i) res+=ans;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | 0 | 53,710,306 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 12,805,472 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<int... | #include <iostream>
#include <string>
const int SURFACE_NUM = 6;
enum Direction{TOP, SOUTH, EAST, WEST, NORTH, BOTTOM};
class Dice{
public:
void roll(char op);
int top(){
return label_value[label_dir[TOP]];
}
Dice(int label_value[SURFACE_NUM]);
int getright(int top, int front);
void rese... | 0 | 53,049,559 |
#include<bits/stdc++.h>
using namespace std;
int a[500005];
int main(){
int n;
long long ans=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<=n;i++){
ans+=a[i*2-1];
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Bsort(a) sort(a.begin(), a.end(), greater<ll>())
#define Pi acos(-... | 0 | 29,109,275 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = max(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 0 | 97,005,825 |
#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 main() {
int A,B; cin >> A >> B;
int ans... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main()
{
#ifdef WIN32
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int h, w, m;
cin >> h >> w >> m;
int x, y;
int row[h + 1], col[w + 1];
memset(row, 0, sizeof(row));... | 0 | 81,775,220 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | #include<iostream>
using namespace std;
int main(){
int a;
int b;
int c;
int c2 = 1;
int c3;
int count = 0;
cin >> a >> b >> c;
while(c2 <= c){
c3 = c % c2;
if(c3 == 0){
if((a <= c2) && (c2 <= b)){
count ++;
}
}
c2 +... | 0 | 50,276,538 |
#include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << ... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 0 | 35,858,659 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 84,832,321 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int i = 0; i < n; i++)
#include<algorithm>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
vec[i] -= i+1;
}
sort(vec.begin(),vec.end());
int index = N/... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int main() {
char b;
cin >> b;
char ans;
if(b == 'A') {
ans = 'T';
}
if(b == 'T') {
ans = 'A';
}
if(b == 'G') {
ans = 'C';
}
if(b == 'C') {
... | 0 | 31,211,296 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
vector<int> X(5);
rep(i, 5) cin >> X.at(i);
int sum = 0;
rep(i, 5) {
sum += (X.at(i) % 10 == 0) ? X.at(i) : (X.at... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int mod = 1e6;
vector<vii> adjlist;
main(){
int n,m;
cin>>n>>m;
int a,b;
adjlist.assign(n+1,vii());
while(m--){
cin>>a>>b;
adjlist[a].push_back(ii(b,1));
... | 0 | 35,212,115 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
vector<int> a(n);
REP(i,n) cin >> a[i];
int sum = 0;
REP(i,n) sum += a[i];
s... | #include <iostream>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
while(!(h == 0 && w == 0)){
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if((i == 0 || i == h - 1) || (j == 0 || j == w - 1)){
cout << "#";
}else{
... | 0 | 62,949,414 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<limits>
using namespace std;
template<typename T>
class MaxHeap{
public:
vector<T> a;
const T INF;
MaxHeap(int n):INF(numeric_limits<T>::max()/2){a.resize(n+1, INF);}
MaxHeap():INF(numeric_limits<T>::max()/2){a.resize(1,INF);}
T find... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> pos(n);
rep(i,n){
ll p;
cin >> p;
--p;
pos.at(p) = i;
}
ll ans = 0;
... | 0 | 90,722,329 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmat... | #include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>
#include<utility>
#include<cctype>
#include<climits>
#include<map>
#include<queue>
#include<functional>
#include<stack>
#include<iomanip>
#include<sstream>
#include<bitset>
using namespace std;
#define REP(i,a,n) for(i... | 0 | 57,102,594 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M,R; cin >> N >> M >> R;
ll G[N][N];
vector<int> RL(R);
r... | 0 | 65,877,262 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <functional>
#include <string.h>
#include <cmath>
using namespace std;
const int MAXN = 15;
int d[MAXN][MAXN];
int M, N;
bool read()
{
scanf("%d", &M);
if(M==0) return false;
for(int i=0; i<=10... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<int> T(3);
cin >> N >> T[0] >> T[1] >> T[2];
vector<int> L(N);
for(int i=0; i<N; i++) cin >> L[i];
vector<int> Ltemp(4);
int result=1e9;
for(int i=0; i<(1<<(2*N)); i++){
int mp=0;
for(int l=0; l<4; l++){
Ltemp[l]=0;
... | 0 | 98,033,941 |
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
int main() {
fast();
priority_queue<int> pq;
int n,m;
cin>>... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <map>
#define N 5005
using namespace std;
typedef long long ll;
const ll mod = 1000000007LL;
int n, k;
int a[N];
ll dp[N][N];
int main() {
cin>>n>>k;
for (int i = 0; i < n; ++i) {
cin>>a[i];
}
memset(dp, 0, si... | 0 | 5,253,815 |
#include <iostream>
#include <vector>
int linear_random(int A, int B, int C, int x);
int main(int argc, char const* argv[])
{
while (true) {
int N, A, B, C, X;
std::cin >> N >> A >> B >> C >> X;
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0)
break;
std::vector<int> reels(N);
for (int i ... | #include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(... | 0 | 14,815,247 |
#include <stdio.h>
#include <stdlib.h>
int min(int a, int b ){
if (a > b) {
return b;
} else {
return a;
}
}
int main(void) {
int n,a[1000],ans;
scanf("%d",&n );
while(n){
ans = 1000000;
for (int i = 0; i < n; i++) {
scanf("%d",&a[i] );
}
for (int i = 0; i < n; i++) {
for... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | 0 | 39,191,002 |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break;
else gcdmax%=gc... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
vector<int> e;
void prime_factor(int num)
{
... | 0 | 77,769,566 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const LL L... | 0 | 76,889,420 |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int leftCount = 0;
int rightCount = 0;
int count = 0;
for(int i = 0; i < n; ++i) {
if(count == 0 && s[i] == ')')
leftCount++;... | #include <bits/stdc++.h>
using namespace std;
const int N = 50000;
const int INF = 1e8;
const int M = 20;
int main(){
int n,m;
cin >> n >> m;
vector<int> v(m);
int dp[M+1][N+1];
for(auto &t: v){
cin >> t;
}
for(int i=0;i<=M;i++){
for(int j=0;j<=N;j++){
dp[i][j]=(j... | 0 | 16,198,530 |
#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 pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... | 0 | 96,130,538 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define mod 998244353
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> vec(n, 0);
ll max = 0;
for(ll i=0; i<n; i++){
ll num;
cin >> num;
if(max < num) max = num;
if(i == 0 && num != 0){
cout << 0 << e... | 0 | 77,193,586 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define sd(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define pd(n) printf("%d",n)
#define pl(n) printf("%lld",n)
#define psp printf(" ")
#define endc printf("\n")
using namespace std;
typedef l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int input;
vector<int> A(4);
cin >> input;
A.at(0) = input/1000; input -= A.at(0)*1000;
A.at(1) = input/100; input -= A.at(1)*100;
A.at(2) = input/10; input -= A.at(2)*10;
A.at(3) = input;
for (int i = 0; i < (1 << 3); i ++) {
bitset<3> tmp(... | 0 | 90,223,316 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n;
long long int a,b,a1,b1,t;
bool flag1=true,flag2=false;
cin>>n;
long long int x[n],y[n],k[n];
int a2[32],b2[32];
vector<long long int> v;
for(int i=0;i<n;i++){
cin>>... | #include <iostream>
using namespace std;
int check(int a, int b, int c);
int main(){
int N = 0;
int A, B, C;
int i, j, k;
int work;
cin >> N;
for(i = 0; i < N; i++){
cin >> A >> B >> C;
if(check(A, B, C)){
cout << "YES\n";
}
else{
cout << "NO\n";
}
}
return 0;
}
int check(int a, int b... | 0 | 35,167,539 |
#include <bits/stdc++.h>
#define fori(x,y) for(int i=x;i<y;i++)
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("D_IN.txt","r",stdin);
freopen("D_Out.txt","w",stdout);
#endif
vector<string> v;
int n,k;
cin>>n>>k;
fori(0,n)
{
string s;
cin>>s;
v.push_back(s);
}
sort(v.begin(),v.end());... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for(int i=0; i<n; i++) cin >> a.at(i);
for(int i=0; i<m; i++) cin >> b.at(i);
bool judge=false;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i+m-1>=n || j+m-1>=n) continue;
bool match=true;... | 0 | 72,200,028 |
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;
int main(){
int N;
cin >> N;
for(int i = 0; i <= 25; i++){
int nokori = N - (4 * i);
if(nokori >= 0 && nokori % 7 == 0){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" ... | #include<bits/stdc++.h>
using namespace std ;
bool dfs(int i , int j , vector<vector<char>> s, int H , int W){
if(i <= H-2 && s.at(i+1).at(j) == '#') return true ;
else if(i >= 1 && s.at(i-1).at(j) == '#') return true ;
else if(j <= W-2 && s.at(i).at(j+1) == '#' ) return true;
else if(j >= 1 && s.at(i).at(j-... | 0 | 91,039,123 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
printf ("%lf", sqrt( pow(x2 - x1, 2) + pow(y2 - y1, 2) ) );
return 0;
} | #include <iostream>
#include <vector>
int main(){
using namespace std;
int m,f,r,i;
char a;
vector<char> v;
while(1){
cin >> m >> f >> r;
if(m==-1&&f==-1&&r==-1){
break;
}else if(m==-1||f==-1){
a = 'F';
}else if(m+f>=80){
a ='A';
... | 0 | 23,079,349 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #include<iostream>
using namespace std;
int pow(int m,int n){
int ret=1;
for(int i=0;i<n;i++)ret*=m;
return ret;
}
int main(){
int N,flag=0;
cin >> N;
for(int i=0;i<4;i++){
if (N/pow(10,2-i)==7)flag++;
N -= N/pow(10,2-i)*pow(10,2-i);
}
if (flag !=0){
... | 0 | 41,651,681 |
#include <bits/stdc++.h>
using namespace std;
int h,w,m;
int a,b;
map<pair<int,int> ,bool> mp;
int x[300010],y[300010];
vector<int> v;
vector<int> t;
int mx=0,mx2=0;
int main(){
cin>>h>>w>>m;
for(int i=0;i<m;i++){
cin>>a>>b;
x[a]++;
y[b]++;
mp[make_pair(a,b)]=1;
mx=max(mx,x[a]);
mx2=max(mx2,y[b]);
}
for... | #include<iostream>
using namespace std;
const int size=1e5+5;
const int level = 60;
typedef long long int ll;
ll basis[level];
void add(ll mask)
{
for(int i=level-1;i>=0;i--)
{
if(((mask>>i)&1) == 0)
continue;
if(!basis[i])
{
basis[i] = mask;
return;
... | 0 | 57,938,092 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, a;
cin >> N;
ll ans = 0, h = 0;
for ( int i = 0; i < N; i++ ) {
cin >> a;
if ( a < h+1 ) continue;
if ( a == h+1 ) {
h++;
continue;
}
ans += (a-1) / (h+1... | #include <bits/stdc++.h>
using namespace std;
vector<string> v_input(int L) {
vector<string> v(L);
for (int i = 0; i < L; i++) {
cin >> v.at(i);
}
return v;
}
int main() {
int N, M;
cin >> N;
vector<string> S = v_input(N);
cin >> M;
vector<string> T = v_input(M);
int Max = 0;
for (int i = 0; i... | 0 | 85,285,370 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a, b;
int main() {
scanf("%lld%lld%lld", &n, &a, &b);
if((n == 1 && a != b) || a > b) printf("0\n");
else if(a == b) printf("1\n");
else printf("%lld\n", ((n - 1) * b + a) - ((n - 1) * a + b) + 1);
} | #include <iostream>
using namespace std;
const int UP=0;
const int FLONT=1;
const int RIGHT=2;
const int LEFT=3;
const int BACK=4;
const int DOWN=5;
class Dice{
public:
Dice();~Dice();
int num[6];
void set_num(int n,int i);
void spin(char c);
int get_num(int n);
};
Dice::Dice(){}
Dice::~Dice(){}
void Dice::s... | 0 | 47,242,562 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long>T(N);
for (int i = 0; i < N; i++) {
cin >> T.at(i);
}
if (N == 1){
cout << T.at(0) << endl;
return 0;
}
long long gcd;
long long lcm = T.at(0);
long long X = T.at(... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
ll mod = 1e9 + 7ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } r... | 0 | 67,569,767 |
#include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 89,173,824 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
vector<int> time;
cin>>N>>T;
for(int i = 0; i < N; i++){
int t;
cin>>t;
time.push_back(t);
}
int tot = 0;
int nex = 1;
if(N==1) tot = T;
for(int i = 0; i < N-1; i++){
if(time[i]+T >= tim... | 0 | 51,504,373 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, ... | 0 | 59,212,159 |
#include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define mod 1000000009
#define pi 2*acos(0)
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
using namespace std;
int main()
{
io;
ll int a, b; cin >> a >> b;
ll int gcd_ = gcd(a, b);
ll int pro = a * b;
ll int ans = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | 0 | 20,802,458 |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
typedef long long ll;
struct apple{
int col,val;
}a[3*maxn];
bool cmp(apple p,apple q){ return p.val>q.val; }
int main()
{
int x,y,A,B,C;
scanf("%d%d%d%d%d",&x,&y,&A,&B,&C);
for(int i=1;i<=A+B+C;i++){
scanf("%d",&a[i].val);
if(i<=A) a[i].col=1;... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int64_t, int64_t>;
vector<int64_t> graph[100001];
bool visited[100001];
P dfs(int64_t v) {
visited[v] = true;
int64_t sum = 0;
int64_... | 0 | 11,819,231 |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
void debug() { cerr << "\n"; }
t... | 0 | 46,984,919 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (a).size()
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define ford(i,n) for(int i=n;i>=0;i--)
#define REP(i,a,n) for(int i=a;i<n;i+... | #include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define num(a) a-'0'
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<#x<<":"<<x<<" "
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define vl v... | 0 | 7,304,895 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <cstdlib>
#define mp make_pair
#define pb push_back
#define mem(i,a) memset(i,a,sizeof(i))
using namespace std;
typedef long long ll;
typedef unsign... | 0 | 56,856,347 |
#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() {
string s, t;
cin >> s >> t;
string ta = t.substr(0, s.size());
if (s == ta) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | 0 | 68,489,992 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string sentence;
int alphabetCount[26] = {};
do {
getline(cin, sentence);
for (unsigned int i = 0; i < sentence.length(); i++) {
if (sentence[i] >= 0x41 && sentence[i] <= 0x5A) {
alphabetCoun... | #include <iostream>
int main() {
int n;
std::string s, t;
std::cin >> n >> s >> t;
for (int i = 0; i <= n; i++) {
int j = 0;
for (j = 0; j < n - i; j++) {
if (s[j+i] != t[j]) {
break;
}
}
if (j >= n - i) {
std::cout << (... | 0 | 71,420,919 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s; cin>>s;
ll ans=0;... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair... | 0 | 7,283,572 |
#include <iostream>
int main()
{
int r, g;
std::cin >> r;
std::cin >> g;
std::cout << g*2 - r << std::endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<numeric>
#include<algorithm>
#include<tuple>
#include<cmath>
#include <iomanip>
typedef unsigned long long ull;
typedef long long ll;
ll DENOM = 1000000000LL + 7LL;
using namespace s... | 0 | 1,525,928 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
queue<int> que;
void bfs(vector<vector<int> > &G, int s, int *seen) {
seen[s] = 0;
que.push(s);
while (!que.empty()) {
int u = que.front();
que.pop();
for (int i = 0; i < G[u].size(); i++) {
int v... | #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 | 93,551,942 |
#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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i... | 0 | 38,069,731 |
#include <iostream>
#include <cstdio>
#include <deque>
#define int long long
using namespace std;
bool vis[100005];
signed main() {
int n; cin >> n;
deque<pair<int, int> > q; q.push_front(make_pair(1, 1));
while (!q.empty()) {
pair<int, int> p = q.front(); q.pop_front();
if (vis[p.first]) continue; vis[p.first] ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, inc, dec;
scanf("%d %d %d", &n, &inc, &dec);
if(inc>n || dec>n){
printf("-1\n");
return 0;
}
bool swapped=false;
if(inc<dec)
{
swap(inc,dec);
swapped=true;
}
vector<int> v;
for(int i... | 0 | 49,373,866 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <climits>
int main(){
long N,K;
std::cin >> N >> K;
long sum=0;
long plus=1;
long MOD=1000000000+7;
for(long i=0; i<=N+1; i++){
if(K<=i){
... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<pair<int, int>>> vt;
int de[100010],indegree[100010];
int visited[100010],update;
void dfs(int here, int par) {
visited[here] = 1;
for (int i = 0; i < vt[here].size(); i++)
{
int next = vt[here][i].first;
int ncst = vt[here]... | 0 | 23,472,009 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
string ans = "ARC";
if (n < 1200) ans = "ABC";
cout << ans << endl;
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(long long *x,long long *y){
long long tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
long long gcd(long... | 0 | 26,035,185 |
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b,c;
string s,t;
cin>>s>>t;
if(s==t) cout<<"=\n";
else if(s>t) cout<<">\n";
else cout<<"<\n";
return(0);
} | #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 rap(p,a,b) for(ll p=a ; p<=b ; p++)
#define per(p,a,b) for(ll p=a ; p>=b ; p--)
#define F first
#define S se... | 0 | 39,523,567 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
int C = A * B % 2;
if (C == 1) {
cout << "Odd" <<endl;
}
else {
cout << "Even" << endl;
}
} | #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 | 62,978,634 |
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
const string K = "keyence";
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
string s;
cin >> s;
... | #include <utility>
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MAX 100005
#define NIL -1
typedef long long ll;
using namespace std;
struct TreeNode { int p... | 0 | 52,440,438 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp12 make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,in... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#include <bitset>
#pragma warning(disable:4996)
typedef long long ... | 0 | 44,661,247 |
#include<iostream>
#include<cstdio>
#define LL long long
#define N 100010
using namespace std;
int main(){
int n;LL d,c;
LL sum=0,ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld%lld",&d,&c);
sum+=d*c;
ans+=c;
}
ans+=sum/9-1;
if(sum%9==0) ans--;
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 0 | 77,898,980 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | #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>;
static const long long INF = 100000000;
int main(){
int n,k;
cin >> n >> k;
vector<long long> monster(n);
rep(i,n){
cin >> monster[i];
}
sort(monste... | 0 | 5,372,629 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, co... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2+5;
int n , k;
bool yes[N];
int main(){
scanf("%d%d" , &n , &k);
for(int i = 1; i <= k; i++){
int d;
scanf("%d" , &d);
for(int j = 1; j <= d; j++){
int x;
scanf("%d" , &x);
yes[x] = 1;
... | 0 | 14,255,477 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K, std::vector<long long> V)
{
vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(N + 1, vector<ll>(N + 1)));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (i + j >= K ||... | #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 | 97,637,409 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s, w;
cin >> s >> w;
if (w>=s){std::cout << "unsafe" << std::endl;}
else{std::cout << "safe" << std::endl;}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 19,281,690 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int64_t ans = 0;
vector<int> a(n);
for(int i=0; i<n; i++) {
cin >> a[i];
if(i>=1) {
ans += max(0, a[i-1]-a[i]);
if(a[i-1]-a[i]>0) a[i] = a[i-1];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int64_t i = 0; i < (int64_t)(n); i++)
int64_t myadd(int64_t a, int64_t b) {
int64_t a_ = a % 1000000007;
int64_t b_ = b % 1000000007;
return ( a_ + b_ ) % 1000000007;
}
int64_t myprod(int64_t a, int64_t b) {
int64_t a_ = a % 1000000007;
int64_... | 0 | 39,933,626 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll a,b;
cin >> a >> b;
if(a==b+1){
ll ans=a^b;
cout << ans << endl;
return 0;
}
if(a==b){
cout << a << endl;
return 0;
}
ll ans;
if(a%2==0){
ll cnt=0;
if(b%2==0){
ll tmp=b-a;
cnt=tmp/2;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+5][3];
for(int i=0; i<n; i++)
cin>>a[i][0]>>a[i][1]>>a[i][2];
int dp[n+5][3];
dp[0][0]=a[0][0];
dp[0][1]=a[0][1];
dp[0][2]=a[0][2];
for(int i=1; i<n; i++)
{
dp[i... | 0 | 90,953,185 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647;
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a,a+3);
if(a[0] == a[1])cout << a[2] << endl;
e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | 0 | 53,011,396 |
#include<iostream>
using namespace std;
int main(){
int n,b,f,r,v,aT[3][10],bT[3][10],cT[3][10],dT[3][10];
cin>>n;
for(int i=0;i<3;i++){
for(int j=0;j<10;j++){
aT[i][j]=0;
bT[i][j]=0;
cT[i][j]=0;
dT[i][j]=0;
}
}
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
switch(b){
case 1:aT[f-1][r-1]+=v; break;... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 63,752,417 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
char a,b;
cin >> a >> b;
char c = 'H' + 'D';
if (a == 'H')
{
cout << b << endl;
}
else
{
cout << char(c - b) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
void solve() {
int N; cin >> N;
vector<pair<int, int>> red(N), blue(N);
for (int i = 0; i < N; i++) {
int a, b; cin >> a >> b;
red[i] = make_pair(a, b);
}
for (int i = 0; i < N; i++) {
int c, d; cin >> c >> d;
blue[i] = ma... | 0 | 41,210,936 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y,ans=0;
cin>>n>>x>>y;
while(n--)
{
int X,Y;
cin>>X>>Y;
if(X>=x&&Y>=y)ans++;
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout << "Yes\n";
else cout << "No\n";
}
void abc_151a()
{
char C;
cin >> C... | 0 | 65,062,247 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vecto... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
bool bet(int i , int a ,int b)
{
int sum =0;
while(i)... | 0 | 98,558,800 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long s, flag = 0, ans = 0;
cin >> s;
long tmp = s;
vector<int> item(1000000);
item.at(0) = tmp;
for (int i = 1; i < 1000000; i++) {
if (tmp%2 == 0) tmp = tmp / 2;
else tmp = 3 * tmp + 1;
item.at(i) = tmp;
for (int j = 0; j < i; j++) ... | #include<iostream>
using namespace std;
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
int x[N];
for (int i = 0; i < N; i++) {
cin >> x[i];
}
int y[M];
for (int i = 0; i < M; i++) {
cin >> y[i];
}
for (int i = X + 1; i <= Y; i++) {
bool willStartWar = false... | 0 | 48,709,849 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#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())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, X;
cin >> N >> M >> X;
vector<int> cost(N);
vector<vector<int>> books(N);
for (int i = 0; i < N; i++) {
cin >> cost[i];
for (int j = 0; j < M; j++) {
int a;
cin >> a;
books[i]... | 0 | 37,169,127 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int,int>;
struct trio{
int first;
int second;
int third;
};
int main(){
int n;
cin >> n;
vector<int> norm(n);
rep(i,n){
norm[i] = i + 1;
... | 0 | 77,202,930 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,x=1,cnt=0;
cin >> N;
vector<int>a(N);
for(int i=0; i<N; i++)
cin >> a.at(i);
while(x!=2){
x = a.at(x-1);
cnt++;
if(cnt>N){
cout << -1 << endl;
return 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int hoge(int n){
int sum = 0;
while (n) {
if (n % 2 == 0) {
sum++;
}
n /=2;
}
return sum;
}
int main()
{
int N;
cin >> N;
int ans = 0;
int sum = 0;
for (int i = 1; i <= N; i++) {
if (sum < hoge... | 0 | 80,979,907 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int i = 1, count = 0;
bool ispossible = false;
while (true) {
if (a[i-1] == 0) {
break;
} else if (i == 2) {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k,i,l;
string s;
cin>>k>>s;
l=s.size();
if(l<=k)
cout<<s<<endl;
else
{
for(i=0;i<k;i++)
{
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
} | 0 | 19,999,382 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int n , m;
cin >> n >> m;
vector<int> adj[n];
for (int i = 0 ;i < m ;i++) {
int k;
cin >> k;
while (k--) {
int s;
cin >> s;
adj[s... | 0 | 11,190,072 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a;
long double b;
cin >> a >> b;
int64_t ans = b*100+0.01;
a*=ans;
a/=100;
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T = 1;
while (T--) {
int n, m;
cin >> n >> m;
int a[n], tot = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
tot +=... | 0 | 80,355,160 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(),(v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int, int>> stu(n);
vector<pair<int, int>> vec(m);
rep(i, n... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n, m, ans = 0;
cin >> n >> m;
if(m < 2)cout << 0;
else{
if(m >= 2 * n){
ans += n;
m = m - n * 2;
if(m >= 4){
ans += m / 4;
}
cout << ans;
}else c... | 0 | 95,818,283 |
#include<iostream>
using namespace std;
int main() {
int H, W; cin >> H >> W;
string C[H];
for (int i = 0; i < H; i++) {
cin >> C[i];
}
for (int i = 0; i < H; i++) {
for (int j = 0 ; j < W; j++) {
cout << C[i][j];
}
cout << endl;
for (int j = 0 ; j... | #include <bits/stdc++.h>
using namespace std;
bool desc(int a,int b){
return a>b;
}
int main(){
int n;
cin>>n;
int a[n],b[n],d1=0,d2=0;
string aa,bb,df;
for(int i = 1 ; i <= n ; i++){
df+=i+'0';
}
for(int i = 0 ; i < n ; i++){
cin>>a[i]... | 0 | 28,632,895 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cctype>
#include <map>
#include <set>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int mai... | 0 | 88,799,233 |
#include "bits/stdc++.h"
#include<cassert>
#pragma warning(disable:4996)
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MRE assert(0)
const int mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int>PP;
vector<int>G[100006];
int dp[1000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,int> pdi;
typedef pair<double,double> pdd;
typedef pair<double,ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vec... | 0 | 10,052,607 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,sum = 0;
cin >> N;
vector<int> l(N),r(N);
rep(i,N) cin >> l[i] >> r[i];
rep(i,N) sum += (r[i] - l[i] + 1);
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 41,089,521 |
#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(){
ll n;
cin >> n;
ll ans... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 2,982,348 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000 + 7;
int X[MAX_N], Y[MAX_N];
int main() {
int N, c = 0;
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d%d", &X[i], &Y[i]);
if ((X[i] + Y[i]) & 1) c++;
else c--;
}
if (abs(c) != N) {
puts("-1");
return 0;
}
i... | 0 | 6,661,399 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string o, e;
cin >> o >> e;
for (int i=0; i<o.size(); i++){
cout << o[i];
if (i < e.size()) cout << e[i];
}
cout << endl;
return 0;
} | #include <iostream>
#include <limits>
#include <cfenv>
#include <cmath>
#include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <tuple>
#include <queue>
#include <vector>
#include <cmath>
#include <random>
#include <math.h>
#include <random>
#in... | 0 | 65,130,946 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<a/b<<" "<<a%b<<" ";
cout<<setiosflags(ios::fixed)<<setprecision(5)<<(double)(a)/b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int h,w;
vector <vector<char>> a;
vector <vector<long long>> dp;
const long long mod = pow(10,9)+7;
int main(){
cin >> h >> w;
a = vector<vector<char>>(h,vector<char>(w));
dp = vector<vector<long long>>(h,vector<long long>(w,0));
for(int i = 0; i < h; i++){... | 0 | 85,617,926 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main(){
ull a,b;
string s;
cin>>a>>s;
b=(s[0]-'0')*100+(s[2]-'0')*10+s[3]-'0';
cout<<a*b/100<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
ll sum1 = 0;
rep(i, n + 1) {
cin >> a[i];
sum1 += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n){
... | 0 | 55,229,678 |
#include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main()
{
ll n, p;
cin >> n >> p;
string s;
cin >> s;
if (p == 5 || p == 2)
{
ll cnt = 0;
for (ll j = 0; j < s.length(); j++)
{
auto num = s[j] - '0';
if (num % p == 0)
... | 0 | 67,335,744 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void out(deque<int> v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v.front() << " \n"[i == sz - 1];
v.pop_front();
}
}
int main() {
ll n,a,b;
cin >> n >> a >> b;
if (a * b < n) {
cout << -... | #include <bits/stdc++.h>
using namespace std;
int H, W;
vector<string> grid;
int dp[105][105];
const int inf = 1 << 30;
int main(void){
cin >> H >> W;
grid.resize(H);
for (int i=0; i<H; i++) cin >> grid[i];
for (int i=0; i<105; i++){
for (int j=0; j<105; j++){
dp[i][j] = inf;
... | 0 | 79,284,918 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 30,270,992 |
#include<bits/stdc++.h>
using namespace std;
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
int t;
cin >> t;
int ti = 0, xi = 0, yi = 0;
bool b = false;
while (t--) {
int ... | #include <iostream>
using namespace std;
int main(void){
int a;
int b;
int c;
cin>>a;
cin>>b;
cin>>c;
if(a>b){
swap(a,b);
}
if(b>c){
swap(b,c);
}
if(a>b){
swap(a,b);
}
cout<<a<<" "<<b<<" "<<c<<endl;
} | 0 | 32,928,948 |
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
char str[100][1000], mark[1000];
int i, j, turn, count;
for(i = 0; ; i++)
{
scanf("%s", str[i]);
if(strcmp(str[i], "-") == 0) break;
scanf("%d", &count);
for(j = 1; j <= count; j++)
{
scanf("%d", &turn);
strcpy(mark, &str[i][turn... | #include <stdio.h>
#include <iostream>
#include <vector>
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
int houses;
std::cin >> houses;
std::vector<int> vec(99);
for (int i = 0; i < houses; i++)
{
int houseLocation;
std::cin >> houseLocatio... | 0 | 1,481,092 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
int n;
cin>>n;
int x[n];
for(int i=0;i<n;i++)cin>>x[i];
int r[20][n];
int l;cin>>l;
int m=0;
for... | 0 | 25,042 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;
int main() {
for (int n; cin >> n && n;) {
int c = 0, d = 0, C = 0;
while (... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>> c(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c.at(i).at(j);
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout<<c.at(i).at(j);
if(j==w-1)
cout<<... | 0 | 80,266,543 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector... | #include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <queue>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <sstream>
typedef ... | 0 | 97,075,573 |
#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>
#define db double
#define ls rt << 1
#define rs rt << 1 | 1
#define pb push_back
#define ll long long
#define mp make_pair
#define pii pair<int, int>
#define X first
#define Y second
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define rep(i, x, y) for(int i = x; i ... | 0 | 68,525,828 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.