code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll exp... | #include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n, h1;
cin>>n;
if(n%2==1)
{
cout<<"No"<<endl;
return 0;
}
char str[n+5];
for(i... | 0 | 77,346,872 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll n, sum[1010], x;
bool jud = false;
vector<ll> ans[1010];
int main(void){
cin >> n;
for (ll i = 0; i < 1000; i++) sum[i + 1] = sum[i] + i + 1;
for (ll i = 1; i <= 1000; i++){
if (sum[i] == n){
jud = true;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int a[26]={};
for(int i=0;i<s.size();i++) a[s[i]-'a']++;
for(int i=0;i<26;i++){
if(a[i]==0){
cout << s+char(i+'a') << endl;
return 0;
}
}
if(s=="zyxwvutsrqponmlkjihgfedcba"){... | 0 | 53,640,445 |
#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;
... | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload... | 0 | 98,415,067 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x=0,y=0,z=0,l=0,m=0;
int p[] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 };
int n;
cin >> n;
int a[16];
fill(a,a+16,0);
for (int i = 2; i <= n; i++) {
int j = 0, temp = i;
while (temp > 1 && j < 15) {
if (temp%p[j]) j++;
e... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
char maze[51][51];
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
int main(){
int h,w;
cin >> h >> w;
rep(i,h) rep(j,w) cin >> m... | 0 | 60,999,032 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong n;
llong a[100005];
int main() {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, A = 0;
int rest = 0;
cin >> N >> A;
if(N >= 500){
rest = N % 500;
if (rest <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}else{
rest = N;
if (r... | 0 | 73,692,221 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,K;
cin>>N>>K;
int M=(N+1)*N/2;
vector<int> A(N+1),B(M);
for(int i=0;i<N;i++){
cin>>A[i+1];
A[i+1]+=A[i];
}
int cnt=0;
for(int i=0;i<N;i++)
for(int j=i+1;j<=N;j++,cnt++)B[cnt]=A[j]-A[i];
int ans=0;
for... | #include<bits/stdc++.h>
using namespace std;
const int mod = 200003;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begi... | 0 | 49,703,582 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } retu... | 0 | 43,203,691 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main()
{
cin >> a >> b;
if (a * b % 2 == 0)
{
cout << "Even" << endl;
}
else
{
cout << "Odd" << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
bool comp(const std:... | 0 | 93,978,322 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
# define MAX_N 1000010
class UnionFind{
private:
int par_[MAX_N];
int rank_[MAX_N];
int size[MAX_N];
int groups_;
public:
void init(int n){
for(int i=0; i<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 61,760,705 |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define SIZE(array) (sizeof(array) / sizeof(array[0]))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> elevations;
vector<bool> hill(n,true);
for (int i = 0; i < n; i++) {
int h;
cin >> h;
elevations.push_back(h);
}
int a, b;
... | 0 | 72,649,782 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n)
{
cin >> a[i];
}
sort(a.begin(), a.end()... | 0 | 64,715,452 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,s,t,n,i;
cin >> n;
for(i=0;i<n;i++){
cin >> a >> b >> c;
if(a<b){
d=b;
b=a;
a=d;
}if(b<c){
d=c;
c=b;
b=d;
}if(a<b){
d=b;
b=a;
a=d;
}
s=a*a;
t=(b... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000000;
const ll mod = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline... | 0 | 92,483,105 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int x, y;
cin >> x >> y;
rep(i, x + 1) {
int r = y - 2 * i;
if (4 * (x - i) == r) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
intt N, K, R, S, P; std::cin >> N >> K >> R >> S >> P;
std::string T; s... | 0 | 23,821,237 |
#include<bits/stdc++.h>
using namespace std;
using Lint=long long;
int main()
{
int N; cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++) cin>>a[i];
Lint ans=a[0]-1;
int mx=1;
for(int i=1;i<N;i++){
if(a[i]%(mx+1)!=0){
ans+=a[i]/(mx+1);
... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){i... | 0 | 98,432,156 |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#de... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10;
int n,cnt,e,f[N],a[N],id[N],w[N],siz[N],res[N],head[N],link[N],to[N];
bool vis[111111];
bool cmp(int x,int y){return a[x]<a[y];}
void add(int u,int v){to[++e]=v,link[e]=head[u],head[u]=e;}
void dfs1(int u,int dep){
siz[u]=1,res[id[1... | 0 | 62,359,872 |
#include<iostream>
using namespace std;
int main(){
int x;cin>>x;
int ans=1,cnt=x;
while(cnt%360!=0){
cnt+=x;
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 30,312,700 |
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 67,771,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
double T;
double calcMaxV(double ... | #include <cstdio>
#include <cctype>
#include <set>
#include <iostream>
using namespace std;
typedef long long LL;
inline char gc()
{
static const int L = 23333;
static char sxd[L], *sss = sxd, *ttt = sxd;
if (sss == ttt)
{
ttt = (sss = sxd) + fread(sxd, 1, L, stdin);
if (sss == ttt) return EOF;
}
return *sss+... | 0 | 72,421,787 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <cmath>
using namespace std;
double calcS(int a, int b, int d);
double calcL(int a, int b, int d);
double calcH(int b, int d);
int main(void)
{
int a, b, d;
cin >> a >> b >> d;
cout << fixed << calcS(a, b, d) << endl;
cout << fixed << calcL(a, b, d)... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string S;
cin >> S;
if(S.size() % 2 == 1) {
S = S.substr(0, S.size()-1);
} else {
S = S.substr(0, S.size()-2);
}
while(S.size() > 0) {
string left = S.substr(0, S.size()/2);
string rig... | 0 | 56,437,776 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be() , (a).en()
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define REP2(i,s,n) for(int (i)=(s);(i)<(n);(i)++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>>a(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> a.at(i).at(j);
}
}
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(a.at(i).at(j) == '.'){
boo... | 0 | 39,244,961 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,a[205],ans=0;
cin>>n;
rep(i,n-1){
cin>>a[i];
if(i==0){
ans+=a[i];
}else{... | 0 | 80,018,383 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n;
long long d, v;
cin >> n >> d >> v;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());... | #include <bits/stdc++.h>
#include <ios>
using namespace std;
const int md = 1e9 + 7;
using ll = long long;
ll solve(string &s, vector<vector<ll>> &memo, int offset = 0,
bool is_less = false) {
if (s.size() == offset) {
return 1;
}
if (memo[offset][is_less] < 0) {
char ch = s[offset];
ll ans =... | 0 | 74,168,843 |
#include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
int main() {
int n; cin >> n;
vector<int64_t> a(n), b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
int64_t ans = 0;
for (int i = n - 1; 0 <= i; --i) {
int64_t mod = (a[i] + ans) % b[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 vec... | 0 | 20,835,673 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | #define Task ""
#define F first
#define S second
#define push_back pb
#define bit(x, i) (x >> i) & 1
#define inf 1e9 + 7
#define INF 1e18 + 7
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <string>
#include <sstream>
#include <cstdio>
#include ... | 0 | 12,935,640 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <unordered_map>
using namespace std;
int main(){
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> AB(N);
int a, b;
for(int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<string> A(N), B(M);
for (int i=0; i<N; i++) cin >> A[i];
for (int i=0; i<M; i++) cin >> B[i];
if (N<M) {
cout << "No" << endl;
return 0;
}
else {
for (i... | 0 | 17,363,060 |
#include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c; cin >> a >> b >> c;
puts((a == b && b == c) ? "Yes" : "No");
return 0;
} | #include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
int N;
vector<long long int> a,b;
int main() {
cin >> N;
for(int i=0;i<N+1;i++){
int x;
cin >> x;
a.push_back(x);
}
for(int i=0;i<N;i++){
int x;
cin >> x;
b.push_back(x);
}
... | 0 | 49,801,882 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a,b,c;
char d,e,f;
int ai,bi,ci;
cin >> a >> b >> c;
cin >> d >> e >> f;
if(a==d){
ai=1;
}else{
ai=0;
}
if(b==e){
bi=1;
}else{
bi=0;
}
if(c==f){
ci=1;
}else{
ci=0;
}
cout << (ai+bi+ci) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void wr... | 0 | 89,168,331 |
#include <iostream>
int main(void) {
std::string x;
std::cin >> x;
while(x != "0") {
int sum = 0;
for (int i = 0; i < x.size(); i++) {
sum += x[i] - '0';
}
std::cout << sum << std::endl;
std::cin >> x;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 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 ... | 0 | 22,790,143 |
#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 a, b, c;
cin >> a >> b >> c;
int k = a;
rep(i, b) {
if (k % b == c) {
cout << "YES" << endl;
return 0;
}
k += a;
}
cout << "NO"... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=500005;
const ll INF=0x3f3f3f3f;
const ll MOD=1000000007;
ll n,m,a[MAX],a_sum[MAX],b[MAX],b_sum[MAX],s1,s2;
int main(){
scanf("%lld%lld",&n,&m);
f... | 0 | 59,644,688 |
#include <iostream>
using namespace std;
int main(void){
int A, B, C, D;
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
cout << "Right" << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define INF 9223372036854777ll
#define pb push_back
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
vector<ll> dp(k+1);
dp[0... | 0 | 94,110,848 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b;
string s;
cin >> a >> b >> s;
bool ans = true;
for (int i = 0; i < s.size(); ++i) {
if (i == a && s[i] != '-') {
ans = false;
break;
}
if (i != a && (s[i] < '0' || s[i] > '9')) {
ans ... | #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;
string s;
cin >> n >> s;
int ans = 0;
for (char i = '0'; i <= '9'; ++i) {
for (char j = '0'; j <= '9'; ++j) {
for (char k = '0'; k <= '9'; +... | 0 | 98,876,837 |
#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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
doubl... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int weight[10]={0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int INF = 1e5;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
int min_A=-INF;
for(int m=0; m<M; m++) {
cin >> A[m];
min_A = min(min_A, A... | 0 | 10,428,678 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 2006
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout<<(a)<<endl
#define VECIN(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define MOD 1000000007
ll dp[N][N]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
int main() {
ll N, M;
cin >> N >> M;
vi L(M), R(M), D(M);
for (ll i = 0; i < M; i++) {
cin >> L[i] >> R[i] >> D[i]... | 0 | 69,658,443 |
#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;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n, k;
cin >> n >> k;
vector<int> mod_zero;
vector<int> mod_half;
for ( int i = 1; i <= n; i++ ) {
if ( i % k == 0 ) {
mod_... | 0 | 35,134,098 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(long long N, std::vector<long long> H){
ll x = H[0];
ll ans = 0;
ll cnt = 0;
for(int i=1; i<N; i++) {
if(x < H[i]) {
ans = max(ans, cnt);
cnt = 0;
} else {
cnt++;
... | 0 | 86,611,538 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
bool xcmp(pair<long long int, long long int> a, pair<long long int, long long int> b) {
if(a.first!=b.first) {
return a.first < b.first;
}
return a.second < b.second;
}
bool ycmp(pair<... | #include<iostream>
#include<algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int A,B,X;
cin >> A >> B >> X;
int remain = X - A;
if(remain < 0)
{
cout << "NO";
}
else if(remain <= B)
{
cout << "YES";
}
else
{
... | 0 | 73,603,535 |
#include<bits/stdc++.h>
using namespace std;
int N;
void solve(){
map<char,char>M;
while(N--){
char from,to;
scanf(" %c %c",&from,&to);
M[from]=to;
}
int K;
scanf("%d",&K);
while(K--){
char c;
scanf(" %c",&c);
if(M.find(c)!=M.end())printf("%c",M[c]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n)
{
cin >> a[i];
a[i]--;
}
int ans = 0, tmp =... | 0 | 90,024,635 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+10,mod=1e9+7;
void plusle(int &a,int b){a+=b;if(a>=mod)a-=mod; return;}
void minun(int &a,int b){a-=b; if(a<0)a+=mod; return;}
int add(int a,int b) {a+=b;return a>=mod?a-mod:a;}
int sub(int a,int b) {a-=b;return a<0?a+mod:a;}
int mul(int a,int b) {return (... | #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... | 0 | 99,072,809 |
#include<bits/stdc++.h>
using namespace std;
#define maxn 100110
int n,a[maxn];
int main()
{
scanf("%d",&n);
for(int i=0;i<n;++i) scanf("%d",&a[i]);
sort(a,a+n);
int ans=a[0],ret=a[0]>a[n-1]/2?a[n-1]-a[0]:a[0];
for(int i=1;i<n-1;++i)
{
int tmp=a[i]>a[n-1]/2?a[n-1]-a[i]:a[i];
if(tmp>ret)
{
ret=tmp;
ans... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#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 all(in) in.be... | 0 | 32,180,722 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define lll __int128
#define ull unsigned long long
#define fi first
#define se second
#define db double
#define ld long double
#define lld __float... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> d;
... | 0 | 32,167,814 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str, revStr;
cin >> str;
for(int i = 0; i < str.length(); i++) {
revStr.push_back(str[str.length() - 1 - i]);
}
cout << revStr << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 40,002,967 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,ans,sum;
scanf("%d",&n);
while(n != 0){
ans = 0;
sum = 1000-n;
while(sum >= 500){
sum -= 500;
ans++;
}
while(sum >= 100){
sum -= 100;
ans++;
}
while(sum >= 50){
sum -= 50;
ans... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 56,710,446 |
#include <iostream>
int main() {
int h, w;
for (std::cin >> h >> w; h !=0 && w != 0; std::cin >> h >> w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cout << '#';
}
std::cout << std::endl;
}
std::cout << std::endl;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<long long> a(N),b(N);
for(int i=0; i<N; i++) cin >> a[i];
for(int i=0; i<N; i++) cin >> b[i];
long long total=0;
for(int i=0; i<N; i++){
total-=a[i];
total+=b[i];
}
vector<long long> u(N,0),v(N,0);
for(int i=0; i... | 0 | 40,866,301 |
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
while (cin >> N, N) {
int a, maxi = 0, mini = 1000, sum = 0;
for (int i = 0; i < N; i++) {
cin >> a;
maxi = max(maxi, a);
mini = min(mini, a);
sum += a;
}
cout << (su... | 0 | 44,270,677 |
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) != ... | #include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long int> ;
bool isPalin( int N ){
int rev = 0 ;
int temp = N ;
... | 0 | 52,064,232 |
#include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
string s;
cin >> s;
if (s[0] != s... | #include "bits/stdc++.h"
#include <numeric>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define llMIN numeric_limits<long long>::min()
#define intMIN numeric... | 0 | 41,070,208 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
... | #include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int main()
{
string str;
while (getline(cin, str))
{
if(str == "0"){
break;
}
int val = 0;
for (auto c : str)
{
val += c - '0';
}
cout << val << endl;... | 0 | 1,101,113 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for(int i=0; i<s.size(); i+=n) cout << s[i];
cout << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | 0 | 3,001,166 |
#include<iostream>
using namespace std;
int main(){
string a;
string b;
int s=0;
cin>>a>>b;
for(int i=0;i<a.size();i++)
{
if(a[i]==b[i])
s++;
}
cout<<a.size()-s;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int s;
cin>>s;
bool flag=0;
int n=1;
vector<int>a(n);
a[0]=s;
while(flag==0){
if(a[n-1]%2==1){
n++;
a.resize(n);
a[n-1]=a[n-2]*3+1;
}
else{
n++;
a.resize(n);
a[n-1]=a[n-2]/2;
}
for(... | 0 | 73,404,973 |
#include <iostream>
#include <string>
#include <utility>
using namespace std;
template <class T>
class mlist {
private:
typedef struct elm_ {
struct elm_* next;
struct elm_* prev;
T value;
} elm;
elm* sentinel;
public:
mlist() {
sentinel = new elm;
sentinel->next = sentinel;
sentinel->prev =... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 5,864,602 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
if (abs(X-Y) <= 1) cout <<"Brown\n";
else cout << "Alice\n";
} | #include <bits/stdc++.h>
#include <string>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main()
{
int n,ans;
cin >> n;
vector<int> a(n),aa(n);
rep(i, n) {
cin >> a[i];
aa[i] = a[i];
}
sort(aa.begin(), aa.end()... | 0 | 27,427,332 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long n;
vector<long>a;
long ans;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
long x;cin>>x;a.push_back(x);
}
while(1)
{
sort(a.begin(),a.end(),greater<long>());
if(a[0]<n)break;
long k=0;
while(k+1<n&&a[k+1]+k+1>=n&&a[k]-a[k+1]<n+1... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) ... | 0 | 53,263,148 |
#include <cstdio>
#include <cmath>
#include <algorithm>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
constexpr int MAX_N = 100000;
int n;
int a[MAX_N];
int ma;
int main()
{
scanf( "%d", &n );
rep( i, n )
scanf( "%d", a+i ), ma = std::max( ma, a[i] );
int r = 0;
rep( i, n )
{
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l... | 0 | 62,279,113 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int s = a.back();
int g = s / 2;
int t;
int dif = 1 << 30;
for (int i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll h, w, m1 = 0, m2 = 0, m3 = 0, minm, maxm, mind = INF;
cin >> h >> w;
for (int i = 1; i < h; ++i) {
m1 = i * w;
int ww = ceil(w / 2.0);
m2 = (h - i) *... | 0 | 100,501,110 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> hight(n);
rep(i,n) cin >> hight[i];
int cnt = 1;
int maxh = hight[0];
for (int i = 1; i < n; i++) {
if (maxh <= hight[i]) cnt+... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
map<int, i... | 0 | 9,539,043 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 41,824,875 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax) {
if (m == 0 && nmin == 0 && nmax == 0) {
break;
}
vector<int> d(m);
for (int i = 0; i < m; i++) {
cin >> d[i];
}
int MAX = d[nmin-1]-d[nmin];
int maxn = nmi... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string str;
getline(cin, str);
for (int i = 0; i < str.size(); i++) {
if (65 <= str[i] && str[i] <= 90) {
cout << (char)(str[i] + 32);
}
else if (97 <= str[i] && str[i] <= 122) {
cout << (char)(str[i] - 32);
}
else {
cout << str... | 0 | 56,327,620 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int >nos(n,0);
for(int i=0,a;i<n;i++){cin>>a;nos[i]=a-1;}
int tot=0;
for(int i=0;i<n;i++){
if(nos[nos[i]]==i)tot++;
}
cout<<tot/2;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define all(v) v.begin() , v.end()
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define fastio ios_base::sync_with... | 0 | 2,313,499 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return ... | #include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
class BBreakNumber {
public:
void solve(std::istream& cin, std::ostream& cout) {
int n ;
cin >> n ;
int ans = 0 ;
for(int i = n ; i>=0 ; --i){
if(i && (!(i & (i - 1)))){
... | 0 | 19,914,983 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string n;
cin >> n;
if (n[1] == n[2]) {
if(n[1] == n[0] || n[2] == n[3]) cout << "Yes" << endl;
else cout << "No" << endl;
}
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 84,173,773 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll gcd(ll a,ll b){
if(b==0) return a;
retur... | #include <bits/stdc++.h>
using namespace std;
const string JpyStr = "JPY";
const int BtcJpyRate = 380000;
int main()
{
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i)
{
double input;
cin >> input;
string unit;
cin >> unit;
sum += (unit == JpyStr ?... | 0 | 25,049,484 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | #include<cstdlib>
#include<vector>
#include<string>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
#include<stack>
#include<cstdio>
#include<iostream>
#include<vector>
#define MAXN 1000
using namespace std;
typedef long long ll;
inline ll rd() {ll x=0;char c=getchar();while(c<'0'||c>'9')c=getchar()... | 0 | 19,615,713 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
... | 0 | 62,929,582 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
... | #include<iostream>
#include<cstring>
using namespace std;
int main(){
int r,c;
int n;
int dp[1000][1000];
while(1){
cin>>r>>c;
if(r==0)break;
cin>>n;
memset(dp,-1,sizeof(dp));
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
dp[b-1][a-1]=0;
}
dp[c-1][r-1]=1;
for(int... | 0 | 55,280,006 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> to[n + 1];
for (int i = 0, a, b; i < m; i++) {
cin >> a >> b;
to[a].emplace_back(b);
t... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
... | 0 | 48,389,112 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fi first
#define se second
#define mp make_pair
#define pb p... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, inc, dec;
scanf("%d %d %d", &n, &inc, &dec);
if(inc>n || dec>n){
printf("-1\n");
return 0;
}
bool swapped=false;
if(inc<dec)
{
swap(inc,dec);
swapped=true;
}
vector<int> v;
for(int i... | 0 | 14,795,158 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N, K;
cin >> N >> K;
ll mod = 1e9+7;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<vector<ll>> dp(N+1, vector<ll>(K+1, 0));
dp[0][0] = 1;
for (int i = 0; i < N; ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
... | 0 | 18,680,793 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != d... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 47,184,321 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int t = 0;
vector<int> vec(N);
for(int i = 0;i < N;++i) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for(int i = 0;i < M;++i) {
t = t + vec.at(i);
}
cout << t << endl... | #include<stdio.h>
#include <stdbool.h>
struct Card{
char c;
int a;
};
void bubble(struct Card A[],int N){
for(int i=0;i<N-1;i++){
for(int j=N-1;j>i;j--){
if(A[j].a<A[j-1].a){
Card t=A[j];
A[j]=A[j-1];
A[j-1]=t;
}
}
}
}
void select(struct Card A[],int N){
for(int i=0;i<N-1;i++){
int k=i;
f... | 0 | 92,322,668 |
#include <bits/stdc++.h>
using namespace std;
#define INPUT freopen("input.txt", "r", stdin);
#define ll long long
#define ld long double
#define len(s) s.size()
#define fl(st, en, in) for (int i = st; i < en; i += in)
#define rfl(st, en, de) for (int i = st; i < en; i -= de)
#define fll fl(0, n, 1)
#define cy cout << ... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 0 | 68,138,874 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define ff first
#define ss second
#define MAX 200550
const ll MOD = 1000000007;
vector<int>g[MAX];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int t=1;
while(t--){
int n,m... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
template <typename T>
ll extGCD(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
... | 0 | 97,388,836 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
int main() {
int A = 0;
int B = 0;
REP(i,4) {
int j;
cin >> j;
A += j... | 0 | 98,016,986 |
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.141592653... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main()
{
int n;
while( cin >> n ) {
if ( n == 0 )
break;
map<char, char> pt;
for( int i=0; i<n; ++i ) {
string f, t;
cin >> f >> t;
pt[f[0]] = t[0];
}
... | 0 | 40,928,719 |
#include<bits/stdc++.h>
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
fast;
ll n;
cin>>n;
ll p[n],x,ans=0;
for(ll i=0;i<n;i++)
{
cin>>x;
x--;
p[x]=i;
}
multiset<ll> s;
s.insert(-1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<pair<ll,ll>>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typena... | 0 | 78,652,165 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
const ll INF = 1LL<<60;
const ll mod = 998244353;
int main()
{
int n, m; cin>>n>>m;
bool flg = false;
for (int i=1; i<=m; i++) {
int l = i;
int r = n-i;
if (n%2 == 0 && !flg && r-l <= n/... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n,d,a;
cin>>n>>d>>a;
vector<pair<long long,long long>>monsters;
int x,h;
for(int i=0;i<n;i++)
{
cin>>x>>h;
monsters.emplace_back(x,h);
}
sort(monsters.begin(),monsters.end());
vector<long long>change... | 0 | 67,671,704 |
#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() {
string s;
cin >> s;
bool ok = false;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ok = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) ok = true... | #include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n) {
int cnt = 0;
for(int i = 0; i <= 9; ++i) {
if(i > n) break;
for(int j = 0; j <= 9; ++j) {
if(i+j > n) break;
for(int k = 0; k <= 9; ++k) {
if(i+j+k > n) break;
for(int l = 0; l <= 9; ++l) {
if(i+j+k+l > n) break;
... | 0 | 56,955,597 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
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 {
cout << ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
int main() {
ll n,m;cin >> n >> m;
vector<vector<ll>> lt(m);
rep(i,m){
ll k;cin >> k;
rep(j,k){
ll num;cin >> num;
--num;
lt.at(i).push_back(num);
}
}
... | 0 | 11,193,170 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
sort(A.begin(), A.end());
int count = 0;
for (int i = N-1; i >= 0; i--) {
if (A.at(i) * 4 * M >= sum) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | 0 | 80,980,641 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define vi vector <int>
#define vii vector <pair<int,int> >
#define vvi vector <vi>
#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 pb push_b... | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i <= n; i++) {
string num_str = to_string(i);
int sum = 0;
for (int j = 0; j < num_str.size(); j++) {
sum = sum + (int)(num_str[j] - ... | 0 | 42,705,902 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int p = 1;
for (int i = 0; i < n; ++i) {
if (p * 2 < p + k) {
p = p * 2;
}else {
p = p + k;
}
}
cout << p;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 45,349,493 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | #include <iostream>
using namespace std;
int main(int argc, char** argv) {
int n;
while(cin >> n) {
int count = 0;
for(int a=0; a<=9; a++) {
for(int b=0; b<=9; b++) {
for(int c=0; c<=9; c++) {
for(int d=0; d<=9; d++) {
if(a+... | 0 | 47,005,597 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s1,s2,s3;
cin >> s1 >> s2 >> s3;
s1[0] = toupper(s1[0]);
s2[0] = toupper(s2[0]);
s3[0] = toupper(s3[0]);
cout << s1[0] << s2[0] << s3[0] << endl;
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma optimize("JARU SOSISONI")
using namespace std;
#define int long long
#define fast cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define geometry cout.setf(ios::fixed); cout.precision(15);
#define all(x) (x).begin(), (x).end()... | 0 | 96,759,128 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int s_int(string s){
... | #include <bits/stdc++.h>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using boost::irange;
using boost::sort;
using boost::adaptors::reversed;
int main() {
string s;
cin >> s;
int n = s.length();
int ans = 0;... | 0 | 2,700,050 |
#include <bits/stdc++.h>
using namespace std;
int n,a,b,cost;
vector<int>ans;
int main(){
scanf("%d%d%d",&n,&a,&b);
if(a*1LL*b < n || a + b - 1 > n)return puts("-1"),0;
for(int i = n - a + 1;i <= n;i++)ans.push_back(i);
n-=a;
for(int i = b - 1;i >= 1;i--){
int t = min(n - i + 1,a);
for(int j = n - t + 1;j <= n... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A[4][4];
int N, B[11];
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
cin >> A[i][j];
cin >> N;
for(int i = 0; i < N; i++) cin >> B[i];
for(int h = 0; h < N; h++){
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
... | 0 | 11,962,618 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | 0 | 22,410,370 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n,m;
cin>>n>>m;
if(n==0&&m==0) break;
vector<pair<int,int>> a;
int ans=0;
lp(i,n){
int b,c;
cin>>b>>c;
ans+=b*c;
a.push_back(make_pair(c,b));
}
sort(a.begin(),a.end());
reverse(a.b... | 0 | 81,071,654 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y; cin>>x>>y;
if(x*2==y||x*4==y)
cout<<"Yes"<<endl;
else{
if((x*4-y)%2==0&&x*4>y){
if((x*4-y)/2<x)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,sum,ans;
sum=0;
cin>>n>>k;
ans=n;
vector<int> d(k);
vector<int> a;
for(int i=0;i<k;i++)
{
cin>>d.at(i);
sum+=d.at(i);
vector<int> b(d.at(i));
for(int j=0;j<d.at(i);j++)
{
cin>>b.at(j);
a.push_back(b.at(j))... | 0 | 50,468,181 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int a,b;cin>>a>>b;
int fi=0,se=0,th=0;
vector<int>p(n);
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <list>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
#define INF (2e9)
const int maxv=10000+10;
const int maxe=100000+10;
int V,E;
int vis[maxv];
list<int> out;
vector<int> g[maxv];
int i... | 0 | 82,745,129 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
vector<vector<int>> x(n+1,vector<int>(n+1)),
y(n+1,vector<int>(n+1));
for(int i=0;i<n;i++){
if(i==0)x[n][i]=abs(z-a[n-1... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#de... | 0 | 39,371,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 64,116,482 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int N, M;
cin >> N;
string n_words[N];
for(int i = 0; i < N; i++) {
cin >> n_words[i];
}
cin >> M;
string m_words[M];
for(int i = 0; i < M; i++) {
cin >> m_words[i];
}
int point = 0;
string target = "";
for(int i = 0; ... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
const int MAX_N = int(1e6) + 10;
c... | 0 | 86,337,616 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long int y, m, d;
cin >> y >> m >> d;
long long int dd = 0;
for (int j = 1; j < y; j++) {
if (j % 3 == 0) {
dd += 20 * 10;
}
else {
dd += 20 * 5 + 19 * 5;
}
}
for (int j = 1; j < ... | 0 | 37,865,234 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
int divup(int n, int k) {
return (n + k - 1) / k;
}
int main() {
int n, k;
cin >> n >> k;
cout << divup(n - 1, k - 1) << endl;
} | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Ford{
vector<vector<edge>> G;
int V;
vector<int> used;
Ford(int N){
V = N;
used.resize(V, 0);
G.resize(V);
}
void add(int u, int v, int... | 0 | 5,144,529 |
#pragma GCC optimize("Ofast")
#include<algorithm>
#include<bitset>
#include<chrono>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unord... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
while(1)
{
int H, W;
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0; i < H; i++)
{
for(int j = 0; j < W; j++)
{
cout << (i == 0 || i == H-1 || j == 0 || j == W-1 ? "#" : ".") << f... | 0 | 7,277,570 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<iterator>
#include<stack>
#include<queue>
#include<utility>
#include<functional>
#include<bitset>
#include<numeric>
#include<cstring>
#include<tuple>
using namespace std;
int n... | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
#ifdef LOCAL
string to_string(char a) { return string(1,a); }
string to_string(bool a) { return a ? "1" : "0"; }
string to_string(const char* a) { return (string)a; }
string to_string(string a) { return a; }
string to_string(vector<bool> v) {
string s = "... | 0 | 95,145,027 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | # pragma GCC target("avx")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include <stack>
# include <map>
# include <iomanip>
# include <stdexcept>
# inclu... | 0 | 84,086,092 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
m... | 0 | 42,175,598 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#define SIZE 100
#define INF 10000000
typedef struct {
int data;
int pos;
} DAT;
using namespace std;
int main(){
DAT ans;
int i,j,k;
int a,b,c;
int n;
int time[SIZE][SIZE];
while(1){
int sum[SIZE]={0};
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
bool check=false;
for(int i=0;i<s.length();i++){
if(s==t){
check=true;
break;
}
s=s[s.length()-1]+s;
s.erase(s.length()-1);
}
if(check) cout << "Yes" << e... | 0 | 29,003,360 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se secon... | 0 | 27,883,565 |
#include <cstdio>
#include <queue>
using namespace std;
vector<int> ans;
int main(){
int N,A,B; scanf("%d %d %d",&N,&A,&B);
if(N<A) return !printf("-1");
for(int i=N-A+1;i<=N;i++) if(i>0){
ans.push_back(i);
}
N-=A;
B--;
if(B){
int k=(N+B-1)/B;
int r=N%B;
if(!r) r=B;
if(k>A || !k) return !printf("-1");
... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 23,795,529 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.