code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void c... | # include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x... | 0 | 6,322,394 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
typedef long long ll;
int main(){
ll hh,ww,ans=1e11,s[3];cin>>hh>>ww;
if(!(hh%3)||!(ww%3)) ans=0;
else{
REP(k,2){
ll h,w;
if(k) h=hh,w=ww;
else h=ww,w=hh;
for(ll i=1;i<w;i++){
s[0]=h*i;
... | 0 | 94,475,542 |
#include <iostream>
using namespace std;
int main()
{
int N, A;
cin >> N >> A;
N %= 500;
if (N <= A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll... | 0 | 36,811,313 |
#include <bits/stdc++.h>
using namespace std;
long long int d(long long int x,long long int y){
long long int a,b,c,w,h,ans=1000000000;
for(int i=1;i<=y;i++){
h = (y-i)/2;
w = x/2;
a = x*i;
b = x*h;
c = x*(y-i-h);
ans = min(ans,max({a,b,c})-min({a,b,c}));
... | #include <iostream>
#include <iomanip>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int a[3];
repi(i,3,0){
cin >> a[i];
}
int index[3] = {0,1,2};
int ans = INF;
d... | 0 | 92,298,540 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 79,422,413 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define endl '\n'
int main()
{
Hello
int n, m;
cin >> n >> m;
int arr[n + 5];
ll sum[n + 5] = {};
ll ans = 0;
for(int i = 1; i <= n; i++)
cin >> arr[i... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 0 | 21,099,675 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define pf push_front
#define F first
#define re return
#define S second
#define ll long long
#define f(i) return cout<<i<<"\n",0;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#de... | 0 | 30,999,470 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
template<typename A,typename B> inline void chmin(A &a,B b){if(a>b) a=b;}
template<typename A,typename B> inline void chmax(A &a,B... | #include<bits/stdc++.h>
using namespace std;
int n,a,b;
long long ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&b);
if(a&&b)--b,++ans;
a=b&1;
ans=ans+(b>>1);
}
printf("%lld",ans);
} | 0 | 95,100,604 |
#include <bits/stdc++.h>
#define fail return (cout << -1 << endl), 0
#define ll long long
using namespace std;
int n;
map<ll, int> f;
ll dis[100010], rdis[100010];
int sz[100010];
struct Edge {
int to, next;
}es[200010];
int first[100010], te = 0;
void addE(int a, int b)
{
te++;
es[te].to = b;
es[te].next = first[a... | #include <math.h>
#include <ctype.h>
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REP(i, n) for(int i = 0; i < n; i++)
struct omt{omt(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main(){
int n;
cin >> n;
list<int> A;
string s;
int tmp... | 0 | 26,488,224 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
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
#define POB pop_back
#define R... | #include<stdio.h>
#include<string.h>
int main(){
int n;
scanf("%d",&n);
char arr[n+1];
scanf("%s",arr);
int flag = 1;
for(int i=0;i<(n/2);i++){
if(arr[i] != arr[i + (n/2)]){
flag = 0;
}
}
if(n%2 != 0){
flag = 0;
}
if(flag == 1){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | 0 | 95,910,861 |
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 85,595,810 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
char map[505][505];
int def[505][505];
int dx[4] = { 1,-1,0,0 };
int dy[4] = { 0,0,1,-1 };
vector<int>to[200005];
ll a[100005];
ll b[100005];
ll keisan(ll x,ll ... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF 1e18
#define INF (int)1e9+1
template <typename A, typename B>
string to_string(pair<A, B> p);
template <... | 0 | 64,879,650 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long ... | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int N, M;
int main(){
while(cin >> N >> M && N+M>0){
pair<int,int> a[N];
long long r = 0;
for (int i = 0; i < N; ++i){
int D, P;
cin >> D >> P;
a[i] = make_pair(P, D);
... | 0 | 82,352,909 |
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
using namespace std;
const int MAXN=1e5+10;
int N;
pair<int,int> elements[MAXN];
int BIT[MAXN];
int len(int i){
return i&(-i);
}
int query(int prefixIndex){
if (prefixIndex<1) return 0;
return max(query(prefixIndex-... | 0 | 91,992,310 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void)
{
int N;
cin >> N;
vector<double> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
double res = 0;
for (int i = 0; i < N; ... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int... | 0 | 42,764,064 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>
#include <climits>
#include <set>
using namespace std;
double sq(double x){return x*x;}
int m... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#incl... | 0 | 50,486,488 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return... | #include <cstdio>
#include <map>
#include <queue>
using namespace std;
int h, w, n;
char field[1010][1010];
using pos = pair<int, int>;
pos pass[10];
int distance(pos start, pos goal) {
bool visited[1010][1010];
for (int i = 0; i < 1010; i++) {
for (int j = 0; j < 1010; j++) {
visited[i][j] ... | 0 | 79,537,626 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | 0 | 27,330,072 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<ty... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
int l = -1;
int r = n;
int idx;
int male = 0;
int female = 0;
rep(i, 20) {
if ( i == 0 ) {
idx = 0;
}
... | 0 | 57,516,374 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int h, w, n, s;
char g[1001][1001];
bool v[1001][1001];
int id[8] = {0, -1, 0, 1, -1, 0, 1, 0};
int main() {
scanf("%d %d %d", &h, &w, &n);
for (int i = 0; i < h; ++i) {
getchar();
for (int j = 0; j < w; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int i=0; i<n; i++)
#define REP2(i, a, b) for(int i=a; i<b; i++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1'000'000'007
template <class T> ostream& operator<<(ostream... | 0 | 82,139,977 |
#include<bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-67
#define pf printf
#define sf scanf
#define sd(n) scanf("%d",&n)
#define sd2(n1,n2) scanf("%d %d",&n1,&n2)
#define slf(n) scanf("%lf",&n)
#define slf2(n1,n2) scanf("%lf %lf",&n1,&n2)
#define sLf(n1) scanf("%Lf",&n1)
#define sLf2(n1,n2) scanf("%Lf %Lf",&n1,&... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
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(); }
inline int readInt() { int x; scanf("%d", ... | 0 | 48,928,444 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
bool flag=false,ans=false;
cin >> a >> b >> c >> d;
if(a>=b && a-b<=d) flag = true;
else if(b>=a && b-a<=d) flag = true;
if(flag && b>=c && b-c<=d) ans = true;
else if(flag && c>=b && c-b<=d) ans = true;
if(a>=c && a-c<=d) ans = true... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
... | 0 | 56,390,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int r;
if(n>=400 && n<=599)
r=8;
if(n>=600 && n<=799)
r=7;
if(n>=800 && n<=999)
r=6;
if(n>=1000 && 1199)
r=5... | 0 | 72,425,288 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <bits/stdc++.h>
const int N = 5010;
using ll = long long;
int p[N], c[N];
bool vis[N];
int main(){
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++ i){
scanf("%d", &p[i]);
}
for (int i = 1; i <= n; ++ i){
scanf("%d", &c[i]);
}
ll ret = LLONG_MIN;
for (... | 0 | 94,639,942 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | 0 | 38,286,036 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
int main() {
int N, K;
cin >> N >> K;
vector<int> sunuke(N,0);
rep(i, K) {
int d;
cin >> d;
rep(j, d) {
int a;
... | #include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
int h,w;... | 0 | 93,780,519 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin,(obj).end()
#define SORT(li... | #include <iostream>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,m,count,cnt,ans=0;
cin>>n>>m;
int s[11][11],p[11],k[11];
rep(i,m){
cin>>k[i];
rep(j,k[i]){
cin>>s[i][j];
... | 0 | 23,436,810 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H,N;
cin>>H>>N;
for(int i=0;i<N;i++){
int A;
cin>>A;
H-=A;
}
if(H<=0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
vector<string> v;
for(int i=0; i<a; i++) {
string s;
cin >> s;
for(int j=0; j<b; j++) {
if(s[j] == '#') {
v.push_back(s);
break;
}
}
}
... | 0 | 11,750,625 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
P cnt_i[300005],cnt_j[300005];
int main(){
int H,W,m;
cin>>H>>W>>m;
set<P> se;
rep(i,H){
cnt_i[i].second=i;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool judge(ll x)
{
printf("? %lld\n",x);
fflush(stdout);
char C;
scanf(" %c",&C);
return C == 'Y';
}
int main()
{
ll ans = 1000000000;
if(judge(ans))
{
ans = 10;
while(!judge(ans - 1))ans *= 10;
pr... | 0 | 80,864 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B,C,K;
cin>>A>>B>>C>>K;
int ans=0;
if(K%2==0){
ans=A-B;
}else{
ans=B-A;
}
if(ans>=1000000000000000000){
cout<<"Unfair"<<endl;
}
cout<<ans<<en... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,m;
cin>>n>>m;
priority_queue<ll> q;
for(int i=0;i<n;i++)
{
ll temp;
cin>>temp;
q.push(temp);
}
while( m--)
{
ll top = q.top();
q.pop();
top = top/2;
q.push(top);
... | 0 | 16,232,918 |
#include <bits/stdc++.h>
#define N 100000
using namespace std;
int n;
int A[2000010],B[2000010];
void Csort(){
int cnt[N]={};
for(int i=0;i<n;i++) cnt[A[i]]++;
for(int i=1;i<N;i++) cnt[i]+=cnt[i-1];
for(int i=0;i<n;i++) B[cnt[A[i]]--] = A[i];
}
int main(){
cin>>n;
for(int i=0;i<n;i++) scanf("%d",&A[i]);
C... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
void InputSet(std::vector<int> & a) {
int n;
cin >> n;
a.resize(n,0);
for(int i=0;i<n;++i) {
cin >> a.at(i);
a.at(i)--;
}
}
int main(){
int n;
cin >> n;
vector<vector<int> > Ad;
Ad.resize(n);
for(int k=0;k<n;++k) {
int u;
cin >>... | 0 | 95,554,007 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int M;
int sum = 0;
cin>>N;
cin>>M;
if(N > 1){
for(int i = (N - 1);i > 0;i--){
sum += i;
}
}
if(M > 1){
for(int i = (M - 1);i > 0;i--){
sum += i;
}
}
cout<<sum<<... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | 0 | 5,653,501 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P,P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
#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 rep2(i, s, n) for (int i = (s); i <= (int)(n); ... | 0 | 60,645,543 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
ll n;
cin>>n;
ll A[n];
int k;
cin>>k;
for(int i=0;i<n;i++){
cin>>A[i];
}
ll dp[n+5];
dp[0]=0;
dp[1]=abs(A[1]-A[0]);
for(int i=2;i<n;i++){
dp[i]=INT_MAX;
for(int j=1;j<=k&&i-j>=0;j++){
dp[i]=min(dp[i],dp[i-j]+abs(A[i]-... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 65,980,942 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong n;
llong cnt[10];
int main() {
... | #include <iostream>
using namespace std;
int main(){
int m,f,r,score;
while(true){
cin >> m >> f >> r;
score = m + f;
if(score < 0 && r == -1) break;
else if( m == -1 || f == -1 || score < 30) cout << "F\n";
else if(score >=... | 0 | 47,699,362 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
signed main() {
int n,m,x;
cin>>n>>m>>x;
int c[n];
vector<vector<int>> v(n,vector<int>(m));
for(int i=0;i<n;i++)
{
cin>>c[i];
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
int ans=IN... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> w[m];
while ( n-- > 0 ) {
int a, b;
cin >> a >> b;
a--;
if ( a < m ) {
w[a].push_back(b);
}
}
long long ans = 0;
priority_queue<int> q;
for ( int i = 0; i < m; i++ ) {
for ( int ... | 0 | 73,573,781 |
#include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, K;
cin >> N >> M >> K;
for(int i = 0; i <= M; ++i){
int sum = i*N;
for(int j = 0; j <= N; ++j){
sum = i*N - i*j + j*(M-i);
if(sum == K){
cou... | #include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 200005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
#define DEBUG
#define FORi(N) for(ll i = 0; i < N; ++i)
#define FORj(N) for(ll j = 0; j < N; ++j)
#define FORk(N) for(ll k ... | 0 | 20,119,745 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> a(h,vector<char>(w));
rep(i,h)rep(j,w) cin >> a.at(i).at(j);
rep(i,2*h)rep(j,w){
cout <<a.at((i+2)/2-1).at(j);
... | #include <bits/stdc++.h>
using namespace std;
constexpr int B = 20;
int main() {
int n, l, q;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
cin >> l >> q;
vector<vector<int>> data(B, vector<int>(n));
for (int i = 0; i < n; i++) {
int ok = a[i] + l;
data... | 0 | 53,324,483 |
#include <iostream>
using namespace std;
int main()
{
int m, k;
cin >> m >> k;
if(k >= (1 << m)){
cout << -1 << endl;
return 0;
}
if(m == 0){
if(k == 0){
cout << "0 0" << endl;
}
else{
cout << -1 << endl;
}
return 0;
... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#define INF 10000000
using namespace std;
struct data{
int x,y;
};
int H,W,N;
int ans[1001][1001];
char field[1001][1001];
int cou,sx,sy;
void bfs(data start,int num){
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
data g;
for(int i=0;i<H;i++... | 0 | 46,535,770 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n,m; cin >> n >> m;
long long ac, a[n], num=0, x; cin >> a[0];
a[0]/=2;
x = a[0];
while(x % 2 == 0){
x /= 2;
num++;
}
bool ok = true;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | 0 | 74,759,328 |
#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 mod 1000000007
typedef long long ll;
int main(){
ll n, a, b;
cin >> n >> a >> b;
if(a>b) cout << 0 << endl;
else if(a==b) cout << 1 << endl;
else{
if(n==1) cout << 0 << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
string make_string(int p, int x){
string left, right, a, b;
a=to_string(p); b=to_string(x);
rep(i,6-a.size()) left+='0';
left+=a;
rep(i,6-b.size()) right+='0';
rig... | 0 | 63,474,881 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL I... | 0 | 41,044,250 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define LEN(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
using vpii = vector<pii>;
template<t... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#define inf 1e9
#define mod 1e9 + 7
using namespace st... | 0 | 38,445,244 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(AL... | #include <iostream>
#include <stack>
using namespace std;
char bl[5]= "([)]";
int main(){
string str;
while(getline(cin,str) && str[0]!='.'){
stack<char> stk;
for(int i=0; str[i]!='.'; i++){
for(int j=0; j<2; j++){
if(str[i]==bl[j]){
stk.push(str[i... | 0 | 46,590,402 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
string s;
cin>>s;
for(int i=s.size()-1;i>=0;i--) cout<<s[i];
cout<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#... | 0 | 36,640,229 |
#include <iostream>
using namespace std;
int main()
{
int A, B, X;
cin >> A;
cin >> B;
cin >> X;
if((X>=A)&(A+B)>=X)
{
cout << "YES";
}
else
{
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
... | 0 | 45,785,541 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll W,H,N;
cin>>W>>H>>N;
ll up=H;
ll down=0;
ll left=0;
ll right=W;
for(ll i=0;i<N;i++) {
ll x,y,a;
cin>>x>>y>>a;
if(a==1) {
left=max(left,x);
}
else if(a==2) {
right=min(ri... | #include<bits/stdc++.h>
using namespace std;
auto ____ = [] () {ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); };
typedef int_fast64_t LL;
const int_fast32_t MAXN = 3e5+7;
int_fast32_t n,A[MAXN],height[MAXN],F[MAXN];
int main(){
____();
cin >> n;
for(int i = 1; i <= n; i++){
int tp;
... | 0 | 35,563,969 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
scanf("%d %d", &a, &b);
if((a > 8) || (b > 8)){
printf(":(\n");
}else{
printf("Yay!\n");
}
return 0;
} | #include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
while(cin >> n){
bool prime[1000000] = {false};
prime[1] = true;
prime[2] = false;
int count = 0;
for(int j = 2; j * j <= n ; j++){
if(!prime[j]){
for (int k = 2; k*j <=... | 0 | 63,022,454 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 1001001001;
const ll mod = 100000000... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
const long long INF = 9e15;
const double PI = 3.14159265358979323846;
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vP = vector<pair<long long, long long>>;
#defi... | 0 | 10,664,611 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cout << #x << " : " << x << '\n';
const int N = 100100;
int n;
int a[N], b[N], c[N];
int dp[N][3];
int main() {
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0]... | 0 | 4,431,716 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K,j=0;
cin>>A>>B>>K;
int i=min(A,B);
for(;j<K;i--)
if(A%i==0 && B%i==0)
j++;
cout<<i+1<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k,i,l;
string s;
cin>>k>>s;
l=s.size();
if(l<=k)
cout<<s<<endl;
else
{
for(i=0;i<k;i++)
{
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
} | 0 | 54,936,114 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
ll dp0[100001];
ll dp1[100001];
int main(){
stri... | #include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
i += s;
}
bool operator!=(iterat... | 0 | 80,676,846 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(2 * N);
rep(i, 2 * N) cin >> L[i];
sort(L.begin(), L.end());
int ans... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 23,602,983 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
using P=pair<int,int>;
const int INF=1000000000000;
signed main(){
int N,M;
cin>>N>>M;
vector<vector<P>> A(N);
while(M--){
int a,b,c;
cin>>a>>b>>c;
A[a-1].push_back({b-1,c});
A[b-1].push_back({a-1,-c});
}
vector<int> B(N,INF)... | 0 | 18,486,817 |
#include <bits/stdc++.h>
using namespace std;
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define m... | #include <iostream>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n ;
cin >> n ;
ll ans = 0 ;
ll a, b ;
REP(i,n){
cin >> a ;
if(i==0){
ans += a/2 ;
... | 0 | 38,379,709 |
#include <iostream>
using namespace std;
const int lim = 1e7 + 1;
int lp[lim] , n;
void sieve(){
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j += i)
lp[j] += 1;
}
int main(){
cin >> n;
sieve();
long long ans = 0;
for (int i = 1; i <= n; i++)
ans = ans + 1LL * lp[... | #include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef unsig... | 0 | 98,124,875 |
#include<iostream>
using namespace std ;
int main()
{
int a[3],b[3] ;
for(int i=0;i<3;i++) cin>>a[i]>>b[i] ;
int c[6]={a[0],a[1],a[2],b[0],b[1],b[2]} ;
int count[4]={0} ;
for(int i=0;i<6;i++){
switch(c[i]){
case 1: count[0]++ ;
break ;
case 2: count[1]++ ;
break ;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll,ll>> C(N),D(N);
rep(i,N){
cin >> A[i] >> B[i];
C[i] = make_pa... | 0 | 12,001,065 |
#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... | #include <bits/stdc++.h>
#define FASTIO
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();
void solve() {
ll N, Y;
cin >>... | 0 | 46,338,451 |
#include<stdio.h>
#include <string.h>
int main(){
char n[201],s[101],t[101];
char *p;
scanf("%s %s",n,s);
strcpy(t,n);
strcat(n,t);
p=strstr(n,s);
if(p==NULL)printf("No\n");
else printf("Yes\n");
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll... | 0 | 50,572,965 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 10;
int main(){
ios::sync_with_stdio(0);
int x; cin>>x;
for(int i=2;;i++){
if(x*i%360==0) return !printf("%d\n",i);
}
} | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<i64> a(n);
i64 x = 0;
for (auto &e : a) {
std::cin >> e;
x ^= e;
}
for (auto &e : a) e &= ~x;
for (int i = 60, index = 0; i >= 0; i--) {
int mi = index;
i64 me =... | 0 | 14,965,961 |
#include<iostream>
using namespace std;
int main(){
char a;int b,sum=0;
while(1){
a=cin.get();
b=(int)a-48;
if(b>=10||b<0)break;
sum+=b;
}
if(sum%9==0)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, ... | 0 | 19,124,598 |
#include <iostream>
int main(void) {
int d;
int s;
int length;
while (std::cin >> d) {
s = 0;
for (int i = 0; i < (600 / d); i++) {
s += d * d * d * i * i;
}
std::cout << s << std::endl;
}
return 0;
} | #include <stdio.h>
long long n, k, t, s, m, f;
long long a[15];
int b[15];
long long c[15];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
}
m = 20000000000;
for (int i = 0; i < (1 << n); i++) {
t = i;
s = 0;
c[0] = 0;
f = 0;
for (int j = 0; j < n; j++) {
... | 0 | 89,410,052 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
int a,b;
cin>>a>>b;
string u;
cin>>u;
if (u==s){
a--;
}
else if (u==t){
b--;
}
cout<<a<<" "<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
ll dp[100010];
int main(){
int n,m;
cin>>n>>m;
vector<bool> ok(100010,true);
rep(i,m){
int a;
... | 0 | 41,430,159 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include<iostream>
#include<algorithm>
using namespace std;
int main(int argc,char* argv[]){
std::ios_base::sync_with_stdio(false);
int n,M=0;
int *pi,*tmp;
cin>>n;
pi=new int[n];
for(int i=0;i<n;i++){
cin>>pi[i];
M=max(M,pi[i]);
}
tmp=new int[M+1];
for(int i=0;i<n;i++){
tmp[pi[i]]++;
}
... | 0 | 3,108,521 |
#include <cstdio>
int main(){
int n;
int a[6] = {500,100,50,10,5,1};
while(scanf("%d",&n), n!= 0){
int t = 0;
n = 1000 - n;
for(int i = 0; i < 6; i++){
t += n / a[i];
n %= a[i];
}
printf("%d\n",t);
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (const auto i : v) {
os << i << " ";
}
os << "]";
return os;
}
template<typename T>
ostream& operator<<(os... | 0 | 79,118 |
#include <iostream>
#include <string>
#include <vector>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
int main(){
ll n,k ;
cin >> n >> k ;
string s ; cin >> s ;
char c = s.at(0) ;
vll one,zero ;
if(c=='0') one.push_back(0) ;
ll cnt = 0 ;
for(int i=0;i<n;i++){
if(c=='1'){
if(s.at(i)=... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | 0 | 61,414,146 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int X, Y, Z, K;
scanf("%d", &X);
scanf("%... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n);
for(auto &e: a) cin >> e;
sort(a.begin(), a.end());
long m = a[n-1];
if(m == 1) {
cout << (n==2 ? "Possible" : "Impossible") << endl;
return 0;
}
if(m%2 == 0) {
... | 0 | 17,819,776 |
#include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
int x;
x = b +c;
if(a < x )
{
int ans;
ans = x - a;
cout << ans << endl;
}
else
cout << "0" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
int a , b , c;
c... | 0 | 55,844,762 |
#include<bits/stdc++.h>
using namespace std;
int n,m;
void test() {
cin >> n;
cin >> m;
int s = 0;
for( int i = 0; i < m; i++) {
int x;
cin >> x;
s += x;
}
cout << ( s >= n ? "Yes" : "No");
}
signed main() {
#ifdef LOCAL
freopen("input.txt","r",stdin);
#endif
test();
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+3;
int arr[N];
int main(){
std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long test;
test=1;
while(test--)
{
long long i,j,n,q,e=0,t,o=0,c=0,temp,k,maxpeak=0,peak,d;
string s;
cin>>n;
for(i=0;i... | 0 | 2,443,376 |
#include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3.14... | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("READ.txt", "r", stdin)
#define Write ... | 0 | 56,759,094 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> p(n);
rep(i,n) cin >> p[i];
int mini = p[0], ans = 0;
rep(i,n) {
if (p[... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
bool exist1=false, exist2=false;
int ans1, ans2;
for (int i=0; i<s.size()-1; i++) {
if (s[i]==s[i+1]) {
ans1=i+1, a... | 0 | 99,748,877 |
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
vector<pair<int,int>> row, col;
set<pair<int,int>> bombs;
int main() {
int r, c, m, a, b; scanf("%d %d %d", &r, &c, &m);
row.resize(r + 1); col.resize(c + 1);
for(int i=0; i<=r; i++) row[i].f = 0, row[i].s = i;
for(int i=0; ... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <cmath>
#include <cassert>
#include <string>
#include <iostream>
#include <bitset>
#include <numeric>
using namespace std;
typedef long long ll;
ll... | 0 | 23,667,411 |
#include<bits/stdc++.h>
#define rep(i, x) for (ll i = 0; i < (x); i++)
#define chmax(x, a) do { x = max(x, a); } while(0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main(void) {
ll N;
cin >> N;
ll V = 0, E = 0;
rep(i, N) {
V += (i + 1) * (N - i);
}
rep(i, N-1... | #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<... | 0 | 57,700,185 |
#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;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, -1)), next(n, vector<int>(n, -1)),
indeces(n, vector<int>(n, -1));
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--... | 0 | 84,915,775 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s,w;
cin >> s >> w;
if(s>w)cout << "safe" << "\n";
else cout << "unsafe" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H + 2, vector<char>(W + 2, '.'));
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> s.at(i).at(j);
}
}
bool ok = true;
for (int i = 1; i <= H; i++) {
for (int j =... | 0 | 58,163,455 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
string s;
vector<int>alp2(26,1e9);
for(int i=0; i<n; i++){
vector<int>alp1(26,0);
cin >> s;
for(int i=0; i<s.size(); i++){
alp1[s[i]-'a']++;
}
for(int i=0; i<26... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | 0 | 72,855,138 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long int LL;
const LL MAX=2e9;
LL pos[1005][2];
void check(int a,int t){
int i,j,k;
t=1<<t;
if(abs(pos[a][0])>abs(pos[a][1])){
if(pos[a][0]>0){
cout<<'R';
pos[a][0]-=t;
}else{
cout<<'L';
pos[a][0]+... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 0 | 35,751,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int c[10]={0,2,5,5,4,5,6,3,7,6};
int main(){
int n,m;
cin>>n>>m;
int a[m];
rep(i,0,m) cin>>a[i];
sort(a,a+m);
reverse(a,a+m);
string dp[n+1];
rep(i,0,n+1) dp... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 3,147,443 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i =... | 0 | 90,057,042 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<tuple>
#include<complex>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define ALL(a) (a).begin(),... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 84,939,931 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N, K, S;
cin >> N >> K >> S;
vector<ll> A(N);
if(S != 1e9){
for(int i = 0; i < N; i++){
A[i] = S + 1;
}
}else{
for(int i = 0; i < N; i++){
A[i] = S - 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int N = S.size();
map<char, int> M;
for (int i = 0; i < N;i++)
{
M[S[i]]++;
}
for (int i = 0; i < N;i++)
{
if(M[S[i]] != 2){
cout << "No" << endl;
return 0;
... | 0 | 71,939,361 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define all(v) v.begin(),v.end()
using namespace std;
template<class T> inline void chmax(T& a, T b) { a = std::max(a, b); }... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
long long cnt=0;
long long A[N];
long long temp;
for(int i=0;i<N;i++){
cin>>A[i];
}
while(1){
sort(A,A+N);
if(A[N-1]<N){
cout<<cnt<<endl;
return 0;
}
temp=1+(A[N-1]-N)/N;
cnt+=temp;
A[N-1]-=N... | 0 | 46,102,757 |
#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<string, int> P;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string str;
getline(cin, str);
vector<P> vec;
int m = 0;
string longest;
for(size_t i = 0; i < str.size(); ++i){
if... | #include <iostream>
using namespace std;
int main (){
int c , d , a , b;
cin >> c >> d ;
if (c < d){
cout << "a < b" << endl;
}
if(c > d){
cout << "a > b" << endl;
}
if(c == d){
cout << "a == b" << endl;
}
return 0;
} | 0 | 10,481,082 |
#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 (){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin >> n >> m;
int a = 0, w = 0;
vector<pair<int,int>> cnt(n,pair<int,int>(make_pair(0,0)));
for (int i=0; i<m; i++) {
int p;
string s;
cin >> p >> s;
--p;
if (cnt[p].first != 1) {
if (s == "AC") {
cnt[p].fir... | 0 | 77,791,335 |
#include<iostream>
#include<set>
int main(void){
int n, m;
std::cin >> n >> m;
std::multiset<int> as;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
as.insert(a);
}
for(int i = 0; i < m; i++){
auto max = std::next(as.end(), -1);
int redu = *max / 2;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 0 | 10,203,299 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
signed ... | 0 | 73,891,186 |
#include<bits/stdc++.h>
#define ft(i,l,r) for(register int i=l;i<=r;i++)
#define fd(i,r,l) for(register int i=r;i>=l;i--)
using namespace std;
int n;
int main()
{
cin>>n;
if(n%111==0) cout<<n;
else cout<<n+(111-n%111);
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <ctime>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
int main()
{
int n; cin >> n;
vector<int> b(n);
rep(i, n - 1) cin >> b[i]... | 0 | 29,997,478 |
#include <iostream>
int main()
{
int A, B, C, K;
std::cin >> A >> B >> C >> K;
int res;
if (A >= K) res = K;
else if (A + B >= K) res = A;
else res = 2*A + B - K;
std::cout << res << std::endl;
return 0;
} | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | 0 | 57,673,584 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAXN 200007
int a[MAXN];
bool cnt[1000007];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
for(int i=0; i<n; i++) {
cin >> a[i];
}
sort(a,a+n);
memset(cnt,0,sizeof cnt);
long long ans=0;
for(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
... | 0 | 45,215,685 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>> a(H,vector<char>(W));
for (int i=0; i<H; i++){
for (int j=0; j<W; j++){
cin>>a.at(i).at(j);
}
}
vector<int> i_remove;
vector<int> j_remove;
for (int i=0; i<H; i++){
bool flag=false;
f... | #include <iostream>
using namespace std;
int main(){
int c;
while(1){
c = 0;
int n,x;
cin >> n >> x;
cin.ignore();
if((n == 0)&&(x == 0)){
break;
}else{
for(int i=1;i<=n;i++){
for (int j=i+1;j<=n;j++){
for(int k=j+1;k<=n;k++){
if(i+j+k == x){
c = c +1;
}
}... | 0 | 68,830,943 |
#include <bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;
struct point {
int x,y;
}p[maxn];
map<int,int> xcnt,ycnt;
signed main(void){
int n,m,k;
cin>>n>>m>>k;
int x,y,maxr=0,maxc=0;
for(int i=0;i<k;i++){
cin>>x>>y;
p[i]={x,y};
xcnt[x]++,ycnt[y]++;
maxr=max... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) r... | 0 | 98,451,866 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
int lst[Max];
int ls[Max];
ll gcd(ll a, ll b)
{
if (b == 0)return a;
else return gcd(b, a % b);
}
int main()
{
int n;
cin >> n;
ll res=1;
for (int i = 1;i <= n;i++)
... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K, H[310], INF = 1000000000000000;
static long long DP[310][310][310] = {};
H[0] = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) cin >> H[i];
H[N + 1] = 0;
for (int i = 0; i <= N + 1; i++) {
for (int j = 0; j <= N + 1; j++) {
for (int ... | 0 | 8,417,254 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353;
te... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 5,329,871 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s;
if (s[2] == s[3] && s[4] == s[5]) {
puts("Yes");
}
else {
puts("No");
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 0 | 41,154,616 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long int F(long long int A, long long int B) {
long long int C = max(A,B), ans = 0;
while (C/10 > 0) {
ans++;
C /= 10;
}
ans++;
return ans;
}
int main() {
long long int N,ans = 11;
cin >> N;
fo... | #include<iostream>
#include<vector>
using namespace std;
int main(){
string s;
cin>>s;
vector<char>v(s.size());
int index=0;
for(int i=0;i<s.length();i++)
{
if(s[i]!='B'){
v[index]=s[i];
index++;
}
else{
if(index>0)
inde... | 0 | 88,817,319 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
typedef double DOUBLE;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REP... | #pragma region _head
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#pragma region _define
#define int LL
#define f(i,a,b) for(LL i=a;i<b;i++)
#define rep(i,n) for(... | 0 | 58,379,879 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
string S, T;
cin >> S >> T;
if(T.substr(0, S.size()) == S){
cout << "Yes"<<endl;
}
else ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
tem... | 0 | 54,486,863 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<char,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(fals... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
for (;;) {
scanf("%d %d",&h,&w);
if (h==0) break;
for (int i=0;i<w;i++) printf("#");
printf("\n");
for (int j=0;j<h-2;j++) {
for (int i=0;i<w;i++) {
printf("%c",(i==0 || i==w-1)?... | 0 | 30,778,434 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> G;
vector<vector<int>> W;
vector<int> dist;
vector<bool> visited;
void dfs(int u) {
visited[u] = true;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (visited[v]) continue;
dist[v] = dist[u] + W[u][i];
... | #include <iostream>
#include <algorithm>
using namespace std;
const int N_MAX=1000;
typedef long long int LLI;
int main() {
int N;
LLI x[N_MAX];
LLI y[N_MAX];
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i];
}
bool impossible = false;
bool odd;
for (int i = 0; i < N; ++i) {
if (!i)... | 0 | 93,147,887 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int K,l;
string S;
cin >> K >> S;
l = S.size();
if(l<=K)cout << S << endl;
else {
S = S.erase(K) + "...";
cout << S << endl;
}
} | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include ... | 0 | 83,861,074 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.