code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int , int > pii;
typedef pair<long , long> pll;
typedef pair<pii , int > piii;
typedef pair<pll , long > plll;
typedef vector<int> vi;
typedef vector<long> vl;
typedef vector <pii> vii;
typedef vector<pll> vll;
typedef long long ll;
typedef unsigned int ui;
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll n;
cin >> n;
vector<ll> a(n + 1);
REP(i, n + 1){
... | 0 | 19,435,395 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 69,127,026 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin... | #include <bits/stdc++.h>
using namespace std;
int F(long int A,long int B){
int da=0,db=0;
while(A!=0){
da ++;
A = A/10;
}
while(B!=0){
db ++;
B = B/10;
}
return max(da,db);
}
int main() {
long int N;
cin >> N;
int ans=F(1,N);
for(long int i=1;i<sq... | 0 | 73,089,005 |
#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--)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>; ... | 0 | 84,421,930 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include <bits/stdc++.h>
#define REP(i,n) for(LL i=0;i<(LL)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long
#define pii pair<LL,LL>
#define pll pair<LL,LL>
using namespace std;
int main(){
string s;cin>>s;
LL n=s.size();
LL isOdd[n+1];
fill_n(isOdd,n+1,0);
LL dp[n+1];
fill_n(dp... | 0 | 9,943,766 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'
#define st first
#define nd second
#define ins insert
#define pb push_back
#define mp make_pair
#define hashmap unordered_map
#define hashset unordered_set
signed main(){
int x, n; cin >> x >> n; hashset<int> s;
for (int i = 0; i < n; ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>... | 0 | 63,758,806 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostr... | #include <iostream>
#include <utility>
#include <cmath>
using namespace std;
int main() {
int n;
double x[5], y[5], ep;
pair<double, double> AB, CD;
cin >> n;
while(n--) {
for(int i = 1; i <= 4; i++) {
cin >> x[i] >> y[i];
}
AB.first = x[2] - x[1];
AB.second = y[2] - y[1];
CD.first =... | 0 | 98,528,145 |
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
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, ... | #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 | 72,971,993 |
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <utility>
#include <climits>
#include <vector>
#include <map>
#include <queue>
using namespace std;
#define ll long long
const int MOD = 1000000007;
const string SPACE = " ";
ll max(ll a, ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define MAX 2005
vector<vector<ll>> dp(MAX, vector<ll>(MAX, 0));
vector<vector<ll>> sm(MAX, vector<ll>(MAX, 0));
ll getVal(int i, int j){
if( i >= 0 && j >= 0 )
return sm[i][j];
return 0;
}
void updateVal(int i, i... | 0 | 98,939,268 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #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... | 0 | 89,427,642 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | 0 | 7,882,296 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(in... | 0 | 30,662,832 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int s;
cin >> s;
vector<int> vec;
vec.push_back(s);
int count = 1;
while(1){
count++;
if (s % 2 == 0) s /= 2;
else s = 3 * s + 1;
if (binary_search(vec.beg... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <iomanip>
#include <math.h>
#include <algorithm>
#define hmm "\n"
#define test() int t; cin>>t; while(t--)
#define ll long long int
#define ull unsigned long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vo... | 0 | 9,998,040 |
#include <bits/stdc++.h>
#include <string>
#include <cstdint>
#include <iterator>
#include <algorithm>
#include <fstream>
#include <unordered_map>
using namespace std;
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Int int_fast64_t
int main()
{
FAST_IO;
string s,t;
cin>>... | #include <string>
#include <iostream>
#define min(a, b) a > b ? b : a
using namespace std;
int main()
{
string s1, s2;
cin >> s1 >> s2;
int min_change = 1000;
for (int i = 0; i < s1.length() - s2.length() + 1; i++)
{
int cnt = 0;
for (int j = 0; j < s2.length(); j++)
{
... | 0 | 73,485,353 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
int main() {
ll X,Y; cin >>X >>Y;
cout <<(X%Y!=0 ? X:-1) <<endl;
return 0;
} | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
usi... | 0 | 52,193,790 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
struct edge{
ll to, cost;
};
ll n,m,r;
const ll INF = 1e18;
const int max_n = 1e4;
ll d[max_n][max_n];
int main(){
cin >> n >> m >> r;
vector<ll> v(r);
for(int i=0 ; i<r ; i++){
cin >> v[i];
v[i]--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
for ( int i = 0; i < n; i++){
for ( int j = 0; j < n; j++){
cin >> a[i][j];
}
}
for ( int i = 0; i < m; i++){
for ( int j = 0; j < m; j++){
... | 0 | 60,065,082 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll P[N];
for(ll i=0;i<N;i++){
cin >> P[i];
}
ll ans = 1;
ll now = P[0];
for(ll i=1;i<N;i++){
if(P[i]<now){
ans++;
now... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<map>
#include<cmath>
#define ll long long
#define INF 0x3f3f3f3f
#define maxn 1005
using namespace std;
int read()
{
int l=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch... | 0 | 89,880,491 |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long int lnt;
typedef pair<lnt,lnt> P;
const lnt INF = 0xffffffffffffff;
lnt d[10][10];
lnt x,y,z;
lnt used[1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 0 | 100,308,176 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<pair<int,int>>> data(n+1,vector<pair<int,int>>(0));
for (int i=1;i<=m;i++){
int p,y;
cin>>p>>y;
pair<int,int> tmp=make_pair(y,i);
data.at(p).push_back(tmp);
}
for (int i=1;i<=n;i++){
sort(data.at(... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
... | 0 | 93,149,716 |
#include <iostream>
#include <complex>
#include <cmath>
using namespace std;
typedef complex<double> xy_t;
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); }
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); }
xy_t projection(xy_t p, xy_t b) { return b * dot_product(p, b) / norm(b); }... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const ll INF=1e18;
int main(){
ll h,w;cin>>h>>w;
ll m=INF;
ll a,b,c;
for(ll i=0;i<h;i++){
a=w*i;
b=(w/2)*(h-i);
c=w*h-a-b;
m=min(m,max(max(a,b),c)... | 0 | 21,425,753 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vector<... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
void sol(){
string s ,t ; cin >> s >> t ;
int n = s.length() , m = t.length();
for(int i = n-m; i >=0 ; --i){
string a... | 0 | 84,554,795 |
#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() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if(a >= k) {
cout << k << endl;
return 0;
} else if(a + b >= k) {
cout << a << endl;
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
cout << setprecision(10);
long long H,W;
cin >> H >> W;
if(H%3 == 0 || W%3==0){
cout << 0 << endl;
return;
}
long long min_val = H*W;
long long S_max, S_min;
long long S1,S2,S3;
for(long long i = 1; i < W; i++){
S1 = H * i;
S... | 0 | 98,615,551 |
#include <bits/stdc++.h>
using namespace std;
class UnionFindDS{
private:
vector<int> p, h, sz;
int num;
public:
UnionFindDS(int N){
p.assign(N,0); for (int i=0; i<N; i++) p[i] = i;
h.assign(N,0); sz.assign(N,1);
num = N;
}
int numSets(){ return num; }
int findSet(int ... | #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 = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 0 | 74,379,062 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main()
{
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, 0, h) cin >> s[i];
if(h == 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define _READ freopen("input.txt", "r", stdin);
#define _FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
void solve()
{
int s,w;
cin>>s>>w;
if(w>=s)
cou... | 0 | 72,036,348 |
#include <bits/stdc++.h>
using namespace std;
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; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
typedef long long ll;... | 0 | 17,791,531 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, Q;
cin >> N >> Q;
dsu d(N);
for (int i = 0; i... | 0 | 37,957,826 |
#include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end())); }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ for(... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const... | 0 | 1,356,149 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
int A[N];
int F(int a,int b){
string x = to_string(a);
string y = to_string(b);
return max(x.length(),y.length());
}
int32_t ma... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace ... | 0 | 5,862,472 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stdlib.h>
#define ll long long
#define MOD_P 1000000007
#define PI 3.141592
using namespace std;
int main()
{
int x, a;
cin >> x >> a;
printf("%d", x < a ? 0 : 10);
return 0;
} | #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 dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | 0 | 19,370,481 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int A,B;
cin >> A >> B;
cout << A*B -(A+B-1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 57,590,657 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | 0 | 12,143,072 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, A, B, C;
cin>>x>>y>>A>>B>>C;
vector<ll> a(A), b(B), c(C);
for(int i = 0; i<A; i++) cin>>a[i];
for(int i = 0; i<B; i++) cin>>b[i];
for(int i = 0; i<C; i++) cin>>c[i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 7,038,417 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=1;i<=n;i++)
signed main(){
int n,m;
int x;
int mod=1e9+7;
cin>>n>>m;
int sx=0,sy=0;
rep(i,n)cin>>x,sx+=(i-1)*x-(n-i)*x,sx%=mod;
rep(i,m)cin>>x,sy+=(i-1)*x-(m-i)*x,sy%=mod;
cout<<(sx*sy)%mod<<endl;
return 0;
} | #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 n;
cin >> n;
vector<int> p(n),q(n);
rep(i,n) cin >> p[i];
rep(i,n) cin >> q[i];
vector<bool> p_check(n+1,true);
vector<bool> q_check(n+1,true);
int p_num = 0;
i... | 0 | 40,260,694 |
#include <bits/stdc++.h>
using namespace std;
bool canAdd(vector<vector<int>>& edge) {
using P = pair<int,int>;
priority_queue<P, vector<P>, greater<P>> q;
q.push(P(0, 0));
vector<int> dp(edge.size(), 1e9+7), work(edge.size(), -1);
while (q.size()) {
auto p = q.top();
q.pop();
auto cost = p.first;
auto now... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<vector<long long>> comb(int n, int r) {
vector<vector<long long>> v(n + 1,vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k <... | 0 | 21,485,179 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for(int i = ((int) a); i < ((int) b); i++)
#define rep(i, n) repl(i, 0, n)
int w, h;
char tile[20][20];
bool vis[20][20];
int dd[] = {-1, 0, 1, 0, -1};
bool range(int y, int x) {
return 0 <= y && y < h && 0 <= x && x < w;
}
int dfs(int y, int x) {
... | 0 | 4,722,338 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
int t = n;
int r = 0;
while(t > 0) {
r += t % 10;
t /= 10;
}
if (n % r == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
... | 0 | 32,341,926 |
#include <iostream>
#include <string>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
int main(void) {
string a, b, c;
cin >> a >> b >> c;
if (a[a.length() - 1] == b[0] && b[b.length() - 1] == c[0]) {
cout << "YES" << endl;
} else {
cout << "NO" << en... | #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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 83,090,943 |
#include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | #include <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(){
int n... | 0 | 48,829,171 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin >> a >> b;
if(a=='H'){
if(b=='H')cout << 'H';
else cout << 'D';
}else{
if(b=='H')cout << 'D';
else cout << 'H';
}
return 0;
} | 0 | 71,329,717 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
if(a == 1){
if(b == n){
for(int i = n; i >= 1; i--) cout << i << " "; cout << endl;
} else {
cout << -1 << endl;
}
} else if(b == 1) {
if(a == n){
for(int i = 1; i <= n; i++) cout << i << " "; cout << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 74,508,158 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
string t = "2019/04/30";
string ans = "_";
rep(i,n){
if(s[i] == t[i]) continue;
else if(s[i] > t[i]){
ans = "TBD";
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class dice {
public:
dice(int* a) {
set(a[0], a[1], a[2], a[3], a[4], a[5]);
}
dice(int& a, int& b, int& c, int& d, int &e, int& f) {
set(a, b, c, d, e, f);
}
void turn(int n) {
if (n < 4)
{
turndice(n);
return;
}
switch... | 0 | 48,417,309 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
typedef double ld;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 0 | 47,756,991 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,... | 0 | 54,100,943 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,long double> Pi;
typedef pair <long double,int> Pd;
#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... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
ll Q, H, S, D, N;
cin>>Q>>H>>S>>D>>N;
ll... | 0 | 77,731,380 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include<iostream>
using namespace std;
#define MAX_N 10000
int par[MAX_N];
int rank[MAX_N];
void init(int n){
for(int i = 0; i < n; i++){
par[i] = i;
rank[i] = 0;
}
}
int find(int x){
if(par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(x);
y =... | 0 | 21,406,989 |
#include <bits/stdc++.h>
#define rep(i , n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main (){
int n;
cin >> n;
for(int i = 0; i <= n; i += 4){
if((n - i) % 7 == 0){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;... | #pragma region header
#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++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 30,293,941 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, m, ans;
map<ll, ll> cnt;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
++cnt[0];
ll cur = 0;
for (int i = 0; i < n; ++i) {
ll a; cin >> a;
cur += a;
cur %= m;
ans += cnt[cur]++... | #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int a,b;
cin>>a>>b;
a--;
b--;
... | 0 | 74,969,700 |
#include <cstdio>
bool d[33554432];
char k[128];
int c(char str[12]){
int ans = str[0], i = 1;
for(i;str[i] != '\0';i++){ans <<= 2;ans += k[str[i]];}
return ans;
}
int main(){
k['A'] = 0;k['C'] = 1;k['G'] = 2;k['T'] = 3;
int n;scanf("%d", &n);
char s[7], str[12];
while(n--){
scanf("%s %s", s, str);
if(s[0] =... | #include "bits/stdc++.h"
using namespace std;
#define long int64_t
struct Solver {
void solve() {
int A, B, K;
cin >> A >> B >> K;
for( int i = 0; i < K; ++i ) {
if( (i&1) == 0 ) {
if( A&1 ) { A -= 1; }
B += A/2;
A /= 2;
}
else {
if( B&1 ) { B -= 1; }
A += B/2;
B /= 2;
}
}
... | 0 | 75,178,170 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a,b;
void solve()
{
if(a+b>n+1||a*b<n)
{
printf("-1\n");
return ;
}
while(n>0){
ll x=min(a,n-b+1);
for(ll i=n-x+1;i<=n;i++)
printf("%d ",i);
n-=x;
b--;
}
printf("\n"... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef 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& opera... | 0 | 23,512,172 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define FALSE... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 11,621,985 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 0 | 79,339,701 |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,... | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 0 | 28,159,585 |
#include <iostream>
#include <string>
#include <cctype>
#include <vector>
using namespace std;
int main() {
string temp;
int n[26] = {0};
char a[26] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<string> vStr;
while (getline(cin, temp) && !temp.e... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | 0 | 55,144,128 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
long long ans = 0;
vector<int> A(n);
rep1(i, n){
cin >> A[i];
}
int tem = A[0];
rep1(i, n){
if(tem < A[i]){
tem = A[i];
}
else{
... | #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 h,w;
cin>>h>>w;
char fi[h][w];
rep(i,h) rep(j,w) cin>>fi[i][j];
int cw[h][w];
rep(i... | 0 | 56,072,959 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using P = pair<llong, llong>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
string s;
cin >> s;
if(s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I')
cout << "Yes" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0... | 0 | 70,357,070 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
int H... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
int ans=2*n;
bool a=true;
for(int i=n; i>0; i--){
a=true;
for(int j=0; j<i; j++){
if(s.at(n-i+j)!=t.at(j)){
a=false;
break;
... | 0 | 29,097,182 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A=N;
int sum=0;
while(A>0){
sum+= A%10;
A/=10;}
if(N%sum==0){
cout << "Yes" <<endl;}
else{
cout << "No" << endl;}
} | #include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <deque>
#include <set>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
set<long long int>d... | 0 | 22,297,406 |
#include<iostream>
using namespace std;
#include<stdio.h>
int main() {
char p[101], s[101];
int pl, sl, i, j, r, sum;
r = 0;
for (sl = 0; sl < 101; sl++) {
scanf("%c", &s[sl]);
if (s[sl] == '\n') break;
}
for (pl = 0; pl < 101; pl++) {
... | #include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
#define pii pair<ll,ll>
#define debug(a) cout<<a<<'\n'
#define maxn 100009
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define per(i, b, a) for(ll i = b-1; i>=a ; i--)
#define trav(a, x) for(au... | 0 | 53,589,232 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read()
{
int x = 0, f = 1; char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}
const int N = 305;
int ... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main()
{
long long int num,i,j,sum=0;
cin >> num;
i = num;
for(;num!=0;)
{
j = num%10;
sum+=j;
num/=10;
}
if(i%sum == 0) cout << "Yes";
else cout << "No";
} | 0 | 89,659,907 |
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <cmath>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define FI first
#define SE second
#define MA(i,j) make_pair(i,j)
#define PA pair<int,int>
#de... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> h(n);
for(int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = h[0];
for(int i = 1; i < n; i++)
dp[i] = max... | 0 | 29,742,146 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, k;
vector<int> dp;
while(true){
cin >> n;
if(n == 0)
return 0;
for(int i = 0; i < n; i++){
cin >> k;
if(i == 0)
dp.push_back(k);
else
dp.push_back(max(dp[i -1] + k, k));
}
int max = dp[0];
for(int i = 0; i <... | #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
ll n = s.size();
vector<ll> d1 (n);
ll l=0, r=-1;
for (ll i=0; i<n; +... | 0 | 78,718,780 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m,x; cin>>n>>m>>x;
vector<int> B[n];
int C[n];
for(int i=0; i<n; i++){
cin>>C[i];
for(int j=0; j<m; j++){
int x; cin>>x;
B[i].push_back(x);
}
}
ll ans = 1e18;
ll arr[m];
for(int mask=0; mask<(1<<n); mask++){
memse... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 0 | 24,222,120 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using pll = pair<ll,ll>;
using Graph = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i,l,r) for(ll i = (l); i <= (ll)(r); i++)
#define rep3(i,l,r) for(ll i =... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 | 86,492,283 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
ll n, x;
ll solve(ll L, ll R) {
if(L % R == 0) return 2LL * (L - R);
return 2LL * L - R - (L % R) + solve(R, L % R);
}
int main() {
cin >> n >> x;
cout << x + solv... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 50,799,447 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
cout << a*a - b;
} | #include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define MAXMIN(a,b,c) std::max(a,min(b,c))
#define CHABS(a)... | 0 | 19,488,484 |
#include <iostream>
#include <cstdio>
#define MAX_N 100
using namespace std;
void display(int ary[], int size);
int selectionSort(int ary[], int size);
int main(void) {
int N;
int ary[MAX_N];
cin >> N;
for(int i = 0; i < N; i++) {
cin >> ary[i];
}
int cnt = selectionSort(ary, N);
printf("%d\n", cnt);
return 0... | #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;
int ans = 1;
int mx = 0;
for (int i = 1; i <= n; i++) {
int x = i;
int cnt = 0;
while (x % 2 == 0) {
... | 0 | 17,567,902 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> X(N);
for(int i = 0; i < N; i++){
cin >> X.at(i);
}
long long sum = 1000000000;
for(int i = 1; i <= 100; i++){
long long cost = 0;
for(int j = 0; j < N; j++){
cost += (X... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, temp, minj, swapNum = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
}
for (int i = 0; i < n; i++) {
minj = i;
for (int j = i; j < n; j++) {
... | 0 | 13,207,503 |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 2e3 + 2;
string s;
ll dp[102][4][2][2], n, k;
ll solve(int ind, int rem, bool f, bool tiny)
{
if (ind == n) return !tiny && !rem;
if (~dp[i... | #include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 1e5 + 10;
int n, par[N], high[N], mark[N];
vector <int> adj[N];
set <pii> st;
void make_par(int v = 0, int p = 0, int h = 0) {
par[v] = p;
high[v] = h;
for (int i : adj[v])
if (i != p)
make_par(i, v, h + 1);
}
int main() {
... | 0 | 32,168,257 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
int main() {
int n; cin>>n;
cout<<(n-2)*180<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#def... | 0 | 53,827,345 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
int64_t dp[2010][2010];
void init()
{
for (int i = 0; i < 2010; i++)
{
dp[0][i] = dp[i][0] = 1;
}
}
int main()
{
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; i++)
{
cin >> S.at(i);
}
for... | 0 | 48,408,693 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int x, y;
cin >> x >> y;
int res = 0;
while (x <... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 56,048,964 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int x =(h2-h1)*60+ m2-m1;
if(x-k>0){
cout<<x-k<<"\n";
}else{
cout<<0<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 12,272,141 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
ll ceil1(ll a,ll b)
{ if(a%b==0)
return a/b;
else
return a/b+1;}
void solve()
{
int n,m,w1,w2,cnt=0;
cin>>n>>m;
string a... | #include <iostream>
#include <algorithm>
#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
while (1) {
int m, nmin, nmax, p[202], ans, maxgap;
maxgap = -1;
cin >> m >> nmin >> nmax;
if (m==0 && nmin==0 && nmax==0) break;
... | 0 | 87,732,885 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | #include<iostream>
#include<cstring>
using namespace std;
const int MAX = 8000;
const char FORWARD = 'F';
const char TURN = 'T';
int main() {
string s;
int x, y;
cin >> s >> x >> y;
int read = 0;
for (;s[read] == FORWARD;++ read) -- x;
x = x < 0 ? -x : x;
y = y < 0 ? -y : y;
int xGo[MAX], yGo[MAX], xp = 0, yp ... | 0 | 11,823,445 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int m,nmin,nmax,max,ans=0,ansp=0;
int p[201];
cin>>m>>nmin>>nmax;
if(m+nmin+nmax==0) break;
for(int i=0;i<m;i++)cin>>p[i];
sort(p,p+m);
for(int i=nmin;i<=nmax;i++){
max=p[m-i]-p[m-i-1];
if(ans<=max)ans=max,ansp=i;
}
cout<... | #include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_checkpoints(void) {
int n, m;
int a[60], b[60];
int c[60], d[60];
int num = 1;
long int min_distance = 200000000;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
f... | 0 | 84,256,220 |
#include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(decltype(t) _##i = (t), i = (f); i <= _##i; i++)
#define uptil(f, t, i) for(decltype(t) _##i = (t), i = (f); i < _##i; i++)
#define downto(f, t, i) for(decltype(t) _##i = (t), i = (f); i >= _##i; i--)
#... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 26,520,376 |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 60,381,189 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include <bits/stdc++.h>
using namespace std;;
int main(){
int w,h,n;
cin >> w >> h >> n;
int maxx=0,minx=w,maxy=0,miny=h;
int x,y,a;
for (int i = 0; i < n; i++){
cin >> x >> y >> a;
if (a==2){
minx = min(x,minx);
}else if (a==1){
maxx = max(maxx,x);
... | 0 | 91,429,782 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
cin >> S;
int l=0;
int r=S.size()-1;
ll ans=0;
while(r-l>0){
if(S[l]==S[r]){
l++;
... | 0 | 62,124,354 |
#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... | #include <iostream>
int sumOfIntegers(int min, int num, int sum);
int main()
{
int num, sum;
while (true) {
std::cin >> num >> sum;
if (num == 0 && sum == 0) {
break;
}
std::cout << sumOfIntegers(0, num, sum) << std::endl;
}
return 0;
}
int sumOfIntegers(int m... | 0 | 76,143,181 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int32_t f(const int32_t n) {
return (n % 2 == 0) ? n / 2 : 3 * n + 1;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t s;
cin >> s;
int32_t value = s;
int32_t m = -1;
vector<bool> lookup... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mo... | 0 | 32,368,499 |
#include<iostream>
using namespace std;
const int maxSize = 21;
int mapData[maxSize][maxSize] = {0};
int W, H, Ans;
void dfs(int hh, int ww) {
if(mapData[hh][ww] == 1) {
mapData[hh][ww] = 0;
Ans++;
if(hh+1<H && mapData[hh+1][ww]==1) {
dfs(hh+1, ww);
}
if(ww+1<W && mapData[hh][ww+1]==1) {
... | #include <bits/stdc++.h>
using namespace std;
#define repX(a,b,c,x,...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__,rep3,rep2,loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__,rrep3,rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_,n)
#define rep2(i,n) rep3(i,0,n)
#define rep3(i,begin,end) for(int i=(i... | 0 | 50,542,374 |
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
#include <utility>
typedef long long ll;
#define pi 3.141592653589793238... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 25,827,247 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E17;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair <int,int> PII;
typedef pair <ll, ll> PLL;
typedef pair <int,string> PIS;
typedef vector <int> vec;
typedef priority_queue<int> PQ;
#define INF 100000000000000000
#define endl '\n'
#define debug(x) c... | 0 | 13,075,102 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
rep(i,n)rep(j,n)cin>>a[i][j];
rep(i,m)rep(j,m)cin>>b[i][j];
rep(i,n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
struct Edge{
int to, c;
Edge(int to, int c):to(to), c(c){}
};
using Graph = vec... | 0 | 69,532,675 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
using namespace std;
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 279,708 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | 0 | 100,199,287 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int c;
string d;
int m;
int e;
int f;
while(cin >> n){
if(n!=0){
string a[n];
string b[n];
c=0;
while(c<n){
cin >>a[c];
cin >>b[c];
c=c+1;}
cin >> m;
c=0;
while(c<m){
cin >>d;
e=0;
f=0;
while(e<n){
if(d==a[e]){cout<<b[e]; f=1;}
e=e+1;
}
if(f=... | #include <bits/stdc++.h>
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/gcd(m,n))
#define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define endl '\n'
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#... | 0 | 40,963,607 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int N;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = 0;
auto max_it = max_element(a.begin(), a.end());
int max_index = distance(a.begin(), max_it);
while (a[max_index] >= N) ... | 0 | 19,741,414 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string deck;
while(cin >> deck && deck != "-") {
int n; cin >> n;
int shuffle;
while(n-- && cin >> shuffle)
rotate(deck.begin(), deck.begin()+shuffle, deck.end());
cout << deck << endl;
}
return 0;
} | #include "bits/stdc++.h"
#include <numeric>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define llMIN numeric_limits<long long>::min()
#define intMIN numeric... | 0 | 22,115,600 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
#define pi 3.141592653589
#define repeat(i,n) for(int i=0;i<n;i++)
int main()
{
string array;
string right;
int n1,n2;
bool ans=false;
cin >> array;
cin >> right;... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
long long ans = min(N,M/2);
N -= ans;
M -= 2 * ans;
ans += M / 4;
cout << ans <<endl;
return 0;
} | 0 | 48,826,602 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
vector<ll> b(n);
rep(i,n){
ll x;
x = a[i];
b[x-1]++;
}
ll ans = 0;
... | #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 | 12,004,548 |
#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, min, ans;
ans = 0;
min = pow(10, 6);
cin >> n;
rep(i, n) {
int p;
cin >> p;
if (p <= min) {
ans++;
min = p;
}
}
cout... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) !... | 0 | 72,800,049 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
REP(... | 0 | 16,199,679 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else{
if(y%2==0){
return (f(x,y/2)*f(x,y/2))%mod;
}else{
return (((x*f(x,y/2))%mod)*f(x,y/2))%mod;
}
}
}
int64_t comb(int64_t n,int64_t k){
int64_t N=1;
for(int64_t i=... | #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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 33,577,612 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int d;
cin >> d;
d = 25 - d;
cout << "Christmas";
rep(i, d)
{
cout << " Eve";
}
cout << endl;
return 0;
} | #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 < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec)... | 0 | 69,365,886 |
#include<iostream>
#include<map>
#include<string>
using namespace std;
string lowen(string str)
{
for(int i=0; i<str.size(); i++)
{
if('A'<=str[i] && 'Z'>=str[i])
str[i] += 'a'-'A';
}
return str;
}
int main(void)
{
string str;
int mode = 0;
string modest = "";
string longest = "";
map<string,int> dic;
wh... | #include<stdio.h>
int main(){
int i,temp;
int n;
int a,b,c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&a,&b,&c);
if(a < b){temp=a;a=b;b=temp;}
if(a < c){temp=a;a=c;c=temp;}
if(a*a == b*b + c*c)
printf("YES\n");
else
printf("NO\n");
}
return 0;
} | 0 | 98,770,509 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
x = x + r - l + 1;
}
cout << x;
} | #include <iostream>
using namespace std;
struct TCoordinate
{
float x;
float y;
};
struct TLine
{
TCoordinate StartPoint;
TCoordinate EndPoint;
float GetInclination()
{
return (EndPoint.y - StartPoint.y) / (EndPoint.x - StartPoint.x);
}
};
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++){
TLine AB... | 0 | 58,884,329 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll mod = 998244353;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
if(d[0]) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()
using namespace std;
using ll = long long;
int main(){
int N;
scanf("%d", &N);
vector<ll> A(N); rep(i, N) scanf("%lld", &A[i]);
ll ans = 0;
... | 0 | 58,858,666 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
... | 0 | 41,805,206 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.