code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int a, b;
char t;
cin >> a >> b;
if (a + b == 15)
t = '+';
else if (a * b == 15)
t = '*';
else
t = 'x';
cout << t << endl;
return 0;
} | #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
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (int i = 0; i <= 25; i++) {
for (int j = 0... | 0 | 86,737,070 |
#include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <climits>
#include <cfloat>
#include <queue>
#include <stack>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = INT_MAX;
typedef long long LL;
typedef pair<int,int> P;
int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n;
cin >> n;
vector<int> dim(n, 0);
vector<int> l(n);
for (int i = 0; i < n; i++)
{
cin >> l[i];
}
for (int i = 0; i < n; i++)
{
dim[i] = l[i] - (i + 1);
}
sort(dim.begin()... | 0 | 10,158,949 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int,int> pairii;
typedef vector<int> veci;
const double pi=3.1415926535;
const ll mod=1000000007;
int MIN(vector<int> Vec){
int n=Vec.size();
int min=... | 0 | 81,171,192 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 29,336,983 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if ((n % 1000) % 111 == 0 || (n - n % 10) % 1110 == 0)
cout << "Yes" << "\n";
else
cout << "No" << "\n";
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 58,626,832 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,x,y;cin >> n >> m >> x >> y;
for(int i = 0;i < n;i++)
{
int xd;cin >> xd;x = max(x,xd);
}
for(int i = 0;i < m;i++)
{
int yd;cin >> yd;y = min(y,yd);
}
string k = "War";
if(x < y)k = "No War";
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long l, t;
cin >> n >> l >> t;
vector<long long> x(n);
vector<long long> w(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> w[i];
}
vector<long long> finish(n);
for (int i = 0; i < n... | 0 | 63,593,898 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
int n;
string s;
cin >> n >> s;
int left = 0;
int addleft = 0;
for (int i = 0; i < n; i++)
{
if ('(' == s[i])
{
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | 0 | 36,118,730 |
#include <iostream>
using namespace std;
int main() {
string a;
cin >>a;
if (a.find ('7') != -1)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vector<T> getVector(ll num){
... | 0 | 37,467,466 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = ve... | 0 | 63,983,709 |
#include<cstdio>
int main(){
int n, count = 0;
while(scanf("%d", &n) + 1){
count = 0;
for (int i = 0; i < 10; i++){
for(int j = 0; j < 10; j++){
for(int k = 0; k < 10; k++){
for(int l = 0; l < 10; l++){
if(n == i + j + k + l){
count++;
}
}
}
}
}
printf("%d\n", count)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for(ll i = 2; i*i <= n; i++) {
if (n%i != 0) continue;
res.emplace_back(i,0);
while (n%i == 0) {
n/... | 0 | 18,042,169 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
int n = s.size();
bool can = true;
string rs1,rs2,rs3;
string s2 = s.substr(0,(n-1)/2);
string s3 = s.subst... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define watch(x); cout << "\n" << #x << " is: " << x << "\n";
#define ll long long int
#define ff first
#define ss second
#define all(a) ... | 0 | 52,024,458 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;
struct status{
int idx_node;
vector<int> children;
int visited = 0;
int depth = -1;
};
deque<int> schedule;
vector<status> graph;
int depth = 1;
void bfs(){
if (schedule.size()>1){
int now_node ... | #include<iostream>
using namespace std;
int a,b,c;
int rcount;
int ran(int x){
return (a*x+b)%c;
}
int main(){
int n,x,xf;
int y[101];
while(1){
rcount=0;
cin >> n >> a >> b >> c >> x;
xf=x;
if(n==0 && a==0 && b==0 && c==0 && n==0)break;
for(int i=0;i<n;i++){
cin >> y[i];
}
for... | 0 | 67,362,168 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const ll INF = 1e14;
void solve(){
int n, a, b; cin >> n >> a >> b;
if(((a+n-1) / n) * n <= b) cout << "OK";
else cout << "NG";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NUL... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 83,575,822 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,l,r,mark[100002]={0},i;
cin>>n;
for (i=0;i<n;i++)
{
cin>... | 0 | 71,219,147 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPL(i,a,n) for(ll i=a;i<n;++i)
#define RUP(a,b) ((a+b-1)/(b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(),v.end(),greater<>())
#define SORTV(v) sort(v.begin(),v.end())
#define ALL(v) (v).begin(),(v).end()
#define MOD 100... | 0 | 70,000,264 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n, m, p;
while(cin >> n >> m >> p, n || m || p){
vector<int> x(n);
int bet = 0;
for(int i = 0; i < n; i++){
cin >> x[i];
bet += x[i];
}
bet = bet * (100 - p);
if(x[m-1] == 0){
cout << 0 << endl;
}els... | #include<bits/stdc++.h>
using namespace std;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(int)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(int)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
... | 0 | 23,555,467 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
char resp[5];
char query(ll x) {
printf("? %lld\n", x);
fflush(stdout);
scanf("%s", resp);
return resp[0];
}
ll p10[13];
ll bs(int len) {
ll start = p10[len], End = p10[len + 1] - 1, ans = 0;
while (start <= End) {
auto mid = (start + End) / 2;
... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#include<assert.h>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int ind... | 0 | 41,701,742 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if(i % 2 == 0) {
if(a % 2 == 1) {
a--;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X,i) ((X>>i)&1)
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).r... | 0 | 65,019,672 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<char> N(4);
for (int i = 0; i < 4; i++) {
cin >> N[i];
}
bool flag = true;
flag &= find(N.begin(), N.end(), '1') != N.end();
flag &= find(N.begin(), N.end(), '9') != N.end();
flag &= find(N.begin(), N.end(), '7') != N.end();
flag ... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =1001001001;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(l... | 0 | 27,341,746 |
#include <iostream>
using namespace std;
int main()
{
int n,x,t,count=0;
cin>>n>>x>>t;
if(n%x>0)
{count=((n/x)+1)*t;}
else{
count=(n/x)*t;
}
cout<<count<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 0 | 59,046,521 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll N=1e6+1;
ll gcd(ll a,ll b){
if (a == 0)
return b;
return gcd(b % a, a);
}
ll fact[N];
bool prime[N];
void sieve(){
for(ll i=2;i<N;i++){
if(prime[i]==true){
for(ll j=i*i;j<=N;j+=i){
... | #include <iostream>
#include <cstddef>
#include <string>
using ll = long long;
ll n;
std::string s, s2;
char t[4];
char p;
ll ans;
int main() {
std::cin >> n;
std::cin >> s;
for (int i = 0; i < 1000; i++) {
bool torf = true;
std::snprintf(t, 4, "%03d", i);
s2 = t;
long long i... | 0 | 75,250,259 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 65,479,845 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=1010;
int a[N],b[N];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch<'0'||ch>'9') ch=='-'?o=-1:0,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | 0 | 89,374,125 |
#include <iostream>
#include <vector>
using namespace std;
int N;
void space(vector<int> &a){
for(int i = 0; i < N; i++){
if(i > 0){
cout << " ";
}
cout << a[i];
}
cout << endl;
}
void selectionsort(vector<int> &a){
int minj, count = 0;
for(int i = 0; i < N; i++){
minj = i;
for(int j... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 10,958,845 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int min = 10000;
int res=0;
string dis = "";
for(int i=0; i<s.length()-2; i++){
dis = "";
dis = s.substr(i, 3);
res = abs(atoi(dis.c_str())-753);
if(res < min)
min = res;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << 100 << ' ' << 100 << endl;
char g[100][100];
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
g[i][j] = '.';
g[i+50][j] = '#';
}
}
for(int i=0; i<b-1; i++){
... | 0 | 96,241,876 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
for(int i = 1; i < n; i++) {
... | 0 | 26,300,470 |
#include <stdio.h>
#include <iostream>
using namespace std;
#define NUM 100000
#define INF 1000000010
int L[NUM + 1];
int length = 0;
void init(){
for(int i = 0; i <= NUM; i++){
L[i] = INF;
}
}
int main(void){
init();
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
int a;
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void CountingSort(vector<int>& A, vector<int>& B){
int n = *max_element(A.begin(), A.end()) + 1;
vector<int> C(n, 0);
for (const auto& a : A) C[a]++;
for (int i = 1; i < n; i++) C[i] += C[i-1];
for (const auto& a : A) {
... | 0 | 25,455,300 |
#include <iostream>
#include <cmath>
using namespace std;
int main (void) { ... | #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()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
map<int,int> m;
for(auto &i:a){
m[i... | 0 | 25,543,352 |
#include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <deque>
using namespace::std;
int ri()
{
int x;
scanf("%d", &x);
return ... | #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;
#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a, val, sizeof a)
#define maxn 100010
#define INF 1e... | 0 | 100,272,979 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 12,191,676 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
set<int> S;
vector<pair<int,int>> V0;
rep(i,n) {
int t, d;
cin >> t >> d;
V0.emplace_back(t,d);
}
sort(V0.rbegin(), V0.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int prev = 0; long long ans = 0;
for (int i = 0; i < n; i++) {
int t = prev + 1;
int s = v[i] - t;
if (s > 0) {
ans += (s + t-1) ... | 0 | 23,288,746 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
string p;
cin >> s >> p;
string s2 = s + s;
cout << (s2.find(p) == string::npos ? "No" : "Yes") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[100000];
int B[100000];
int main() {
int N;
cin >> N;
for (int i=0; i<N; i++) {
cin >> A[i];
}
for (int i=0; i<N; i++) {
cin >> B[i];
}
ll S = 0;
int cntS = 0;
vector<int> E;
for (int i=0; i<N; i++) {
if (A[i] < B[i]) {
S +=... | 0 | 40,343,656 |
#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(void){
int n, m;
cin >> n >> m;
int ans = 0;
n -= 1; m -= 1;
ans += n*(n+1)/2;
ans += m*(m+1)/2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define MAX_N 200'000
using namespace std;
int A[MAX_N];
int D[MAX_N];
int main() {
int K, N;
cin >> K >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int max_d = 0;
int max_idx = 0;
for (int i = 0; i < N - 1; ++i) {
... | 0 | 59,957,107 |
#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()
const ll INF = 1LL << 60;
int main(){
string s,t;
cin >> s >> t;
int count=0;
rep(i,3){
if(s[i]==t[i]) count ++;
}
cout << count <... | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n; cin >> n;
int par = 0;
vector < pair < ll, ll > > v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i].firs... | 0 | 24,867,152 |
#include<bits/stdc++.h>
int main(void) {
using namespace std;
long n, z, w;
cin >> n >> z >> w;
vector<long> a(n);
for(auto &x: a) cin >> x;
vector<long> dpx(n, 0), dpy(n, 1e10);
dpx[n-1] = abs(a[n-2] - a[n-1]);
dpy[n-1] = abs(a[n-2] - a[n-1]);
for(int i=n-2; i>0; i--) {
dpy[... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<int>v(n+5);
vector<int>dfs(n+5);
int mn=1;
int j=1;
for(int i=n-1;i>=1&&m--;i--){
while(v[j+i]) i--;
while(dfs[n-(i)]||i==n-i) i--;
cout<<j<<' '<<j+i<<'\n';
dfs[i]=1;
... | 0 | 20,208,516 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#define MAX_B 100'000
using namespace std;
int main() {
int N;
cin >> N;
int _b = MAX_B;
int res = 0;
for (int i = 0; i < N - 1; ++i) {
int b;
cin >> b;
res += min(_b, b);
_b = b;
}
printf("%d\n", res + _b);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 51,083,737 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <iostream>
#include <set>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int g=max(a,b), l=min(a,b);
set<int> st1, st2;
for (int i=1; i*i<=g; i++) {
if (g%i == 0) {
st1.insert(i);
st1.insert(g/i);
}
if (l%i == 0) {
... | 0 | 14,472,475 |
#include<bits/stdc++.h>
#include<queue>
using namespace std;
int W,H;
char c[101][101];
bool visited [100][100];
int dx[4]={1,0,-1,0};
int dy [4]={0,1,0,-1} ;
void compute(){
memset(visited,false,sizeof visited);
queue<int> que;
int i,j;
for(i=0;i<H;++i){
for(j=0;j<W;++j){
if(c[i][j]=='@'){
que.push... | #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(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 8,672,385 |
#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... | #include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
con... | 0 | 11,806,651 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int A, B;
size_t K;
cin >> A >> B >> K;
vector<int> v;
int upper = min(A, B);
for (int i = 1; i <= upper; ++i) {
if (((A % i) == 0) && ((B % i) == 0)) {
v.push_back(i);
}
}
if (K <= v.size()) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long int> vll;
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fo(i,a,b) for(ll i = a; i<=b;i+=1)
#define rf(i,a,b) for(ll ... | 0 | 64,717,062 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int time[86401]={0},n,start,end;
string str[2],se;
vector<string> vec;
string h,m,s,eh,em,es;
while(cin>>n,n){
cin.ignore();... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 38,158,308 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define rep(i, n) for(i = 0; i < n; i++)
int main(){
int N, K;
int val = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
val = min(val * 2, val + K);
}
cout << val << '\n';
... | #include<stdio.h>
int main()
{
int H, N, i, sum=0;
scanf("%d %d", &H, &N);
int A[N+2];
for(i=1; i<=N; i++){
scanf("%d", &A[i]);
}
for(i=1; i<=N; i++){
sum += A[i];
if(sum >= H){
N=0;
break;
}
}
if(N==0)
printf("Yes\n");
... | 0 | 70,924,821 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long N;
cin >> N;
vector<long long> H(N);
for(long long i = 0; i < N; ++i) {
cin >> H[i];
}
reverse(H.begin(), H.end());
long long ans = 0, max_num = 0;
long long now_... | 0 | 18,894,257 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int sa,sb;
sa = a.size();
sb = b.size();
if(sa>sb){
cout << "GREATER" << endl;
return 0;
}else if(sa <sb){
cout << "LESS" << endl;
return 0;
}else if(sa == sb){
for... | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 1e5 + 10;
int n, sg[N];
vector<int> nxt[N];
void dfs(int x, int fa) {
for (int i = 0; i < nxt[x].size(); i++) {
int y = nxt[x][i];
if (y == fa) continue;
dfs(y, x);
sg[x] ^= ... | 0 | 23,508,401 |
#include <iostream>
#include <vector>
using namespace std;
template<class T>
T square(const T &x) { return x * x; }
template<class T>
bool chmin(T &a, const T &b) { return b < a && (a = b, 1); }
const int INF = 2147483647;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int &i : a) cin >> i;
int res = IN... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,b,ans;cin>>n>>k;
map<int,int> a;
ans=0;
for(int i=0;i<n;i++){
cin>>b;
if(a.count(b)){
a.at(b)++;
}else{
a[b]=1;
}
}
if(a.size()<=k){
cout<<0<<endl;
}else{
vector<int> aa(a.size());
int i=0;
for (auto... | 0 | 18,921,990 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define __lcm(a, b) std::__detail::__lcm(a, b)
typedef long long ll;
const long mod = 1e... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 1000000000000000000;
const doub... | 0 | 12,249,460 |
#include <iostream>
using namespace std;
int main(){
string S;
cin >> S;
for(auto& i:S){
if(i == '1') cout << "9";
else cout << "1";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
void solve() {
string str; cin >> str;
bool b1= 1, b2= 1;
int n= str.size();
for (int i= 0; i< n/ 2; i++) {
if (... | 0 | 1,204,449 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int n; cin>>n;
vector<vector<int>> info(n-1,vector<int>(3,0));
rep(... | 0 | 93,571,185 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #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 | 32,433,562 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a+c, min({a+d, b+c, b+d}));
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | 0 | 29,655,731 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 25,629,348 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, X;
cin >> A >> B >> X;
if((X-A) >= 0 && (X-A) <= B){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
#include <stack>
using namespace std;
using ll = long long;
using Pii = pair... | 0 | 79,427,949 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll H,W;
cin>>H>>W;
vector<string> vec(H);
for(ll i=0;i<H;i++) {
cin>>vec[i];
}
vector<vector<ll>> dp(H,vector<ll> (W,0));
dp[H-1][W-1]=1;
for(ll i=W-2;i>=0;i--) {
if(vec[H-1][i]=='#') {
dp[H-1]... | 0 | 28,384,189 |
#include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define LL long long
#define mp make_pair
#define pb push_back
int gcd(int a, int b) {
return (!b ? a : gcd(b, a % b));
}
i... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).begin... | 0 | 19,481,275 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string s;
cin >> s;
int N = 0;
N = s.size();
bool fi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int now = 1;
int cnt = 0;
rep(i, n) {
if (s[i] == (now + '0')) {
++cnt;
} else {
v.push_ba... | 0 | 2,644,585 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
typedef std::tuple<ll, ll, ll> t3;
constexpr ll INF = 1e15;
constexpr ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } r... | 0 | 16,161,367 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
string s, t;
cin >> s >> t;
bool a = true;
rep(i, s.size()){
if (s.at(i) != t.at(i)) a = false;
}
if (a) cout << ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 96,442,915 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> alp(26,0);
rep(i,n){
string s;
cin >> s;
vector<int> now(26);
rep(j,s.size()) now[s[j] - 'a'... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <sstream>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n;
cin >> n;
map<char,string> m;
m['1'] = ".,!? ";
m['2'] = "abc";
m[... | 0 | 74,021,635 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
i64 s;
cin >> s;
i64 x = (1000000000 - s%1000000000)%1000000000;
i64 y = (s+x) / 1000000000;
cout << "0 0 1000000000 1 " << x << " " << y << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const int mod = 1e9 + 7;
using namespace std;
int n, k;
int a[N];
long long s[N];
long long A[N], B[N];
int main()
{
ios_base::sync_with_stdio(0);
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> ... | 0 | 65,407,553 |
#include <iostream>
using namespace std;
void print_frame(int H, int W);
void print_bread(int W);
void print_meat(int W);
int main() {
int H, W;
while(cin >> H >> W){
if (H == 0 && W == 0) break;
print_frame(H, W);
}
}
void print_frame(int H, int W){
print_bread(W);
for (int h=2; h != H; ++h){
print_meat(W);... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vector<int> vi;
#define m1 make... | 0 | 18,703,895 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
ll ch(ll n)
{
ll r = 0;
while (n % 2 == 0)
{
n /=... | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define mod 1000000007
#define pb push_back
#define csl ios_base::sync_with_stdio(false); cin.tie(NULL)
#define reps(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) for(int i=0;i<int(b);i++)
#define first ff
#define second ss
typedef long long ll;
... | 0 | 19,022,992 |
#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>;
using Graph = vector<vector<int>>;
int main() {
int N;
string S, T;
cin >> N >> S >> T;
string ans;
rep(i, N) {
ans += S[i];
ans += T[i];
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <map>
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) + 1; i++)
#define all(vecto) vecto.begin(), vecto.e... | 0 | 36,178,126 |
#include <bits/stdc++.h>
using namespace std;
#define m 1046527
#define L 14
char T[m][L];
int h1(long long key){
return key%m;
}
int h2(long long key){
return 1+key%(m-1);
}
int h(long long key, int i){
return (h1(key)+i*h2(key))%m;
}
int charTonum(char c){
switch(c){
case 'A':
retu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
bool seen[10000][10000];
char S[10000][10000];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i !... | 0 | 880,477 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RFOR(i, a, b) for (int(i) = (a); (i) > (b); --(i))
#define SORT(x) sort(ALL((x)))
#define RSORT(x) sort(RAL... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 100,425,164 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int to, cost;
};
signed main() {
int K;
cin >> K;
vector<bool> vis(K, false);
deque<pair<int, int>> dq;
dq.push_back({1, 1});
while (!dq.empty()) {
pair<int, int> p = dq.front();
dq.pop_front();
int x = p.first, ... | #include <vector>
#include <iostream>
class Union_Find {
private:
std::vector<int> par;
std::vector<int> rank;
public:
Union_Find(int n) {
par = std::vector<int>(n);
rank = std::vector<int>(n);
for(int i=0; i<n; i++) {
par[i] = i;
rank[0] = 0;
}
}
int root(int x) {
if(par[x] == x)... | 0 | 54,609,104 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#i... | #include <iostream>
#include <algorithm>
bool sieve[1000000];
int main() {
int n;
sieve[0] = true;
sieve[1] = true;
while (std::cin >> n) {
if (n <= 1) {
std::cout << 0 << std::endl;
continue;
}
for (int i = 2; i*i <= n; ++i) {
if (!sieve[i]) {
for (int j = i + i; j <= n; j += i)
sieve[j] = ... | 0 | 25,853,819 |
#include <iostream>
using namespace std;
int main(){int k, x;cin >> k >> x;string s=(500*k>=x)?"Yes":"No";cout << s;} | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | 0 | 15,622,425 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll t,a,b,i,j,k,n;
cin>>n>>k>>a>>b;
i=0;
cout<<min(k,n)*a+max(i,(n-k))*b<<endl;
return 0;
} | #include <cstdio>
#include <string>
using namespace std;
void sshuffle(string &s, size_t h) {
string t=s.substr(0, h), u=s.substr(h);
s = u + t;
}
int main() {
while (true) {
char buf[1<<8];
scanf("%s", buf);
string s(buf);
if (s == "-") return 0;
size_t m;
sc... | 0 | 74,670,625 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long h, w;
cin >> h >> w;
char c[h][w];
char c2[2*h][w];
for(long long y = 0; y < h; y++){
for(long long x = 0; x < w; x++){
cin >> c[y][x];
}
}
for(long long y = 0; y < 2*h; y++){
... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int next_combination(int sub)
{
int x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
void solve(int b... | 0 | 47,972,846 |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int minj, k = 0, c;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = i + 1; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if(a[i]!=a[minj])
k... | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdint>
using namespace std;
unsigned long long int magicfunc(unsigned long long int *a,unsigned long long int n){
unsigned long long int sum=a[0],xsum=a[0],ans=0;
unsigned long long int l=0,r=0;
while(l... | 0 | 7,950,674 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
bool seen[10000][10000];
char S[10000][10000];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i !... | 0 | 95,309,297 |
#include<iostream>
using namespace std;
int main()
{
int n = 0;
int debt = 100000;
cin >> n;
for( int i = 0; i < n; i++ )
{
debt = debt * 105 / 100; ... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
string a,d[9];
d[0]=".,!? ",d[1]="abc",d[2]="def",d[3]="ghi",d[4]="jkl";
d[5]="mno",d[6]="pqrs",d[7]="tuv",d[8]="wxyz";
for(int i=0;i<n;i++){
cin>>a;
int count=-1;
for(int j=0;j<a.size();j++){
if(j!=0){
if(a[j]=='0'&&a... | 0 | 46,730,932 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, int> PL;
constexpr int mod = 1e9 + 7;
constexpr int INF = 2e9;
int main() {
int n;
cin >> n;
string s;
ci... | #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... | 0 | 44,323,289 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functiona... | #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 | 54,774,184 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define p... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 97,819,211 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> ab;
rep(i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 71,067,007 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> p(n);
ll j=1;
for(ll i=1;i<=n;i++){
j=1;
while(i+j-2<n){
p.at(i+j-2)++;
j+=i;
}
}
ll ans=0;
for(ll i=1;i<=n;i++){
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1006;
int X,Y,Z,K;
ll A[MAX_N],B[MAX_N],C[MAX_N];
void solve()
{
sort(A,A+X,greater<ll>());
sort(B,B+Y,greater<ll>());
sort(C,C+Z,greater<ll>());
vector<ll> v;
for(int i=0;i<X;++i)for(int j=0;j<Y;++j){
v.push_back(A[i]+B[j]);
... | 0 | 29,501,953 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
ll ans = 0;
ans += n - 1;
ans *= n;
ans /= 2;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 40,163,183 |
#include<bits/stdc++.h>
#pragma optimizer(O2)
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>... | #include <iostream>
#include <cmath>
using namespace std;
#define range(a, l, r) a >= l && r >= a
int main(){
double x1, y1, x2, y2, x3, y3, xp, yp;
double s, t;
while(cin >> x1){
cin >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp;
s = ((xp-x1)*(y3-y1)-(yp-y1)*(x3-x1)) / ((x2-x1)*(y3-y1)-(y2-y1)*(x3-x1));
t = ((xp-... | 0 | 81,972,332 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 1000000000
#define PB ... | #include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long int
#define nn cout<<"\n"
#define tcc int tc; cin>>tc; while(tc--)
#define arr(a,n) for(int i=0;i<n;i++) cin>>a[i]
#define all(a) a.be... | 0 | 91,843,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,k;
cin>>n>>k;
vector <ll> ans(0);
ll x;
for(ll i=1;i<=n;i++) cin>>x,ans.push_back(x);
sort(ans.begin(),ans.end());
ll now=0;
for(ll i=0;i<k;i++) now+=ans[i];
cout<<now;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
while (true) {
int h, w;
cin >> h >> w;
if (!h && !w) break;
string s1(w, '#');
string s2(w, '.');
s2[0] = '#';
s2[s2.size() - 1] = '#';
cout << s1 << "\n";
if (h > 2)
... | 0 | 11,847,217 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<'\n';
#define debug(a,b,c) cout << a << " " << b << " " << c << endl;
#de... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, d, a;
cin >> n >> d >> a;
pair<int, int> pairs[n];
for (int i = 0; cin >> pairs[i].first >> pairs[i].second; ++i) {}
sort(pairs, pairs + n);
int64_t diff[n];
diff[0] = pairs[0].second;
for (int i = 1; i < n; ++i) {
dif... | 0 | 18,402,201 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
if (a.size() > b.size()){
cout << "GREATER" << endl;
}
else if (a.size() == b.size()){
if (a>b){
cout << "GREATER" << endl;
}
else if (a==b){
cout << "EQUAL" << endl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define sf scanf
#define pf printf
#define pb push_back
#define llu unsigned long long
#define U unsigned int
#define SIZE 100005
#define pie 3.14159265358979323
#define minuss 1e-6
#define fast_cin ios_base::sync_with_stdio(false)... | 0 | 10,319,636 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << (double) t / x << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin>>n>>k;
vector<int> stone(n);
for (int i=0;i<n;i++)
cin >> stone[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j <= i + k; j++)
... | 0 | 85,316,112 |
#include <bits/stdc++.h>
using namespace std;
long money = 100000;
void up() {
int judge = money % 1000;
if(judge) {
money -= judge; money += 1000;
}
}
int main(void) {
int n; cin >> n;
for(int r = 0; r < n; r++) {
money *= 1.05; up();
}
cout << money << endl;
return(0);
... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 0 | 28,892,018 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include<bits/stdc++.h>
int main()
{
int n;
std::cin >> n;
std::vector<std::pair<int,int>> red(n), blue(n);
for(int i = 0; i < n; i++)std::cin >> red[i].first >> red[i].second;
for(int i = 0; i < n; i++)std::cin >> blue[i].first >> blue[i].second;
std::sort(red.begin(),red.end());
std::sort(... | 0 | 65,224,741 |
#include <iostream>
#include <vector>
#include <iomanip>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int N; cin >> N;
vector<int> t(N), v(N);
int T = 0;
REP(i, N) { cin >> t[i]; T += t[i]; }
REP(i, N) cin >> v[i];
vector<double> maxv(2*T + 1, 1e10);
maxv[0] = maxv[2*T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD... | 0 | 17,377,754 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
cin >> n;
vi b(n-1);
rep(i,n-1) cin >> b.at(i);
vi a(n);
rep(i,n-1){
if (i == 0){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | 0 | 75,966,099 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
#define _USE_MATH_DEFINES
#include <math.h>
int main() {
ll n,m;cin>>n>>m;
ll sum=0;
for(ll i=0;i<m;i++){
ll now;
cin>>now;
sum+=now;
}
if(sum<=n){
cout << n-sum;
}
else{
cout << -1;
}
retur... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
void debug() { cerr << "\n"; }
t... | 0 | 53,606,386 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include<bits/stdc++.h>
using namespace std;
int main() {
int x[12];
int y[12];
scanf("%d %d %d",&x[0],&x[1],&x[2]);
scanf("%d %d %d",&x[3],&x[4],&x[5]);
scanf("%d %d %d",&x[6],&x[7],&x[8]);
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&y[i]);
for(int i = 0 ;... | 0 | 73,083,139 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
#define _GLIBCXX_DEBUG
vector<bool> seen;
int dfs(const Graph &G, ll v) {
seen[v] = true;
int score = 0;
for (auto next_v : G[v]) {
if (seen[next_v]) continue;
dfs(G, next_v);
}
... | #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 n,k,num;... | 0 | 99,813,368 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int l[n];
for(int i=0; i<n; i++) {
cin >> l[i];
}
sort(l,l+n);
reverse(l,l+n);
int ans=0;
for(int i=0; i<k; i++) {
ans+=l[i];
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int dp[1001][1001];
int main() {
string a, b; cin >> a >> b;
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = 0;
rep(i, a.size() + 1)rep(j, b.size() + 1) {
if (i < a.size())dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1);
if (j == b.size... | 0 | 56,421,577 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 31,939,718 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, max=0, s[100];
for(int i=0; i<100; i++) {
s[i]=0;
}
while(cin >> n) {
s[n-1]++;
}
for(int i=0; i<100; i++) {
if(s[i]>max)
max=s[i];
}
for(int i=0; i<100; i++) {
if(s[i]==max)
cout << i+1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
void solve(){
ll h,w;
cin >> h >> w;
ll ans = INF;
for(ll i=1; i<w; i++){
ll x,y,z;
x=h*i;
if(h... | 0 | 31,065,409 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define all(a) a.begin(), a.end()
#define All(a) a.rbegin(), a.rend()
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.precision(10), cout << fixed
int main()
{
ios;
int n;
cin >> n;
doubl... | #include<iostream>
#include<cstdlib>
using namespace std;
int main(){
int n;
while(cin >> n,n){
int a[n];
for(int i=0; i<n; ++i){
cin >> a[i];
}
int ans = 1000000;
for(int i=0; i<n; ++i){
for(int j=i+1; j<n; ++j){
if(abs(a[i]-a[j]) < ans){
ans = abs(a[i]-a[j]);
... | 0 | 97,511,136 |
#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()
const ll INF = 1LL << 60;
int main(){
char b;
cin >> b;
if(b=='A'){
cout << 'T' << endl;
}
else if(b=='T'){
cout << 'A' << end... | #include <algorithm>
#include <iostream>
#include <string>
int main() {
using namespace std;
string s;
cin >> s;
int ans_0 = 0;
int ans_1 = 0;
for (size_t i = 0UL; i < s.length(); ++i) {
if (i % 2UL) {
if (s.at(i) == '1') {
ans_1++;
} else {
... | 0 | 11,905,041 |
#include <bits/stdc++.h>
#include<algorithm>
#include<math.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i,a,... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 75,987,664 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
rep(i, n+1) cin >> a[i];
rep(i, n) ci... | 0 | 4,632,926 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define LINT long long
class unionfind{
public:
int Num;
vector<int> par;
vector<int> height;
vector<int> diff_weight;
unionfind(int N):
par(... | #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 | 40,350,579 |
#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>;
const int INF = 1<<29;
void chmin(int &a, int b){if(a > b) a = b;}
int n, A, B, C;
vect... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) (a).begin(),(a).end()
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){... | 0 | 71,468,135 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.