code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int data[1001000]={0};
int main(){
int n,k;
int sum = -10000000;
int tmp;
while(1){
cin >> n >> k;
tmp = 0;
if(n == 0 && k == 0) break;
for(int i=0;i<n;i++) cin >> data[i];
for(int i=0;i<k;i++) tmp += data[i];
sum =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 1,688,496 |
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <bitset>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
... | 0 | 3,500,040 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
string str;
getline(cin, str);
REP(i, str.size()){
if (islower(str[i])) cout << (char)toupper(str[i]);
else if (isupper(str[i])) cout << (char)tolower(str[i]);
else cout << (char)s... | #include<string>
#include<iostream>
using namespace std;
int main() {
int count;
cin >> count;
int scoreA =0 , scoreB = 0;
for (int i = 0; i < count; i++) {
string a, b;
cin >> a >> b;
if (a < b) {
scoreB += 3;
}
else if (a > b) {
scoreA += 3;
}
else {
scoreA++;
scoreB++;
}
}
cout << s... | 0 | 33,102,298 |
#include <string>
#include <iostream>
using namespace std;
int main (){
while(1){
string input = "";
int m = 0;
cin >> input;
if(input == "-") break;
cin >> m;
int *H = new int[m]();
for(int i=0; i<m; i++){
cin >> H[i];
}
for(int i=0; i<m; i++){
input = input.substr(H[i]) + input.substr(0, H[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 51;
int n;
int d[N];
int psum[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> d[i];
sum += d[i];
psum[i] = sum;
... | 0 | 17,733,569 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) ... | #include <bits/stdc++.h>
# define ll int64_t
#define rep(i,n) for(ll i=0;i<n;i++)
#define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
using namespace std;
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
... | 0 | 52,522,127 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> A(n);
int x;
rep(i,n){
cin>>x;
A[i]=x-i-1;
}
sort(ALL(A));
int m=A[n/2];
ll ans=0;
rep(i,n){
... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include... | 0 | 48,902,542 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
int n; cin >> n;
string s; cin >> s;
int l = s.size();
if(l>n){
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 48,170,782 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
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<vector<long long>> vvll;
template <typename T... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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... | 0 | 13,315,380 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
int selection_sort(vector<int>... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
for(int i=N;i<1000;i++) {
if((i/100) == ((i/10)%10) && (i/100) == (i%10)) {
cout << i << endl;
break;
}
}
return 0;
} | 0 | 95,370,207 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
std::queue<std::pair<int, int>> q;
std::vector<std::vector<int>> vec;
std::vector<int> distances;
int n, id, num, d;
void bfs_search(int start_id) {
q.push(std::make_pair(start_id, 0));
while (!q.empty()) {
au... | 0 | 49,368,181 |
#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>
#define vi vector<int>
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define ll long long int
#define pi pair<ll,ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(int a, int b)
{
if(b==0)
return a;... | 0 | 84,386,787 |
#include <iostream>
#include <string>
using namespace std;
void North(int *nums){
nums[6]=nums[0];
nums[0]=nums[1];
nums[1]=nums[5];
nums[5]=nums[4];
nums[4]=nums[6];
}
void East(int *nums){
nums[6]=nums[0];
nums[0]=nums[3];
nums[3]=nums[5];
nums[5]=nums[2];
nums[2]=nums[6];
}
vo... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 83,525,610 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
string S, T;
cin >> S >> T;
if(S.size() < T.size()) {
cout << "UNRESTORABLE\n";
return 0;
}
vector<int> candidate;
for(int i = 0; i <= S.size() - T.si... | 0 | 39,255,049 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
int main(){
int n;
cin>>n;
vector<pair<pi,int> >arr;
for(int i=0; i<n; i++){
int x,y;
cin>>x>>y;
arr.push_back(make_pair(pi(x,y),0));
}
for(int i=0; i<n; i++){
int x,y;
cin>>x>>y;
arr.push_back(make_pair(pi(x,y),1));
}
sort(arr.b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repi(i,x,n) for(ll i=x;i<(ll)(n);i+... | 0 | 28,132,170 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
int main() {
int R, G, B, N, count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; R * i <= N; i++) {
... | 0 | 76,169,684 |
#include<iostream>
using namespace std;
int main(){
int str[10000],i;
str[1]=1;
for(int i=1;i<i+1;i++){
cin>>str[i];
if(str[i]==0){
for(int a=1;a<i;a++){
cout<<"Case "<<a<<": "<<str[a]<<endl;
}
break;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int sw=0;
for (int i=0; i<n; i++){
cin >> a[i];
}
for (int i=0; i<n; i++){
int minj=i;
for (int j=i; j<n; j++){
if (a[j]<a[minj]){
minj=j;
}
... | 0 | 70,654,931 |
#include<cstdio>
#include<string>
using namespace std;
int P[10010];
void init(int N){
for(int i=0;i<N;i++){
P[i]=i;
}
}
int root(int a){
if(P[a]==a) return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a)==root(b);
}
void unite(int a,int b){
P[root(a)]=root(b);
}
int main(){... | #include<iostream>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
int main()
{
ios;
int n,m;
cin>>n>>m;
n%=500;
if(m>=n)cout<<"Yes\n";
else cout<<"No\n";
} | 0 | 69,393,611 |
#include<iostream>
using namespace std;
int main()
{
int n, i, j;
int b[1000] = { 0 };
int f[1000] = { 0 };
int r[1000] = { 0 };
int v[1000] = { 0 };
int A[3][10] = { 0 };
int B[3][10] = { 0 };
int C[3][10] = { 0 };
int D[3][10] = { 0 };
cin >> n;
for (i = 0; i < n; i++)
{
cin >> b[i] >> f[i] >> r[i] >> v... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i =... | 0 | 77,054,483 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int n; cin>>n;
cout<<(n-2)*180<<endl;
return 0;
} | 0 | 93,525,133 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | 0 | 51,980,580 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,... | #include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 100005
#define MOD 1000000007
using namespace std;
int n,k,a[105],dp[105][M];
int pre[M];
int mod(int x) { x %= MOD; if (x<0) x += MOD; return x; }
int main()
{
scanf("%d %d", &n, &k);
REP(i,1,n) s... | 0 | 28,040,593 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) < 0) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n, m, k, cnt, s;
int mask[10];
int p[10];
int main() {
c... | 0 | 52,691,490 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main(){
ll ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#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
#define eb emplace_back
template<class T>void chmax(T &a,... | 0 | 15,065,549 |
#include<iostream>
using namespace std;
int sum(int a) {
int ret = 0;
while (a > 0) {
ret += a % 10;
a /= 10;
}
return ret;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
int s = 0;
for (int i = 1; i <= n; i++) {
int ss = sum(i);
if (ss<= b && ss >= a) s += i;
}
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#def... | 0 | 68,889,926 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int64_t k,n,c=0;
cin>>s>>k;
n=s.length();
if(s.at(0)!='1') cout<<s.at(0)<<endl;
else{
while(c<n&&s.at(c)=='1') c++;
if(k<=c) cout<<'1'<<endl;
else cout<<s.at(c)<<endl;
}
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 11,688,271 |
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve(ll N, vector<ll> A) {
sort(A.begin(), A.end());
ll min_ix = 0;
while (min_ix < N - 1 && A[min_ix + 1] > 0) {
ll ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"Yes"<<endl
#define cno cout<<"No"<<endl
#define sp <<" "<<
#define CST(x) cout<<fixed<<setprecision(x)
#define PI 3.14159265359
using namespace std;
using ll = long long;
using ld = long double;
int m... | 0 | 77,032,099 |
#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");
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 <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 17,299,531 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int N, M, K; cin >> N >> M >> K;
for(int i=0; i<N+1; i++){
for(int j=0; j<M+1; ... | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff... | 0 | 24,478,891 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 67,824,400 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
struct edge{int to;ll cost;};
typedef pair<ll,int> P;
const ll INF=1000000000000LL;
const ll MOD=1000000007LL;
const ll MAX=100010;
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
cout<<s<<endl;
return 0;
} | #include<bits/stdc++.h>
#define forw(m,i,n) for(i=m; i<n; i++)
#define done return 0
#define in(x) cin >> x
#define out(x) cout << x << endl
#define pb(x) push_back(x)
#define w(x) while(x--)
#define maxx 1000000000
using namespace std;
typedef long long ll;
map<int,int>dig;
int main() {
int a,b,i;
in(a),in(b)... | 0 | 44,296,111 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,j,k,l,a,b,d,s,c;
cin>>n;
long long arr[n+10];
for(i=0; i<n; i++)
{
cin>>arr[i];
}
sort(arr+0,arr+n);
s=1;
c=0;
for(i=n-1; i>=0; i--)
{
if(arr[i]==arr[i-1])
{
s*=arr[i];... | #include <iostream>
using namespace std;
int ans,s,x[101],n,i,j,mn,mx;
int main()
{
cin >> n;
for (i=1; i<=n; i++)
{
cin >> x[i];
mn=min(mn,x[i]);
mx=max(x[i],mx);
}
for (i=mn; i<=mx; i++)
{
for (j=1; j<=n; j++)
s+=(max(i,x[j])-min(i,x[j]))*(max(i,x[j])-min(i,x[j]));
... | 0 | 39,673,604 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
char s;
cin>>s;
(s=='a'||s=='e'||s=='i'||s=='o'||s=='u')?cout<<"vowel":cout<<"consonant";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<string> s(50);
map<char, int> memo;
for(int i=0; i<n; i++){
cin >> s[i];
sort(s[i].begin(), s[i].end());
char tmp;
int cnt=0;
map<char, int> dis;
for(int j=0; j<s[i].length();... | 0 | 14,091,759 |
#include <bits/stdc++.h>
using namespace std;
double pi=3.14159265358979323846264338;
inline void ex(){cout<<"Yes"<<endl;exit(0);}
long long a,b,c,d;
long long n,k,ind;
bool ok[1000001];
long long arr[11][3];
map<long long,long long>ma;
long long arr3[200001];
long long N;
long long T(long long t){
if(t<0)return t+N;
... | #include <iostream>
#include <vector>
#include <queue>
int main() {
int n;
std::cin >> n;
std::vector<std::vector<int>> edges(n);
for (auto&& v : edges) {
int k;
std::cin >> k >> k;
for (int i = 0; i < k; ++i) {
int u;
std::cin >> u;
--u;
v.push_back(u);
}
}
std::vector<int> depth(n, -1);
dep... | 0 | 29,482,879 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 58,855,938 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 22,990,121 |
#include<iostream>
using namespace std;
int main(){
int x[3000], y[3000], i=0;
while(1){
cin >> x[i] >> y[i];
if(x[i]==0 && y[i]==0) break;
else i++;
}
for(int j = 0; j < i; j++){
if(x[j] < y[j] || x[j] == y[j]){
cout << x[j] << " " << y[j] << endl;
}
else{
cout << y[j] << " ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<int> vec;
const int N = 300030;
int A[N];
int P[N];
int n;
int qu(int o) {
int lo=0, hi=n;
while (lo<hi) {
int mid = (lo+hi+1)/2;
if (mid != 0 && vec[mid-1] < o) {
hi = mid-1;
}
else {
lo =... | 0 | 33,441,739 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin >> A;
for(int i=0; i<3 ; i++)
{
if(A.at(i)=='9')cout << '1';
if(A.at(i)=='1')cout << '9';
}
cout << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[])
{
vector<char> record;
int m, f, r;
while (true)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
{
record.push_back(... | 0 | 58,602,177 |
#include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
vector<int> A, B;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N, K; cin >> N >> K;
for (int i = 0; i < N; ++i) {
int a, b; cin >> a >> b;
A.push_back(a);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#define gcd(a,b) __gcd(a,b)
#define all(x) x.begin(),x.... | 0 | 80,707,671 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d,t,s;
cin >> d >> t >> s;
if (s*t>=d) cout << "Yes" << endl;
else cout << "No " << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
signed main() {
int n;
cin >> n;
vi a(n);
map<int, int> mp;
for(int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
int ans = 0;
for(auto& i : mp) {
ans += ((i.second) * ... | 0 | 77,588,217 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n;
cin>>n;
vector<string> hoge(n);
for(long long int i=0; i<n; i+... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 58,182,865 |
#include<iostream>
#include<vector>
#include<algorithm>
int main () {
std::vector<int> a(5);
std::vector<int> uq;
int sum = 0;
for (int i = 0; i < 5; i++)
{
std::cin >> a[i];
if (a[i] % 10)
{
uq.push_back(a[i] % 10);
a[i] += (10 - a[i] % 10);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, K;
cin >> A >> B >> K;
int counter = 0;
int ans = 0;
for(int i = min(A, B); i >= 1; i--){
if(A % i == 0 && B % i == 0){
counter++;
}
if(counter == K){
ans = i;
break;
... | 0 | 7,689,171 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int cnt=0;
for(int i=a; i<=b; i++){
if(c%i==0){
cnt+=1;
}
}
cout<<cnt<<"\n";
return 0;
} | #include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 26+5;
int n, vis[N]; c... | 0 | 37,302,881 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(i... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main(){
int maxv=0;
int sum=0;
rep(i,5){
int t;
cin>>t;
int x=t%10;
if(x!=0){
t+=(10-x);
maxv=max(maxv,10-x);
}
sum+=t... | 0 | 57,045,436 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (INT_MAX / 4)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define TIMER_S(start) chrono::system_clock::time_point start = chrono::system_clock::now();
#define TIMER_E(end) chrono::system_clock::time_point end = chrono:... | 0 | 82,316,913 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
int H, W, K;
string *c;
set<int> s;
int dfs(int i) {
if (i == H + W) {
int tmp = 0;
for (int j = 0; j < H; j++) {
for (int k = 0; k < W; k++) {
if (c[j][k] == '#' && s.find(j) == s... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
const ll maxN = 1000000000;
ll S;
cin >> ... | 0 | 59,856,988 |
#include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
int main(){
int i,n,a=0,b=0;
string s;
stack<char> sta;
cin >> n;
cin >> s;
for(i=0;i<n;i++){
if(!sta.empty() && s[i]==')' && sta.top()=='('){
sta.pop();
b--;
}else{
sta.push(s[i]);
if(s[i]==')') a... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int c1=0,c2=0,c3=0,c4=0;
for(int i=0;i<3;i++){
int ai,bi;
cin>>ai>>bi;
if(ai==1)
c1++;
else if(ai==2)
c2++;
else if(ai==3)
c3++;
else
c4++;
if(bi==1)... | 0 | 34,749,235 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int N;
ll D, A;
vector<ll> X, H;
ll solve(){
vector<int> ids(N);
for(int i = 0; i < N; i++) ids[i] = i;
sort(ids.begin(), ids.end(), [&](int i, int j) {return X[i] < X[j]; });
vector<ll> nX(N), nH(N);
for(i... | 0 | 32,338,297 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
long n;
cin >> n;
vector<long> h(n);
int m = 0;
int c = 0;
cin >> h[0];
rep(i, n - 1) {
cin >> h[i + 1];
if(h[i + 1] > h[i])
m = max(m, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int H,W,K;
cin >> H >> W >> K;
vector<string>c(H);
for(int i = 0; i < H; i++) {
cin >> c[i];
}
... | 0 | 4,174,936 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
int main(){
int N;
cin >> N;
long long A[N];
for(int i = 0; i < N;i++)cin >> A[i];
sort(A,A+N);
long long ans = 0;
long long sum = 0;
for(int i = 0; i < N;i++){
if(sum*2<A[i]){
ans = 0... | 0 | 50,471,773 |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(){
int n;
vector<char> str;
while(cin >> n, n){
map<char,char> m;
char a, b;
for(int i=0; i<n; i++){
cin >> a >> b;
m[a] = b;
}
cin >> n;
for(int i=0; i<... | #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>
#inclu... | 0 | 70,631,085 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define int ll
signed main ()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
double now;
cin >> now;
now /= 3.0;
cout << fixed << setprecisio... | #include<iostream>
#include <cmath>
using namespace std;
int main(){
int num;
int i;
double x1, y1, x2, y2, x3, y3, x4, y4;
double cross;
cin >> num;
for(i = 0; i < num; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
cross = abs((x2 - x1) * (y4 - y3) - (y2 - y1) * (x4... | 0 | 55,637,017 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n... | #include <bits/stdc++.h>
#define INT(name) int name; scanf("%d",&name);
#define VINT(name,n) vector<int> name(n); for(int i = 0;i < n;i++) scanf("%d",&name[i]);
using namespace std;
int main(int argc, char const *argv[]){
for(int i = 1;i <= 9;i++){
for(int j = 1;j <= 9;j++){
printf("%dx%d=%d\n",i,j,i*j);
}
}
... | 0 | 61,292,681 |
#include <iostream>
using namespace std;
const int speY = 200;
const int ordY = 195;
const int bigM = 20;
const int smlM = 19;
const int Y3 = speY + ordY * 2;
int calcDay(int Y, int M, int D)
{
int day = 0;
day += Y3 * ((Y - 1) / 3);
day += ordY * ((Y - 1) % 3);
if (Y % 3)
day += (M - 1) / 2 * (bigM+smlM) + ((M -... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 0 | 81,291,108 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int h,w;
int inf = 1e5+1;
cin >> h >> w;
vector<string>data(h);
vector<vector<int>>dp(h,vector<int>(w));
rep(i,0,h) cin >> data[i];
if(data[0][0] != '#') dp[0][0] = 0;
el... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI ... | 0 | 47,398,837 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | 0 | 91,370,081 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,s,g,p[200];
while(cin>>m>>s>>g,m){
int ans=-1,an;
for(int i=0;i<m;i++)cin>>p[i];
sort(p,p+m,greater<int>());
for(int i=g;i>=s;i--)if(ans<p[i-1]-p[i])ans=p[i-1]-p[i],an=i;
cout<<an<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define arep(a,i,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define cinf(x,n) for(int i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(int i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
s... | 0 | 99,316,751 |
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int x,t;
cin... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<int, int> P;
typedef tuple<int, int, int> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(... | 0 | 45,350,699 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
s.at(5) = ' ';
s.at(13) = ' ';
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007
#define IN freopen("nocross.in","r",stdin)
#define OUT freopen("nocross.out","w",stdout)
#d... | 0 | 78,525,624 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#defin... | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N)cin >> v... | 0 | 16,888,391 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a, b, k;
cin >> a >> b >> k;
long long z = a;
a -= min(a, k);
k -= min(z, k);
b -= min(k, b);
cout << a << " " << b << endl;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 74,673,086 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("... | #include <bits/stdc++.h>
using namespace std;
#define Boost ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define see(x) cerr<< __LINE__ << ": " << (#x) << " is "<< (x) <<'\n';
#define pb push_back
#define inf 1e9+8
#define mp make_pair
#define rep(i,n) ... | 0 | 69,536,560 |
#include <iostream>
using namespace std;
int main() {
int n,y,m,d;
cin >> n;
while(cin >> y >> m >> d){
int sum=0;
if(y%3==1){
if(m%2==1){sum =(y/3)*590 + (m/2)*39 + d;}
else{sum = (y/3)*590 + (m/2-1)*39+20 + d;}
}
if(y%3==2){
if(m%2==1){su... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 | 4,002,101 |
#include <bits/stdc++.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const ll INF=1e15+4;
const int Nmax=2e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string o,e;
cin >> o >> e;
int n = e.length() + o.length();
int ne = 0, no = 0;
string ans = "";
rep(i,n){
if... | 0 | 26,035,115 |
#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++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 100000;
ll mod = INF;
int n;
int h[maxn];
int main(){
cin >> n;
rep(i,n)cin >> h[i];
int ans=0;
int streak=0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n = 5;
int a[n];
rep(i, n) cin >> a[i];
int ans = 0;
int mx = 0;
rep(i, n) {
int x = a[i] % 10;
if (x == 0) {
ans += a[i];
continue;
}
mx = ma... | 0 | 14,367,359 |
#include <iostream>
int main(){
int x, y;
std::cin >> x;
std::cin >> y;
if(x > y) std::cout << "a > b" << std::endl;
else if(x < y) std::cout << "a < b" << std::endl;
else std::cout << "a == b" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"... | 0 | 69,116,503 |
#include<iostream>
#include<algorithm>
int w,h,x,y,r;
bool func(int x,int y){
if(0<=x && x<=w && 0<=y && y<=h){
return true;
}else return false;
}
int main(){
std::cin>>w>>h>>x>>y>>r;
if(func(x,y) && func(x+r,y) && func(x+r,y+r) && func(x,y+r) && func(x-r,y+r) && func(x-r,y) && func(x-r,y-r) && func(x,y-r) && func... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 | 47,357,409 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >>c ;
bool flg = false;
for(int i = 0; i < 100; i++) {
int tmp = a*i;
if(tmp%b == c) {
flg = true;
break;
}
}
if(flg) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 67,849,795 |
#include<cstdio>
#include<cstring>
const int MAXN = 2e5 + 10;
char s[MAXN], t[MAXN];
int main()
{
fgets(s, MAXN, stdin);
fgets(t, MAXN, stdin);
int n,count=0;
n = strlen(s);
for (int i = 0; i < n;i++)
{
if(s[i]!=t[i])
count++;
}
printf("%d", count);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
lli pw[11];
int main() {
pw[0]=1;
for(int i=1;i<11;i++) pw[i]=pw[i-1]*10;
int arr[11]={0,};
for(int s=0;s<11;s++) {
int lo=(s==0 ? 0 : -1), up=9;
lli v=0;
for(int i=0;i<s;i++) v=v*10+arr[i];
while(up-lo>... | 0 | 82,831,374 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int h,w;
char arr[105][105];
int memo[105][105];
int f(int x,int y){
if(x==h && y==w){
return arr[h][w]=='#';
}
if(memo[x][y]!=... | #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(... | 0 | 4,628,636 |
#include<stdio.h>
int main(){
int a;
while(1){
scanf("%d",&a);
if(a==0)return 0;
long long int n[10000];
for(int i=0;i<a;i++)scanf("%lld",n+i);
long long int dp[10000];
dp[0]=n[0];
long long int max=dp[0];
for(int i=1;i<a;i++){
if(dp[i-1]>0)dp[i]=dp[i-1]+n[i];
else dp[i]=n[i];
if(max<dp[i])ma... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 44,950,480 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
ll n;
cin>>n;
ll minv=1000000000005;
for(ll i=1;i<=sqrt(n);i++){
ll j=n/i;
if(j*i==n) minv=min(minv,i+j-2);
}
cout<<minv<<"\n";
return 0;
} | #include<set>
#include<iostream>
#include<map>
#include<vector>
#include<queue>
#include <utility>
#include<algorithm>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast;
long long a,b,c,d,e,f,target,i,j;
long long sum=0;
cin >> a >> target... | 0 | 82,885,344 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | #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=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 0 | 60,725,863 |
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> P_inv(N + 1);
for(int i = 1; i <= N; i++){
int tmp;
cin >> tmp;
P_inv[tmp] = i;
}
long long ans = 0;
set<int> indices;
indices.insert(0);
indices.insert(N + 1);
for(int i = N; ... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 13,858,197 |
#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;
int a[100];
int main(){
int N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 85,336,964 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main()
{
string s;cin >>s;
string ans="";
... | #include<bits/stdc++.h>
using namespace std;
int frog1(int N, int a[])
{
int dp[N+1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2]-a[1]) , abs(a[2]-a[0]));
for( int i = 3; i < N; i++)
{
dp[i+1] = min(dp[i] + abs(a[i]-a[i-1]), dp[i-1] + abs(a[i]-a[i-... | 0 | 46,488,113 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int N, Q;
vector<vector<int>> G(N, vector<int>());
void dfs(int s, vector<int> &counter, vector<bool> &seen) ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 58,793,020 |
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define ll long long
int n, p, v;
ll m, a[100000];
bool ok(int x) {
ll y = m*(v-1);
int z = 0;
vector<ll> b;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
ll N,Y;
cin >> N >> Y;
Y /= 1000;
bool flag = false;
for(ll yukiti = 0;yukiti<=N;yukiti++){
for(ll itiyou = 0;itiyou <= N-yukiti;itiyou++){
ll hi... | 0 | 9,887,947 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define p... | #include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
int main(){
int n;cin>>n;
vector<ll> ... | 0 | 95,780,831 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a , b;
cin >> a;
cin >> b;
for(int i = 0;i < a.size();i++){
if(a.at(i) != b.at(i)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll range = b - a + 1;
ll div_c, div_d, div_cd... | 0 | 26,668,987 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include <iostream>
#include <string>
using namespace std;
struct Trump{
string suit;
string num;
};
void print(Trump trump[], long N){
for (long i = 0; i < N; i++){
cout << trump[i].suit << trump[i].num;
if (i < N - 1) cout << " ";
}
cout << endl;
}
void BubbleSort(Trump trump[], long N){... | 0 | 69,990,930 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, k;
cin >> a >> b >> c >> k;
if (a >= k)
{
cout << k << endl;
}
else if (a + b >= k)
{
cout << a << endl;
}
else
{
int ans = a;
k -= (a + b);
while (k > 0)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,K;
cin >> A >> B >> C>> K;
int counter=0;
while(B<=A){
counter++;
B*=2;
}
while(C<=B){
counter++;
C*=2;
}
if(counter<=K){
cout << "Yes";
}else{
cout << "No";
}
} | 0 | 68,182,846 |
#include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll,ll> P;
const ll MO = 1000000007;
int main(){
ll n,m;
cin >> n >> m;
if(n=... | 0 | 80,676,027 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
x++;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<int> d(n);
rep (i, n)
cin >> d[i];
int ans = 0;
rep (i, n)
rep (j, n)
if (i != j)
ans += d[i] * d[j];
cout << an... | 0 | 29,107,361 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans=0;
cin>>n;
vector<double>x(n);
vector<string>u(n);
for(int i=0;i<n;i++) cin>>x[i]>>u[i];
for(int i=0;i<n;i++){
if(u[i]=="JPY") ans+=x[i];
else ans+=x[i]*380000.0;
}
cout<<setprecision(10)<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
string func(int n){
string s;
string t=to_string(n);
rep(i,0,6-t.size()){
s+='0';
}
return s+t;
}
int main(){
int n,m;
cin>>n>>m;
vector<P> a[n];
rep(i... | 0 | 62,154,506 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(b >= c) cout << "delicious";
else if(a + b < c) cout << "dangerous";
else cout << "safe";
} | #include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100000+10;
int x[maxn],xx[maxn],w[maxn];
int i,j,k,l,r,s,t,n,m;
ll c;
int main(){
scanf("%d%d%d",&n,&l,&t);
fo(i,1,n) scanf("%d%d",&x[i],&w[i]);
fo(i,1,n){
if (w[i]==2)... | 0 | 20,107,706 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include<bits/stdc++.h>
#define LL long long
#define rep(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
static const LL INF = 1LL<<61LL;
static const int MAX_N = 10000;
typedef pair<int,int> PII;
int par[MAX_N];
int rank[MAX_N];
int n,q;
int com,x,y;
class UF{
public:
... | 0 | 61,799,798 |
#include<algorithm>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int N, a, b, c;
cin >> N;
rep(i,N){
cin >> a >> b >> c;
if(a*a==b*b+c*c || b*b==a*a+c*c || c*c==a*a+b*b) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
} | #include <stdint.h>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <iostream>
#include <bitset>
#include <array>
#include <stdio.h>
using namespace std;
# define MAX 1000
uint64_t D0[MAX]={0}, HP[MAX]={0}, HN[MAX]={0}, VP[MAX]={0}, VN[MAX]={0};
uint64_t Cmap[MAX][20] =... | 0 | 83,562,753 |
#include <bits/stdc++.h>
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define rep(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;
ll w,h,p,num[2],ans;
vector<pair<ll,bool>>vec;
int main(){
cin>>w>>h;
num[0]=h+1;
num[1]=w+1;
rep(i,w+h){
cin>>p;
vec.push_back({p,i<w});
}
... | #include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | 0 | 64,262,538 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
ll ans = 0;
vector<ll> apb(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
ans -= b;
apb[i] = a + b;
}
sort(a... | 0 | 90,137,718 |
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cassert>
#define InfL 1000000000
#define InfLL 1000000000000000000LL
#define mod 1000000007
#define rep(i,n) for(int (i)=0;(i)<(n)... | 0 | 10,422,337 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
if(S[0]==S[1] && S[1]==S[2] && S[2]==S[3]) cout << "Yes" << endl;
else if(S[0]==S[1] && S[1]==S[2]) cout << "Yes" << endl;
else if(S[1]==S[2] && S[2]==S[3]) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> d;
UnionFind (int n): d(n,-1) {}
int find(int x) {
if(d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x); y = find(y... | 0 | 22,572,432 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
string res;
for (int i = 0; i < n; i++) {
res.push_back(s[i]);
res.push_back(t[i]);
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
struct unionfind{
vector<int> par, rank;
unionfind(int s) {
par.resize(s);
rank.resize(s, 0);
for(int i = 0; i < s; ++i) par[i] = i;
}
int root(int x) {
return par[x] == x ? x : par[x] = root(par[x]);
}
bool same(int x,... | 0 | 29,205,732 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int k;
cin >> k;
queue<long long> que;
for(int i = 1; i < 10; i++) que.push(i);
int num = 0;
while(!que.empty()){
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#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<<" ";new... | 0 | 10,508,759 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string s,t,u;
cin >> s >> t >> u;
char dif='A'-'a';
char xs,xt,xu;
xs=s[0]+dif;
xt=t[0]+dif;
xu=u[0]+dif;
cout << xs << xt << xu << endl;
return 0;
} | #include <cstdio>
#include <algorithm>
#define max_n 1000
using namespace std;
long long x[max_n+1],y[max_n+1],ton[33];
void solve(long long x,long long y,int sz){
for(int i=sz; ~--i; labs(x)>labs(y)?(x<0?(putchar('L'),x+=ton[i]):(putchar('R'),x-=ton[i])):(y<0?(putchar('D'),y+=ton[i]):(putchar('U'),y-=ton[i])));
p... | 0 | 77,673,150 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if(x % y == 0){
cout << -1 << endl;
return 0;
}
long long k = 1;
while(1){
long long ans = k * x;
if(ans % y == 0){
k++;
continue;
}
cout << ans << endl;
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>;
void judge(int &i, unordered_map<char, char> &map, string &S1, string &S2, string &ans) {
if (map.count(S1.at(i)) == 1 && map[S1.at(i)] != S2.at(i)) {
ans = "No";
}... | 0 | 54,229,612 |
#include <iostream>
#include <cmath>
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
using namespace std;
int main (int argc, char const* argv[]){
int n;
double x1,x2,x3,x4,y1,y2,y3,y4;
cin >> n;
while(cin >> x1 >>y1 >>x2 >>y2 >>x3 >>y3 >>x4 >>y4){
double ax=x2-x1, ay=y2-y1, bx=x4-x3,by=y4-y3;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | 0 | 49,417,400 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define... | #include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,N) for(long i=0;i<(long)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr... | 0 | 18,974,274 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | 0 | 71,580,835 |
#include <bits/stdc++.h>
#define N 100010
using namespace std;
int n,a[N],fir[N],to[N<<1],nxt[N<<1],c[N<<1],tot(1),d[N],root,s[N],ok(0);
template <class Aqua>
inline void read(Aqua &s){
s=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) s=s*10+c-'0',c=getchar();
}
inline void add(int u,int v)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<long long int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
if (i > 0) v[i] += v[i-1];
}
long long int ans = -10000000000;
for (int i = ... | 0 | 51,329,607 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(ll i=(x);i<(y);i++)
#define disp(a) cout << a << endl;
typedef long long ll;
using namespace std;
int main(... | #include <iostream>
using namespace std;
typedef long long llong;
void solve_test()
{
char a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) cout << "Yes\n";
else if (a == c && a != b) cout << "Yes\n";
else if (b == c && b != a) cout << "Yes\n";
else cout << "No\n";
}
int main()
{
ios_base::sync_with_stdio(fals... | 0 | 40,569,343 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.