code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> x;
d.at(i) = x;
}
int count = 0, a = 0;
for (;;) {
if (a == 1) {
cout << count << endl;
break;
}
... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
main() {
int64_t n;
cin >> n;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") {
return 0;
}
int64_t f = (s == "Female"... | 0 | 10,317,499 |
#include <iostream>
using namespace std;
int main()
{
long long a, b, c = 0;
cin >> a >> b;
cout << min(a,b/2)+max(b-a*2,c)/4;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h,w,d;
cin >> h >> w >> d;
vector<P> a(h*w);
rep(i,h){
rep(j,w){
int x;
cin >> x;
P p(i,j);
... | 0 | 64,099,163 |
#include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#d... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include... | 0 | 2,979,044 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
t=1;
while(t--){
string s;
cin >> s;
int ans = 0;
for(int i=0;i<s.length();i++){
ans=(ans%9+(s[i]-'0')%9)%9;
}
if(ans == 0)cout << "Yes" << endl;
else{
cout... | 0 | 28,090,248 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
ll x, n;
cin >> x >> n;
set<ll> s;
for (int i = 0; i < n; i++){
ll p;
cin >> p;
s.insert(p);
}
int ans = -100, m = abs(x+100);
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define INF INT_MAX
vector<ll> dp;
ll f(vector<ll> &v,ll n,ll k)
{
ll i,j;
dp[0]=0;
for(i=1;i<=min(n,k);i++)
{
for(j=0;j<i;j++)
{
dp[i]=min(dp[i],dp[j]+abs(v[j]-v[i]));
}
}
fo... | 0 | 47,080,279 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int N;
cin >> N;... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 0 | 92,518,368 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define PB push_back
#define MP make_pair
#define MEMSET(v,... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | 0 | 45,340,746 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
int n10k, nk, nc, nd, n1, counter = 0;
cin >> a >> b;
for (int n = a; n< b + 1; n++)
{
n10k = n / 10000;
nk = (n - n10k * 10000) / 1000;
nc = (n - n10k * 10000 - nk * 1000) / 100;
nd = (n - n10k * 10... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_A... | 0 | 19,621,999 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int (i)=0; (i)< (n); ++i)
#define REPR(i, n) for(int (i)=(n); (i)>=0; --i)
#define FOR(i, n, m) for(int (i)=(n); (i)<(m); ++i)
constexpr ll INF = 1LL << 62;
constexpr int mod = 1e9+7;
int main(){
int K, N;
cin >> N >> K;
vec... | 0 | 92,816,138 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<double,int> P;
#define repl(i,n... | 0 | 69,336,442 |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
using ppa = pair<pa,int>;
#define SORT(v, n) sort(v, v+n);
#define ALL(v) v.begin(),v.end()
#define VSORT(v) sort(ALL(v))
#define GRESORT(v) so... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
ll mod = 998244353;
long long power(long long m,long long n){
long long res = 1;
if(n > 0)... | 0 | 57,796,385 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
templa... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k; cin >> n >> k;
string s; cin >> s;
V<int> v;
... | 0 | 55,156,526 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000*1000*1000 + 7;
int mul(int a, int b) {
return (1LL * a * b) % mod;
}
int mpow(int a, int n) {
if(n == 0) return 1;
int x = mpow(a, n/2);
x = mul(x, x);
if(n % 2) x = mul(a, x);
return x;
}
void add_self(int& a, int b) {
a += b;
if(a >= mod) a -=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N, Y;
cin >> N >> Y;
for(int i=0; i<=N; i++) {
for(int j=0; j<=N-i; j++) {
int k = N - i - j;
if(i * 1000 + j * 5000 + k * 10000 == Y) {
cout <... | 0 | 87,546,795 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using pq =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
const int maxn = 200000;
ll mod = INF;
int n;
int a[maxn];
bool key=false;
int ans;
int main(){
cin >> n;
rep(i,n){
cin >> a[i];
}
ans=n;
int now=0;
rep(i,n){
... | 0 | 14,733,129 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define intarr(arr, n) ll arr[n]; for (ll i = 0; i < n; i++) cin >> arr[i]
#define inpvec(vec,n) for(ll i=0;i... | #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<<" ";n... | 0 | 31,442,350 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #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() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> v(n);
REP(i,n){
int a,b;
cin >> a >> b;
v[i].firs... | 0 | 61,178,092 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
int cs[12] = {};
int as[12][12] = {{}};
rep(i, n) {
cin >> cs[i];
rep(j, m) { cin >> as[i][j]; }
}
int mmmoney = 100000000;
for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,H,W,cnt = 0,x0,x1,y0,y1,a,xi,yi,ans;
cin >> W >> H >> N;
x0 = 0;
y0 = 0;
x1 = W;
y1 = H;
rep(i, N){
cin >> xi >> yi >> a;
switch (a)
... | 0 | 47,941,908 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
} | #include<cstdio>
using namespace std;
int main(void) {
int X, A;
scanf("%d %d", &X, &A);
if (X < A) {
printf("%d\n", 0);
} else {
printf("%d\n", 10);
}
return 0;
} | 0 | 30,550,993 |
#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;
typedef pair<ll, int> LP;
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 > ... | #include <iostream>
#include <string>
using namespace std;
int main(void){
string s;
int shf;
int tmp;
while (1) {
int sum = 0;
cin >> s;
if (s == "-") break;
cin >> shf;
for (int i = 0; i < shf; i++) {
cin >> tmp;
sum += tmp;
}
... | 0 | 90,286,021 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
#define fo(i,s,e_ex) for(i=s;i<e_ex;i++)
#define Fo(i,k,n) for(i=k;k<n?i<=n:i>=n;k<n?i+=1:i-=1)
#define endl '\n'
#define MOD 1000000007
#define pbb push_back
#define mpp make_pair
#define ff first
#d... | 0 | 33,957,462 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main()
{
i64 N, X, M;
cin >> N >> X >> M;
vector<i64> A(M + 2), sum(M + 2), ind(M + 1, -1);
A[1] = X;
sum[1] = X;
ind[X] = 1;
i64 loopStart, loopSize;
for (i64 i = 2; i <= M + 1; i++)
{
A[i] = (A[i - 1] * A[... | #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 | 37,550,315 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include<iostream>
using namespace std;
#include<stdio.h>
#include<cctype>
int main() {
int r[26], i, j;
char ch;
for(i = 0; i < 26; i++) {
r[i] = 0;
}
for(i = 0; i < 26; i++) {
while( cin >> ch ) {
if(isupper(ch)) ch = (cha... | 0 | 1,689,873 |
#include <iostream>
int main(){
unsigned long long f = 1;
int n;
std::cin >> n;
for(int i=1;i<=n;++i){
f *= i;
}
std::cout << f << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define REPR(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define all(v) v.begin(), v.end()
tem... | 0 | 32,061,479 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A ;
B = N % 500 ;
if (A-B >=0 ) {
cout << "Yes" << endl;
}
if (A-B <0 ) {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | 0 | 95,031,157 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
scanf("%d %d",&n,&k);
vector<int> v(n);
for(int&x:v) scanf("%d",&x);
vector<int> dp(n+1,1e9);
dp[0] = 0;
for(int i = 1; i < n; i++)
for(int j = 1; j <= k; j++)
if(i-j >= 0)
dp[i] = min(dp[i], dp[i-j]+abs(v[i]-v[i-j]));
printf("%d\n", dp[... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, k, d, x;
bool ans[107];
int main() {
cin >> n >> k;
for(ll i = 0; i < k; ++i) {
cin >> d;
for(ll j = 0; j < d; ++j) {
cin >> x;
ans[x] = 1;
}
}
ll cnt = 0;
for(ll i = 1; i <=... | 0 | 45,411,558 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A;
int c = 1;
cin >> A;
rep(i, 10000) {
if(c > A) {
break;
}
c *= 2;
}
cout << c / 2 << endl;... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
string s; cin >> s;
bool ... | 0 | 45,332,845 |
#include <iostream>
using namespace std;
long long int get_digit(long long int l){
long long int digit = 0;
while(l != 0){
l /= 10;
digit++;
}
return digit;
}
int main(void){
long long int n;
cin >> n;
long long int j;
long long int x,y,z;
long long int ans = 20000000... | #include<bits/stdc++.h>
int main(){
int n;std::cin>>n;
std::vector<long long>a(n+2);
for(int i=0;i<n;i++){
std::cin>>a.at(1+i);
}
std::vector<int>ord(n);
std::iota(ord.begin(),ord.end(),1);
std::sort(ord.begin(),ord.end(),[&a](int x,int y){return a.at(x)>a.at(y);});
std::multiset... | 0 | 90,287,490 |
#include <iostream>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] < a[j+1]) {
swap(a[j], a[j+1]);
}
}
}
for (int i = 0; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 61,555,350 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 52,119,996 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string a, b;
long long e=0;
cin >> a >>b;
for (int i=0; i<3;i++){
char c=a[i], d=b[i];
if (c==d){
e++;}}
cout << e;} | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 20,128,042 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
char a, b;
cin >> a >> b;
if ((a == 'H')&&(b == 'H')) {
cout << 'H' << endl;
} else if ((a == 'H')&&(b == 'D')) {
cout << 'D' << endl;
} else if ((a == 'D')&&(b == 'H')) {
cout << 'D' << e... | #include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x... | 0 | 93,814,468 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
ll a, b, k;
cin >> a >> b >> k;
if(k <= a) cout << a - k << " " << b << endl;
else if(k <= a + b) cout << 0 << " " << b - (k - a) << endl;
else cout ... | #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 | 31,416,168 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 0 | 30,249,454 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[51][51];
ll dir[8][2]={{1,0},{0,1},{0,-1},{-1,0},{-1,1},{-1,-1},{1,-1},{1,1}};
map<ll,ll>di;
int main()
{
string s,t;
cin>>s;
cin>>t;
ll n,m;
n=s.size();
m=t.size();
if(m>n){
cout<<"UNRESTORABLE";return 0;
}
... | 0 | 72,940,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define gap ' '
#define L(i) ((i) - (&i))
const int MAXN = 1000010;
const int MAX = 1e6 + 1;
const int MOD = 1e9;
const int INF = 1e9;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n,0);
for(int i = 0; i < n; ++i)
cin... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int N;
string s;
bool f(vector<int> &t) {
for(int i=1; i<=N; i++) {
if(s[i] == 'o' && t[i]) {
t[i+1] = 1 - t[i-1];
} else if(s[i] == 'o') {
t[i+1] = t[i-1];
} else if(t[i]) {
t[i+... | 0 | 38,703,356 |
#include <stdio.h>
int main(void){
char chara[1200];
int count[26];
for(int i=0;i<1200;i++)chara[i]=0;
for (int i = 0; i<26; i++)count[i] = 0;
while(fgets(chara, sizeof(chara), stdin) != NULL){
for (int i = 0; i < sizeof(chara);i++) {
int ch = chara[i];
if (ch < 65 || ch >122)continue;
if (c... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | 0 | 42,570,510 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod=998244353;
int64_t jo(int64_t a,int64_t b){
int64_t c=a;
for(int i=0; i<b-1; i++){
c = c*a;
c = c%mod;
}
if (b==0) c=1;
return c;
}
int main(){
int n;
cin >> n;
int64_t ans=1;
vector<int64_t> cnt(n);
for(int i=0; i<n; i++){
int64_... | #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... | 0 | 32,165,131 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int) 1e5 + 7;
int n, sum[N];
pair<int, int> pmin[N];
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s;
n = (int) s.size();
for (int ch = 0; ch < 26; ch++) {
for (int i = 1; i <= n; i++) {
if (s[i - 1] - 'a' == ch) {
... | #include <bits/stdc++.h>
using namespace std;
void input(int& rnAchieve, vector<int>& rvnPrice, vector<vector<int>>& rvvnSkill)
{
int nPriceSiz, nSkillSiz;
cin >> nPriceSiz >> nSkillSiz >> rnAchieve;
rvnPrice.resize(nPriceSiz);
rvvnSkill.resize(nPriceSiz, vector<int>(nSkillSiz));
for (int ny = 0; ny < rvvnSki... | 0 | 100,248,934 |
#include<stdio.h>
#include<string.h>
int main(){
char s[100];
char p[100];
char a[200];
scanf("%s",s);
scanf("%s",p);
strcpy(a,s);
strcat(a,s);
if(strstr(a,p))
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include "iostream"
using namespace std;
int main(){
int mplication, mplicand;
for (int mplication = 1; mplication <= 9; ++mplication)
{
for (int mplicand = 1; mplicand <= 9; ++mplicand)
{
cout << mplication << "x" << mplicand << "=" << mplication * mplicand << endl;
}
}
return 0;
} | 0 | 15,987,003 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
static const int MAX = 10000;
using namespace std;
int V,E;
vector<int> G[MAX];
vector<int> ans;
bool used[MAX];
int indeg[MAX];
void bfs(int s){
queue<int> q;
q.push(s);
used[s]=true;
while(!q.empty())
{
int u=q.f... | #include <algorithm>
#include <iostream>
#include <stack>
#include <set>
#include <cstdio>
#include <cstring>
using namespace std;
int ans[100005];
int res[100005];
int kun[100005];
int a[200005][2]={0};
int main(){
int n;
cin>>n;
long long a[200005];
long long res=0;
for(int i=0;i<n;i++){
c... | 0 | 1,524,109 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v.begin(),unique(v.begin(... | #include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <deque>
#include <stack>
#include <iomanip>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007... | 0 | 24,284,631 |
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
int main() {
string n;
cin>>n;
if( n[0] == n[1] && n[1]==n[2])
{
cout<< "Yes" <<endl;}
else if(n[2] == n[3] && n[2]==n[1] )
{
cout<< "Yes" <<endl;}
else {cout<<"No"<<endl;}
} | #include <iostream>
using namespace std;
int main() {
while (true) {
int x, y;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
if (x == 0 && y == 0) {
break;
} else {
cout << x << " " << y << endl;
}
}
} | 0 | 77,158,242 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <al... | 0 | 83,444,550 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
struct Q{char x; int a, b, c, d;} a[2001][2001];
int n, m;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) cin >> a[i][j].x;
for(int i = 1; i <= n; i++) {
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | 0 | 80,260,261 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char A;
cin >> A;
int c = 0;
string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for(int i = 0; i < 26; i++) {
if(A == ALP.at(i)) {
cout << "A" << endl;
c++;
}
}
if(c == 0) {
cout << "a" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9+9;
int g[103][103];
int edg[1004][3];
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
g[i][j] = inf;
}
g[i][i] = 0;
}
for(int i=0;i<m;i++){
for(int j=0;j<3;j++)... | 0 | 67,512,924 |
#include <stdio.h>
#include <string>
#include <string.h>
#include <cstring>
#include <algorithm>
const float a=1.05;
using namespace std;
int main(void)
{
int debt,week;
scanf("%d",&week);
debt=100000;
for(int loop=1;loop<=week;loop++)
{
debt*=1.05;
if(debt%1000!=0)
{
debt=debt-(debt%1000)+1000;
}
}
p... | #include <iostream>
#include <cstdio>
#define INF (1ll << 32)
#define int64 long long
using namespace std;
long long dp[105][105];
void pre (int size) {
for ( int i = 0 ;i < size; i++) {
for ( int j = 0;j < size; j++) {
dp[i][j] = ((i == j) ? 0 : INF );
}
}
}
main()
{
int v, e;
int s, t, d;
int... | 0 | 31,693,251 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
int64_t sum_mod (int64_t a, int64_t b) {
return (a + b) % mod;
}
int64_t sub_mod (int64_t a, int64_t b) {
return (a - b + mod) % mod;
}
int64_t mul_mod (int64_t a, int64_t b) {
return (a * b) % mod;
}
int64_t pow_mod (int64_t a, int6... | 0 | 52,134,178 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int counter(ll n)
{
int cnt = 0 ;
while(n)
{
n/=10;
cnt++;
}
return cnt ;
}
int main()
{
ll n,m;
cin >> n ;
int mn = INT_MAX;
for(ll i=1; i*i<=n; i++)
{
if(n%i==0)
{
int mx = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 4,510,237 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 10,307,425 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;cin>>N>>M;vector<bool>V(N,true);vector<int>F(N);int P=0;int A=0;
for(int X=0;X<M;X++){
int L;string S;cin>>L>>S;
if(V[L-1]&&S=="WA"){
P++;F[L-1]++;
}
if(V[L-1]&&S=="AC"){
A++;V[L-1]=false;
}
}
for(int X=0;X<N;X++)... | #include<bits/stdc++.h>
using namespace std;
char str[603][603]; int N , len[603][603][2];
int qry(int x1 , int y1 , int tp){
if(len[x1][y1][tp] != -1) return len[x1][y1][tp];
int &l = len[x1][y1][tp] = !tp;
int p = x1 , q = y1 , r = x1 - tp , s = y1 + tp;
while(str[p + l][q - l] && str[r - l][s + l] && str[p + l][... | 0 | 29,077,867 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using iii = pair<ii, ll>;
#define vt vector
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const ll MOD = 1e9 + 7;
const ll INF = 2e9;
... | #include"bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = b - 1; i >= a; i--)
#define RREP(i, n) RFOR(i, 0, n)
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define rrep(i, a, b) for (auto i = a; i > b; i--)
#define range(i, a, b) (a <... | 0 | 80,941,030 |
#include <bits/stdc++.h>
using namespace std;
long long int solve(vector<long long int> H, long long int K){
sort(H.begin(), H.end());
if(H.size()<=K) return 0;
long long int cost = 0;
for(long long int i=0; i<H.size()-K; ++i) cost += H[i];
return cost;
}
int main(){
long long int N, K; cin>>N>>K;
vect... | #include<stdio.h>
#include<string.h>
int main(){
char s1[101],s2[101];
int n,i,taro=0,hana=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %s",s1,s2);
if(strcmp(s1,s2)==0){
taro++;
hana++;
}
if(strcmp(s1,s2)>0){
taro=taro+3;
}
if(strcmp(s1,s2)<0){
hana=hana+3;
... | 0 | 820,975 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main()
{
string s;
cin >> s;
if (s == "SSS")
cout << "0" << endl;
if (s == "SSR")
cout << "1" << endl;
if (s == "SRS")
cout << "1" << endl;
if (s == "SRR")
cout << "2" << endl;
if (s == "RSS")
cou... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int long long
#define pb push_back
#define fi first
#define se second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define IO ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pii pair<int,int>
#def... | 0 | 49,499,448 |
#include <iostream>
using namespace std;
int main()
{
int i=0,j, k, l, h[100], w[100];
cin >> h[0] >> w[0];
while ((h[i] != 0) && (w[i] != 0)) {
i++;
cin >> h[i] >> w[i];
}
for (j=0; j < i; j++) {
for (k=0; k < w[j]; k++)
cout << '#';
cout << endl;
for (k=0; k < (h[j]-2); k++) {
cout << '#';
for... | #define loop(i, s, e) for(ll i = s;i < e;i++)
#include <iostream>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long signed ll;
ll v, e, s, t;
vector<pair<ll, ll>> w;
bool color[10000];
ll indeg[10000];
queue<ll> q;
vector<ll... | 0 | 73,128,277 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i,n) for(int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
ll M = 1000000000 + 7;
template<class T>bool chmax(T &a, const T &b) { i... | 0 | 55,557,893 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
for(int i = n; i <= 999; ++i){
int t = i;
... | #include <iostream>
#include <complex>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) ((EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
double cross(P a, P b)
{
return (a.real() * b.imag() - a.imag() * b.real());
}
bool is_par... | 0 | 10,680,263 |
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin()... | 0 | 58,100,196 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
long long flag=0;
cin >> n;
vector<string> a(n);
set<string> b;
for(int i=0; i<n;i++){
cin >> a[i];
b.insert(a[i]);
}
if(b.size()!=n) flag=1;
for(int i=0; i<n-1; i++){
if(a[i+1][0]!=a[i][a[i].size()-1]){
flag=1;
... | #include<iostream>
#include<vector>
int main(void){
int n;
std::cin >> n;
std::vector<int> a(n+1), b(n);
for(int i = 0; i < n+1; i++){
std::cin >> a[i];
}
for(int i = 0; i < n; i++){
std::cin >> b[i];
}
long long ans = 0;
for(int i = 0; i < n; i++){
if(a[i] >=... | 0 | 99,497,689 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
signed main() {
int n;
string s;
cin >> n >> s;
if(s.substr(0, n/2) == s.substr(n/2, n/2) && n % 2 == 0) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
} | #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;
#define all(v) v.begin(), v.end()
int main(){
ll N,P,a=0,b=0,ans=1;
cin >> N >> P;
vector<ll> A(N);
rep(i,N){
cin >> A.at(i);
A.at(i)... | 0 | 38,598,505 |
#include <bits/stdc++.h>
using namespace std;
int main(){
signed long long int K,A,B;
cin>>K>>A>>B;
unsigned long long int bisket=1;
for(int i=1;i<=K;i++){
if(i>=A&&B-A>=2&&i!=K){
i++;
bisket+=B-A;
}
else bisket++;
}
cout<<bisket<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
ll N;
ll solve(vector<ll> A, vector<bool> B) {
ll ans = 0;
for (int i = 0; i < N; i++) {
if (i > 0) {
if (A.at(i-1) == A.at(i)) {
B.at(A.at(i)) = false;
... | 0 | 92,952,299 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int cnt[86401];
int toSec(string s) {
int h = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[3] - '0') * 10 + (s[4] - '0');
int sec = (s[6] - '0') * 10 + (s[7] - '0');
return h * 3600 + m * 60 + sec;
}
int main() {
while (cin >> n... | 0 | 31,860,487 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
int main()
{
ft
int t,i,j,n,m=... | #include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);-... | 0 | 80,996,474 |
#include<iostream>
using namespace std;
int main(){
int i,j;
for(i = 1;i <= 9;i++){
for(j = 1;j <= 9;j++){
cout << i << "x" << j << "="<<i*j<<"\n";
}
}
return 0;
} | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1;
... | 0 | 44,389,510 |
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | #include <iostream>
int main(int argc, char **argv){
int a = 0;
int b = 0;
int c = 0;
int n = 0;
std::cin >> a >> b >> c;
for(int i = a; i <= b; i++){
if(c % i == 0){n++;}
}
std::cout << n << std::endl;
return 0;
} | 0 | 76,810,747 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define RREP(i,n) for(ll (i)=(n)-1;(i)>=0;(i)--)
#define FOR(i,a,b) for(ll (i)=(a);(i)<(b);(i)++)
#define FORR(i,a... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 13,297,215 |
#include <stdio.h>
#include <vector>
using namespace std;
struct Node{
Node(){
parent = -1;
depth = num_of_children = 0;
}
int parent;
int depth;
vector<int> children;
int num_of_children;
};
void calcDepth(Node nodes[],int root_id){
for(int i = 0;i < nodes[root_id].num_of_children;i++){
nodes[nodes[root_i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int k=1,x=0,count=0;
for(int i=0;i<n;i++){
cin>>x;
if(x==k){
k++;
}
}
if(k==1) cout <<-1 << endl;
else cout<<n-k+1<<endl;
return 0;
} | 0 | 76,169,542 |
#include <bits/stdc++.h>
using namespace std;
long long dp[310][610];
int main() {
int n, k; cin >> n >> k;
vector<long long> h(n+1, 0);
for (int i = 0; i <= n+1; i++) {
for (int j = 0; j <= 2*n; j++) dp[i][j] = 1e16;
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) cin >> h[i+1];
for (in... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 1,243,983 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vec... | 0 | 13,979,695 |
#include<iostream>
#include<queue>
using namespace std;
int main(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
priority_queue<long long> rap,gap,tap;
for(int i=0;i<a;++i){
long long r;
cin>>r;
rap.push(r);
}
for(int i=0;i<b;++i){
long long g;
cin>>g;
gap.p... | #include<stdio.h>
int main(void){
int i,n,k,sum,max;
int N[150000];
while(0==0){
scanf("%d %d",&n,&k);
sum=0;
if(n==0 && k==0) break;
for(i=0;i<n;i++)
scanf("%d",&N[i]);
for(i=0;i<k;i++)
sum+=N[i];
max=sum;
for(i=k;i<n;i++){
sum+=N[i];
sum-=N[i-k];
if(sum>max)max=sum;
}
printf("%d... | 0 | 12,506,089 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | #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... | 0 | 17,684,594 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int n,k; cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) a[i]=0;
while(k--)
{
int d; cin>>d;
for(int i=0;i<d;i++)
{
int x; cin>>x;
a[x-1]++;
}
}
int ans=0;
for(int i=0;i<n;i++) if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
string s; cin >> s;
ll cnt = 0,ans = 0;
for(... | 0 | 80,042,656 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
rep(i, n){
int tmp = i+1;
int sum =... | 0 | 79,476,899 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1LL << 31 - 1)
#define MOD int(1e9+7)
#define repi(i,j,n) for(int i = (j); i < (n); ++i)
#define rep(i,n) repi(i,0,n)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
inline void init() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int count = 0;
for (int i = c; i < d; i++)
{
for (int j = a; j < b; j++)
{
if(i == j) count++;
}
}
printf("%d\n", count)... | 0 | 49,953,900 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
char C[1000][10... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <iterator>
#include <utility>
#include <unordered_map>
using namespace std;
vector<string> splitString(const string& str, const string& separator = " ") {
vector<string> ret;
std::size_t bp, ep;
bp = ep = 0;
while((ep = str.find_fir... | 0 | 5,760,652 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int solve(vector<int>& vec, int n, int k)
{
int dp[n + 2][k + 2];
for(int j = 0; j <= k; j++)dp[1][j] = (j > vec[1])?0:1;
for(int i = 2; i <= n ;i++){
for(int j = 0; j <= k; j++){
if(j == 0)dp[i][j] = dp[i-1][j];
else{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 90,827,739 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
vector<vector<int>> edge(n, vector<int>());
vector<vector<int>> weight(n, vector<int>());
for(int i=0; i<n-1; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]-... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
map<int, int> mp;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
sort(a.begin(), a.end());
if (a[a.size() - 1] != a[a.size() - 2]) {
puts("Imp... | 0 | 18,902,407 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <list>
#include <set>
#include <queue>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#define ll long long
#define _ ios_base::sync_with_stdio(0);cin.tie(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N=1e5+5;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n;cin>>n;
ll a[n],sum=0;
for(ll i=0;i<n;i++)cin>>a[i],sum+=a[i];
ll tot = (n*(n+1))/2;
if(sum%tot)return cout<<"NO" , 0;
... | 0 | 92,577,472 |
#include <iostream>
#include <string>
int main()
{
std::string s;
std::cin >> s;
for (const char c : s)
{
if (c == ',')
{
std::cout << ' ';
}
else
{
std::cout << c;
}
}
std::cout << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 6,474,330 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<string> s(3);
for(int i=0; i<3; i++){
cin >> s.at(i);
}
string ans;
string sam="abcdefghijklmnopqrstuvwxyz";
string res="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for(int i=0; i<3; i++){
for(int j=0; j<26; j++){
if(s.at(i).at(0)==sam.at(j)) ans+=res.at(j... | #include <bits/stdc++.h>
#define FOR(i, m, n) for(int i = m; i <= n; i++)
using namespace std;
int main(){
int n, x;
while (true) {
cin >> n >> x;
if (n == 0 && x == 0) break;
int cnt = 0;
FOR(i, 1, n) FOR(j, i+1, n) FOR(k, j+1, n){
if (i+j+k == x) cnt++;
}
... | 0 | 21,623,736 |
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#includ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define reps(i,s,n) for (int i=(s); i<(n); i++)
#define rep1(i,n) for (int i=1; i<=(n); i++)
#define repr(i,s,n) for (int i=(s)-1; i>=(n); i--)
#define print(a) cout ... | 0 | 93,162,614 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int N;
cin >> N;
vector<ll>A(N);
vector<ll>B(N);
vector<pair<ll, int>>C(N);
for (int i = 0; i < N; i ++) {
cin >> A[i] >> B[i];
C[i] = make_pair(A[i] + B[i], i);
}
sort(C.begin(), C.end());
ll ans = 0;
for (int ... | 0 | 24,652,578 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
vector<vector<char> > v;
vector<char> mv;
mv.push_back(' ');mv.push_back('.');mv.push_back(',');mv.push_back('!');mv.push_back('?');
v.push_back(mv);
mv.clear();
mv.push_back('c');mv.push_back('a');mv.push_back('b');
... | 0 | 51,125,040 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | 0 | 51,081,213 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i < n + 1; i++)
{
int x;
cin >> x;
a[x] = i;
}
for (int i ... | 0 | 58,392,244 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(val) cerr << "Value " << #val << " : " << val << '\n... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 0 | 62,114,597 |
#include<bits/stdc++.h>
using namespace std;
#define Fast_as_duck ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define forn(i,st,n) for(int i = st; i < n ; i++)
#define rev(i,st,n) for(int i = st; i >= n ; i--)
#define ss second
#define ff first
#define ll long long
typedef pair <int , in... | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <... | 0 | 15,165,587 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include <stdio.h>
int main(){
int n,m;
int i,j;
scanf("%d",&n);
while(n!=0){
char before[n],after[n];
for(i=0;i<n;i++){
scanf(" %c %c",&before[i],&after[i]);
}
scanf("%d",&m);
char data[m];
for(i=0;i<m;i++){
scanf(" %c",&data[i]);
for(j=0;j<n;j++){
if(data[i]==before[j]){
data[i]=afte... | 0 | 89,285,852 |
#include <iostream>
using namespace std;
int main(){
while(1) {
int price;
cin >> price;
if (price == 0) break;
int otsuri = 1000 - price;
int nCoin = 0;
nCoin += otsuri/500;
otsuri = otsuri % 500;
nCoin += otsuri/100;
otsuri = otsuri % 100;
nCoin += otsuri/50;
otsuri = otsuri % 50;
nCoin +=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int ... | 0 | 48,340,367 |
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main (void) {
int arr[100001];
int size,
rem, coun, res;
cin >> size;
for (int it = 0; it < size; ++it) cin >> arr[it];
sort(arr, arr + size);
rem = arr[0];
coun = 1;
res = 0;
for (int it = 1; it < size; ++it) {
if (arr[i... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define a... | 0 | 97,027,596 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =200005;
const int MOD =1000000007;
signed main(){
int... | 0 | 27,705,997 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct Edge {
ll to;
ll cost;
ll index;
};... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#d... | 0 | 41,738,358 |
#include <bits/stdc++.h>
#define SIZE 10000
using namespace std;
vector<pair<double, double> > vertex;
void koch_curve(const pair<double, double> &p1, const pair<double, double> &p2, int n)
{
if (n == 0)
{
return;
}
double ax = p1.first * 2 / 3 + p2.first / 3, ay = p1.second * 2 / 3 + p2.second ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
int main(){
ll n, k;
cin >> n >> k;
int max_bit = 31;
vector<ll> a(n);
vector<ll> b(n);
for(int i = 0; i < n; i++){
... | 0 | 12,835,137 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ll long long
#define ld long double
#define pr pair<int,int>
#define prr pair<pr,int>
#define mp make_pair
#define pb push_back
#define eb emplac... | 0 | 27,506,311 |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, ans = 3, now;
scanf("%lld%lld", &h, &w);
char s[h][w + 10];
ll cnt[4][h][w];
for(i = 0; i < h; ++i) scanf("%s", s[i]);
for(i = 0; i < h; ++i) for(j = 0; j < w; ++j) {
cnt[0][i][j] = cnt[1][i][j] = 1;
if(s[i][j] == '#') cnt[... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
static const int INF = 1e9;
static const int SIZE = 101;
typedef pair<int, int> P;
int d[SIZE];
vector<int> G[SIZE];
void solve()
{
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int u, k;
cin >> u >> k;
for (int j = 0; j < k; ++j)
... | 0 | 62,497,615 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
using namespace std;
int main() {
vector<int> s,t;
int a,i,j,k,l,len;
int max = 0;
for (i = 0; i <= 100; i++) {
s.push_back(0);
}
while (cin >> a) {
s[a] += 1;
}
for (j = 0; j <= 100; j++) {
if (max < s[j]) {
max = s[j];
}
}
for... | #include <bits/stdc++.h>
using namespace std;
struct edge {int to,cost;};
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
typedef vector<edge> VE;
static const long long INF = 9223372000000000000/2;
static const int NIL = -1;
static const int MOD = 1000000007;
#define pb push_back
#define mp make... | 0 | 77,656,384 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const long long INF = 1000000000000;
const long long N = 10000;
long long n,m;
struct edge{
long long from,to,cost;
}w[N];
long long d[N];
void path(long long s){
for(long long i=0;i<n;i++) d[i]=INF;
d[s] = 0;
while... | #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
int a;
long sum = 0;
int m = 1000000, M = -1000000;
for(int i = 0; i < n; i++){
scanf("%d", &a);
M = max(M, a);
m = min(m, a);
sum += a;
}
printf("%d %d %ld\n", m, M, sum);
return 0;
} | 0 | 35,993,912 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c=0;
double a=0,b=0,x=0;
cin >> a;
cin >> b;
x = (a + b)/2 + 0.5;
c = x;
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
cin >> x.at(i).at(j);
}
}
double dis = 0;
int ans = 0;
for(int i=0; i<=n; i++){
f... | 0 | 18,146,864 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100010
#define ll long long
#define db double
#define vi vector<int>
#define pb push_back
#define mod 998244353
ll ksm(ll a, ll b) {
if (!b) return 1;
ll ns = ksm(a, b >> 1);
ns = ns * ns % mod;
if (b & 1) ns = ns * a % mod;
return ns;
}
int a[ma... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
int field[1010][1010] = {0};
queue<pair<int, int>> que;
for(int i=0; i<h; i++){
string s; cin >> s;
for(int j=0; j<w; j++)
if(s[j] == '#') que.push({i+1, j+1});
else field[i+1][j+1] = 1e9;
}
int d[] = ... | 0 | 93,588,483 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef long long LL;
LL n,k,a[200005];
LL pre[200005] = {0};
map <LL,LL> mp;
LL tot = 0;
int main(){
ios::sync_with_stdio(false);
cin >> n >> k;
for(LL i = 1;i <= n;i ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, K;
cin >> N >> K;
vector<pa... | 0 | 17,535,430 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) ... | 0 | 3,909,227 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.