code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int ans = 0;
for(int i=0;i<3;i++){
if(a.at(i)!=b.at(2-i)) ans=1;
}
if(ans) cout << "NO";
else cout << "YES";
} | #include<bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx... | 0 | 26,382,438 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | #include <iostream>
#include <string>
using namespace std;
int main(void){
long long int N,H,W,i,j,k,ans,count;
string S;
bool flag;
count=0;
ans=0;
flag=false;
cin >> H>>W;
if (H==1 || W==1){
ans=1;
}
else if (H%2==1 && W%2 ==1){
ans=H*W/2+1;
}
else{
... | 0 | 87,733,655 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
short A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
scanf("%d",&n);
for (int i = 0; i < 10002; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d",&A[i]);
if (A[i] ... | #include <bits/stdc++.h>
using namespace std;
template<class Func, class Callback, class T>
void recurse(int from, int to, Func f, Callback cb,
int& i, T& p, T q) {
if (p == q) return;
if (from == to) {
cb(i, to, p);
i = to; p = q;
} else {
int mid = (from + to) / 2;
recurse(from, mid, f, cb, i,... | 0 | 31,930,966 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,a,b;
cin >> N;
vector<int> G[N];
for (cin >> M; M; M--) {
cin >> a >> b;
G[--a].push_back(--b);
G[b].push_back(a);
}
queue<int> q;
int d[N];
vector<bool> visited(N);
for (q.push(0), d[0] = 0, visited[0] = true; !q.empty(); ... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 45,382,736 |
#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 +... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N;
cin >> N;
ll ans = 1e8;
vector<ll> six(0), nine(0);
int tmp = 1;
while (true) {
six.push_back(tmp);
tmp *= 6;
if (N < tmp) break;
... | 0 | 86,743,423 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #include <cstdio>
#include <algorithm>
using namespace std;
int MatrixChainMaltiplication(int *p, int n) {
int m[n+1][n+1];
for (int i=0; i<=n; i++) m[i][i] = 0;
for (int l=2; l<=n; l++) {
for (int i=1; i<=(n-l+1); i++) {
int j = i + l - 1;
m[i][j] = (1 << 21);
fo... | 0 | 77,873,198 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1000000007;
ll f[101010], rf[101010];
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1) res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
void init() {
... | #include <bits/stdc++.h>
using namespace std;
int apple[3][100005], need[2], siz[3];
int main() {
int x, y, a, b, c;
scanf("%d%d%d%d%d", &need[0], &need[1], &siz[0], &siz[1], &siz[2]);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < siz[i]; j++) {
scanf("%d", &apple[i][j]);
}
sort(apple[i], apple[i] + siz... | 0 | 86,216,571 |
#include <stdio.h>
int main()
{
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d", &H1, &M1, &H2, &M2, &K);
int totalHours = (H2-H1)*60;
int totalMinutes = M2-M1;
printf("%d\n", totalHours+totalMinutes-K);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pii>
#define Mi map<int,int>
#define mii ... | 0 | 51,015,224 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int e1_x= x2- x1;
int e1_y= y2- y1;
int e2_x= -e1_y;
int e2_y= e1_x;
int x3= x2+ e2_x;
int y3= y2+ e2_y;
int x4= x1+ e2_x;
int y4= y1+ e2_y;
cout << x3 <<" "<< y3 <<" "<< x4 <<" "<< y4 << endl;... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | 0 | 95,226,179 |
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int n;
int sm;
while(cin>>n&&n){
n=1000-n;
sm=0;
while(n>=500){
n-=500;
sm++;
}
while(n>=100... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 0 | 36,786,324 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
#define debug cout << "Ok" << endl;
using namespace std;
int solve(int n){
return ( (... | #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... | 0 | 81,339,354 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<string> grid(n);
rep(i, n) cin >> grid[i];
int ans = 0;
for (int a = 0; a < n; a++) {
bool can = true;
rep(i, n) {
... | 0 | 67,868,577 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 100... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 0 | 73,756,517 |
#include <iostream>
#include <iomanip>
#include <cmath>
#define PI 3.14159265359
using namespace std;
int main(){
double a, b, C, S, L, h;
cin >> a >> b >> C;
C = C * PI / 180;
h = b * sin(C);
S = a * h / 2;
L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(C));
cout << fixed << setprecision(9) << S << endl << L... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 100000
int main(){
string s;
cin >> s;
int n = s.length();
int ans = INF;
for(int i = 0; i < n-2; i++){
... | 0 | 38,997,650 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int c[1000010];
int main(){
in... | #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 | 23,704,383 |
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
map<int,int> mp;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
mp[a] = i;
}
for (int i = 1; i <= n; ... | 0 | 7,832,675 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<tuple>
#define LL long long
#define TT std::tuple<int,int,int>
int ans;
int sx, sy;
int dx[] = { 0,1,-1,0 };
int dy[] = { -1,0,0,1 };
int W, H, N;
char map[1010][1010];
bool used[1010][1010];
int bfs(int &sx,int &sy,char m) {
std::queue<T... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
int main(void){
while(true){
int m,n,p;
... | 0 | 8,083,847 |
#include <bits/stdc++.h>
using namespace std;
int N, L;
int main()
{
cin >> N >> L;
string arr[N];
for (int i = 0 ; i < N ; i ++) {
cin >> arr[i];
}
sort (arr, arr + N);
for (int i = 0 ; i < N ; i ++) {
cout << arr[i];
}
return 0;
} | #include<iostream>
using namespace std;
void BubbleSort(char C[36][2], int N){
for(int i = 1; i < N; i ++){
for(int j = N - 1; j >= i; j --){
if(C[j][1] < C[j - 1][1]){
char temp[2];
temp[0] = C[j][0];
temp[1] = C[j][1];
C[j][0] = C[j- 1][0];
C[j][1] = C[j- 1][1];
C[j - 1][0] = temp[0];
... | 0 | 63,248,778 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n,d;
cin >> n >> d;
int x[n][d];
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0;i<n-1;i++){
int wa = 0;
for(int j=i+1;j<n;j++){
wa = 0;
for(int k=0;k<d;k++){
wa += (x[i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
int n;
cin>>n;
string s,t;
while(n--){
cin>>s>>t;
int si=0;
rep(i,s.size()... | 0 | 18,935,747 |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using ll = long long;
int main() {
FASTIO
int n, x, t;
cin >> n >> x >> t;
int ans = ((n/x) + (n%x != 0))*t;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
int cnt = 0, c = 0;
for (int i = 0; i < S.size(); i++) {
if (!i) {
if (S.at(i) != 'A') {
cout << "WA" << endl;
return 0;
}
}
... | 0 | 6,584,187 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int k;
cin >> k;
const int INF = 9 * 5;
vector<int> d(k, INF);
deque<int> st;
st.push_front(1);
d[1] = 1;
while (!st.empty()) {
auto cur = st.front(); st.... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ll long long
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define VAR(v, i) __typeof( i) v=(i)
#define forit(i, c) for(VAR(i, (c).begin()); i != (c)... | 0 | 90,143,459 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
string s;
cin >> n >> s >> k;
k--;
for(int i = 0; i < n; i++){
s[i] = (s[i] == s[k] ? s[i] : '*');
}
cout << s << endl;
} | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <cstring>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <s... | 0 | 32,584,400 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbeg... | #include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,L,T;
int pos[N],v[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++) scanf("%d%d",&pos[i],&v[i]),v[i]=v[i]==1? 1:-1;
vector<int> fin;
for(int i=1;i<=n;i++)
fin.push_back(((pos[i]+v[i]*T)%L+L)%L);
int pos1=fin[0]... | 0 | 13,327,702 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;
int main() {
... | #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
ty... | 0 | 59,077,731 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
string s;
cin >> s;
for(int i = 0; i < 1000; i++) {
vector<int> v(3);
v[0] = i % 10;
v[1] = (i % 100) / 10;
v[2] = i / 100;
int idx = 0;
for(int j = 0; j < n; j++) {
if(s[j] - '0' == v[idx]) idx+... | #include <cstdio>
int main() {
int h, w;
while (1) {
scanf("%d %d", &h, &w);
if (!h && !w) break;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if ((i > 1 && i < h) && (j > 1 && j < w))
putchar('.');
else
putchar('#');
}
puts("");
}
puts("");
}
} | 0 | 8,946,745 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vl vector... | 0 | 97,252,155 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 51,136,686 |
#include<iostream>
int main(){
long long int M,c,d,ans,count;
std::cin>>M;
ans=0;
count=0;
for(long long int i=0;i<M;i++){
std::cin>>d>>c;
ans+=c;
count+=c*d;
}
ans=ans+(count-1)/9-1;
std::cout<<ans<<std::endl;
return 0;
} | # include <iostream>
using namespace std;
long long numbers[500005];
long long sum=0;
string S;
int main()
{
numbers[0]=0;
cin>>S;
for (int i=0; i<S.size(); i++)
{
if (S[i]=='<')
{
numbers[i+1]=numbers[i]+1;
}
}
for (int i=S.size()-1; i>=0; i--)
{
... | 0 | 50,949,474 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
ll ans = 1;
int odd = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
odd += a%2;
ans *= 2;
}
if (odd == 0) {
if (p == 0) {
cout << ... | #include<iostream>
using namespace std;
#include<stdio.h>
typedef struct box { int val; box *prev, *next; } box_t;
box_t* init()
{
box_t* head = new box_t;
head->val = -1;
head->next = NULL;
head->prev = NULL;
return head;
}
box_t* make_tail(box_t* head)
{
box_t* tail = new box_t;
tail->val ... | 0 | 42,285,005 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
long long a[MAXN];
vector<int> adj[MAXN];
vector<long long> c[MAXN];
int n;
bool b = 1;
long long dfs(int v, int p = -1){
if(adj[v].size() == 1){
return a[v];
}
long long sum = 0;
for(int i = 0; i < adj[v].size(); i++){
... | #include <bits/stdc++.h>
#include <cstring>
#include <ctype.h>
#include<stdlib.h>
#define flin freopen("input.txt", "r", stdin);
#define flout freopen("output.txt", "w", stdout);
#define ll long long
#define ull unsigned long long
#define fastio ios_base::sync_wit... | 0 | 70,783,097 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#d... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 0 | 69,532,462 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <numeric>
#include <math.h>
#include <climits>
#include <stack>
#include <iomanip>
#include <sstream>
using namespace std;
template <typename T>
inline bool sign(T A) {
return (A>0)... | #include<bits/stdc++.h>
using namespace std;
long long int c[10005];
int main(){
string S;
long long int N,P,i;
long long int tmp = 0;
long long int count = 0;
long long int ten=1;
cin >> N >> P;
cin >> S;
if(P==2 || P==5){
for(i=0;i<S.length();i++)if((S[i]-'0')%P==0)count+=(i+1)... | 0 | 42,982,336 |
#include <stdio.h>
int main (){
char p;
scanf("%c", &p);
p++;
printf ("%c", p);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N; long long K;
cin >> N >> K;
vector<pair<long long, long long> > v(N);
for (int i = 0; i < N; ++i) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
long long res = 0;
long long sum =... | 0 | 19,354,029 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
#define fi first
#define se second
#define sc scanf
#define pr printf
#define pb push_back
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = (1LL<<40);
using name... | #include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
const int mx = 40;
vector<vector<int>> ex(mx);
for (int i = 0, a, a_; i < n; i++) {
cin >> a;
a_ = a... | 0 | 48,539,293 |
#include<stdio.h>
int main(){
int D;
scanf("%d",&D);
printf("Christmas");
D-=25;
while(D++)
printf(" Eve");
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
vector<int> A(N);
rep(i, N)
{
cin >> A[i];
}
std::sort(A.be... | 0 | 34,352,041 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 57,687,129 |
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
using namespace std;
char buf[1001];
map<string, int> cnt;
string mode;
string longest;
int main() {
while (1) {
if (scanf("%s", buf) != 1) break;
string word = buf;
int n = strlen(buf);
if (n > longest.size()) longest = buf;
++... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int s[100];
int sum;
cin >> n;
while(n > 2){
for(int i=0; i<n; ++i){
cin >> s[i];
}
sort(s, s+n);
sum=0;
for(int i=1; i<(n-1); ++i){
sum+=s[i];
}
cout << sum/(n-2) << endl;
cin >> n;
}
return 0;
} | 0 | 70,198,115 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 44,983,697 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
using names... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; cin>>n;
map<int, int> mp;
for(int i = 1; i <= n; i++){
int x; cin>>x; mp[x]++;
if(... | 0 | 87,226,018 |
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
int n;
ll m,p,v;
ll a[MAXN];
bool check(int x){
ll cnt = (v - (p - 1)) * m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(const int n, const int m, ll x, vector<ll> c, vector<vector<ll>> a) {
const int bit = 1 << n;
ll res = -1;
for(int i=0; i< bit; i++) {
ll cost = 0;
vector<ll> temp(m, 0);
for(int j=0;j<n;j++) {
if(i & (1 << j)) {
cost +... | 0 | 51,914,916 |
#include<bits/stdc++.h>
int main(){ int n,a; std::cin>>n>>a; std::cout<<(n*n)-a<<"\n"; return 0; } | #include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 500000001000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans, cnt;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;... | 0 | 44,134,772 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if(s.at(0) == '1')s.at(0) ='9';
else if(s.at(0) == '9')s.at(0) ='1';
if(s.at(1) == '1')s.at(1) ='9';
else if(s.at(1) == '9')s.at(1) ='1';
if(s.at(2) == '1')s.at(2) ='9';
else if(s.at(2) == '9')s.at(2) ='1';
cou... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
int dp[1100][2][6];
signed main(){
string N;
cin >> N;
int K;
cin >> K;
dp[0][0][0] = 1;
for( int i = 0; i < N.size(); i++ ){
for( int k = 0; k <= K; ... | 0 | 5,890,359 |
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 0 | 78,510,729 |
#include<iostream>
using namespace std;
int main() {
int data_lim;
cin >> data_lim;
for(int cnt=0;cnt<data_lim;cnt++) {
int a,b,c;
cin >> a >> b >> c;
bool flg = false;
if(a*a == b*b+c*c)
flg = true;
else if(b*b == a*a+c*c)
flg = true;
else if(c*c == a*a+b*b)
flg = true;
if(flg == true)
cou... | #include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
int w, h, n, x, y, a, x1, x2, y1, y2;
int main() {
cin >> w >> h >> n;
x1 = y1 = 0, x2 = w, y2 = h;
while (n--) {
cin >> x >> y >> a;
switch (a) {
case ... | 0 | 12,973,508 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
int main(){
std::string s;
int n;
std::cin >> s >> n;
for (int i = 0; i < n; i++) {
std::string op;
int a, b;
std::cin >> op >> a >> b;
if (op == "print") {
... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 100005;
struct Edge {
int next, to;
Edge(int a=0, int b=0) : next(a), to(b) {}
} e[maxn << 1];
int head[maxn], tot = 1;
void Add(int u, int v) {
e[++tot] = Edge(head[u], v); head[u] = tot;
}
int... | 0 | 35,109,505 |
#include <bits/stdc++.h>
using namespace std;
long long int solve(int n,int k,int v[])
{
long long int dp[n+1][k+1];
long long int m=pow(10,9)+7;
for(int i=0;i<=k;i++)
{
dp[1][i]=(i>v[1])?0:1;
}
for(int i=2;i<=n;i++)
{
for(int j=0;j<=k;j++)
{
if(j==0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
bool comp(string a, string b){
if(b == "-") return true;
if(a == "-") return false;
if(a.size() > b.size()) return true;
if(a.size() < b.size()) return false;... | 0 | 15,482,282 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
class Dice {
private:
std::vector<int> number;
std::vector<int> initialize();
std::string order_list;
void decide_order();
void decide_slide();
int times;
int top;
int front;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio... | 0 | 96,579,531 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main(){
int N; cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) \
for (int i = static_cast<int>(a); i < static_cast<int>(b); ++i)
#define rep(...)... | 0 | 44,394,412 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int a[4];
rep(i,4)cin>>a[i];
cout<<min(a[0], a[1])+min(a[2], a[3])<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long;
using namespace std;
const ll mod = 1000000007;
template <class Abel> struct BIT2D {
int H, W;
vector<vector<Abel>> data;
Abel UNITY = 0;
BIT2D(int H_, int W_) { init(H_, W_); }
void init(int H_, int W_) {
... | 0 | 44,247,633 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T> inline bool chma... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
ll solve(vector<ll> ... | 0 | 94,488,802 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<iomanip>
#include<queue>
#include<cmath>
#include<stack>
#include <map>
#define ll long long int
#define skip cin>>ws;
#define vll vector<ll>
#define vb vector<bool>
#define vpll vector<pair<ll,ll>>
#define vvll vector<vector<ll>>
#define p... | 0 | 40,824,960 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string s1,s2;
cin >> s1 >> s2;
reverse(s2.begin(), s2.end());
if(s1 == s2) cout << "YES" << endl;
else cout << "NO" << en... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int mod=1000000007;
const int INF=1001001001;... | 0 | 59,841,278 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
vector <int> ad[N], kid[N];
int n;
bool dp[N][2];
void solve(int v, int p) {
if (ad[v].size() == 1 && p != 0) {
dp[v][0] = 1;
dp[v][1] = 0;
return;
}
int cnt0 = 0, cnt1 = 0;
for (auto u: ad[v]) {
if (u == p)
continue;
solve(u, v);
c... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007;
int dp[1001][1001];
int solve(vector<vector<char>>&v,int x1,int y1,int x2,int y2)
{
if(dp[x1][y1]!=-1)
return dp[x1][y1];
if(x1==x2&&y1+1==y2)
return dp[x1][y1]=1;
if(y1==y2&&x1+1==x2)
return dp[x1][y1]=1;
int o... | 0 | 50,493,092 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n);
rep(i,m) {
s[i] = 0;
int c;
cin >> c;
rep(j,c){
int t;
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int mod=pow(10,9)+7;
int main(){
ll n,k;
cin>>n>>k;
ll arr[n];
for(ll i=0;i<n;i++){
cin>>arr[i];
}
int dp[n+1][k+1];
for(int i=0;i<=k;i++)dp[0][i]=1;
for(int i=0;i<=n;i++)dp[i][0]=1;
for(int i=1;i<=n;i++){
... | 0 | 51,923,695 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c) cout << '1';
else if(a==b) cout << '2';
else if(c==b) cout << '2';
else if(a==c) cout << '2';
else cout << '3';
return 0;
} | #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<string> VS;
typedef p... | 0 | 90,126,201 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
typedef pair<ll, ll> P;
int main() {
string s; cin >> s;
set<char> S;
for (auto c: s) {
if (S.count(c)) {
cout << "no" << endl;
return 0;
}
S.inse... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <functional>
#include <set>
#include <numeric>
#define ll long long int
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int x, y, ans;
ll K, num=0;
cin >> x >> y;
rep(i, x){
if ((x * 4 >=... | 0 | 40,150,133 |
#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<tuple>
#include<bitset>
#include<iomanip>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int ind... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 77,918,185 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 65,814,926 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string ans;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0' || s.at(i) == '1') {
ans += s.at(i);
}
else {
if (ans.size() > 0) {
ans.pop_back();
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> x(N), y(N);
vector<ll> xAry(N), yAry(N);
rep(i, N) {
cin >> x... | 0 | 94,560,109 |
#include<bits/stdc++.h>
using namespace std;
int n,k,a[200100],cnt[400100];
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++) scanf("%d",a+i);
while(k--)
{
bool flag=0;
for(int i=1;i<=n;i++) if(a[i]<n) flag=1;
if(!flag) break;
for(int i=1;i<=n;i++) cnt[i]=0;
for(int i=1;i<=n;i++) cnt[max(1,i-a[i])]++,cnt[i+a[... | #include <stdio.h>
#define MAX 101
int A[MAX][MAX], s[MAX], h[MAX];
void serch(int x, int y){
int i;
h[x] = y;
for(i=1; i<=s[x]; i++){
if(h[A[x][i]] > y)
serch(A[x][i], y+1);
}
}
int main(){
int i, j, k, n;
scanf("%d", &n);
for(i=1; i<=n; i++){
h[i] = 10000;
for(j=1; j<=n; j++)
A[i... | 0 | 98,980,543 |
#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;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> array(n),parray(n),qarray(n);
for(int i=0;i<n;i++) cin >> parray.at(i);
for(int i=0;i<n;i++) cin >> qarray.at(i);
int num = 1;
for(int i=0;i<n;i++){
ar... | 0 | 51,791,026 |
#include <cstdio>
using namespace std;
int main() {
long NUM = 1000000;
long n;
long counter = 0;
bool primeNum[NUM + 10];
long i, ii, j, len = NUM + 10;
primeNum[0] = primeNum[1] = false;
for (i = 2; i < len; i++) primeNum[i] = true;
ii = 4;
for(i = 2; ii < NUM;) {
if (primeNum[i]) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p; cin >> n >> p;
string s; cin >> s;
ll r=0, ans=0, acc=1;
if (p == 2) {
for (int i = 0; i < n; i++) {
if ((s[i]-'0')&1^1) ans+=i+1;
}
cout << ans;
return 0;
}
if (p == 5) {
for (int i = 0; i < ... | 0 | 84,614,940 |
#include<algorithm>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vect... | #include <cstdio>
#include <cctype>
using namespace std;
int main(void){
char ch;
while(1){
scanf("%c",&ch);
if(!isalpha(ch)){
printf("%c",ch);
if(ch=='\n')break;
continue;
}
if(isupper(ch))printf("%c",tolower(ch));
else printf("%c",tou... | 0 | 46,862,623 |
#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>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf=1010001000;
const ll INF=1001000100010001000;
const int mod=(int)1e9+7;
int main(){
ll n;
cin>>n;
vector<ll>a(n),... | 0 | 24,220,023 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
#define repi(i,a,b) for (int i=a;i<(b);i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
if(a+b==15){
cout<<'+'<<endl;
}else if(a*b==15){
cout<<"*"<<endl;
... | #include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<int> V(N);
for(int i = 0; i < N; ++i) cin >> V[i];
map<int, int> odd, even;
for(int i = 0; i < N; ++i){
if(i%2 == 0)... | 0 | 71,138,386 |
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
double x1,x2,y1,y2,takasa,yoko,kyori,takasa2,yoko2,goukei;
cin>>x1>>y1>>x2>>y2;
takasa=y2-y1;
yoko=x2-x1;
takasa2=takasa*takasa;
yoko2=yoko*yoko;
goukei=takasa2+yoko2;
kyori=sqrt(goukei)... | #include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long N, long long M, std::vector<std::string> A, std::vector<std::string> B){
bool ans = false;
REP(i, N - M + 1) REP(j, N - M + 1) {
... | 0 | 1,554,933 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const ll INF = 1000000007;
vector< vector<ll> > M(110, vector<ll>(110, 0));
vector<ll> P(110);
int N;
ll multiplication(){
for(... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 58,762,673 |
#include <iostream>
using namespace std;
int main() {
char ch;
int counter[26] = { 0 };
while (cin >> ch) {
ch = tolower(ch);
int num = ch - 'a';
counter[num]++;
}
for (int i = 0;i < 26;i++)
cout << (char)(i + 'a') << " : " << counter[i] << endl;
} | #include <iostream>
#include <map>
using namespace std;
map<int,int> mp,ind;
typedef long long ll;
ll imos[400010] = {};
int main(){
ll i,n,d,a;
cin >> n >> d >> a;
for(i=0;i<n;i++){
int x,h; cin >> x >> h;
mp[x] += h; mp[x + 2*d + 1] += 0;
}
int now = 0;
for(auto x:mp){
... | 0 | 62,353,515 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main()
{
ll Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
H = min(H, 2 * Q);
S = min(S, 2 * H);
if (2 * S <= D)
{
cout << N * S << endl;
}
else
{
cout << (N / 2) * D + (N % 2)... | #include <iostream>
#include <set>
using namespace std;
int main()
{
int s;
cin >> s;
set<int> st;
st.insert(s);
for(int i=0; i<1000000; i++)
{
if(s % 2 == 0)
s /= 2;
else
s = 3 * s + 1;
if(st.find(s) != st.end())
{
cout << i+2 << endl;
return 0;
}
else
... | 0 | 3,717,821 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(500*A<B){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<pair<int,int>, int>> city(M);
vector<pair<int, int>> ans(M);
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
pair<int, int> p = make_pair(P,Y);
city[i] = make_pair(p, i);
pair<int, int> q... | 0 | 33,559,510 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string S; cin>>S;
int ans=INF;
rep(i,S.length()-2){
int a[3];
int X=0;
rep(j,3){
a[j]=S[i+j]-'0';
X+=pow(10,2-j)*a[j];
}
ans=min(ans,abs(X-753));
}
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, C, k; cin >> n >> C >> k;
vector<int> t(n);
rep(i, n) {
cin >> t[i];
}
sort(t.begin(), t.end());
int ans = 0;
for (int i = 0; i < n; i++) {
... | 0 | 90,547,908 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 88,353,346 |
#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <random>
#include <utility>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | 0 | 99,630,063 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main(){
int N;
cin >> N;
if(N < 1200) cout << "ABC" << endl;
else if(1199 < N && N < 2800) cout << "ARC"... | #include <bits/stdc++.h>
using namespace std;
int n, k, g, maxi, a;
int main() {
cin >> n >> k >> g;
maxi = g;
n--;
while (n--) {
cin >> a;
g = gcd(g, a);
maxi = max(maxi, a);
}
cout << ((k % g == 0 && k <= maxi) ? "POSSIBLE" : "IMPOSSIBLE") << '\n';
return 0;
} | 0 | 21,961,537 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b) cout << "Draw" << "\n";
else if(a==1) cout << "Alice" << "\n";
else if(b==1) cout << "Bob" << "\n";
else if(a>b) cout << "Alice" << "\n";
else cout << "Bob" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string a;
cin>>a;
if(a.at(0)!='A'){
cout<<"WA"<<endl;
return 0;
}
for(ll i=2;i<a.size()-1;i++){
if(a.at(i)=='C'){
a.at(i)='z';
break;
}
if(i==a.size()-2){
cout<<"WA"<<endl;
return 0;
... | 0 | 54,329,174 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main(){
ll n;
cin >> n;
vector<ll>a(n),b(n);
for(int i=0; i<n ;i++) cin >> a[i];
for(int i=0; i<n; i++) cin >> b[i];
vector<ll>d(n);
for(int i=0; i<n; i++) d[i] = a[i] - b[i];
ll counta = 0;
for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 1;
int x = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) != a){
x ++;
}
else {
a ++;
}
}
if (x == N)
... | 0 | 21,758,241 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
int N, M;
... | 0 | 27,833,632 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<int>> ans(H, vector<int>(W));
for (int i = 0; i < H - B; i++) {
for (int j = 0; j < W - A; j++) {
ans[i][j] = 1;
}
}
for (int i = H - B; i < H; i++) {
... | #include <iostream>
#include <stack>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
string s;
cin >> s;
int n = s.length();
stack<char> t;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (t.empty()) {
t.push(s[i]);
continue;
}
... | 0 | 69,765,946 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long... | #include<cstdio>
#include<iostream>
using namespace std;
const int N = 2e5+10;
int n,t,a[N];
int main()
{
cin>>n>>t;
for (int i = 0 ; i < n ; i++)
scanf("%d",&a[i]);
long long ans = 0;
for (int i = 1; i < n ;i++)
{
ans += min(t, a[i] - a[i-1]);
}
ans+=t;
cout<<ans<<endl;
return 0;
} | 0 | 44,816,209 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main(){
long long N, K;
cin >> N >> K;
string S;
cin >> S;
vector<long long> raw;
int flag;
if(S[0] == '0') flag = 0;
else flag = 1;
raw.push_back(0);
int cnt = 1;
for(int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 48,309,005 |
#include <cstdio>
int main()
{
long long x, y;
scanf("%lld%lld", &x, &y);
if (x % y == 0)
{
puts("-1");
return 0;
}
printf("%lld\n", x * (y - 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, W, K, ans = 0;
cin >> H >> W >> K;
vector<char> board(H * W);
for (int i = 0; i < H; i++){
string C;
cin >> C;
for (int j = 0; j < W; j++){
board.at(i * W + j) = C.at(j);
}
}
for (int bit = 0; bit < (1 << H); bit++){
... | 0 | 68,679,103 |
#include<iostream>
using namespace std;
class Dice {
public:
int *num;
Dice(int *n) {
num = n;
}
void move(char c) {
int n[6];
for (int i = 0; i < 6; i++) {
n[i] = num[i];
}
if (c == 'N') {
nu... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define rep1(i,n) for (int i=1; i<=(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fst first
#define scd second
#define pb push_back
using namespace std;
using ll = long long;
u... | 0 | 76,544,167 |
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <algorithm>
#include <array>
using namespace std;
template<typename T>
void execute(T& cin) {
size_t n;
cin >> n;
vector< vector<int> > grapthMatrix(n, vector<int>(n,0));
for (size_t i = 0; i != n; ++i) {
size_t u;
size_t k;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
l... | 0 | 75,783,304 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) cout << "... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(decltype(n) i=0; i<(n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define st first
#define nd second
#define pb push_back
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
void solve(){
int n,k,a,b;
cin>>n>>k;
vector<... | 0 | 21,847,613 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for(int i = 0; i < (int)n; i++)
void solve() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1; i <= b; i++) {
if (a*i % b == c) {
... | 0 | 96,233,157 |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cctype>
#define MAX 32
using namespace std;
class MCXI{
string s;
int N,m,c,x,i;
public:
MCXI():N(0),m(0),c(0),x(0),i(0){}
MCXI(const char *s){
unsigned int len = strlen(s);
this->N = 0;
for(unsigned int i = 0; i < len; ++i){
i... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
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)
{
... | 0 | 66,568,135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, num = 1;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int squareNum = num * 2;
int kplus = num + k;
if (squareNum < kplus) {
num = squareNum;
} else {
num = kplus;
}
}
cout << num << endl;
} | #include <bits/stdc++.h>
using namespace std;
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int N; cin>>N;
vector<int> A(N);
rep(i,N){
cin>>A.at(i);
}
int A_total = accumulate(A.begin(),A.en... | 0 | 20,482,902 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,a,n) for(int (i)=(a); (i)<(int)(n); (i)++)
#define rep(i,n) REP(i,0,n)
#define vec vector
int main(){
int N, A, B;
cin >> N >> A >> B;
if((A-B)%2==0){
cout << "Alice";
}else{
cout << "Borys";
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 | 80,016,585 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | #include <bits/stdc++.h>
#define rep(i, m, n) for(int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " ";} cout << endl;
#define printa2(x,m,n) for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ cout << x[i][j] << " ";} cout << endl;}
#d... | 0 | 78,774,646 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i,j,c,d,an=0,k,mod;
mod=1000000007;
cin>>n;
ll ar[n+2];
for(i=0;i<n;i++)
{
cin>>ar[i];
}
for(i=0;i<60;i++)
{
k=(1LL<<i);
c=0;
d=0;
for(j=0;j<n;j++)
{
... | #include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c =... | 0 | 82,745,896 |
#include <algorithm>
#include <iostream>
using namespace std;
int a[5010];
int main(){
int i,n,max_so_far,max_ending_here,amax;
cin>>n;
while(n!=0){
for(i=0;i<n;i++){
cin>>a[i];
}
max_ending_here=0;
max_so_far=0;
amax=-100000;
for(i=0;i<n;i++){
max_ending_here = max(0,max_ending_here + a[i]);
ma... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 0 | 82,364,109 |
#include <bits/stdc++.h>
using namespace std;
long long x, n, cnt[100010], ans, m;
int main () {
cin>>n;
for(int i=1; i<=n; i++){
cin>>x;
cnt[x-1]++;
cnt[x]++;
cnt[x+1]++;
m=max(m, x);
}
for(int i=-1; i<=m+1; i++){
if(cnt[i]>ans) ans=cnt[i];
}
cout<<ans<<endl;
} | #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);... | 0 | 13,987,747 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int d,e,f;
string a,b,c;
int main(){
cin>>a>>b>>c;
d=a.length();
e=b.length();
f=c.length();
a.erase(1,d-1);
b.erase(1,e-1);
c.erase(1,f-1);
a[0]=a[0]-'a'+'A';
b[0]=b[0]-'a'+'A';
c[0]=c[0]-'a'+'A';
cout<<a<<b<<c;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
using ll = l... | 0 | 78,128,729 |
#include<iostream>
#include<vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> height(N);
for (int i = 0; i < N; i++) std::cin >> height[i];
std::vector<std::vector<int>> connection(N);
for (int i = 0; i < M; i++) {
int A, B;
std::cin >> A >> B;
connection[A - 1].push_back(B);
connection[... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 0 | 52,330,339 |
#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;
ll n;
cin >> n;
ll ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int dp[101][4][2];
int main() {
string N; cin >> N;
int K; cin >> K;
int n = N.size();
dp[0][0][0] = 1;
rep(i, n) {
int Ni = N[i] - '0';
rep(j, K+1) rep(k, 2) rep(x, 10) {
int j2 = j, k2 = k;
if... | 0 | 40,281,189 |
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll MOD=100000007;
const ll INF=1000000101001;
int main(){
int n,k;cin>>n>>k;
int h[n];
int cnt=0;... | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAX_N = 1e5 + 5;
const lint MOD = 1e9 + 7;
lint N, A[MAX_N], fact[MAX_N], fact_inv[MAX_N];
lint mod_pow(lint x, lint n){
lint res = 1;
while(n){
if(n & 1) res = res * x % MOD;
x = x * x % MOD; n >>= 1;
}
retur... | 0 | 46,447,538 |
#include<iostream>
#include<string>
#include <stdio.h>
#include <math.h>
#include <cctype>
#include<queue>
#include<stack>
#include<cstdio>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n;
while(cin>>n){
int ans=0;
int d[999999+100]={};
for(int i=2;i*i<=n;i++){
if(d[i]==0){
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
const int mod = 1000000007;
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
map<int,int>primes;
void factor... | 0 | 44,913,265 |
#include<bits/stdc++.h>
#define MAX 100005
#define INF 1000000
using namespace std;
int main(){
int k, a[MAX];
deque<int> dq;
scanf("%d", &k);
for(int i = 0; i < MAX; i++) a[i] = INF;
a[1] = 1; dq.push_front(1);
while(!dq.empty()){
int t = dq.front(); dq.pop_front();
if(a[t*10%k] > a[t]){
a[t*... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+100;
typedef long long ll;
typedef pair<ll,int> pli;
#define fr(i,a,b) for(int i = a;i <= b; ++i)
#define nfr(i,a,b) for(int i = a;i >= b; --i)
#define pb push_back
int n;
pli v[N];
ll d[N];
int fa[N];
int siz[N];
map<ll,int> vis;
vector<int> edge[N];
ll va... | 0 | 12,884,244 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
cin>>n>>l;
vector<string> a;
for(int i=0;i<n;i++)
{
string s;
cin>>s;a.push_back(s);
}
sort(a.begin(),a.end());
string s;
for(auto x:a)
{
s+=x;
}
cout<<s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x[i];
}
vector<int> right(n);
for(int i=0; i<n-1; i++){
right[i] = x[i+1] - x[i];
}
right[n-1] = -1;
int klim = log... | 0 | 7,482,459 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#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++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 0 | 48,734,041 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.