code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x... | #include <bits/stdc++.h>
using namespace std;
const int INF=999999999;
int main() {
int A,B;
cin>>A>>B;
if(A==1){A=14;}
if(B==1){B=14;}
if(A>B){cout<<"Alice"<<endl;}
else if(A<B){cout<<"Bob"<<endl;}
else if(A==B){cout<<"Draw"<<endl;}
return 0;} | 1 | 70,657,636 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cout<<fixed<<setprecision(10);
int A,B,C,D;
cin >> A>>B>>C>>D;
cout << min(A,B)+min(C,D);
} | 1 | 59,998,028 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 100000
using namespace std;
struct node
{
int to;
node *nxt;
}edges[MAXN*2+5];
node *ncnt=&edges[0],*Adj[MAXN+5];
int d[MAXN+5],cnt[MAXN+5],n;
void AddEdge(int u,int v)
{
node *p=++ncnt;
p->to=v;
p->nxt=Adj[u];
Adj[u]=p;
node *q=++ncnt;
q->to=u... | #include<cstdio>
#include<vector>
#include<bitset>
#define N 100000
using namespace std;
vector<int> vecin[N+1];
bitset<N+1> viz;
int dfs(int nod=1){
viz.set(nod);
bool ans=false;
for(int i=0;i<vecin[nod].size();i++){
int now=vecin[nod][i];
if (viz[now]==false){
int r=dfs(now);
... | 1 | 22,320,691 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<tuple<int, int, int>> t(5);
for (int i = 0; i < 5; i++) {
int x;
cin >> x;
t.at(i) = make_tuple(x, (((x + 9) / 10) * 10), ((10 - (x % 10)) % 10));
}
sort(t.begin(), t.end(), [](auto &a, auto &b){
return get... | #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){
vector<long long int> a(5);
long long int high=10000000;
long long int pre=0;
for(l... | 1 | 65,179,219 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MA... | 1 | 13,148,297 |
#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>
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... | 1 | 90,284,022 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX 101
int d[MAX],visited[MAX];
vector<int> G[MAX];
queue<int> Q;
int main(){
int n; cin >> n;
for(int i=0;i<n;i++){
int u,k; cin >> u >> k;
for(int i=0;i<k;i++){
int v; cin >> v;
G[u].push_back(v);
}
}
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(l... | 1 | 31,983,063 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans;
if (b - a <= 2 || 1 + k <= a) {
ans = 1 + k;
} else {
ans = a;
k -= (a - 1);
if (k & 1) {
ans++;
k--;
ans += (b - a) * (k / 2);
} else {
... | 1 | 12,816,908 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #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 x,y,z, N, count=0, ans=0;
ll Y;
cin >> N >> Y;
Y/=1000;
for(x=0;x<N+1;x++){
for(y=0;x+y<N+1;y++){
z=N-x-y;
if(x*10+y*5+z==Y) {
co... | 1 | 84,993,401 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
static const int INF = 2000000000;
int main(){
ll n, m;
cin >> n >> m;
ll ans;
if (2*n >= m)... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
long long n,m;
cin>>n>>m;
if(n>=m/2) cout<<m/2<<endl;
else cout<<n+(m-2*n)/4<<endl;
return 0;
} | 1 | 27,053,240 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll output = b - a + 1;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
ll f(ll n, ll x){
if(n>=0)
return n/x + ... | 1 | 80,182,962 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> abc(3);
cin >> abc.at(0) >> abc.at(1) >> abc.at(2);
sort(abc.begin(), abc.end());
int ans = 0;
ans += (abc.at(2) - abc.at(1)) / 2;
ans += (abc.at(2) - abc.at(0)) / 2;
if((abc.at(2) - abc.at(1)) % 2 && (... | 1 | 34,608,779 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
string S;
string T;
cin >> S;
cin >> T;
int lenS = S.size();
int lenT = T.size();
int max = 0;
for (int i = 0; i < lenS - lenT + 1; i++) {
int count = 0;
for (int j = 0; j < lenT; j++) {
if (S[i + j... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define po pop_back
#define mp make_pair
#define fi first
#define se second
#define hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
using namespace std;
bool comp(ll a,ll b){if(a>b)return true;else return false;}
int i... | 1 | 43,283,651 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
vector<int> a(5);
int sum = 0;
for(int i = 0;i < 5;i++){
cin >> a[i];
sum += (a[i] + 9) / 10 * 10;
}
int ans = sum;
for(int i = 0;i < 5;i++){
ans = (a[i] % 10 > 0) ? min(ans,sum - 10 + a[i] % 10) : ans;
... | #include <iostream>
#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 a[5];
rep(i,5) {
cin >> a[i];
}
int ibuff;
int min=10;
int minpos=5;
rep(i,5) {
ibuff = a[i]%10;
if (ibuff !=0 && mi... | 1 | 4,997,533 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class AMaximizeTheFormula {
public:
void solve(std::istream &in, std::ostream &out) {
vector<int> a(3);
REP(i, 3) in >> a[i];
sort(a.begin(), ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;cin>>a>>b>>c;
d=max({a,b,c});
if(d==a)d=a*10+b+c;
else if(d==b)d=b*10+a+c;
else d=c*10+a+b;
cout<<d;
} | 1 | 7,506,700 |
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
const int maxn = 1<<17, mlg = 17, mod = 1e9 + 7;
ll n, l, q, x[m... | #include <bits/stdc++.h>
using namespace std;
const int K = 20;
int n, q, l;
int x[100000];
int d[K][100000];
void pre() {
int j = 0;
for (int i = 0; i < n; ++i) {
while (j < n && x[j] - x[i] <= l) {
++j;
}
d[0][i] = j - 1;
}
for (int k = 1; k < K; ++k) {
for (int i = 0; i < n; ++i) {
... | 1 | 4,030,875 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int N; cin >> N;
vector<int> a(N+1);
for(int i = 0; i < N; i++){ cin >> a[i];}
a[N] = 10001;
int head = 0; int tail = 0;
int cnt = 0;
while( head < N && tail < N){
if( a[tail] != a[tail+1] && tail... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n;
cin >> n;
int a[n];
int cnt, ans;
rep(i, n) cin >> a[i];
ans = 0;
cnt = 1;
for(int i = 0; i < n; i++)
{
if (a[i] != a[i + 1])
{
ans += cnt / 2;
cnt = 1;
}
else
cnt++;
}
cou... | 1 | 95,998,185 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<long long> a(N), b(N), c(M), d(M), checkpoint(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a.at(i) >> b.at(i);
}
for (int i = 0; i < M; ++i) {
cin >> c.at(i) >> d.at... | #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... | 1 | 9,954,567 |
#if 0
?????????X[0]???????????????????????\???????????¨??§???X[1],Y[1]???????????????????????????????????????
#endif
#include <iostream>
#include <string>
using namespace std;
int main(){
int q;
cin >> q;
for(int a=0;a<q;++a){
string X,Y;
int L[1000+10][1000+10];
cin >> X >> Y;
for(int i=0;i<1000;++i)
fo... | #include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int dp[1001][1001] = {};
int getLCS(string X, string Y)
{
int m = 0;
for (int i = 1; i <= X.size(); i++)
{
for (int j = 1; j <= Y.size(); j++)
{
... | 1 | 75,077,488 |
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#i... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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... | 1 | 81,958,910 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
char a[3];
cin >> a;
for(int i=0; i<3; i++){
if(a[i]=='1') cout << 9;
else cout << 1;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) cout << (c == '1' ? 9 : 1);
} | 1 | 91,086,528 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
for (int i = 100; i > 0; i /= 10) {
if (N / i == 7) {
cout << "Yes" << endl;
return 0;
}
N %= i;
}
cout << "No" << endl;
} | #include <iostream>
int main() {
int n; std::cin >> n;
bool inc7 = false;
while (n) {
if (n % 10 == 7) inc7 = true;
n /= 10;
}
if (inc7) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
return 0;
} | 1 | 99,540,478 |
#include<iostream>
using namespace std;
int main(){
int A, B, X;
cin >> A >> B >> X;
cout << (A+B>=X && A <= X? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int a,b,x;
cin >> a >> b >> x;
if(a<=x&&x<=a+b) {
... | 1 | 50,580,741 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1;i <= n;i++){
cin >> a[i];
}
for(int i = 1;i <= n;i++){
cout << "node " << i << ": key = " << a[i] << ", ";
if(i / 2 >= 1)cout << "parent key = " <<a[i / 2] << ", ... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
void print(int id, std::vector<int> tree) {
std::cout << "node " << id << ": key = " << tree[id-1] << ", ";
if (id/2 > 0) {
std::cout << "parent key = " << tree[id/2-1] << ", ";
}
if (2*id <= tree.size(... | 1 | 19,112,431 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 1 | 80,769,919 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 1 | 80,276,958 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
vector<int64_t> a(1L << n);
for (auto&& aa : a) {
cin >> aa;
}
vector<array<int64_... | #include <bits/stdc++.h>
using namespace std ;
const int MAXN = 19 , MAX = (1 << 19) ;
int arr[MAX] ;
pair<int , int> ans[MAX] ;
int n ;
void Merge(pair<int , int>&p , pair<int , int>p2)
{
if(p2.first > p.first)
{
p.second = p.first , p.first = p2.first ;
if(p2.second > p.second)
p.second = p2.second ;
}
els... | 1 | 1,381,607 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | 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) != ... | 1 | 9,190,947 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
char A, B, ans;
cin >> A >> B;
if(A > B) ans = '>';
if(A == B) ans = '=';
if(A < B) ans = '<';
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char x,y;
cin>>x>>y;
if(x<y){
cout<<"<"<<'\n';
}
else if(x > y){
cout<<">"<<'\n';
}
else{
cout<<"="<<'\n';
}
return 0;
} | 1 | 8,594,160 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
string s;
ll k;
cin >> s >> k;
int f = 0;
while(true){
if(s[f] != '1'){... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string S;
ll K;
cin >> S >> K;
rep(i, S.size()) {
if (S[i] != '1') {
cout << S[i] << "\n";
return 0;
}
if (K == i + 1) {
... | 1 | 100,392,259 |
#include <bits/stdc++.h>
#include<iostream>
using namespace std;
int main() {
int a,b,c,d,ans,tmp;
cin >> a;
if(a >= 2800)cout << "AGC";
else if(a >= 1200)cout << "ARC";
else cout << "ABC";
} | #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...... | 1 | 24,417,766 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int N, Z, W;
cin >> N >> Z >> W;
int A[N]; rep(i, N) cin >> A[i];
if(N == 1) cout << abs(A[0]-W) << endl;
else{
cout << max( ab... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | 1 | 68,474,182 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
double a, b, c, d, e, f;
double p, q;
while(cin >> a >> b >> c >> d >> e >> f){
cin >> p >> q;
vector<int> x(3), y(3);
x[0] = a; x[1] = c; x[2] = e;
y[0] = b; y[1] = d; y[2] = f;
int ret = 0;
... | 1 | 7,716,236 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n, a, b, c, x, y, i, num;
const int MAX = 10001;
while (cin >> n >> a >> b >> c >> x, n|a|b|c|x) {
int ys[n];
for (i = 0; i < n; ++i) {
cin >> y;
ys[i] = y;
}
for (i = 0, n... | #include <iostream>
#include <vector>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x, n){
vector<int> y(n);
for(int i=0; i<n; ++i){
cin>>y[i];
}
int res = -1;
int cnt = 0;
vector<int>::iterator it;
for(int t=0; t<=100... | 1 | 13,889,251 |
#include <stdio.h>
#include <string.h>
char result[100000];
void calculation(int multi){
int carry=0,i,j=0;
for(i=0;result[i]!=NULL;i++){
carry+=(result[i]-48) * multi;
result[j++]=(carry % 10) + 48;
carry/=10;
}
while(carry){
result[j++]=(carry % 10) + 48;
carry/... | #include <iostream>
using namespace std;
unsigned long long factorial(int x) {
if(x != 1)
return x * factorial(x-1);
else if(x == 1)
return 1;
}
int main() {
int a;
cin >> a;
cout << factorial(a) << endl;
return 0;
} | 1 | 52,172,630 |
#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){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.... | 1 | 92,585,076 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to) - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typena... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n-1);
rep(i, n-1) cin >> b[i];
a[0] = b[0];
for(int i = 1; i < n; i++){
if(i == n-1){
... | 1 | 13,840,620 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
int k;
cin >> k;
int a[n];
ll sum = 0;
rep(i, n){
cin >> a[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() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
rep(i,N) cin >> H.at(i);
ll ans = 0;
sort(H.begin(), H.end(), greater<ll>());
if (N > K) {
... | 1 | 60,803,778 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <random>
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using n... | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li h, w, d;
cin >> h >> w >> d;
if (d % 2 == 1) {
for (int r = 0; r < h; ++r) {
for (int c = 0; c < w; ++c) {
if ((r + c) % 2 == 1) {
... | 1 | 48,500,662 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
const int mod = 2019;
int l, r;
cin >> l >> r;
int ans = 2018;
REP(i,l,r+1)REP(j,i+1,r+1){
if (... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 | 85,278,752 |
#include <iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B; A--, B--;
cout << "100 100" << endl;
for (int i = 0; i < 50; ++i) {
for (int j = 0; j < 100; ++j) {
if (A > 0 && (i % 2 == 0) && (j % 2 == 1)) {
cout << '.';
A--;
}
else {
cout << '#';
}
}
cout << endl;
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int A,B;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B;
cout << 100 << " " << 100 << endl;
int cnt = 0;
for (int i = 0;i < 50;i++){
for (int j = 0;j < 100;j++){
if(i%2 == 0 && j%2 == 0 && cnt < ... | 1 | 39,513,293 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a>>b>>c>>d;
int p=abs(b-a);
int q=abs(c-b);
int u=abs(c-a);
string s="No";
if(p<=d && q<=d){
s="Yes";
}
if(u<=d){
s="Yes";
}
cout << s;
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...)... | 1 | 66,605,541 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
#define INF 1000000000000000000
int main(){
ll S;
cin>>S;
ll X1,Y1,X2,Y2;
X2=(int)sqrt((double)S);
Y1=X2;
if(S==X2*Y1){
X1=0;
Y2=0;
}else{
Y1++;
ll x=X2*Y1-S;
if(x<0){
X2++;
x=X2*Y1-S;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LIM = 1e9;
ll s;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> s;
string ss = to_string(s);
int n = ss.length();
if (n == 19) {
cout << "0 0 1000000000 1 0 1000000000";
return 0;
}
ll si =... | 1 | 97,249 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,d,ans=0,dd,ddd;
cin>>n>>d;
long long x[n][d];
f(i,0,n){
f(j,0,d){
cin>>x[i][j];
}
}
f(i,0,n){
f(j,i+1,n){
dd=0;
f(k,0,d){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
vector<int> sq(128);
int i,j,k;
for(i=0;i<128;i++){
sq.at(i)=i*i;
}
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d,0));
for(i=0;i<n;i++){
for(j=0;j<d;j++){
cin >> x.at(i).at(j);
}
}
int s=0... | 1 | 30,503,181 |
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> G(8);
int cntPath = 0;
int N, M;
void bfs(int cnt, int pos, vector<int> checked){
if(cnt == N - 1){
for(int j = 0; j < N; j++){
if(checked.at(j) == 0) return;
}
cntPath++;
return;
}
cnt++;
for(int i = 0; i < G.at(pos).size();... | #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>;
using Graph = vector<vector<int>>;
int n,m,ans=0;
Graph g;
vector<bool>seen;
void dfs(int x){
seen[x]=true;
bool flag=true;
rep(i,n){
if(!seen[i]){
flag=fals... | 1 | 80,473,338 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
int main(){
int n;
cin>>n;
ll h,w,a,b;
cin>>h>... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
lint n, h, w;
cin >> n >> h >> w;
... | 1 | 5,306,062 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int a, b, c; cin >> a >> b >> c;
V<int> v({a, b, c});
sort... | 1 | 35,405,186 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,b="keyence"; cin>>s;
int n=s.size();
for(int i=0; i<n; i++) {
if(s[i]==b[0]){
bool flag=1;
int j = 1;
while(flag && j<7){
if(s[i+j]==b[j])j++;
else flag=0;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
getline(cin,s);
string t=s;
for(int i=0;i<t.size();i++)
{
for(int j=0;j<t.size();j++)
{
t.erase(i,j);
if(t.compare("keyence")==0){
cout<<"YES\n";
return 0;
}
t=s;
}
}
cout<<"NO\n";
return 0;
} | 1 | 56,741,028 |
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
string S;
cin >> S;
bool b = true;
for (int i = S.size() - 1; i >= 0; ) {
char ch = S.at(i);
if (ch == 'm') {
if (i<4) {
b = false;
break;
}
else {
string s = S.substr(i - 4, 5);
if (s != "dream") {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string str;
cin>>str;
regex e("(dream|dreamer|erase|eraser)+");
cout<<((r... | 1 | 63,156,137 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int m, a, b;
while (cin >> m >> a >> b,m,a,b) {
int p[300];
for (int i = 0;i < m;i++)cin >> p[i];
int ans = 0;
int g = 0;
for (int i = 0;i < m - 1;i++) {
int c = p[i] - p[i + 1];
if (g <= c && (i + 1 >= a) && (i + 1 <= b)) {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
signed main() {
while (true) {
int m, n1, n2;
cin >> m >> n1 >> n2;
if (!m && !n1 && !n2) return 0;
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int diff ... | 1 | 99,956,718 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,c[1001],k=0,sum=0;
cin >> a>>b;
rep(i,a){
cin >> c[i];
sum+=c[i];
}
rep(i,a){
if(c[i]*4*b>=sum){
k++;
}
... | 1 | 42,357,158 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
int main(){
int n,k; cin >> n >> k;
if((n-1)*(n-2)/2 -k<0){
printf("%d\n",-1);
return 0;
}
printf("%d\n",n-1+(n-1)*(n-2)/2 -k);
rep(i,n-1){
printf("%d %d\n",1,i+2);
}
... | 1 | 63,049,344 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | 1 | 73,474,081 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> e[n];
rep(i,m) {
int a, b;
cin >> a >> b;
a--; b--;
e[a].push_back(b);
e[b].push_back(a);
}
i... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int n, m;
cin >> n >> m;
vector<int> adj[n];
while(m--)
{
int a, b;
cin >> a >> b;
a--; b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
queue<int> q;
bool visite... | 1 | 15,952,434 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int n = 1;n<=N;++n) {
int tmpn = n;
int count = 0;
while (tmpn <K) {
tmpn *= 2;
++count;
}
int memo = 1;
for (int n=0;n<count;++n) {
memo *= 2;
}
ans += 1.0 / N / memo;
}
printf("%.10f... | #include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,k;
cin >> n >> k;
long double ans = 0;
long double p = 1.0 / n;
if(n >= k){
ans = (long double)(n - k + 1) / n;
n =... | 1 | 20,786,837 |
#include <stdio.h>
int main(){
int a,b,d,r;
double f;
scanf("%d %d",&a,&b);
d = a/b;
r = a%b;
f =(double)a/b;
printf("%d %d %f\n",d,r,f);
} | #include<stdio.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
printf("%d %d ", a / b, a%b);
printf("%f", a*1.0 / b*1.0);
return 0;
} | 1 | 38,454,927 |
#include <iostream>
using namespace std;
int main() {
int d;
while(cin >> d) {
int n = 600 / d;
int sum = 0;
for(int k = 0; k < n; ++k) {
sum += d * (k * d) * (k * d);
}
cout << sum << endl;
}
return 0;
} | #include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#de... | 1 | 91,989,207 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
... | 1 | 75,265,359 |
#include<bits/stdc++.h>
#include<string>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c){cout<<1;}
else if(a==b || a==c || b==c){cout<<2;}
else{cout<<3;}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | 1 | 53,952,264 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
auto check = [&](long long mid) {
vector<pair<int, int>> v;
v.emplace_back(0, 0);
for (int i = 1;... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 1 | 12,515,832 |
#include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | 1 | 16,338,133 |
#include <iostream>
#include <string>
#include <utility>
#include <iomanip>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define max(a,b) ((a)>(b) ? (a) : (b))
#define min(a,b) ((a)<(b) ? (a) : (b))
typedef long long ll;
typedef long double ld;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
l... | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i = x; i < (int)(n); i++)
#define rep_ll(i,x,n) for(ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-... | 1 | 1,242,030 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 1 | 2,726,907 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3,y3,x4,y4;
int n = x2 - x1;
int m = y2 - y1;
if (n >= 0) {
if (m >= 0) {
x3 = x2 - m;
x4 = x3 - n;
y3 = y2 + n;
y4 = y3 - m;
}
else {
x3 = x2 - m;
x4... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = c - a, y = d - b;
printf("%d %d %d %d\n... | 1 | 12,812,989 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
int N; cin >> N;
vi a(N);
rep(i,N) c... | 1 | 47,685,452 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int H, W, D;
cin >> H >> W >> D;
vector<pair<int, int>> pos(H * W + 1);
rep(i, H) rep(j, W)
{
int A;
cin >> A;
pos[A] = make_pair(i + 1, j + 1);
}
vector<in... | #include <bits/stdc++.h>
using namespace std;
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; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 1 | 27,910,393 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define INT(a) int((a)+1e-9)
#define INF 1e8
int ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
int n;
while(cin>>n, n){
vector<int> v(n);
for(int i=0; i<n; i++)
cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for(int i=1; i<n-1; ... | 1 | 8,432,975 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int money = 100000;
for (int i = 0; i < n; i++){
money *= 1.05;
if (money % 1000 > 0) money = (money / 1000 + 1)*1000;
}
cout << money << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <string>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
double loan = 100000;
for(int i=0; i<n; ++i){
loan *= 1.05;
loan = std::ceil(loan/1000)*1000;
}
... | 1 | 86,388,826 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #pragma GCC positionimize(3,"Otrst","inline")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<algorithm>
#include<tr1/unordered_map>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N... | 1 | 99,583,845 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int A,B;
cin >> A >> B;
cout << A*B - A - B + 1<< endl;
} | #include<bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
printf("%d\n",a*b-a-b+1);
return 0;
} | 1 | 31,619,220 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
char s='A', k;
int h, w;
cin >> h >> w;
string a[h][w];
rep(i,0,h){
rep(j,0,w) cin >> a[i][j];
}
rep(i,0,h){
rep(j,0,w){
if(a[i][j]=="snuke"){
k=s+j;
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
using namespace std;
int main() {
int H, W, i, j;
string str[26][26];
string s = "snuke";
char w;
cin >> H >> W;
for (i = 0; i < H; i+... | 1 | 13,204,071 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int head(int n) {
string s = to_string(n);
return s[0] - '0';
}
int tail(int n) {
string s = to_string(n);
return s[s.length() - 1] - ... | 1 | 6,918,311 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
int main(void){
map<int,int> seen;
int n;
cin>>n;
bool ok=true;
rep(i,n){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
map<int,int>Map;
bool ok=true;
for(int i=0;i<n;i++){
int a;
cin >> a;
Map[a]++;
if(Map[a]==2)ok=false;
}
if(ok)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | 1 | 40,383,919 |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a+b/2;
cout<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D,E;
cin >> D >> E;
cout << D + E/2 << endl;
} | 1 | 89,710,631 |
#include <iostream>
#include <complex>
#include <cmath>
using namespace std;
typedef complex<double> P;
#define PI 3.1415926535898
#define EPS (1e-10)
#define X real()
#define Y imag()
bool equal(double a, double b){
return ( abs( a-b ) < EPS )? true : false ;
}
class Triangle{
private:
P a, b, c;
double edgeA,edgeB... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
double EPS=1e-10;
double add(double a, double b)
{
if(abs(a+b)<EPS*(abs(a)+abs(b))) return 0;
return a+b;
}
double x[3],y[3],X,Y;
bool input()
{
for(int i=0;i<3;i++) cin >> x[i] >> y[i] ;
if(cin.eof()) return false;
cin >> X >> Y ;
ret... | 1 | 27,416,958 |
#include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string mark;
if (a < b) {
mark = "<";
}
else if (a > b) {
mark = ">";
}
else {
mark = "==";
}
cout << "a " + mark + " b" << endl;
} | #include<iostream>
int main(void) {
int a, b;
std::cin >> a >> b;
if (a < b) {
std::cout << "a < b" << std::endl;
} else if (a > b) {
std::cout << "a > b" << std::endl;
} else {
std::cout << "a == b" << std::endl;
}
return 0;
} | 1 | 19,836,235 |
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
swap(a, b);
int m = n;
vector<int> v(b);
... | #include <cstdio>
#define FOR(i, l, r) for(int i = l; i <= r; ++i)
using namespace std;
long long n, a, b;
int main()
{
scanf("%lld%lld%lld", &n, &a, &b);
if (a * b < n || a + b - 1 > n) {puts("-1"); return 0;}
FOR(i, 1, a) if (n - i * b + i < a)
{
for(int j = n - a + i; j > (i - 1) * b; --j) pr... | 1 | 1,130,614 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n; cin >> n;
cout << "Christmas";
for (int i = 25; i > n; i-... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d;
cin >> d;
if (d==25) cout << "Christmas";
else if (d==24) cout << "Christmas Eve";
else if (d==23) cout << "Christmas Eve Eve";
else cout << "Christmas Eve Eve Eve";
return 0;
} | 1 | 4,419,552 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main(){
int x,a,b;
cin >> x >> a >> b;
if(a >= b) cout << "delicious" << endl;
else if((b - a) <= x) cout << "safe" << endl;
else cout << "dangerous" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b - a <= 0)
{
printf("delicious");
}
else if (b - a <= x)
{
printf("safe");
}
else
{
printf("dangerous");
}
} | 1 | 89,646,707 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX_N = 8005;
vector<int> _dp;
vector<int> _ldp;
int& dp (int x) {
return _dp[MAX_N + x];
}
int& ldp (int x) {
return _ldp[MAX_N + x];
}
bool knapsack (vector<int> v, int t) {
_dp = vector<int> (2 * MAX_N + 5);
dp(0) = 1;
f... | #include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl;
#define dd(x) cout<<#x<<"="<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define ll long long
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se se... | 1 | 99,886,087 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
long long int t;
vector <long long int> v;
cin >> n >> k;
for(int i=0;i<n;i++)
{
cin >> t;
v.push_back(t);
}
vector <unsigned long long int> v2;
for(int i=0;i<n;i++)
{
unsigned long long in... | #include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
int64_t n,k;
cin >> n >> k;
vector<int64_t> a(n);
rep(i,n){
cin >> a[i];
}
vector<int64_t> ruiseki(1);
rep(i,n){
... | 1 | 99,287,879 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 200009;
int N, T;
ll t[MAX_N];
void solve()
{
ll ans = 0;
ll b=0, e=T;
for(int i=1;i<N;++i){
if(t[i]<=e) e=max(e,t[i]+T);
else{
ans += e-b;
b=t[i], e=t[i]+T;
}
}
ans += e-b;
cout << ans << '\n';
}
int main()
{
cin >... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, T; cin >> N >> T;
vector<int> t(N);
rep(i, N){
cin >> t[i];
}
int ans = t[N-1] + T;
for (int i = 1; i < N; i++){
int d ... | 1 | 56,678,810 |
#include<bits/stdc++.h>
#define mkp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
typedef long long ll;
typedef map<ll,ll>::iterator itll;
typedef pair<ll,ll> P;
int main()
{
string s;
cin>>s;
for(int pos = 0;pos<s.size();pos++)
{
for(int len = 0;len<=s.size();len++)
{
string k = s;
k... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
string ans = "NO", t="keyence";
int c = 0, sn = s.size(), tn = t.size();
int r = 0;
... | 1 | 65,754,088 |
#include <iostream>
using namespace std;
int main()
{
int N,a,b,c,i,j;
cin>>N;
int A[3*N];
for(i=0;i<N;i++)
{
int a,b,c;
cin>>a>>b>>c;
j=3*i;
A[j] = a;
A[j+1] = b;
A[j+2] = c;
}
for (i=0;i<3*N;i=i+3)
{
if (A[i]*A[i]==A[i+1]*A[i+1]+A... | #include<stdio.h>
int main(){
int n;
int a[3];
int temp;
int i,j,k;
scanf("%d",&n);
for(k=0;k<n;k++){
for(i=0;i<3;i++){
scanf("%d",&a[i]);
}
for(i=0;i<2;i++){
for(j=0;j<2-i;j++){
if(a[j]<a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
if(a[0]*a[0]==a[1]*a... | 1 | 20,908,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H1, H2;
int M1, M2;
int K;
int total = 0;
cin >> H1 >> M1 >> H2 >> M2 >> K;
if (M1 > M2) {
M2 += 60;
H2--;
}
total += M2 - M1;
total += 60 * (H2-H1);
cout << total - K << endl;
} | #include<bits/stdc++.h>
using namespace std;
void solve() {
long long H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
long long res = (H2 - H1) * 60 + (M2 - M1) - K;
cout << res << "\n";
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | 1 | 35,999,747 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
int n,y;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N, Y;
cin >> N >> Y;
for (ll i = 0; i <= N; ++i)
{
for (ll j = 0; j <= N - i; ++j)
{
ll k = N - i - j;
if (k < 0)
{
break;
}
ll ... | 1 | 4,931,883 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, m; cin >> n >> m;
V<int> b(n + 1);
for(int i = 0; i < m; i++){
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 | 20,188,421 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#if DEBUG
#include "debug.h"
#else
#define debug(args...)
#endif
using namespace std;
typedef vector<int> vi;
typedef pair<int,int>... | 1 | 63,943,318 |
#include<iostream>
using namespace std;
int main(){
int s[4] = {},a,b;
cin >> a >> b;s[a-1]++;s[b-1]++;
cin >> a >> b;s[a-1]++;s[b-1]++;
cin >> a >> b;s[a-1]++;s[b-1]++;
if(s[0]!=3 && s[1]!=3 && s[2]!=3 && s[3]!=3) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <numeric>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <tuple>
using ll = long long int;
using ul = unsigned long long int;
const ll LL_MAX (1LL<<60);
const... | 1 | 3,545,379 |
#include <iostream>
using namespace std;
int faces[1+6];
void roll(int f){
int tmp = faces[f];
faces[f] = faces[1];
faces[1] = faces[7-f];
faces[7-f] = faces[6];
faces[6] = tmp;
}
int main(){
int input[1+6];
for(int i = 1; i <= 6; i++){
cin >> input[i];
}
int n, top, front, right, topNum;
cin >> n;
for(int... | #include <iostream>
#include <algorithm>
#include <array>
#include <string>
class Dice{
public:
std::array<int, 6> state;
Dice(bool isRight=false):state(std::array<int, 6>{{1, 2, (!isRight)?3:4, (!isRight)?4:3, 5, 6}}){}
Dice(std::array<int, 6> d, bool isRight=false):state(d){if(isRight){int tmp=state[2... | 1 | 68,653,393 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 1 | 8,119,832 |
#include <cstdio>
const int MAXN = 1e5 + 5, mod = 1e9 + 7;
inline int addmod(int a, int b) { return ((a + b) % mod + mod) % mod; }
inline int mulmod(long long a, int b) { return ((a * b) % mod + mod) % mod; }
int n, m, x[MAXN], y[MAXN], suffix[MAXN];
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) sca... | #include <bits/stdc++.h>
#define int LL
using namespace std;
typedef long long LL;
const int MAX_N=100005;
const int Mod=1e9+7;
int n;
int m;
int x[MAX_N];
int y[MAX_N];
int xi[MAX_N];
int yi[MAX_N];
int pre[MAX_N];
int sum(int seg[],int nm)
{
for(int i=1;i<nm;i++)
{
pre[i]=pre[i-1]+seg[i];
}
int l=1,r=nm-1;
in... | 1 | 52,289,626 |
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> p(51), b(51);
ll f(ll n, ll x) {
if (n == 0) return (x <= 0) ? 0 : 1;
if (x <= 1 + b[n-1]) return f(n-1, x-1);
else return p[n-1] + 1 + f(n-1, x-2-b[n-1]);
}
int main() {
ll n, x; cin >> n >> x;
p[0] = b[0] = 1;
for (int i = 0; i < 50;... | 1 | 95,589,258 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
bool isRightTriangle(int a, int b, int c) {
return(a*a + b*b == c*c);
}
int main(void) {
int num; cin >> num;
vector<int> vec(3);
for(int r = 0; r < num; r++) {
cin >> vec[0] >> vec... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0;i < n;++i){
int a[3];
for(int j = 0;j < 3;++j){
cin >> a[j];
}
sort(a, a + 3);
if(a[0] * a[0] + a[1] * a[1] == a[2] * a[2]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
ret... | 1 | 97,527,268 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n), b(n-1);
for (size_t i = 0; i < n-1; i++) cin >> b[i];
a[n-1] = b[n-2];
for (int i = n-2; i > 0; i--) {
if (b[i-1] <= b[i]) a[i] = b[i-1];
else a[i] = b[i];
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n;
cin >> n;
vector<i64> b(n-1);
for(auto&& x:b)cin >> x;
vector<i64> a(n);
i64 ret = 0;
a[0] = b[0];
for(int i=0;i<n-1;i++){
a[i] = min(a[i], b[i]);
a[i+1] = max(a[i+1], b[i]);
}
f... | 1 | 21,836,459 |
#include <cstdio>
#include <vector>
#include <algorithm>
int main()
{
int n,v,p;
long long m;
scanf("%d%lld%d%d",&n,&m,&v,&p);
std::vector<long long> A(n);
for(int i=0;i<n;i++){
scanf("%lld",&A[i]);
}
std::sort(A.begin(),A.end());
int l=-1,r=n-p;
while(l+1<r){
int d=(l+r)/2;
bool F=true;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <stack>
#include <map>
#define ri register
#define inf 0x7fffffff
#define E (1)
#define mk make_pair
#define int long long
using namespace std; const int N=200010;
in... | 1 | 60,974,961 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
double ans = 0.0;
for(int i=1; i<=n; i++){
double p = 1.0/n;
int x = i;
while(0<x && x<k){
x *= 2;
p *= 0.5;
}
ans += p;
}
cout << fixed << setprecision(15) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
double ans = 0;
for (int64_t i = 1; i <= N; i++) {
int64_t memo = i;
double memo2 = 1.0 / N;
while (memo < K) {
memo *= 2;
memo2 *= 0.5;
}
ans += memo2;
}
cout << fixed << setprecision(16);
c... | 1 | 75,573,477 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >> a[i][j];
}
int ans = 100100... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | 1 | 17,141,845 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
using namespace std;
typedef long long int ll;
int main(){
int cnt[4]={};
for(int i=0;i<6;i++){
int t ;cin >> t;
cnt[t-1]++;
}
if(cnt[0]*cnt[1]*cnt[2]*cnt[3]>0&&cnt[0]<3&&cnt[1]<3&&cnt[2]<3&&cnt[3]<3){
cout << "YES" << endl;
}
else... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 12,447,367 |
#include <iostream>
#include <cstdio>
using namespace std;
static const int N = 100 + 1;
void trace(int* a, int n);
void swapInt(int& t1, int& t2);
int selectionSort(int* a, int n);
int main() {
int a[N], n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int c = selectionSort(a, n);
trace(a, n);... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
void trace(int a[], int n){
REP(i, n) {
if (i>0) ... | 1 | 30,020,090 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.