code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
#include <stack>
#include <ioman... | #include <bits/stdc++.h>
using namespace std;
int n,m,a[101][101],row[101],col[101];
string str;
int main() {
cin>>n>>m;
for (int i=0; i<n; i++) {
cin>>str;
for (int j=0; j<m; j++) a[i][j]=(str[j]=='.');
}
for (int i=0; i<n; i++) {
int x=0;
for (int j=0; j<m; j++) {
... | 0 | 82,469,356 |
#include<iostream>
#include<string>
using namespace std;
class trans {
public:
string str;
void print(int a, int b) {
for (int i = a; i < b + 1; i++){
cout << str[i];
}
cout << endl;
}
void reverse(int a, int b){
string s;
for (int i = 0; i < b + 1 - a; i++){
s += str[i + a];
}
for (int i = 0; ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n);
fo... | 0 | 41,104,030 |
#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.at(i);
vector<int>B(100011);
for(int i=0; i<N; i++){
B.at(A.at(i)) ++;
B.at(A.at(i)+1) ++;
B.at(A.at(i)+2) ++;
}
sort(B.begin(), B.end());
cout << B.at(100010) << en... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
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 | 50,405,163 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
string p;
int i,len;
cin>>s;
cin>>p;
len=s.size();
for(i=0 ; i<len ; i++){
s.push_back(s[i]);
}
if(s.find(p)!=string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 63,912,841 |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ull mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
void solve() {
int n, k; sc(n); sc(k);
int a[n]; fo(i, n) sc(a[i]);
int g = 0;
int el = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
vector<long long> dp(100001,0);
for(long long i=1;i<=100000;i++){
long long com=1000000;
for(long long j=1;i-j>=0;j*=6) com=min(com,dp[i-j]);
for(long long j=1;i-j>=0;j*=9) com=min(com,dp[i-j]);
... | 0 | 62,300,773 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<st... | 0 | 92,321,163 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
int gcd_arr(vector<int> &a){
int n = a.size();
for(int i=n-2; i>=0; i--){
a[i] = gcd(a[i], a[i+1]);
}
return a.front();
}
int main(void){
long long int i=0,j,c=0,n,m=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 0 | 64,897,977 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.length(),sum=0;
if(s[0]=='A' && s[1]>='a' && s[1]<='z' && s[n-1]>='a' && s[n-1]<='z'){
for(int i=2;i<n-1;i++){
if(s[i]!='C' && s[i]>='A' && s[i]<='Z')
break;
if(s[i]=='C')sum++... | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | 0 | 9,001,979 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
int val = 0;
if (j >= a)
val = 1 - val;
if (i >= b)
val = 1 - val;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int H, W; cin >> H >> W;
vector<vector<char>> table(H+2, vector<char>(W+2,'.'));
for (int i=1; i<H+1; i++){
for (int j=1; j<W+1; j++){
cin >> t... | 0 | 1,122,780 |
#include <bits/stdc++.h>
#define N 1000099
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define LL long long
using namespace std;
int n;
LL S;
int main()
{
cin >> S;
LL t = sqrt(S);
if (t * t < S)
t++;
cout << "0 0 " << t << " " << t * t - S << " 1 " << t << endl;
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
#define rep(i, s, e) for (int i = s; i < e; i++)
using namespace std;
struct UnionFind
{
vector<int> par;
UnionFind(int N) : par(N)
{
for (int i = 0; i < N; i++)
par[i] = -1;
}
int root(int x)
{
if (par[x] < 0)
... | 0 | 41,972,886 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0, tt = 0;
for(int i = n-1; i >= 0; i--){
if(h[i] <= h[i-1]) tt++;
else... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
using namespace std;
#define N 2003
#define mod 1000000007
int dp[N][N];
int add(int x,int y) {
int ret = x+y;
if(ret>=mod) {
ret -= mod;
}
if(ret<0) {
... | 0 | 22,341,025 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=n;i>=0;i--)
#define rrepa(i,a,n) for(int i=n;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
#define cmax(a,b) a=max(a,b)
#define cmin(a,... | 0 | 68,828,941 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | 0 | 46,286,634 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int stage[100000] = {0};
for(int i = 1;i <= n; i++){
scanf("%d",&stage[i]);
}
int x = 0;
int ans = -1000000;
for(int i = 1;i <= n; i++){
f... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 84,692,422 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
int main() {
int N;
cin>>N;
for(int i=0;i<900;i++){
if((N+i)%111==0){
cout<<N+i;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define erep(n) for (ll i = 0; i <= n; ++i)
#define erep2(i,... | 0 | 15,024,583 |
#include <bits/stdc++.h>
const std::int64_t INF = 1e18;
int main() {
std::int32_t N; std::cin >> N;
std::vector<std::int64_t> A(N + 1), B(N + 1);
for (std::int32_t i = 0; i <= N; ++i) {
std::cin >> A[i];
}
B[N] = A[N];
for (std::int32_t i = N - 1; i >= 0; --i) {
B[i] = B[i + 1] +... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a = "AtCoder Beginner Contest ";
string b = "AtCoder Regular Contest";
int s1 = a.size();
int s2 = b.size();
a[0] = toupper(a[0]);
b[0] = toupper(b[0]);
int x;
cin >> x;
if(x<1200)
{
for(int... | 0 | 84,377,244 |
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<type... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
long long a[100000];
pair <long long, i... | 0 | 2,584,314 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<string> str(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int v[100001] = {};
bool a[100001] = {};
for (int i = 0; i < n; i++) {
int xi;
cin >> xi;
v[i] = xi;
}
int now = 0;
int acc = 0;
while (!a[now]) {
a[now] ... | 0 | 93,936,487 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i<n;i++)
int main(){
int n;
cin >> n;
cout << min(n/2, (n-1)/2) <<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | 0 | 70,396,440 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <set>
#include <queue>
int main() {
int n;
std::cin >> n;
std::unordered_map<int, std::vector<int>> Adj(n);
for (int i = 0; i < n; i ++) {
int u, k;
std::cin >> u >> k;
std::vector<int> V(k);
for (int... | 0 | 18,705,058 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pii;
int main(){
int H,W,D;
map<int, pii> m;
cin >> H >> W >> D;
ll ans = 0;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int tmp;
cin >> tmp;
tmp--;
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int h,w;
vector<vector<char>> v(100);
int main(){
cin >> h >> w;
rep(i,h){
vector<char> r(w);
rep(j,w){
cin >> r.at(j);
}
v.at(... | 0 | 7,327,784 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << (a-1)*(b-1) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 0 | 13,574,703 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 5010;
int n, k;
int p[N], c[N];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++)
{
scanf("%d", &p[i]);
}
for(int i = 1; i <= n; i++)
{
scanf("%d", &c[i]);
}
ll an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
string s;
cin >> n >> p;
cin >> s;
long long ans = 0;
if(p == 2 | p == 5) {
for(int i = 0; i < n; i++) {
if((s[i] - '0') % p == 0) {
ans += (i + 1);
}
}
} else {
... | 0 | 54,541,354 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
cin >> s;
deque<char> q;
fo... | 0 | 55,014,525 |
#include <stdio.h>
#include <algorithm>
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void SelectionSort(int A[], int N) {
int count = 0;
for (int i = 0; i < N; ++i) {
in... | #include <iostream>
#include <stdio.h>
#include <string>
#include <cctype>
using namespace std;
int main() {
string number;
int num;
int result;
while(1) {
cin >> number;
if (number == "0") break;
result = 0;
for (int i = 0; i < number.size(); i++) {
num = num... | 0 | 64,265,964 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repm(i,m,n) for(ll i=m;i<n;i++)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define YesNo(a) (a)?cout<<"Yes"<<endl:cout<<"No"<<endl
#define YESNO(a) (a)?cout<<"YES"<<endl:cout<<"NO"<<endl
#define INF... | #include<bits/stdc++.h>
using namespace std;
multiset<int> a;
void extract(){
cout << *(--a.end()) << endl;
a.erase(--a.end());
}
int main(void){
char command[10];
int temp;
while(true){
scanf("%s", command);
if(command[0] == 'i'){
cin >> temp;
a.insert(temp);... | 0 | 53,013,126 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 56,502,720 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll dp[100010][2];
int main() {
string s;
cin>>s;
dp[0][0]=1;
for(ll i=0;i<s.size();i++){
if(s[i]=='0'){
dp[i+1][0]+=dp[i][0];
dp[i+1][1]+=dp[i][1];
dp[i+1][1]+=(dp[i][1]*2)%inf;
}
else{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
using ll = long long;
int digits(ll n) {
int cnt = 0;
while (n) {
cnt++;
n /= 10;
}
return cnt;
}
int main() {
ll N;
cin >> N;
ll an... | 0 | 22,682,772 |
#include <iostream>
using namespace std;
int main() {
int h[10000];
int i;
for (i = 0; ; i++) {
cin >> h[i];
if (h[i] == 0) {
break;
}
}
for (int j = 0; j < i; j++) {
cout << "Case " << j + 1 << ": " << h[j] << endl;
}
} | #line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#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(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | 0 | 14,808,676 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
string S;
cin >> N >> S;
enum RGBtype : int64_t { kR = 0L, kG, kB, kNumber };
vector<int64_t> A(N);
vector<int64_t> counts(3, 0);
for ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 97,852,680 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>
void printIter(const T &a, string delimiter) {
if (a.size() == 0) return;
auto it = a.begin();
cout << *it;
it++;
while (it != a.end()) {
cout << delimiter << *it;
it++;
}
cout << endl;
}
in... | 0 | 97,503,972 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int mod = 1000000000+7;
int main(){
int n;
cin>>n;
int a[n];
map<int,int> mp;
rep(i,n){
cin>>a[i];
mp[a[i]]++;
}
sort(a,a+n);
int ans=n;
for(auto itr = mp.begin();itr!=mp.end();++itr){
i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14... | 0 | 57,472,283 |
#include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,N) for(long i=0;i<(long)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, ... | 0 | 8,361,840 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> x(N), dx(N);
for (int i=0; i<N; i++) {
cin >> x[i];
}
x.push_back(X);
int mdx=1000000001;
sort(x.begin(), x.end());
for (int i=0; i<N; i++) {
dx[i]=x[i+1]... | #include <iostream>
using namespace std;
string shuffle(string str, int n)
{
string leftString = str.substr(0, n);
string rightString = str.substr(n, str.size());
return rightString + leftString;
}
int main()
{
string str;
int m, n;
while (true) {
cin >> str;
if (!str.compare("-"... | 0 | 42,928,676 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin>>a;
if(a>='a'&&a<='z') cout<<"a";
else cout<<"A";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int sum = 0;
for (int i = a; i < b + 1; i++){
int c_1 = i / 10000;
int c_2 = (i % 10000) / 1000;
int c_3 = (i % 100) / 10;
int c_4 = i % 10;
if (c_1 == c_4 && c_2 == c_3){
... | 0 | 35,493,600 |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum = 0;
cin >> A >> B;
for (int num = A; num < B+1; num++){
int reverse = 0;
int a = num;
for (int i = 0; i < 5; i++){
int remaind = 0;
remaind = a % 10;
reverse = reverse * 10 +... | 0 | 689,833 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n],b[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
cin >> b[i];
}
long long sum = 0,sum1 = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
sum += a[i]... | 0 | 90,336,279 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = v... | #define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long INF = 1LL << 60;
ll MOD = 1e9+7;
vector<int> Graph[2*100000+1];
vector<bool> visitGraph(2*100000+1,false);
vector<int> ansGraph(2*100000+1, 0);
void bfs(){
queue<int> q;
q.push(1);
visitGraph[1] = ... | 0 | 60,782,781 |
#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++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int a,b,c; cin >> a >> b >> c;
if (a+b >= c)
cout << "Yes\n";
else
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 0 | 78,643,738 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
int c, r;
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
string s;
cin >> s;
if(s == "snuke"){
c = j;
r = i;
}
}
}
cout << (char)('A'+c) << r+1 << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
ll a[20000000] ={NIL};
int h;
ll rk(int n) {
if(n*2+1 <= h) return a[n*2+1];
return NIL;
}
ll lk(int n) {
if(n*2 <= h) return a[n*2];
return NIL;
}
ll pk(int n) {
if(n/2 <= h) return a[n/2];
... | 0 | 35,677,274 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int n;
cin >> n;
long long int a[n],b[n];
long long int a_sum = 0,b_sum = 0;
for(int i = 0;i < n;i++)
{
cin >> a[i];
a_sum += a[i];
}
for(int i = 0;i < n;i++)
{... | #include <bits/stdc++.h>
#define pan(i,n) for(int i=0;i<n;i++)
#define pans(i,n,a) for(int i=a;i<n;i++)
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define INF 1000000007
#define PI 3.141592653
#define inf 100007
#define P pair<ll,ll>
using namespace std;
int main(){
... | 0 | 46,896,021 |
#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>;
const ll MX=1e18;
int main(){
int n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll ans=1;
sort(a.begin(),a.end());
rep(i,n){
if(a[i]==0){
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
int n;
int id[maxn], num[maxn], top;
bool check(int MAX)
{
top=0;
id[top]=1;
num[top]=a[0];
top++;
for(int i=1;i<n;i++)
{
if(a[i]>a[i-1]){
num[top]=a[i]-a[i-1];
id[top]=1;
... | 0 | 20,391,230 |
#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 = 1e5 + 5;
int n, k, cnt[A];
int mul(int x, int y) {return (1LL * x * y) % mod;}
int add(int x, int y) {return ((x + y) % mod + mod) % mod;}
int fp(i... | #include<iostream>
#include<fstream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<map>
using namespace std;
int k;
struct pa{
int x,y;
};
deque<pa>p;
bool vis[10000000];
void bfs(){
while(p.size())
... | 0 | 31,437,800 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, M;
vector<pair<int, int>> ans;
cin >> N >> M;
if (N % 2)
{
for (int l = 0, r = N - 1; l < r; l++, r--)
{
ans.emplace_back(l, r);
}
}
else
{
bool flag = true;
for (int l = 0, r = N - 1; l < r; l++, r--)
{
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int q;
cin >> q;
for (auto i=0; i<q; i++) {
string M;
cin >> M;
int a, b;
cin >> a >> b;
if (M == "print") {
cout << S.substr(a, b-a+1) << endl;
} else if (M == "rever... | 0 | 78,155,818 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S;
cin >> N;
vector<int> W(N), M(N+1,0);
for (int i=0; i<N; i++) {
cin >> W[i];
S+=W[i];
M[i+1]+=M[i]+W[i];
}
int m=10000000;
for (int i=0; i<=N; i++) {
m=min(m, abs(S-2*M[i]));
}
cout << m << endl;
} | #include <iostream>
using std::cin;
using std::cout;
using std::endl;
using std::string;
int main(){
int n;
int y,m,d;
cin >> n;
int summ,sumd;
summ = 0;
sumd = 0;
for(int i = 1;i < 1000;i++){
summ += 20*10;
if(i % 3 != 0){
summ -= 5;
}
}
summ += 1;
for(int i= 0 ;i < n;i++){
su... | 0 | 13,061,599 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int count = 0;
for(int i=0; i<N; i++)
{
int l,r;
cin >> l >> r;
count += r-l+1;
}
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
ll n; cin >> n;
vector<ll> A(n,0),K(n);
rep(i,n){
cin >> K[i];
A[K[i]-1]++;
}
ll cnt = 0;
vector<ll> B(n);
rep(i,n){
B[i] = A[i]*(A[i]-1)/2;
... | 0 | 35,496,273 |
#include <iostream>
#include <vector>
#include <queue>
#include<map>
#include<algorithm>
#include<set>
#include<iomanip>
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1; i<=n;i++)
#define ALL(a) a.begin(),a.end()
#define PI acos(-1)
using namespace std;
template<typename A, size_t N, typename ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n;
string ans;
cin >> n;
vector<string> s(n);
vector<vector<int>> num_list(n, vector<int>(26, 0));
vector<int> ans_list(26);
for(int i=0; i<n; i++){
cin >> s[i];
}
... | 0 | 29,516,614 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 1,434,076 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 0 | 48,393,510 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int r, d, x;
cin >> r >> d >> x;
rep(i,10) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include<cstdio>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
int n,a[N],stk[N],c[N],top,ans;
inline bool check(CI lim)
{
if (lim==1)
{
for (RI i=2;i<=n;++i) if (a[i]<=a[i-1]) return 0; return 1;
}
top=0; for (RI i=2;i<=n;++i) if (a[i]<=a[i-1])
{
int x=a[i]; while (to... | 0 | 93,040,370 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i ++)
static const long long MOD = 1000000007;
long long fact[101010];
long long extgcd(long long a, long long b, long long& x, long long& y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, ... | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;
int n, a[110000];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int mi = 0;
for (int i = 1; i <= n; i... | 0 | 92,883,728 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str, ord, p,ans;
int m, a, b,y;
cin >> str >> m;
for (int i = 0; i < m; i++){
cin >> ord;
if (ord == "replace"){
cin >> a >> b >> p;
for (int k = 0; k < b - a + 1; k++){
str[a + k] = p[k];
}
}
if (ord == "reverse"){
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned lo... | 0 | 13,670,716 |
#include <iostream>
using namespace std;
int n,ans;
string s[300],t[300];
bool solve(void){
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(t[i][j]!=t[j][i])return false;
}
}
return true;
}
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
t[i]=s[i];... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 0 | 11,338,435 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tre... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 39,839,159 |
#include "bits/stdc++.h"
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(i... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 9223372036854775807
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define ORREP(i,n) for(int i=(n);i>=1;--i)
#define ZREP(i,n) for(int i=1;i<(n);++i)
#define RREP(i,n) for(int i=(n)... | 0 | 3,950,059 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string a,b,c; cin>>a>>b>>c;
char m='A'-'a';
printf("%c%c%c\n",a[0]+m,b[0]+m,c[0]+m);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<ll> a(N),b(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
cin>>b.at(i);
}
ll a_count=0,b_count=0;
for(int i=0;i<N;i++){
if(a.at(i)>b.at(i)){
b_c... | 0 | 41,645,063 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pa... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#define mp make_pair
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(... | 0 | 98,343,619 |
#include <bits/stdc++.h>
using namespace std;
void input(string& rsTarget)
{
cin >> rsTarget;
}
int parse(string sTarget)
{
const vector<string> cnvsWord{"dream", "dreamer", "erase", "eraser"};
int ixBgn, ixEnd;
ixBgn = sTarget.size();
while (ixBgn)
{
bool bReslt = false;
ixEnd = ixBgn;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef long long ll;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF ... | 0 | 41,948,549 |
#include<bits/stdc++.h>
using namespace std;
int k,num=9;queue<long long>q;
void bfs()
{
while(!q.empty())
{
long long x=q.front(),lst=x%10;q.pop();
for(int i=lst-1;i<=lst+1;++i)
{
if(i<0||i>9) continue;
q.push(x*10+i);++num;
if(num==k)
{
cout<<x*10+i;
return;
}
}
}
}
int main()
{
cin... | #include <stdio.h>
#include <string.h>
int main()
{
char S[15], T[15], U[15];
int A, B;
scanf ("%s %s", S, T);
scanf ("%d %d", &A, &B);
scanf ("%s", U);
(strcmp (S,U) == 0) ? A-- : B--;
printf ("%d %d", A, B);
return 0;
} | 0 | 30,849,177 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 41,345,544 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define data pair<int,pii>
int N;
vector<data> V;
signed main()
{
cin >> N;
rep(i, N)
{
int a, b;
cin >> a >> b;
V.push_back({a + b, {a, b}});
}
... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 19,577,167 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long int ll;
template<typename T> T changeMax(T& a, T b){if(a < b)a = b;return 0;}
int main()
{
int n;
cin >> n;
if(n < 1200)cout << "ABC" << endl;
else if(n < 2800) cout << "ARC" << endl;
else cou... | #include <cstdio>
#include <cctype>
int main(){
int i=0, a[26]={0};
char ch;
while( scanf("%c", &ch) != EOF ){
if( isupper(ch) )
ch = tolower(ch);
if('a'<=ch && ch<='z')
++a[ ch-'a' ];
++i;
}
for(int x=0; x<26; ++x)
printf("%c : %d\n", 'a'+x, a[x]);
return 0;
} | 0 | 12,944,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=30;
const ll INF=0x3f3f3f3f3f3f3f;
ll p,q,mux[MAX][MAX],tmp[MAX];
ll find_mux(ll a,ll b){
int tmp[MAX];
if(mux[a][b]==-1){
mux[a][b]=0;
for(ll i=0;i<MAX;i++) tmp[i... | #include<bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll,ll>>
#define pii pair<int,int>
#define REP(i,a) for(int (i)=0; (i)<(a); (i)++)
#define RREP(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define REP2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define ALL(v) ... | 0 | 67,780,365 |
#include <iostream>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
for (int i = 0; i <= N; i++) {
for (int j = 0; i+j <= N; j++) {
int total = 10000 * i + 5000 * j + 1000 * (N-i-j);
if (total == Y) {
cout << i << " " << j << " " << N-i-j << endl;
return 0;
}
}
}
cout << -1 << " " <... | #include<bits/stdc++.h>
using namespace std;
#define close std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define eps 1e-8
typedef long long ll;
const double PI = acos(-1.0);
constexpr int INF = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3f;
constexpr int mod = 1e9+7;
constexpr int maxn = 1e6+100;
int mai... | 0 | 62,352,545 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
#include<ios>
#include<iomanip>
using name... | #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 | 7,976,551 |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int d[1005][1005];
int main(){
string s1,s2;
cin>>s1>>s2;
s1=' '+s1;
s2=' '+s2;
int l1=s1.size();
int l2=s2.size();
int i,j;
for( i=1;i<l1;i++)d[i][0]=i;
for( j=1;j<l2;j++)d[0][j]=j;
for( i=1;i<l1;i++){... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 85,614,059 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
map <ll, ll> ma;
bool flag = true;
for(int i=0; i<n; i++){
int a; cin >> a;
ma[a]++;
if(ma[a]==2) flag=false;
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
const int mod = 1e9 + 7;
string to_string(string s) {
return '"' + s + '"';
}
string t... | 0 | 36,512,495 |
#include <iostream>
using namespace std;
using ll = long long;
ll labs(ll a)
{
if (a >= 0) return a;
else return -a;
}
ll diffabs(ll a, ll b)
{
if (a >= b) return a - b;
else return b - a;
}
int main()
{
ll x, y;
cin >> x >> y;
int ans = diffabs(labs(x), labs(y));
if (x * y > 0 && x > y)
ans += 2;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int rainy = 0;
int maxrainy = 0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
rainy++;
} else {
rainy = 0;
}
if(rainy > maxrainy){
maxrainy = rainy;
}
}
cout << maxr... | 0 | 74,271,311 |
#include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
size_t count(const string& str, const string& sub, const size_t ini = 0, const size_t fin = string::npos) {
size_t pos = str.find(sub, ini);
size_t cnt = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
const ll MAX=1e18;
int main() {
int n; cin>>n;
vll a(100010);... | 0 | 96,140,152 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
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... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
int main()
{
_LL n;
cin >> n;
_LL a = 10;
_LL ans = 0;
if( n % 2 == 1 )
{
cout << 0;
return 0;
}
while( a <= n )
{
ans += ( n / a );
a *= 5;
}
cout << ans;
... | 0 | 73,184,596 |
#include <iostream>
#include <unordered_map>
using namespace std;
int fib(int);
unordered_map<int, int> memoFib;
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if(memoFib.count(n)) return memoFib[n];
int a;
a = memoFib[n] = n == 0 || n == 1 ? 1 : fib(n - 1) + fib(n - 2)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define pp pair<int,int>
#define ll long long
#define ld long double
int inf=100000000;
ll INF=4000000000000000000;
ll MOD=1000000007;
int main() {
int n;
string s;
cin >> n >> s;
s+=s.at(0);
rep(j,4){
vector<int> ... | 0 | 59,421,788 |
#include<iostream>
#include<vector>
using namespace std;
int get_square(int x){
return x*x;
}
int main(){
vector<int> area_anss;
int d;
while(cin>>d){
int area=0;
for(int i=1;i<600/d;i++){
area=area+get_square(i*d)*d;
}
area_anss.push_back(area);
}
for(int i=0;i<area_anss.size();i++){
cout... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rt return
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for... | 0 | 61,963,822 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
const int mod = 1000000007;
signed main() {
int N, M; cin >> N >> M;
vector<bool> t(N... | 0 | 15,111,616 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
typedef long long ll;
const int MAX = 1e7+10;
const int MAX1 = 1e5+10;
const int INF = 1e9+10;
double eps = 1e-6;
int cnt[MAX];
int main(... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | 0 | 2,975,608 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using LP = pair<int, int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
vector<int> to[n];
rep(_,n){
int u; ci... | 0 | 56,977,691 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> h(n);
for(int i=0;i<n;i++)
{
cin>>h[i];
}
vector<int> dp(n,INT_MAX);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<n;i++)
{
for(int j=i-1,jump=0; j>=0&&jump<k;j--,jump++){... | 0 | 56,530,721 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+100;
struct Node{
int index, number;
}a[N];
int n;
bool cmp(const Node &x,const Node &y)
{
return x.number < y.number;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].number);
a[i].index = i;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int h,w;
... | 0 | 34,145,006 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
... | #include <bits/stdc++.h>
#include <boost/hana/functional/fix.hpp>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T>
void debug(const std::vector<T>& v) {
debug_iter(v.begin(), v.end());
}
template ... | 0 | 88,105,411 |
#include <cstdio>
const char c[]={'R','Y','G','B'};
int n,m,d,b;
int main(){
scanf("%d%d%d",&n,&m,&d);b=10000*d;
for(int i=0;i<n;++i,putchar(10))
for(int j=0;j<m;++j)
putchar(c[(((i+j)/d&1)<<1)|((i-j+b)/d&1)]);
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | 0 | 8,528,454 |
#include<iostream>
int x = 0 , y = 1 ;
int main()
{
for(;(x != 0) || (y != 0);)
{
std::cin >> x >> y;
if(( x != 0 ) || ( y != 0 ))
{
if(x <= y)
{
std::cout << x << " " << y << std::endl ;
}
else
{
std::cout << y << " " << x << std::endl ;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, N_max=0, M_max=0, max;
cin >> N;
vector<string> N_s(N);
for(int i=0;i<N;i++){
cin >> N_s.at(i);
}
cin >> M;
vector<string> M_t(M);
for(int i=0;i<M;i++){
cin >> M_t.at(i);
}
for(int i=0;i<N;i++){
int... | 0 | 10,732,971 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, w;
cin >> s >> w;
if(w >= s) {
cout << "unsafe\n";
}else{
cout << "safe\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define pb push_back
int dx[]={0,1,0,-1},dy[]=... | 0 | 34,929,785 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
for (int i = 1; i < 1000000; ++i)
{
int p = a*i;
if(p%b == c){cout<< "YES"<<"\n"; return 0;}
}
cout<<"NO"<<"\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 69,287,988 |
#include<bits/stdc++.h>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e5+5;
#define ll long long
#define inf 0x3f3f3f3f
#define mem(x)... | #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
string input, longest, many;
int len = ... | 0 | 32,833,152 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int result;
result = 0;
if (
(n=="a")||
(n=="i")||
(n=="u")||
(n=="e")||
(n=="o")
)
{
cout << "vowel" << endl;
}
else
{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 90,586,603 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
int is_reverse=0;
deque<int> deq;
rep(i,N)
{
int a;
cin>>a;
if(is_reverse)
{
deq.push_front(a);
}
else
{
deq... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | 0 | 50,309,238 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n; cin >> n;
long long p_total = 0;
long long zero = 0;
vector<long long> a(n + 1)... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
... | 0 | 70,039,945 |
#include <iostream>
using namespace std;
int n, q, P[1000000], buff1, buff2, buff3;
int x[100000], y[100000];
bool com[100000];
int root(int x){
if(P[x]==x) return x;
P[x] = root(P[x]);
return P[x];
}
bool is_same_set(int x, int y){
return root(x) == root(y);
}
void unite(int x, int y){
P[root(x)] = root(y);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl "\n"
#define fast_io ios::sync_with_stdio(false); cin.tie(0);
#define file_io freopen("input.txt", "r", stdin); \
freopen("output.... | 0 | 49,877,588 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, pair<int, int> > p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) {
cout << "Possible" << endl;
} else {
cout << "I... | #include <bits/stdc++.h>
using namespace std;
void solve(int n,int mn,int mx){
int t,st=0,maxx=0,ans=0;
vector<int> v;
cin >> st;
for(int i=0;i<n-1;i++){
cin >> t;
v.push_back(st-t);
st=t;
}
for(int i=mn-1;i<mx;i++){
if(maxx<v[i]){
maxx=v[i];
}... | 0 | 31,165,436 |
#include <iostream>
using namespace std;
int main() {
int d[7], g;
cin >> d[1] >> d[2] >> d[3] >> d[4] >> d[5] >> d[6] >> g;
for (int i = 0; i < g; i++) {
int x, y; cin >> x >> y;
if (x != d[1]) {
if (x == d[2]) {
int t = d[2];
d[2] = d[6];
d[6... | #include <iostream>
#include <string>
using namespace std;
bool isAC(const string &S) {
if (S[0] != 'A') return false;
int cnum = 0;
bool exist = false;
for (int i = 1; i < S.size(); ++i) {
if (i >= 2 && i + 1 < S.size() && S[i] == 'C') ++cnum;
if (S[i] >= 'A' && S[i] <= 'Z' && S[i] !=... | 0 | 58,053,640 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
void printArray(int* A, int n) {
for (int i = 0; i < n; ++i) {
if (i != 0) { cout << " "; }
cout << A[i];
}
cout << endl;
}
void countingSort(int* A, int* B, int n, int k) {
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_t... | 0 | 71,168,800 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
char grid[2020][2020];
vector<int> bh[2020],bw[2020];
bool isOK(int index, int i, vector<int> &vec){
if(vec[index]<i) return 1;
else return 0;
}
int nibutan(int i, vector<... | #include <iostream>
#include <cstdio>
#include <bitset>
#define M 8005
using namespace std;
int x, y, z, c;
string s;
bitset<M * 2> bs[2];
int main() {
int i;
cin >> s >> x >> y;
for (i = 0; s[i] == 'F'; i++);
bs[0][i + M] = bs[1][M] = 1;
for (; i <= s.size(); i+... | 0 | 44,094,695 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int heights[10];
for(int i = 0; i <= 9 ; i++){
cin >> heights[i];
}
sort(heights , heights + 10);
cout << heights[9] << endl << heights[8] << endl << heights[7] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int ans;
if (h2 < h1 || (h1 == h2 && m2 < m1)) {
h2 += 24;
}
ans = max(0, 60*h2+m2 - (60*h1+m1) - k);
cout << ans << endl;
} | 0 | 54,537,359 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr,0,sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_t ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 0 | 35,608,294 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int main(){
int n, k;
cin >> n >> k;
string s;
cin >>... | 0 | 96,252,492 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int p,q,r;
cin>>p>>q>>r;
cout<<min(min(p+q,p+r),q+r)<<endl;
} | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#def... | 0 | 3,382,858 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
ll n,m;
cin>>n>>m;
ll gcd=__gcd(n,m);
ll lcm=(n*m)/gcd;
cout<<lcm<<"\n";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)... | 0 | 47,992,761 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include<bits/stdc++.h>
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define read freopen("input.txt", "r", stdin);
#define write freopen("output.txt", "w", stdout);
#define endd '\n'
#define ll long long
#define sq(a) ((a) * (a))
using namespace std;... | 0 | 16,875,379 |
#include <iostream>
#include <vector>
using namespace std;
int A, B, C;
int X;
int myrand() {
int res = X;
X = (A*X + B) % C;
return res;
}
bool solve() {
int N;
cin >> N >> A >> B >> C >> X;
if(!N && !A && !B && !C && !X) return false;
vector<int> ys(N);
for(int i = 0; i < N; ++i) {
... | #include<cstdio>
#include<algorithm>
using namespace std;
int s[10001];
int finds(int n)
{
if(s[n]==n)
return n;
else return s[n]=finds(s[n]);
}
int unionh(int a,int b)
{
a=finds(a); b=finds(b);
s[a]=b;
}
int main()
{
for(int i=0; i<=10000; i++) s[i]=i;
int n,q,op,x,y;
scanf("%d%d",&... | 0 | 871,090 |
#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;
int main(){
int n;
cin >> n;
vector<int64_t>a(n);
vector<int64_t>b(n);
for(int i=0;i<n;i++)
cin >> a.at(i);
for(int i=0;i<n;i++)
cin >> b.at(i);
vector<int64_t>h(n);
for(int i=0;i<n;i++)
h.at(i)=b.at(i)-a.at(i);
sort(h.begin(),h.end(),greater())... | 0 | 11,424,801 |
#include <bits/stdc++.h>
#define MOD
#define MAXN
#define MAXM
#define LL long long
#define ll long long
#define mem(a) memset(a,0,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while (ch<'0'||ch>'9'){
if (ch=='-') f=-1;
ch=getchar();... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define pmin priority_queue < ll, vector<ll>, greater<ll> >
#define pmax priority_queue <ll>
#define endl '\n'
#define mii map<ll , ll >
#define pii pair< ll, ll >
#defin... | 0 | 84,317,490 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.