code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
int n;
int a[305];
ll dp[305][90005];
ll dp2[305][90005];
ll p(ll a, ll x) {
ll res = 1;
while(x > 0) {
if(x & 1) res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
cin >> n;
i... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 998244353;
void add(ll& a, ll... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main()
{
//ใณใณใในใ
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[i];
}
sort(W, W + 10);
reverse(W, W + 10);
sort(K, K + 10);
reverse(K, K + 10);
cou... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main() {
vector<int> W, K;
int dommy;
for (int i = 0; i < 10; ++i) {
cin >> dommy;
W.push_back(dommy);
}
sort(W.begin(), W.end(), greater<int>());
for (int i = 0; i < 10; ++i) {
cin >> dommy;
K.push_back(... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin>>a;
if(a.at(0)=='7'||a.at(1)=='7'||a.at(2)=='7'){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string S;
cin >> S;
vector<int> v={0};
for (int i = 0; i < (int)S.size(); i++) {
if (S[i] == 'S') {
v.push_back(0);
} else {
v[(int)v.size()-1]++;
}
}
cout << *max_element(v.begin(), v.end()) << endl;
... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int main(){
// 1. ๅ
ฅๅๆ
ๅ ฑ.
char c[2020];
int w;
scanf("%... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin>>n;
while(n){
string action;
int base=0,outCount=0,point=0;
while(outCount!=3){
cin>>action;
if(action=="OUT"){
outCount++;
}
else if(acti... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),v).end()
#define PB(a) push_back(a)
#define MOD 1000000007
typedef long long ll;
t... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
int n, m;
cin>>n>>m;
if(n == 0 || m == 0){
cout<<"0 0";
return 0;
}
bool accepted[n];
unordered_map<int, int> ma;
for(int i = 0; i < n; i++){
accepted[i] = fal... | 0 |
#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define mx 1000008
#define pii pair<int,int>
#define pi acos(-1.0)
#define pb push_back
#define ss second
#define ff first
typedef long long int ll;
///adja... | /*MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMWO:,'..'xXWWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .:kOo.,kNMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .lNWWo..lXMMMMMMMMMMMM... | 0 |
// #pragma GCC target("avx") // CPU ๅฆ็ไธฆๅๅ
// #pragma GCC optimize("O3") // CPU ๅฆ็ไธฆๅๅ
// #pragma GCC optimize("unroll-loops") // ๆกไปถๅฆ็ใฎๅผใณๅบใใๆธใใ
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll ... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
int main(){
int n,m;
while(std::cin >> n >> m){
if(n == 0 && m == 0) return 0;
std::vector<int> a(n);
for(int i = 0; i < n; ++i){
std::cin >> a[i];
}
std::sort(a.begin(), a.end(), std::greater<int>());//้้
int cost = 0;
for(int i = ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
}
std::sort(a.begin(), a.end(), std::greater<int>());
int ans = 0;
for (int i = 0; i < k... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
const int N = 1e5 + 10;
VI adj[N];
int col[N];
bool bip = true;
int f[3];
void dfs(int u, int c) {
if (col[u] != 0) {
if (c != col[u]) bip = false;
return;
}
col[u] = c;
f[c]++;
f... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<int> m(206, 0);
m[0] = 300000;
m[1] = 200000;
m[2] = 100000;
cout << m[x - 1] + m[y - 1] + (x == 1 && y == 1 ? 400000 : 0) << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 1 |
/********************************************************
**โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ**
**โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ**
**โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ**
**โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ**
**โโโโโโโโโโโโโโ... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
int n;
cin>>n;
rep(loop,n){
int rui[5]={};
string s;
int o=0;
int p=0;
... | 0 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
template <class Type> Type GCD(Type a, Type b)
{
if (a % b == 0) { return b; }
if (b % a == 0) { return a; }
if (a > b) { return GCD(b, a % b); }
if (a < b) { return GCD(a, b % a); }
return (Type)(-1);
}
template <class Type> Type... | #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() {
ll n; cin >> n;
vector<ll> t(5);
rep(i,5) cin >> t[i];
ll bn = *min_element(t.begin(),t.end());
ll ans ... | 0 |
#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>
#include <cctype>
#in... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pa... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool ok = false;
char c;
for (c = 'a' ; c <= 'z'; c++ ) {
ok = false;
for (int i = 0; i < S.size(); i++) {
if(S.at(i) == c){
ok = true;
break;
}
}
if(ok == false){
break;
}
}
if(o... | #include <bits/stdc++.h>
using namespace std;
int main(void){
vector<int>X(26,0);
string S;cin>>S;
for(long long i=0;i<S.size();i++){
X[(int)S[i]-97]++;
}
for(long long i=0;i<26;i++){
if(X[i]==0){
int ans=i+97;
cout<<(char)ans<<endl;
return 0;
... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... |
#include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i,a,b) for (int... | 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int A, B, C, D;
int main(int argc, char* argv[]) {
cin >> A >> B >> C >> D;
int L = A + B;
int R = C + D;
if (L > R)
cout << "Left" << endl;
else if (L == R)
cout << "Balanced" << endl;
else
cou... | #include <iostream>
#include <vector>
using namespace std;
const int Inf = 10000 * 100000 + 100;
int main(){
int V,E,R;
cin >> V >> E >> R;
vector<int> s(E),t(E),d(E);
for(int i = 0; i < E; i++)
cin >> s[i] >> t[i] >> d[i];
vector<int> cost(V, Inf);
cost[R] = 0;
for(int p = 0; p < V; p++){
bool... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
//read_kaisetsu
int main() {
string s;cin>>s;
ll n = s.size();
ll ans = n*(n-1)/2 + 1;
ll a[27];rep(i,27)a[i]=0;
// memset(a,0,sizeof(a));
rep(i,n){
ll tmp = s[i]-'a';
//... | #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()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000007;
int main() {... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec(x) vector<x>
#define pb push_back
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pair<ll,ll>>
#define matrix(x) vector<vector<x>>
#define all(v) v.begin(),v.end()
#define mem(a,b) memset(a, b, sizeof ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 1 |
#include<iostream>
using namespace std;
#include<vector>
#include<functional>
template<typename T>
struct lazysegtree{
function<T(T,T)>calcfn,lazycalcfn;
function<T(T,T,unsigned int)>updatefn;
int n;
T defvalue,lazydefvalue;
vector<T>dat,lazy;
vector<bool>lazyflag;
lazysegtree(int n_=0,T defvalue_=0,
function<... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1400010;
inline int read()
{
int a = 0, f = 1; char c = getchar();
while(c > '9' || c < '0') { if(c == '-') f = -1; c = getchar(); }
while(c >= '0' && c <= '9') { a = a * 10 + c - '0'; c = getchar(); }
return a * f;
}
int n, m;
int a[MAXN], pre[MAXN], A... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt N; std::cin >> N;
std::map<std::string, int> MAP;
std::vector<std::string> s(N);
for (auto& r : s) {
std::cin >> r;
++MA... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> via(n),vib(n);
for(int i = 0; i < n; i++){
scanf("%d", &via[i]);
}
for(int i = 0; i < n; i++){
scanf("%d", ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m; cin >> n >> m;
vector<int> xt(n+1); cin >> xt[0];
vector<int> yt(m+1); cin >> yt[0];
for (int i=1; i<n+1; i++) cin >> xt.at(i);
for (int i=1; i<m+1; i++) cin >> yt.at(i);
sort(xt.begin(), xt.end());
sort(yt.begin(), yt.end());
... | #include<iostream>
#include<string>
#include<stdio.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<vector>
using namespace std;
int main(){
int N,M,X,Y;cin >> N >> M >> X >> Y;
int x[100]={};
int y[100]={};
int flag = 1;
for(int i = 0;i < N;i++)cin >> x[i];
for(int i = 0;i < M... | 1 |
#include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),... | #include <stdio.h>
int isprime(int n) {
int i;
for(i = 2; i * i <= n; i++) {
if(n % i == 0) return 0;
}
return 1;
}
int main(){
int i, n, max;
while(1){
scanf("%d", &n);
if(n == 0) break;
for(i = n;i > 0;i--){
if(isprime(i) == 1 && isprime(i - 2) == 1){
max = i;
break;... | 1 |
#include<cstdio>
#include<set>
#include<stack>
#include<queue>
int main()
{
int d,f,s;
scanf("%d %d %d",&d,&f,&s);
if(d<=f*s){printf("Yes");}
else{printf("No");}
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
// ---------------------------... | 0 |
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, m | nmin | nmax) {
vector<int> P(m);
for (int i = 0; i < m; i++) {
cin >> P[i];
}
int cost = 0, ans = 0;
for (int i = 0; i < m; i++) {... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+5;
const ll mod=1e9+7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
ll n,ans=0,mx=0,a[N],num[100]={0},cnt[100]={0};
void split(ll x){
ll p=0;
while(x){
if(x%2) cnt[p]++;
p++;
x/=2;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
void solve();
clock_t start_time;
double get_current_time() {
return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
// freopen("input.txt", "r", stdin);
// freopen();
ios_base::sync_with_stdio(fa... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M, Q;
cin >> N >> M >> Q;
vector<string> S(N);
for ( int i = 0; i < N; i++ ) {
cin >> S[i];
}
vector<int> X1(Q), Y1(Q), X2(Q), Y2(Q);
for ( int i = 0; i < Q; i++ ) {
cin >> X1[i] >> Y1[i] ... | #include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
int w,h,sx,sy,gx,gy,fc;
int imap[110][110];
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
bool found;
void Init(){
for(int i=0;i<110;i+... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
usin... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Edge(size_t src, size_t dst, Weight weight=1):
src(src), dst(dst), weight(weight)
{... | 0 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if ... | 1 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
string s;
cin >> a >> b;
cin >> s;
vector<char> num{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
if(s.at(a) == '-'){
vector<bool> judge2 (s.size(), false);
judge2.at(a) = true;
for(int i = 0;i < s.... | 0 |
#include<bits/stdc++.h>
const int N=1005,mo=1e9+7;
int n,m,a[N],b[N],i,j,k,ans=1,p,q;
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)scanf("%d",a+i);std::sort(a+1,a+n+1);
for(i=1;i<n;++i)if(a[i]==a[i+1])return puts("0"),0;
for(i=1;i<=m;++i)scanf("%d",b+i);std::sort(b+1,b+m+1);
for(i=1;i<m;++i)if(b[i]==b[i+1])re... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3000;
const int P = 1e9 + 7;
int n, k;
int fac[N * N], inv[N * N], f[N][N];
int power(int a,int b) {
int res = 1;
while (b > 0) {
if (b & 1) res = res * a % P;
a = a * a % P, b >>= 1;
}
return res;
}
int C(int n,int m) {
int ... | 0 |
#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>
using namespace ... | #include <iostream>
#include <memory.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
const int sz = 100000;
bool prime[sz];
int main(){
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for(int i = 2; i * i < sz; i++){
if(prime[i]){
for(int j = 2; i * j < sz; j++){... | 0 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n,a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t minimum;
for(int i = 0; i < 5; i++) {
if(i == 0) {
cin >> minimum;
}
else {
int64_t a;
cin >> a;
minimum = min(minimum, a);
}
}
cout << (N - 1) / minimum + 5 << endl;
} | 1 |
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX_N = 200000;
struct Node {
int idx;
int skipCnt;
int t... | #include <iostream>
#include <algorithm>
using namespace std;
long long N, A[1 << 18];
long long dp[1 << 18][2][20];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = 0; i <= N; i++) {
for (int j = 0; j < 20; j++) {
dp[i][0][j] = -(1LL << 60);
dp[i][1][j] = -(1LL << 60);
}
}
... | 1 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | //#define _GLIBCXX_DEBUG
#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 ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | 1 |
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int, int> pii;
typedef long long ll;
const int MAXN = 2e5 + 5;
const ll INF = 5e16;
int n;
int a[MAXN];
ll brute(int i, int qtt) {
if (i > n) {
if (qtt == n/2) return 0;
else return -INF;
}
return max(a[i] + brut... | 1 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | /*
[jsc2019-qual] C - Cell Inversion
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 1e5;
const int MOD = 1e9 + 7;
class gf {
public:
int n;
gf()... | 1 |
#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(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll mod=1000000007;
const ll INF=1e15;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
vec chikan(vec X, vec M){
vec ret(M.size());
for(int i=0;i<M.s... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define fore(i,x,n) for(int i=x;i<n;i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define ordenar(a) sort(all(a))
typedef long long ll;
typedef vector<int> vi;
int a[5], k;
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
int b;
int c;
int d;
int e;
int k;
cin >>a;
cin >>b;
cin >>c;
cin >>d;
cin >>e;
cin >>k;
if(e - a <= k)cout << "Yay!" <<endl;
else cout << ":(" <<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int main() {
int a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream> // cout, endl, cin
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, k;
cin >> a >> b >> c >> k;
long long ans = a + b + c;
a = max(a, max(b, c));
ans -= a;
for(int i = 0; i < k; i++) a *= 2;
cout << ans + a << endl;
} | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, m, q, x, y;
cin >> n >> m >> q;
int count[501][501] = {0};
for(int i = 0; i < m; i++)
{
cin >> x >> y;
count[x][y]++;
}
for(int i =0; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
co... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include<iostream>
#include<list>
#include<queue>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
int n, m;
struct Node {
//int id;
list<int> next;
};
Node graph[100005];
int prenum[100005];
int parent[100005];
int lowest[100005];
set<int> answer;
int rootCount;
void dfs(int curNodeId,int ste... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void read(ll &x){
x=0; char c=getch... | 1 |
#include <iostream>
using namespace std;
int main(){
while(1){
int E;
cin >> E;
if(E==0) break;
int x=0,y=0,z=0;
int m = 1000000;
for(z=0;z*z*z<=E;z++){
for(y=0;(z*z*z)+(y*y)<=E;y++){
x=E-(z*z*z)-(y*y);
if(x+y+z<m){
m=x+y+z;
//cout << x << y << z << endl;
}
}
}
co... | #include <bits/stdc++.h>
using namespace std;
const int N = 510;
int p[10010];
vector<int> primes;
int a[N * 2], b[N * 2];
void init() {
for (int i = 2; i < 10000; i++) {
if (!p[i]) {
for (int j = i + i; j < 10000; j += i) {
p[j] = 1;
}
primes.push_... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1e9+7;
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
if (n == 1) {
cout << 1;
return 0;
}
sort(a.begin(), a.end());
int ans = 0;
rep(i,n - 1) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
ll s[200010];
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i+1]=s... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#define NIL -1
#define MAX 610005
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int n;
int root;
int *p = new int[MAX]; // p---| Unit
int *left2 = new int[MAX]; // left2 --|--------> T
int *right... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int arr[n][n];
for(int i=0;i<n;... | 0 |
// https://agc026.contest.atcoder.jp/tasks/agc026_c
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;constexpr const char nl='\n',sp=' ';
seed_seq seq {
uint64_t(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::n... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,j,mx,t,x,ans,f[19][19],a[19],b[19];
char s[101];
int main(){
scanf("%lld",&n);
scanf("%s",s+1);
mx=1ll<<n;mx--;
for(t=0;t<=mx;t++){
a[0]=b[0]=0;
for(i=n*2;i>n;i--){
x=n*2-i;
if(t&(1ll<<x))a[++a[0]]=s[i]-'a';
else b[++b[0]]=s[i]-'... | 1 |
#include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n' << flush;
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (true) {
int m = (l + r) / 2;
string M = qu... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
while(t--)
{
string s;
cin>>s;
int l,r;
string... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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&... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <u... | 1 |
#include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int s[10];
inline bool Ch... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int b,c,d,e,f,g,h,i,j,k,l,m,t;
long long a;
cin>>a;
string s;
while(a--)
{
s+=('a'+a%26);
a=a/26;
}
reverse(s.begin(),s.end());
cout<<s;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdi... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s; cin >> s;
if(s.length() <= n) cout << s << endl;
else{
for(int i = 0; i < n; i++) cout << s[i];
cout << "..." << endl;
}
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;
const int dx[4]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T>
inline bool ... | 1 |
#include<iostream>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,c,d;
cin >> n;
int A[1000];
int B[1000];
for (int i=0; i<n; i++){
A[i] = 0;
B[i] = 0;
}
for(int i=0; i<n*(n-1)/2; i++){
cin >> a >> b >> c >> d;
if( c > d ){
A[a-1] += 3;
B[a-1] += 3;
}
else if( c < d ){... | #include<stdio.h>
#include<iostream>
using namespace std;
int main(void){
int n,a[4],t[100],i,c,j;
cin>>n;
for(i=0;i!=n;i++){
t[i]=0;
}
for(i=0;i!=n*(n-1)/2;i++){
for(j=0;j!=4;j++)
cin>>a[j];
if(a[2]<a[3])
t[a[1]-1]+=3;
else if(a[2]>a[3])
t[a[0]-1]+=3;
else{
t[a[0]-1]++;
t[a[1]-... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string S; cin >> S;
const int N = S.size();
int K; cin >> K;
int res = 0;
vector<vector<vector<int>>> dp(K+1, vector<vector<int>>(N, vector<int>(N, 0)));
for(int d=N-1;d>=0;d--){
for(int i=0;i+d<N;... | #include <cstdio>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
int c = 0;
for(int i = a; i <= b; i++) {
int p = i % 10, q = i / 10000 % 10;
int r = i / 10 % 10, s = i / 1000 % 10;
if(p == q && r == s)
c++;
}
printf("%d\n", c);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int xmax = x;
int ymin = y;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a;
xmax = max(a, xmax);
}
for (int i = 0; i < m; i++) {
cin >> b;
ymin = min(b, ymin);
}
if (xmax < ymin) {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0... | 1 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, K, ans=1000000000000, tmp=-1;
vector<ll> A, B;
signed main(){
cin >> N >> K;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
if(a<0) A.push_back(a);
else B.push_back(... | #include <iostream>
#include <vector>
#include <algorithm>
#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"
typedef long long ll;
typedef unsigned long long ull;
const do... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long N;
long long A[200005];
int main(){
cin >> N;
for(long long i = 0; i < N; i++) {
cin >> A[i];
}
set<long long> aset;
for(long long i = 0; i < N; i++) {
if(aset.count(A[i]) != 0) {
cout << "NO" << endl;
return 0;
}
aset.insert(A[i]);
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s; cin >> s;
string c = "abcdefghijklmnopqrstuvwxyz";
bool find_flag = false;
for (int i=0; i<26; i++) {
bool target = false;
for (int j=0; j<s.length(); j++) {
if (c[i] == s[j]) target = true;
}
if (!target) {
... | 0 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
int main(){
int n,q;
cin>>n>>q;
ll c,x,y;
fenwick_tree<ll> fw(n);
rep(i,n){
cin>>x;
fw.add(... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct BIT {
int n; vector<LL> bit;
void init(int _n) { n = _n; bit.assign(n + 1, 0); }
void m(int x, LL d) {
while (x <= n)
bit[x] += d, x += x & (-x);
}
LL q(int x) {
LL ret = 0;
while (x > 0)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
int N;
cin>>N;
stri... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
// ref... | 0 |
#include<cstdio>
#include<vector>
using namespace std;
int n,m;
vector<int> tomo[1001];
int ss[1001];
void saiki(int s,int dps){
ss[s]=1;
if(dps==2){
return;
}
for(int i=0;i<tomo[s].size();i++){
saiki(tomo[s][i],dps+1);
}
}
int main(){
while(1){
scanf("%d%d",&n,&m);
if(n==0&&m==0){
break;
}
for(... | #include <bits/stdc++.h>
using namespace std;
#define LIMIT 100001
int N, Q, K;
vector<map<long long, long long>> nodeDis(LIMIT);
vector<long long> kToNode(LIMIT);
vector<bool> check(LIMIT);
vector<unordered_set<int>> vg(LIMIT);
void makeDistance(int k, long long dis){
check[k] = true;
kToNode[k] = dis;
for(au... | 0 |
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
long long int gcd(long long int a, long long int b);
//int a[200000];
vector<int> graph[100000];
int flag[100000];
int main() {
//F
int n;
cin >> n;
int u, v;
cin >> u >> v;
int a, b;
int i;
for (i = 0; i < n - 1; i++) {
cin >> a >> b... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dis[2][N];
vector<int> g[N];
void bfs(int be, int id) {
queue<int> q;
q.push(be);
dis[id][be] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v : g[u]) {
if (!dis[id][v]) {
dis[id][v] = dis[id][u]... | 1 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lm... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #define NODE 0
#define WEIGHT 1
#define COST_IDX 0
#define TIME_IDX 1
#define P_IDX 0
#define Q_IDX 1
#define R_IDX 2
#include <iostream>
#include <cstring>
using namespace std;
int n, m, k;
int weights[101][101][2];
int min_w[101][101][2];
int requests[200][3];
struct heap_queue {
int arr[101];
int *cmp_val;
i... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
typedef int TInt;
typedef std::vector<TInt> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
int insertionSort(TList& A, int g)
{
i... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 0 |
// A - 01 Matrix
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int grid[1000][1000];
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {... | #include <iostream>
using namespace std;
int main(void){
int n,i,a[100];
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
}
for(i=n-1;i>=0;i--){
cout << a[i];
if(i!=0) cout << " ";
else cout << endl;
}
}
| 0 |
#include "bits//stdc++.h"
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
int a[100000];
vector<int> G[100000];
int in[100000];
int N, K;
int ans;
int solve(int v) {
if (G[v].size() == 0) retu... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k, t;
cin >> k >> t;
vector<int>a(t);
for (int i = 0; i < t; i++)cin >> a.at(i);
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
if (a.at(0) <= ceil((double)k / 2))cout << 0 << endl;
else {
if (k % 2 == 0)cout << 1 + ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const double PI = acos(-1);
int main()
{
string s;
cin >> s;
cout << s.substr(0, s.size() - 8) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size() - 8; i++) {
cout << str[i];
}
cout << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 7;
string w[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
for (unsigned int i = 0; i < 7; i++) {
if(s == w[i]) {
ans -= i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string arr[7] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string s;
cin>>s;
int x = find(arr,arr+7,s)-arr;
cout<<7-x<<endl;
return 0;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int a,b,k,i;
cin>>a>>b>>k;
for(i=0;i<k;i++){
if(i&1){
a+=(b>>=1);
}else{
b+=(a>>=1);
}
}
cout<<a<<" "<<b;
return 0;
} | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
constexpr ModFact() : fact() {
fact[... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string res = "AC";
int C_cnt = 0;
if (s.at(0) == 'A') {
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == 'C') {
if (2 <= i && i <= (s.size()-2)) {
C_cnt++;
... | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
char s[200005];
int n,cnt[26];
ll ans=0;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++)cnt[s[i]-'a']++;
ans=1;
for(int i=0;i<26;i++)for(int j=i+1;j<26;j++)ans+=1ll*cnt[i]*cnt[j];
printf("%lld\n",a... | #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(){
string s;
cin>>s;
int n=s.size();
ll ans=1;
map<char,int>mp;
rep(i,n){
mp[s[i]]++;
ans+=i+1-mp[s[i]];
}
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#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... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
voi... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9+7 ;
const ll INF = 1e18 ;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(2));
for (int i = 0; i < N; ++i) {
cin >> A[i... | #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 v... | 0 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int p,q,r,a,b;
cin>>p>>q>>r;
a=min(p+q,q+r);
b=min(a,p+r);
cout<<b<<endl;
return 0;
}
| #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int n,x[1000010],p;
char s[1000010],t[1000010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k,l;
scanf("%d%s%s",&n,&s,&t);
for(i=n-1,j=n,k=0,l=0;i>... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
ll extgcd(ll a, ll b, ll& x, ll& y) {
ll d = a;
if(b ... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const l... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,k;
cin>>n>>k;
if(n%k==0) cout<<0<<endl;
else cout<<1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.beggin(), x.end(), greater<t>());
#define dump(... | 0 |
#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; cin >> N;
vector<int> A(N), B(N);
vector<int> C(N);
ll totalB = 0;
rep(i, N){
cin >> A[i] >> B[i];
C[i] = A[i] + B[i];
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define INF 99999999
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
long long ans = 0;
cin >> n;
vector <vector<int>> v(n, vector<int>(3));
int a, b, c;
for (vector<int>& tmp ... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
#define N 50
int main(){
while(1){
int n,m;
int ca[N];
cin >> n >> m;
if(!n&&!m) break;
fill(ca,ca+n,0);
int wan = m;
int k = 0;
while(1){
while(wan){
ca[k]++;
k++;
k = k%n;
wan--;
}
if((k==0&&ca[n-1]==m)||(ca[k-1]=... | #include<iostream>
#include<stdio.h>
#include<cmath>
#include<vector>
using namespace std;
#define loop(i,a,b) for(int i=a,i<b;i++)
#define rep(i,a) loop(i,0,a)
int main(){
int n,p;
while(cin>>n>>p,n||p){
int wan=p;
vector<int>in(n);
int to=0;
while(1){
if(wan){
wan--;
in[to]++;
}else{... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,k,c[10],l[10],e[10000],d,a,b;
while(true){
cin>>n;
cin>>k;
if(n==0 && k==0){
break;
}
for(int i=0;i<n;i++){
cin>>c[i];
if(c[i]>=10){
l[i]=100;
}
else{
l[i]=10;
}
}
d=0;
if(k==2){
for(int i=0;i<n;i++... | #include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int n,k,d[10];
int sum(int a,int b,int c=0,int d=0){
int x=a*(b>=10?100:10)+b;
if(k==2)return x;
x=x*(c>=10?100:10)+c;
if(k==3)return x;
return x=x*(d>=10?100:10)+d;
}
int main(){
while(scanf... | 1 |
#include <iostream>
using namespace std;
int main() {
int m,min,max,ten[200],gap=10001,sa;
cin>>m>>min>>max;
while(1){
if(m==0 && min==0 && max==0){
break;
}
for(int i=1;i<=m;i++){
cin>>ten[i];
}
for(int i=min;i<=max;i++){
if(gap>=ten[i+1]-ten[i]){
gap=ten[i+1]-ten[i];
... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#d... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=5e18;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
cout << min(a,b)+min(c,d) << endl;
} | #include<iostream>
using namespace std;
int main(){
int a,b,c,d,e,f,m,n;
cin >> a >> b >> c >> d >> e >> f;
if(a<b && a<c && a<d) m=b+c+d;
if(b<a && b<c && b<d) m=a+c+d;
if(c<a && c<b && c<d) m=a+b+d;
if(d<a && d<b && d<c) m=a+b+c;
if(e<f){
n=f;
}else{
n=e;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
void insertion_sort(vector<int>& A, int n, int g, int& cnt)
{
for (int i = g; i < n; ++i) {
int key = A[i];
int j = i - g;
while (j >= 0 && A[j] > key) {
A[j + g] = A[j];
j -= g;
++cnt;
}
... | #include <iostream>
#include <vector>
template<typename T>
void print_ary(std::vector<T> ary, char delim = '\n') {
for(int i = 0; i < ary.size()-1; i++) {
std::cout << ary[i] << delim;
}
std::cout << ary[ary.size()-1];
}
template<typename T>
void insertion_sort(std::vector<T>&& ary) {
for (in... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b... | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
//cout << fixed << setprecision(20) << *** << endl;
#define rep(i,N) for(int i=0;i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
vector<vector<int>>xyc(3, vector<int>(M));
for(int i=0; i<A; i++)cin >> a.at(i);
for(int i=0; i<B; i++)cin >> b.at(i);
for(int i=0; i<M; i++){
for(int j=0; j<3; j++){
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
vector < ll > fact(N);
ll pwr(ll a, ll b){
ll res = 1;
while(b > 0){
if(b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
ll inv(ll a){
return pwr(a,... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 998244353;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep... | #include<stdio.h>
int main(){
char a[150];
int x=1;
scanf("%[^\n]", a);
for (int i=0 ; a[i]!='\0' ; i++){
if (a[i]==' '){
if (a[i-1]==a[i+1]){
continue;
} else{
x=0;
break;
}
}
}
printf("%s\n", x==1 ? "YES" : "NO");
return 0;
} | 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int main(int argc, char* argv[]){
cin.ti... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string sa, sb, sc;
cin >> sa >> s... | 0 |
#include <iostream>
#include <vector>
int main() {
int A, B, M; std::cin >> A >> B >> M;
std::vector<int> a(A);
int ma = 0;
for (int i = 0; i < A; i++) {
std::cin >> a[i];
if (i == 0) {
ma = a[0];
} else {
ma = std::min(ma, a[i]);
}
}
std:... | #include <iostream>
#include <array>
#include <string>
using namespace std;
enum dir_t {NORTH, EAST, WEST, SOUTH};
enum face_t {TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT};
class Dice {
public:
Dice(int32_t top, int32_t bottom, int32_t front, int32_t back, int32_t left, int32_t right) {
val[TOP] = top;
... | 0 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int x = 0;
while (n > 2)
{
x++;
n = n - 3;
}
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 1 |
// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 1 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main() {
vector<int> a(3);
rep(i,0,3) cin >>a[i];
sort(a.begin(),a.end());
int K; cin >>K;
a[2]*=pow(2,K);
cout <<accumulate(a.begin(),a.end(),0) <<endl;
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n, a = 0, b = 0, c;
cin >> a >> b >> c;
cin >> n;
cout << (a + b + c) - max(max(a, b), c) + (max(max(a, b), c) << n);
}
| 1 |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 1005
ll N,M;
int min_dist[SIZE],pre_node[SIZE];
vector<int> G[SIZE];
vector<int> bfs... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
#define all(c) c.begin(), c.en... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | 0 |
#include <bits/stdc++.h>
#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--)
#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
int m, e, j;
cin >> m >> e >> j;
if (m == 100 || e == 100 || j == 100 || (m + e) / 2 >= 90 || (m + e + j) / 3 >= 80)cou... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iostream>
#include <numeric>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int INF = 1e9;
int main(){
int n,... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int num[10];
bool is_OK(int X){
while(X > 0){
int n = X % 10;
if(num[n]){
return false;
}
X /= 10;
}
return true;
}
int main(void){
int N,K;
cin >> N >> K;
int D[K];
fo... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.