code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s;
cout<<s.substr(0,4)<<" "<<s.substr(4,8)<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef unsigned long long int ulli;
#define int ll
#define F first
#define S second
#define endl "\n"
#define MP make_pa... | 0 | 42,734,840 |
#include <bits/stdc++.h>
using namespace std;
int a,b,n;
bool area[18][18];
bool memo[18][18];
int dx[2] = {0,1};
int dy[2] = {1,0};
int cnt;
void dp(int x,int y){
fill_n(*memo,18*18,0);
if(x == a && y == b)cnt++;
for(int i = 0;i < 2;i++){
int nx = x + dx[i];
int ny = y + dy[i];
if(area[nx][ny])continue;
dp(... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> r(a);
sort(r.begin(), r.end());
vector<int> x(0), y(0);
for (vector<i... | 0 | 75,006,870 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
{
int n;
cin >> n;
int a[n];
int sum = 0;
for (int i = 0; i < n; ++i)
{
... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | 0 | 88,480,885 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | #include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi ... | 0 | 41,171,779 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | #include <iostream>
using namespace std;
int main() {
int N;
int A[110];
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
int cnt = 0;
for (int i = 0; i < N - 1; i++) {
int min_idx = i;
for (int j = i + 1; j < N; j++) {
if (A[j] < A[min_idx]) {
min_idx = j;
}
}
if (min_... | 0 | 15,112,981 |
#include <iostream>
using namespace std;
int main(){
int n; cin >> n;
int p=0;
for(int i=1;i<=n;i+=2){
int o=0;
for(int j=1;j<=i;j++)
if(i%j==0) o++;
if(o==8)p++;
}
cout << p << endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<iosfwd>
#include<sstream>
#include<math.h>
#define N 100
using namespace std;
int main(){
int a[6];
int b[4]= {0,0,0,0};
int cnt=0;
for(int i=0; i<6; i++){
int d;
cin >> d;
b[d-1]++;
if(b[d-1]... | 0 | 96,969,160 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 57,014,909 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e12;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pii;
const ll mod = 1e9 + 7;
void faster()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const ll M = 400 + 10;
const ll N = 100 * 1000 + 10;
l... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
#define maxn 200005
const ll mod=1e9+7;
using namespace std;
ll fac[maxn];
ll a[maxn];
ll dis;
int vis[maxn];
ll quickpow(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=ans*a%mod;
b>>=1... | 0 | 37,443,445 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
int n,k; cin>>n>>k;
string s; cin>>s;
vector<int> num;
int conti... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 88,160,348 |
#include<bits/stdc++.h>
using namespace std;
const long long INF=1LL<<60;
long long dist[210][210];
int main(){
int N,M,R;
cin >> N >> M >> R;
vector<int> r(R);
for(int i=0;i<R;++i){
cin >> r[i];
r[i]--;
}
for(int i=0;i<210;++i){
for(int j=0;j<210;++j){
dist[i][j]=INF;
}
dist[i][i]... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int R = 69966969;
const int MAXN = 2e5 + 69;
int n, k;
int a[MAXN];
int pre[MAXN];
int encode(int i) {
return ((pre[i] - i) % k + k) % k;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
f... | 0 | 17,647,072 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#define rep(i, n) for(int i=0;i<(int)(n);++i)
using namespace std;
template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include<iostream>
#include<list>
#include<cstring>
using namespace std;
int main()
{
int n;
cin >> n;
list<int> L;
char command[12];
int key;
for( int i = 0; i < n; i++)
{
cin >> command;
if( strcmp( command, "insert" ) == 0 )
{
cin >> key;
L.... | 0 | 57,720,497 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 1e19;
#define all(v) v.begin(), v.end()
int main(){
ll N,K,m=INF;
cin >> N >> K;
vector<P> A(N);
vector<ll> X(N),Y(N);
rep(i... | 0 | 50,999,545 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <complex>
#include <map>
#include<unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include<bitset>
#include<deque>
#include<string>
#include<list>... | 0 | 42,436,413 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
char A = a.at(0)-32;
char B = b.at(0)-32;
char C = c.at(0)-32;
cout << A << B << C;
} | #include <iostream>
#include <string>
#include <vector>
#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 D;
cin >> D;
string s;
switch (D)
{
case 25:
s = "Christmas";
break;
case 24:
s = "Ch... | 0 | 58,170,525 |
#include <iostream>
using namespace std;
int main(){
int n,x,y;
while(true){
y=0;
cin >>n >>x;
if(n==0 && x==0){
break;
}
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++){
for(int k=1;k<j;k++){
if(i+j+k==x){
y +=1;
}
}
}
}
cout << y << endl;
}
} | #include<stdio.h>
int main(){
int a,b,k;
scanf("%d%d%d", &k,&a,&b);
if((b/k)*k >b || (b/k)*k <a){
printf("NG");
} else {
printf("OK");
}
return 0;
} | 0 | 45,180,012 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
string yes = "Yes\n";
string no = "No\n";
int main()
{
int n; cin >> n;
int x = n * ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 71,541,024 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string a, b, c;
cin >> a >> b >> c;... | #include <stdio.h>
#include <math.h>
int n,k = 10000;
int a[2000001], b[2000001], c[10000];
int main(void)
{
int i, j;
scanf("%d", &n);
for(i = 0 ; i < n ; i++) {
scanf("%d", &a[i + 1]);
}
for(i = 0 ; i <= k ; i++) {
c[i] = 0;
}
for(i = 0 ; i < n ; i++) {
c[a[i + 1]]+... | 0 | 31,532,103 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
for (int i = 1; i <= 2000; i++)
{
if(i * 8 / 100 == a && i / 10 == b) {
cout << i << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.siz... | 0 | 31,826,601 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> G[114514];
int dfs(int v,int p){
int res=0,cnt=0;
for(int u:G[v]){
if(u==p) continue;
res^=dfs(u,v)+1;
cnt++;
}
return res;
}
signed main(){
int n;
cin>>n;
for(int i=0;i<n-1;i++){
int x,y;
cin>>x>>y;
x--... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 0 | 33,552,350 |
#include<iostream>
using namespace std;
int main(){
for(int i1=0 ; i1<9 ; i1++){
for(int i2=0 ; i2<9 ; i2++){
cout << i1+1 << 'x' << i2+1 << '=' << (i1+1)*(i2+1) << endl;
}
}
return 0;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 48,834,207 |
#include <bits/stdc++.h>
int main()
{
int N;
scanf("%d", &N);
std::vector<int64_t> A(N);
for (auto& e: A) scanf("%lld", &e);
int64_t all_xor{};
for (auto& e: A) all_xor ^= e;
for (int row{60}, col{}; row >= 0 && col < N; row--)
{
if (all_xor >> row & 1) continue;
for (int i{col}; i < N; i++)
if (A[i] >> ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int r, g, b, n;
cin>>r>>g>>b>>n;
int an... | 0 | 59,264,867 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const long double EPS = 1e-10;
const long long INF = 1e18;
const int MOD = (int)1e9 + 7;
const long double PI = acos(-1.0L... | #include <iostream>
using namespace std;
int main(){
const int inf = 1000000;
int N, M;
cin >> N >> M;
int a[1000], b[1000], c[1000], dist[100][100];
for(int i = 0; i < M; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]--, b[i]--;
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(i==j... | 0 | 22,084,231 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll a[5];
cin >> a[0] >> a[1] >> a[2]... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int a,b,c,d,e,f,g = 0;
int aa,bb,cc,dd,ee;
int ans = 0;
cin >> a >> b >> c >> d >> e;
aa = a % 10;
if... | 0 | 62,072,785 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 1000000000000000
#define MOD 1000000007
int main(){
ll N;
cin>>N;
vector<ll> a(N);
for(ll i=0;i<N;i++){
cin>>a.at(i);
}
bool flag=true;
for(ll i=0;i<N;i++){
if(a.at(i)>=N){
flag=false;
}
}
if(flag){
cou... | 0 | 17,287,311 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll num_of_ways(vector<ll>&capacity, ll n, ll k)
{
vector<vector<ll>>dp(n + 2, vector<ll>(k + 2));
for (ll j = 0; j <= k; j++)
{
if (j > capacity[1])
dp[1][j] = 0;
else
dp[1][j] = 1;
}
for(ll j=0;j<=k;j++)
{
dp[0][... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_H = (int)(1e2 + 5);
const int MAX_W = (int)(1e2 + 5);
int a, b;
int h = 100;
int w = 100;
char white = '.';
char black = '#';
char field[MAX_H][MAX_W];
void coloring(char ... | 0 | 17,238,650 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll a,b;
cin>>a>>b;
if(b-a+1>=2019) cout<<0<<endl;
else{
ll ans=INF;
for(ll i=a;i<=b-1;i++){
for(ll j=i+1;j<=b;j++){
... | 0 | 20,442,979 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
int h,w,d;
cin>>h>>w>>d;
vector<pair<int,int>> mp(h*w+10);
for (int i = 0; i < h; ++i)
{
for (int j = 0; j < w; ++j)
{
int a;
cin>>a;
mp[a]={i,j};
}
}
auto diff=[](pair<int,i... | 0 | 17,612,260 |
#include <iostream>
using namespace std;
int main()
{
int d, S;
while (cin >> d)
{
S = 0;
if (cin.eof()) return 0;
for (int i = 1; i < 600 / d; i++)
{
S += i * d * i * d * d;
}
cout << S << endl;
}
return 0;
} | #include <cstdio>
#include <string>
#include <map>
#include <iostream>
using namespace std;
int maxlen = 0, mode = 0;
map<string,int> mp;
int main()
{
string len_key, mode_key, s2;
int m = 9;
while( cin >> s2 )
{
mp[s2]++;
if( mode < mp[s2] )
{
mode = mp[s2];
... | 0 | 41,311,676 |
#include <iostream>
#define P 1000000007
using namespace std;
int main(){
int N;
int A[100000];
int T[100000];
int A_min[100000];
int T_min[100000];
int A_max[100000];
int T_max[100000];
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[i];
}
for(int i = 0; i < N; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
int main() {
int N, M; cin >> N >> M;
ll ans = 0;
priority_queue<int> p;
vector<vector<int>> jobs(M+1);
for (int i = 0; i < N; i++) {
int A, B; cin >> A >> B;
if (A <= M) jobs[A].push_bac... | 0 | 89,552,997 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double x,y,reg;
cin>>x>>y;
reg=x+(y/2);
cout<<reg;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | 0 | 45,175,375 |
#include <iostream>
using namespace std;
#define ll long long
const ll MAX = 1e9;
int main() {
ll s;
cin >> s;
if (s <= MAX) {
printf("0 0 0 1 %d 0", s);
} else if (s == 1e18) {
printf("0 0 %d 0 0 %d", MAX, MAX);
} else {
int a = s / MAX + 1;
int b = MAX - s % MAX;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h)
cin >> s[i];
vector<vector<int>> c(h, vector<int>(w, -1));
rep(i, h)
rep(j, w)
{
if (s[i][j] == '#')
... | 0 | 13,938,157 |
#include<bits/stdc++.h>
using namespace std;
#define ll "%I64d"
const int max1=100010;
int main()
{
long long n,a=0,b;
cin>>n;
if(n==1)
{
cout<<0<<"\n";
}
else
{
vector<long long int>s1;
long long t1;
t1=((n-1)*n)/2;
cout<<t1<<"\n";
}
} | #include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
inline int inputi(){ int x; scan... | 0 | 89,101,638 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
struct CHANGE{
char before;
char after;
};
int main(){
int i, j, n, m;
string s, t, str;
CHANGE change;
vector<CHANGE> Change;
while(1){
cin >> n;
if(n == 0) break;
for(i=0; i<n; ++i){
cin >> s >> t;
change.b... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | 0 | 46,971,472 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
string ans = "No";
for (int i = 0; i < x+1; i++) {
int b = x-i;
if (2*i + 4*b == y) {
ans = "Yes";
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,m,j,l,n,a=0,b,x=10000000000;
vector<long long int>ar;
cin>>n;
for(i=0;i<n;i++){
cin>>j;
ar.push_back(j);
}
long long int sum=0;
for(l=0;l<n;l++){
sum+=ar[l];
}
for(m=0;m<n-1;m++){
a+=... | 0 | 9,575,359 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
int i, j, Ns = S.size(), Nt = T.size();
for(i = Ns - Nt; i >= 0; i--){
bool flag = true;
for(j = 0; j < Nt; j++){
if(S[i + j] != T[j] && S[i + j] != '?'){
flag = false;
break;
}
}
if(... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 66,732,216 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n, k, s;
cin >> n >> k >> s;
rep(i,k){
cout << s << endl;
}
rep(i,n-k){
if (s==1e9) cout << 1 << endl;
else cout << s+1 << endl;
}
r... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for(int i=0; i<h; i++){
cin >> s[i];
}
int ans = 0;
for(int bit=0; bit<(1<<(h+w)); bit++){
int count = 0;
for(int i=0; i<h; i++){
for(int j=0; j... | 0 | 30,011,813 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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... | #include <iostream>
#include <stdio.h>
#include <cmath>
#include <climits>
#include <map>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9 + 5;
int main(){
cin.tie(0);
int n;
cin>>n;
vector<int>h(n);
for(int i=0;i<n;i++){
cin>>h[i];
... | 0 | 15,624,529 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,N;
cin >> K >> N;
vector<int> pl(N);
for(int i=0;i<N;i++)
cin >> pl.at(i) ;
vector<int> d(N);
d.at(0) = pl.at(N-1) - pl.at(0);
for(int i=1;i<N;i++)
d.at(i) = K - pl.at(i) + pl.at(i-1);
sort( d.begin(),d.end() );
cout << d.at(0) <... | #include <bits/stdc++.h>
using namespace std;
int n, m;
string a[100], b[100];
bool check(int i, int j)
{
if ((n - i) < m || (n - j) < m)
{
return false;
}
for (int ax = i, bx = 0; bx < m; ax++, bx++)
{
for (int ay = j, by = 0; by < m; ay++, by++)
{
if (a[ax][ay] ... | 0 | 51,873,814 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
int main() {
int64_t N,answer=0;
cin>>N;
for(int64_t i=1;i*i<N;i++){
if(N%i==0&&i<(N/i)-1) answer+=(N/i)-1;
}
cout<<answer;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define nt _int128
#define fir first
#define sec second
#define slow_as_snail ios_base::sync_with_stdio(false) , cin.tie(NULL);
#define debug(x) cout<<x<<"\n";
#define debugged cout<<"debugged\n";
#define inf 0... | 0 | 16,630,501 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main () {
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 1; i <= b; i++) {
for (int j = 1; j <= a; j++) {
cout << 0;
}
for (int j = a + 1; j <= w; j++) {
cout << 1;
}
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, Y;
cin >> N >> Y;
for (int i = 0; i <= N; i++)
{
for (int j = 0; j + i <= N; j++)
{
int a = i, b = j, c = N - i - j;
if (a * 10000 + b * 5000 + c * 1000 == Y)
{
... | 0 | 78,065,573 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #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() {
string N;
int K;
cin >> N >> K;
long long dp[200][2][200];
rep(i, 200) rep(j, 2) rep(k, 200) dp[i][j][k... | 0 | 91,348,919 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | #include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define ... | 0 | 20,690,072 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 25,296,777 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <typename T> inline void print(T val) { cout << val << '\n'; }
template <typename Iterator> inline void print(Iterator begin, Iterator end) {
for (auto it = begin; it != end; it = next(it)) {
cout << *it <... | 0 | 4,816,601 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
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;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0, end_with_a = 0, begin_with_b = 0,
begin_with_a_and_end_with_b = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | 0 | 41,665,443 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const double pi =... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
template<class T> inline bool UpdateMin(T& a, T b) {
if (a > b) { a = b; return 1; } return 0;
}
template<class T> inline bool UpdateMax(T& a, T b) {
if (a < b) { a = b; return 1; } return 0;
}
constexpr int DEBUG = 1;
bool Solve() {
int n;
... | 0 | 59,908,011 |
#include <iostream>
using namespace std;
int n, m;
int c[20];
int dp[50000];
int main(void)
{
cin >> n;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> c[i];
}
for (int i = 1; i <= n; i++) {
int mini = i;
for (int j = 0; j < m; j++) {
if (i >= c[j]) {
if (mini > dp[i - c[j]] + 1) {
mini = dp[i - c... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 98,743 |
#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 repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll mod = 1000000007;
const ll N = 300... | 0 | 3,540,169 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
set<char> se;
for(int i = 0; i < s.size(); i++) {
se.insert(s[i]);
}
if(se.size() == 2) {
cout << ... | #include <iostream>
#include <string>
using namespace std;
class Dice
{
private:
int S[6];
int top_id;
int left_id;
int right_id;
int front_id;
int back_id;
int bottom_id;
public:
Dice()
{
input_surface();
top_id = 0;
left_id = 3;
right_id = 2;
front_id = 1;
back_id = 4;
bottom_id = 5;
... | 0 | 64,969,180 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
int min3(int a, int b, int c){
int d = min(a, b);
return min(c, d);
}
int LevenshteinDistance(string str1, string str2){
int dis[1001][1001], cost;
for(int i=0;i<=str1.length();i++)
dis[i][0] = i;
for(int j=0;j<=str2.length();j++)
dis... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll> dp;
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> a(m+5, 0);
fo... | 0 | 94,152,522 |
#include <queue>
#include <iostream>
#include <string>
using namespace std;
priority_queue<int> S;
int k;
int main() {
string word;
while (cin >> word) {
if (word == "insert") {
cin >> k;
S.push(k);
}
else if (word == "extract") {
int n = S.top();
S.pop();
cout << n << e... | #include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
os << "sz:" << v.size() << "\n[";
for (const auto& p : v) {
... | 0 | 62,019,299 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n; cin >> n;
int res = 0;
for (int i = 1; i <= n; ++i) res += i * (n - i + 1);
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
if (u > v) swap(u, v);
res -= u * (n - v + 1);
}
cout << res;
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool result = false;
int d_i = 0, c_i = 0;
while (7 * d_i <= N) {
if ((N - 7*d_i) % 4 == 0) {
result = true;
break;
}
else
{
d_i++;
}
}
if (... | 0 | 74,778,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int a,b,c,n;
int ans = 0;
while(cin>>n){
ans = 0;
for(a=0;a<=9;a++){
for(b=0;b<=9;b++){
for(c=0;c<=9;c++){
if(n-(a+b+c) <= 9 && n-(a+b+c)>=0)
ans++;
... | 0 | 26,040,399 |
#include <bits/stdc++.h>
int main() {
long long n;
std::cin >> n;
for (auto i = 2ll; ; i++) {
auto t = i * (i - 1) / 2;
if (t > n) {
std::cout << "No" << std::endl;
return 0;
} else if (t == n) {
std::cout << "Yes" << std::endl;
std::co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | 0 | 37,908,431 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | #include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
void solve(){
int h, w, ans = 0; cin >> h >> w;
char c[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> c[i][j];
}
... | 0 | 36,013,998 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 105
int n, d[MAX];
vector<vector<int> > vec;
vector<int> ve;
queue<int> Q;
void bfs(int s) {
for (int i = 1; i <= n; i++) {
d[i] = -1;
}
d[s] = 0;
Q.push(s);
int now, cnt;
while (!Q.empty()) {
now = Q.front();
Q.pop();
for (cnt = 1; cnt <= vec[now]... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 | 31,006,322 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define i... | 0 | 68,872,902 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, s, e) for (int i = s; i < e; i++)
#define endl '\n'
bool notInArray(int a, vector<int> A, int size)
{
for (int i = 0; i < size; i++)
{
if (a == A[i])
return false;
}
return true;
}
int main()
{
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SI... | 0 | 69,183,114 |
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n, a[1005], b[1005];
int main()
{
scanf("%d", &n);
rep(i, n) s... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_atcoder_penki(void) {
int a[3];
for (int i = 0; i < 3; i++) cin >> a[i];
int cnt = 3;
sort(a, a + 3);
for (int i = 0; i < 2; i++) {
if (a[i] == a[i + 1]) cnt-... | 0 | 42,698,333 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (char c:a) {
if (c==',') {
cout << " ";
continue;
}
cout << c;
}
cout << endl;
} | 0 | 87,976,479 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
#define PI 3.14159265359
#define dij priority_queue<pair<int,int>,vector<pa... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, n = 0, s = 0;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
if (A[i] < 0)
n++;
s += abs(A[i]);
}
sort(A.begin(), A.end());
if (N == 2)
{
cout << A[1] - A[0] << endl;
cout << A[0... | 0 | 11,239,734 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long>a(n + 1);
vector<long long>b(n);
for(int i = 0;i < n + 1;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
cin >> b[i];
}
long long count = 0;
for(int i = 0;i < a.size();i++)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a[9];
int i, j;
for (i = 0; i<9 ; i++){cin >> a[i];}
int n;
cin >> n;
int b[n];
for (i = 0; i<9 ; i++){cin >> b[i];}
int row1, row2, row3;
int col1, col2, col3;
int dia1, dia2;
int c[9]={0};
for (i = 0; i<9; i+... | 0 | 53,695,012 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).re... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector <long long> A(N);
for (long long i=0; i<N; i++) cin >> A.at(i);
vector <long long> s(N+1, 0);
map<long long, long long> m;
m[0]++;
for (long long i=0; i<N; i++) {
s.at(i+1) = s.at(i) + A.at(i)... | 0 | 61,662,822 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | #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 | 961,256 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define LOG(variable) cout << #variable":\t" << (variable) << endl
#define LOGCON(i, container) for(int (i) = 0; (i) < (container).size(); ++(i)) cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0; i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 86,879,291 |
# include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
ll m, v, p;
vector<ll> a;
bool bin(int i) {
ll sm = 0;
ll k = a[i] + m;
if (k < a[p - 1]) {
return false;
}
sm += (p - 1) * m + (n - i) * m;
for (int x = p - 1; x < i; x++) {
sm += max(ll(0), k - a[x]);
... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define S... | 0 | 88,139,834 |
#include <bits/stdc++.h>
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long fibonatti(long long d){
long long count = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | 0 | 77,256,788 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 36,160,900 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#define rep(i,n) Rep(i,0,n)
#define Rep(i,k,n) for(int i=k ; i<n ; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(),v.end())
using namespace std;
int main(){
int a,b;
cin >> a >> b;
double f = 1.000000*a... | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if((b-a) > x)
{
cout << "dangerous";
}
else if((b-a) <= x && (b-a) > 0)
{
cout << "safe... | 0 | 24,762,565 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double w, h;
double pX, pY;
double tmp1, tmp2;
double kekka = 0.0000;
double cnt = 0;
cin >> w >> h >> pX >> pY;
kekka = (w * h) / 2.0;
if ((double)pX == (double)(w / 2) && (double)pY == (double)(h / 2)) cnt++;
cout << setprecision(18) << kekk... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main(void)
{
ll h, w, k, ans = 0;
cin >> h >> w >> k;
vector<vector<char>> c(h, vector<char>(w));
vector<bool> he(h), wi(w);
for(ll i = 0; i < h; i++)
for(ll j = 0; j < w; j++)
cin >> c.at(i).at... | 0 | 92,029,496 |
#include <iostream>
#include <cmath>
#include <iomanip>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double v = a * a * b;
double ans = 0;
if(x < v/2) {
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | 0 | 54,636,576 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int k, n;
cin >> k >> n;
int a[n];
rep(i, n){
cin >> a[i];
}
... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 64,341,562 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int days = 0 ;
for (int i = 0; i < N; i++) {
int take_days = 0;
cin >> take_days;
days += take_days;
}
if(days > N){cout << "-1" << endl;}
else{
std::cout << N - days << endl;
}
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | 0 | 45,962,364 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 100005;
ll n, l, t, a[N], b[N], c[3];
vector<ll> ans;
int main()
{
scanf("%lld%lld%lld",&n,&l,&t);
for(ll i=0;i<n;i++) {
scanf("%lld%lld",&a[i],&b[i]);
if(b[i] == 1) {
if(l - a[i] <= t % l) c[1]++;
ans.push_back((a[i] + t) % l);... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | 0 | 50,917,099 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
long long a[15];
int main(void){
int ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define PB push_back
#define PII pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin.tie(0);
const int maxn = 2e5;
ll a[maxn] , b[maxn];
set <ll> s;
int main() {
int n , cnt = 0;
cin >> n;
... | 0 | 7,812,962 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
const long long nil = -2000000001;
int h = 0;
cin >> h;
vector<long long> t(h, nil), p(h, nil), l(h, nil), r(h, nil);
for (int i = 0; i < h; i++)
cin >> t[i];
for (int i = 1; i < h; i++)
p[i] = t[(i + 1) / 2 - 1];
for (int i = 0; i < h /... | #include <bits/stdc++.h>
#define PI 3.141592653589793
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
int i,k;
int ans=1e9;
int ctr=0;
string S,T;
cin >> S >> T;
for(i=0;i<=(S.size()-T.size());i++){
ctr=0;
f... | 0 | 87,393,221 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
struct str{
ll to,cost;
};
vector<vector<str>>g;
vector<ll>d;
void dfs(ll v,ll now,ll p=-1){
d[v]=now;
for(auto u:g... | 0 | 42,052,806 |
#include <bits/stdc++.h>
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define trace(x) cout << #x << " = " << x << endl
#define FOR(i,a,b) for(int i = int(a); i < int(b); i++)
#define iFR(i,a) for(int i = int(a-1); i >= int(0); i--)
#define fastio ios_base::... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 65,487,929 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <comp... | #include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
#define plll pair <pair <ll, ll>, ll>
#define pllll pair <pair <ll, ll>, pair <ll, ll>... | 0 | 37,531,818 |
#include<iostream>
#include<vector>
#include<string>
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
int main(){
ll n, start;
std::cin >> n >> start;
ll ans;
std::cin >> ans;
ans = std::abs(ans - start);
for(int i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 87,239,247 |
#include<bits/stdc++.h>
using namespace std;
const int mod = 200003;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begi... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | 0 | 37,068,516 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,a,b;
cin >> k >> a >> b;
bool e = false;
for(int i=a;i<=b;i++){
if(i % k == 0) e = true;
}
if(e == true) cout <<"OK" << endl;
else cout << "NG" << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1 << 18;
int n;
int a[MaxN];
pair<int, int> f[MaxN];
void Update(int x, int Val)
{
if (f[x].second <= Val)
{
f[x].second = Val;
}
if (f[x].first < f[x].second)
{
swap(f[x].first, f[x].second);
}
}
int GetBit(int num... | 0 | 17,945,679 |
#include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include<iostream>
using namespace std;
int main() {
int N, M; cin >> N >> M;
bool A[N][N], B[M][M];
for (int i = 0; i < N; i++) {
string s; cin >> s;
for (int j = 0; j < N; j++) A[i][j] = (s[j] == '.');
}
for (int i = 0; i < M; i++) {
string s; cin >> s;
for (int j = 0; j < M; j++) B[i][j] = ... | 0 | 77,820,739 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int lim = 1'000'000'000;
int main() {
ll n;
cin >> n;
int x1 = 0, y1 = 0;
int x2 = lim, y2 = 1;
int x3 = (n % lim == 0 ? 0 : lim) - n % lim;
int y3 = (n % lim == 0 ? 0 : 1) + n / lim;
printf("%d %d %d %d %d %d\n", x1, y1, x2, y2, x3... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <cctype>
#include <cassert>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <utility>
#include <string>
#include <stack>
#include <queue>
#inclu... | 0 | 38,065,944 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> uniqued;
for (unsigned int i = 0; i < a.size(); i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
unique_copy(a.begin(), a.end(), back_inserter(uniqued));
cout << (a.siz... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | 0 | 11,540,997 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int dataN,i,j,tmp;
string str;
cin>>str;
for(i=str.length()-1;0<=i;i--){
cout<<str[i];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int ... | 0 | 96,175,779 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int>a(N);
vector<int>b(N);
ll total_a = 0;
ll total_b = 0;
ll count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
total_a += a[i];
}
for (int i = 0; i < N; i... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 4,756,912 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int a,b,c;
cin >> a >>b>>c;
if (a < b && b < c) {
cout << "Yes" << endl;
} else {
cout <... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 9,085,131 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
map<char, int>... | #include<bits/stdc++.h>
int main(void) {
using namespace std;
long n, z, w;
cin >> n >> z >> w;
vector<long> a(n);
for(auto &x: a) cin >> x;
vector<long> dpx(n, 0), dpy(n, 1e10);
dpx[n-1] = abs(a[n-2] - a[n-1]);
dpy[n-1] = abs(a[n-2] - a[n-1]);
for(int i=n-2; i>0; i--) {
dpy[... | 0 | 20,500,971 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <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 dp[100][77];
int main(){
int N;
scanf("%d", &N);
... | 0 | 61,342,296 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin>>N>>M>>X>>Y;
vector<int> x(N);
vector<int> y(M);
for (int i=0; i<N; i++){
cin>>x.at(i);
}
for (int i=0; i<M; i++){
cin>>y.at(i);
}
bool flag2=false;
for (int Z=-100; Z<=100; Z++){
bool flag=false;
for (int i=0... | 0 | 3,683,059 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n,k;
cin >> n >> k;
vector<ll> v(n);
rep(i,n) cin >> v[i];
ll limit... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
LL a[n+1],b[n];
for(int i=0;i<n+1;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
cin >> b[i];
}
LL ans = 0;
for(int i=0;i<n;i++){
if(b[i] < a[i]){
ans += b[i];
}else{
ans += a[i];
b[i] -= a[i];
if(b[i... | 0 | 72,415,136 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll x[1005], y[1005];
int main() {
scanf("%d", &n);
bool flag;
for (int i = 1; i <= n; ++i) {
scanf("%lld%lld", x + i, y + i);
x[i] += y[i];
if (i == 1) flag = !(x[i] % 2);
else if (x[i] % 2 == flag) return puts("-1"), 0;
y[i] = x[i]... | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++) cin >> x[i];
typedef long long int ll;
using namespace std;
int main(){
while(1){
int h,w; cin >> h >>w;
if(h==0 && w==0)break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
} | 0 | 79,180,398 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
int main() {
string s; cin >> s;
vector<string> ans;
string c = "abcdefghijklmnopqrstuvwxyz";
set<char> se;
rep(i,26) se.insert(c[i]);
rep(i,s.size()) se.erase(s[i]);
... | 0 | 3,916,819 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=a;i<int(b);i++)
#define rep(i,n) repd(i,0,n)
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define VARNAME(v) #v
using P = pair<int,int>;
constexpr int MOD = 1000000007;
constexpr ll INF = 1e16;
#pragma region... | #include <bits/stdc++.h>
using namespace std;
#define typeof(x) __typeof__(x)
#define bit(x,i) (x&(1<<i))
#define lowbit(x) ((x)&((x)^((x)-1)))
#define hBit(msb,n) asm("bsrl %1,%0" : "=r"(msb) : "r"(n))
#define max(a,b) (a<b?b:a)
#define IN(i,l,r) (l<i&&i<r)
#define LINR(i,l,r) (l<=i&&i<=r)
#define LIN(i,l,r) (l<=... | 0 | 81,808,696 |
#include <iostream>
using namespace std;
int main() {
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
cout<<i<<'x'<<j<<'='<<i*j<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> us... | 0 | 66,680,248 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
while(n){
if(n%10==7){
cout <<"Yes"<<endl;
return 0;
}
n/=10;
}
cout <<"No"<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
int p[10000];
int r[10000];
int findSet(int x) {
while (x != p[x]) {
x = p[x];
}
return x;
}
bool same(int x, int y) {
return findSet(x) == findSet(y);
}
void link(int x, int y) {
if (r[x] > r[y]) {
p[y] = x;
return;
}
if (r[x] < r[y]) {
p[x] = y... | 0 | 26,030,730 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 97,775,283 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int N;
i... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 97,398,834 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
long long a[n+1], sum = 0, res = 1;
for(int i = 0; i < n+1; i++) {
cin >> a[i];
sum += a[i];
}
if(n == 0) {
if(a[0] == 1) {
cout << "1" << endl;
return 0;
}
else {
cout << "-1" << endl;
return 0;
}
}
else {
if(a[... | #include <stdio.h>
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
int ai[N+1];
for (int i=1; i<=N; i++) {
scanf("%d", &ai[i]);
}
long long sum[N+1];
long long plusSum[N+1];
sum[0] = 0;
plusSum[0] = 0;
for (int i=1; i<=N; i++) {
sum[i] = sum[i-1] + ai[i];... | 0 | 58,960,496 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.