code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie();
ll n , b;
int a = 0;
cin >> n;
b = ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
int cnt = 0;
REP(i, 10) {
auto posA = find(s.begin(), s.end(), i + '0');
if (posA != s.end()) {
REP(j, 10) {
auto posB = find(posA+1, s.end(), j + '0');
if (... | 0 | 31,145,280 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 47,419,464 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define doub... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 18;
int dp[N + 1][1 << N][2];
void add(int a[2], int b[2]) {
for (int i = 0; i < 2; i++) {
if (b[i] > a[0]) {
a[1] = a[0];
a[0] = b[i];
}
else if (b[i] > a[1]) {
a[1] = b[i];
}
}
}... | 0 | 61,463,849 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
#define _GLIBCXX_DEBUG
const int INF=1e15;
signed main(){
int N;cin>>N;
if(N==25)cout<<"Christmas"<<endl;
if(N==24)cout<<"Christmas Eve"<<endl;
if(N==23)cout<<... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | 0 | 12,068,004 |
#include<bits/stdc++.h>
#define P pair<int,int>
#define fir first
#define sec second
using namespace std;
const int N=1000005;
int q[5],a[N],m,n,Max;
P f[N];
P up(P A,P B)
{
q[1]=A.fir;q[2]=A.sec;q[3]=B.fir;q[4]=B.sec;
sort(q+1,q+5);
return P(q[4],q[3]);
}
int main()
{
scanf("%d",&m);n=1<<m;
for (int i=0;i<n;i++) ... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
const int INF = 100000000;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
... | 0 | 96,314,971 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
bool ans;
cin>>n;
if(n%4==0||n%7==0||n%11==0)
cout<<"Yes"<<endl;
else
{
for(i=0; ;i++)
{
n-=11;
if((n%4==0||n%7==0)&&n>=0)
{
ans=true;
br... | 0 | 65,528,393 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<string> a(n);
for (string &i : a) cin >> i;
vector<vector<int>> f(n, vector<int>(26, 0));
for (int i = 0; i < n; i++) {
for (char c : a[i]) {
f[i][c - 'a'] += 1;
}
... | #include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int... | 0 | 91,592,837 |
#include <bits/stdc++.h>
using namespace std;
#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(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 80,208,750 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
ll n,t,x; cin>>n>>t;
ll px=-1,ans=0;
for(ll i=0;i<n;i++){
cin>>x;
ans+=t;
if(px!=-1) ans-=max((ll)0,px-x+t);
px=x;
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP_ITER(it, v) for (it = v.begin(); it != v.end(); it++)
#define FASTIO \
ios::sync_with_stdio(false); \
cin.tie(0)
#define TEST(test) \
int test; \
cin >> tes... | 0 | 31,529,441 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++){
int Y, M, D;
cin >> Y >> M >> D;
int offset = (10 - M + 1) * 20 - (D - 1);
if (Y % 3 != 0){
offset -= (12 - M) / 2;
}
Y++;
int uruutime = (1002 - Y) / 3;
int ans = offset + 195 * (1000 - Y) + uruuti... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double lld;
typedef long long int lli;
using namespace std;
const int N = 1000001;
const int MOD = 1e9+7;
const bool DEBUG = 1;
#define sd(x) scanf("%d ", &x... | 0 | 68,225,282 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
if(A+B>=C){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
if(x>=400 && x<600){
cout<<8<<endl;
}
else{
if(x>=600 && x<800){
cout<<7<<endl;
}
else{
if(x>=800 && x<1000){
cout<<6<<endl;
}
else{
if(x>=1000 && x<1200){
cout<<5<<endl;
}
else{
if(x>=1200 && x<... | 0 | 71,805,166 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int N, K; cin >> N >> K;
vector<tuple<int, int> > T;
for(int i=... | #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 | 94,616,388 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int k,n;
cin>>k>>n;
vector<int> a;
for(int i=0;i<n;i++){
int temp;
cin>>temp;
a.push_back(temp);
}
vector<int> ans;
for(int i=1;i<n;i++){
ans.push_back(a[i]-a[i-1]);
}
int fi... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cou... | 0 | 86,930,773 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W = 0;
cin >> H >> W;
int i;
for(i = 0;true;i++){
string s;
cin >> s;
if(s == "snuke"){
break;
}
}
int a;
a = i / W + 1;
char b;
if(i % W == 0){
b = 'A';
}
if(i % W == 1){
b = 'B';
}
if(i % W == 2){
b = 'C';
}
if(i % W == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const long double EPS = 1e-10;
const long long INF = 1e18;
const int MOD = (int)1e9 + 7;
const long double PI = acos(-1.0L... | 0 | 31,640,245 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair< int, int > iP;
int main() {
int n;
while(cin >> n, n) {
vector< iP > v;
vector< int > t(24 * 3600, 0);
for(int i = 0; i < n; i++) {
int h, m, s, hh, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#def... | 0 | 19,355,127 |
#include <bits/stdc++.h>
int main()
{
int E;
std::cin >> E;
int a = (E / 1000) % 10;
int b = (E / 100) % 10;
int c = (E / 10) % 10;
int d = (E / 1) % 10;
std::vector<std::vector<int>> P = {{1, 1, 1}, {1, 1, -1}, {1, -1, 1}, {1, -1, -1}, {-1, 1, 1}, {-1, 1, -1}, {-1, -1, 1}, {-1, -1, -1}};
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
using ll = long long;
using namespace std;
int monmo(char ms){
if(ms=='R')return 3;
else if(ms=='G')return 2;
else if(ms=='B')return 1;
else co... | 0 | 75,891,865 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
#define INF ((1LL<<62LL) - 1)
const int N = 1000005;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<int> a[15][10];
int total = 9;
for(int i=0;i<=9;i++){
a[1][i].push_back(i);
... | 0 | 30,370,112 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int m, f, r;
while (cin >> m >> f >> r) {
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1) {
cout << 'F' << endl;
continue;
}
int sum = m + f;
char c;
if (sum < 30)... | 0 | 74,991,078 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
int N, a;
cin >> N;
int ans = 101;
vector<int> vec(N);
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 6,100,409 |
#include <bits/stdc++.h>
using namespace std;
int n, ai;
int main(){
scanf("%d", &n);
long long res = 0, sum = 0;
map <long long, int> cnt;
cnt[0]++;
for(int i = 0; i < n; i++){
scanf("%d", &ai);
sum += ai;
res += cnt[sum];
cnt[sum]++;
}
printf("%lld\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 14,345,941 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
int ans = 0;
int now = 0;
for( int i = 0; i < N; i++ ){
int A;
cin >> A;
if( A == 0 ){
ans += now/2;
now = 0;
}else no... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define PI 3.141592653589793
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
class Dice{
p... | 0 | 73,372,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int S;
cin >> S;
long long int A, B;
A = S / 1000000000;
B = S % 1000000000;
cout << 0 << " " << 0 << " ";
cout << 1000000000 << " " << 1 << " ";
if (S == 1000000000000000000) cout << 0 << " " << 1000000000;
else cout << 1000000000 -... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
#define MOD int(1e9 + 7)
int main()
{
int H, W, D, Q;
vector<vector<long long>> A;
map<long long, vector<int>> v2xy;
... | 0 | 985,282 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string l;
cin >> l;
ll dp[2];
dp[0] = 0;
dp[1] = 1;
for(int i = 0; i < l.size(); i++){
if(l[i] == '1'){
dp[0] = (dp[0]*3+dp[1])%1000000007;
dp[1] = (dp[1]*2)%1000000007;
}
... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 95,005,843 |
#include <iostream>
using namespace std;
int main()
{
int n , a;
cin >> n;
for (int i = 0 ; i < 3 ; i++){
a = n % 10;
if (a == 7){
cout << "Yes";
return 0;
}
n /= 10;
}
cout << "No";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll s, c;
cin >> s >> c;
ll ans = 0;
ll t = c / 2;
if (s > t) {
cout << t;
return 0;
}
else {
ans += s;
c -= (s * 2);
ans += (c / 4);
}
cout << ans;
return 0;
} | 0 | 73,622,587 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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;
int main(){
ll N, M;
cin >> N >> ... | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, mi, ma;
while(cin >> n >> mi >> ma, n) {
vector<int> v(n);
int gap=0, ans=0;
for(int i=0; i<n; ++i) {
cin >> v[i];
}
for(int i=mi-1; i<ma; ++i) {
if(gap... | 0 | 87,085,658 |
#include<bits/stdc++.h>
using namespace std;
int n,a[101010],b[101010];
string s;
bool check(int x,int y)
{
a[0]=x;
a[1]=y;
for(int i=1;i<n;i++)
{
a[i+1]=b[i]*a[i-1]*a[i];
}
if(a[n]==a[0] && a[1]==b[0]*a[n-1]*a[0])
{
for(int i=0;i<n;i++)
{
if(a[i]==1)
{
cout<<'S';
}
else
{
cout<<'W';... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,rgb[3][4005]={};
cin>>n;
string s;
cin>>s;
for(ll i=0;i<n;i++){
if(s[i]=='R'){
rgb[0][i]=1;
}
else if(s[i]=='G'){
rgb[1][i]=1;
}
else{
rgb[2][i]=1;
}
}
for(ll i=1;... | 0 | 9,869,992 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, x, m;
cin >> n >> x >> m;
vector<int> seen(m);
long long sum = 0, move = 1;
while (move <= n && seen[x] == 0) {
sum += x;
seen[x] = move;
x *= x;
x... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 55,420,343 |
#include <iostream>
#include <stdio.h>
#include <ctype.h>
int main()
{
char ch,h;
while(true){
scanf("%c", &ch);
if (islower(ch)){
h=toupper(ch);
}else{
h=tolower(ch);}
std::cout << h;
if ( ch == '\n' ) break;
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
int main() {
int N;
vector<int> x = { 111,222,333,444,555,666,777,888,999 };
cin >> N;
int diff;
int ans = 0;
int min = 999;
for (int i = 0; i < x.si... | 0 | 65,876,644 |
#include <bits/stdc++.h>
#define SS " "
#define endl "\n"
#define EPS 1e-9
#define gcd __gcd
#define pb push_back
#define pi acos(-1.0)
#define Ars greater<int>()
#define vi vector<int>
#define vvi vector<vector<int> >
#define flush ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string S;
cin >> S;
reverse(S.begin(), ... | 0 | 328,080 |
#include<stdio.h>
int main()
{
int money,coin,i,j,k,l ;
scanf("%d%d",&money,&coin);
if((money % 500)<=coin)
{
printf("Yes");
}
else if(money<coin || money%500==0){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | #include <string>
#include <iostream>
using namespace std;
int main()
{
string S;
cin >> S;
if(S != "0")
{
int A = 0;
for(int i = 0; i < S.size(); i++)
{
A += S[i] - 48;
}
cout << A << endl;
main();
}
return 0;
} | 0 | 11,678,009 |
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 107
int p[MAXN];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x,n; cin >> x >> n;
for(int i=0; i<n; i++) cin >> p[i];
sort(p,p+n);
int ii=lower_bound(p,p+n,x)-p;
int xx=x, ox=x;
for(int i=ii; i<n; i++) {
if(p[i]==x) ... | #include <bits/stdc++.h>
#define mem(x,y) memset(x,y,sizeof(x))
#define PN(x,n) cout<<'{'<<x[0];for(int i=1;i<n;i++)cout<<','<<x[i];cout<<'}'<<endl;
#define RP(i,n) for(int i=0;i<n;i++)
#define RP2(i,a,b) for(int i=a;i<=b;i++)
#define mp make_pair
#define P pair<int,int>
#define pb push_back
#define fi first
#define se... | 0 | 32,892,188 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
long long t=0,u=0;
cin >> s;
for(long long i=0;i<s.size();i++){
if(i%2==0){
if(s[i]=='0'){
u++;
}else{
t++;
}
}else{
if(s[i]=='0'){
t++;
}else{
u++;
}
}
}
cout <... | #include <bits/stdc++.h>
#define endl '\n'
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a/gcd(a,b)) * b)
#define pf(x) push_front(x)
#define pb(... | 0 | 70,567,000 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
typedef long long ll;
using namespace std;
const ll m = 1e9 + 7;
int main() {
int n; cin >> n;
vector<int>vec(n);
for (int i = 0; i < n; ++i)
cin >> vec[i];
int mx = 0;
ll res = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, vec[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N ;
string S ;
cin >> N;
cin >> S;
if (N % 2 != 0){
cout << "No" << endl;
}
else {
int n = N / 2;
string S2 = S;
string s1 = S.erase(n);
string s2 = S2.substr(n);
if (s1 == s2){
cou... | 0 | 80,810,271 |
#include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 0){
int a[n];
for (int i = 0; i < n; ++i){
cin >> a[i];
}
int maximum = -100000000;
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n; j++){
sum += a[j];
maximum = max(maximum... | 0 | 83,299,367 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const pair<F,S>& p) {
... | #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, m;
cin >> n >> m;
vector<in... | 0 | 76,594,215 |
#include<bits/stdc++.h>
#define INF (1e9)
using namespace std;
string s;
int dp[1<<26];
int main(){
cin>>s;
for(int i=0;i<(1<<26);i++) dp[i]=INF;
dp[0]=0;
int S=0;
for(int i=0;i<s.size();i++){
S^=(1<<(s[i]-'a'));
int minv=INF;
minv=min(minv, dp[S]);
for(int j=0;j<26;j++) minv=min(minv, dp[S^(1... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | 0 | 31,555,068 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | 0 | 65,663,562 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const int Inf = 1000000000;
const ll INF= 1e18;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
int main() {
string S;
cin >> S;
vector<bool> vec(26);
for(int i = 0;i < S.size();i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
int N; cin >> N;
... | 0 | 99,307,737 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> D(N);
for(int i=0;i<=N-1;i++){
cin>>D[i];
}
sort(D.begin(),D.end());
cout<<D[N/2]-D[N/2-1];
return 0;
} | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "... | 0 | 23,523,068 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll,ll> P;
const ll MO = 1000000007;
int main(){
string s;
cin >> s;
char pre... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
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)
#d... | 0 | 24,005,294 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
int main() {
int N;
cin >> N;
vector<string>res(N);
cout << 0 << endl;
cin >> res.at(0);
if (res.at(0) == "Vacant")return 0;
cout << N - 1 << endl;
cin >> res.at(N - 1);
if (res.at(N - 1) == "Vacant")... | #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 lma... | 0 | 74,396,116 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
double arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
double ans = (arr[0]+arr[1])/2;
for(int i=2;i<n;i++)
{
ans = (an... | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 0 | 89,351,277 |
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define plll pair <pair <ll, ll>, ll>
#define pllll pair... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -... | 0 | 27,011,103 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int x, y, z, k;
ll a[1111], b[1111], c[1111];
bool f(ll n) {
int cnt = 0;
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
for (int l = 0; l < z; l++) {
if (a[i] + b[j] + c[... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (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 rrng(a) a.rbegin()... | 0 | 3,650,299 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
rep(i, n) {
... | #include <iostream>
#include <cmath>
using namespace std;
bool test (double x1, double y1, double x2, double y2) {
return x1 * y2 == x2 * y1;
}
int main (void) {
int n;
cin >> n;
while (n--) {
double x1, x2, x3, x4, y1, y2, y3, y4;
cin >> x1; cin >> y1;
cin >> x2; cin >> y2;
... | 0 | 30,852,238 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include<algorithm>
#include<bitset>
#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<unordered_map>
#include<unordered_set>
#include<util... | 0 | 40,540,190 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF=1001001001;
long long int answ(long long int x){
if(x==1) return 1;
if(x>1) return 2*answ(x/2)+1;
}
int main() {
int r;
cin>>r;
cout<<r*r<<endl;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
... | 0 | 48,348,629 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a, b;
cin >> a >> b;
if(a < 9 && b < 9) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 25,080,667 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define TIC int tt = (int) clock();
#define TOK cerr << "TIME = " << (double)(clock() - tt) / CLOCKS_PER_SEC << endl;
int kiran_bhanushali[29][7][20];
int32_t ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 66,308,189 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long ... | #include <iostream>
using namespace std;
int main(void){
char s[101];
char p[101];
cin >> s >> p;
bool flg = false;
int i = 0;
while (s[i] != '\0') {
int j = i;
int k = 0;
while (1) {
if (p[k] == '\0') {
flg = true;
break;
... | 0 | 80,328,659 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=0, tmp=INF;
vector<ll> A, B;
signed main(){
cin >> N;
for(int i=0;i<N;i++) {
ll a, b;
cin >> a >> b;
A.push_ba... | #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 inf=1LL<<61;
int main() {
ll n;
cin >> n;
vec a(n);
for(ll i=0;i<n;i++) cin >> a[i];
ll cnt=0;
for(ll i=1;i<n;i++) {
if(a[i]==a[i-1]) ... | 0 | 22,236,210 |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> A.at(i).at(j);
}
}
vector<vector<char>> B(M, vector<char>(M));
for (int i = 0; i < M; i++) {
f... | 0 | 71,737,883 |
#include<iostream>
int main(){
int N, A;
std::cin >> N >> A;
if(N%500 <= A) std::cout<<"Yes";
else std::cout<<"No";
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <numeric>
#include <ctime>
#include <cassert>
#include <unordered_set>
#includ... | 0 | 18,159,542 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n;
cin>>n;
string s;
cin>>s;
int i,c=0;
char prev='1';
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int f(long long a, long long b) {
int d_a = 1;
while (a / 10 != 0){
d_a++;
a /= 10;
}
int d_b = 1;
while (b / 10 != 0){
d_b++;
b /= 10;
}
return max(d_a, d_b);
}... | 0 | 8,176,412 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #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... | 0 | 95,842,119 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
ll g... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
void bfs(const vvi &adlist, vi &arrive, int s){
queue<int> que;
que.push(s);
arri... | 0 | 50,196,663 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
#include <algorithm>
#include <vector>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 2,400,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b, ans;
bool... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 18,027,814 |
#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>;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k, r_point, s_point, p_point... | #include<iostream>
using namespace std;
int main(){
long long i,N,Y,M,D,ty,ny,sum,pass;
cin >> N;
while(N--){
sum=0;
pass=0;
cin >> Y >> M >> D;
ty = 333 - (Y/3);
ny = 999 - ty-Y;
sum = ny*195+ty*200;
if(Y%3==0){
sum+=200;
for(i... | 0 | 4,145,334 |
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
int dist[1005][1005];
queue<pair<int,int> > q;
int dx[] = {-1,0,1,0};
int dy[] = {0,-1,0,1};
int R, C;
bool inside(int r, int c){
return 1<=r && r<=R && 1<=c && c<=C;
}
int bfs(){
int ans = 0;
while(!q.empty()){
aut... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=6e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 20,894,803 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
int main(void)
{
ll n, m; cin >> n >> m;
vector<ll> p(m), y... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,a,b,i,j;
cin >> h >> w >> a >> b;
for(i=0;i<h;i++){
if(i<b){
for(j=0;j<w;j++){
if(j<a){
cout << 1;
}else{
cout << 0;
}
}
cout << endl;
}else{
for(j=0;j<w;j++){
if(j<... | 0 | 90,984,909 |
#include <iostream>
using namespace std;
int ary[60],res[40];
int main(){
int N;
for(int i=1;i<=51;i++){
cin>>ary[i];
if(cin.eof()){
N=i-1;
break;
}
}
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int l=0;l<10;l++){
res[i+j+k+l]++;
}
}
}
}
for(int i=1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;... | 0 | 76,565,758 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
typedef long long ll;
const ll mod=pow(10,9)+7;
int main()
{
ll n;
cin >> n;
ll ans = 0;
for(int i=1; i<n; i++){
ans += (n-1)/i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 33,022,814 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 80,905,800 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a + b == 15) {
cout << '+' << "\n";
}
else if(a * b == 15) {
cout << '*' << "\n";
}
else {
cout << 'x' << "\n";
}
return 0;
} | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 73,761,695 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int v[n];
rep(i, n) cin >> v[i];
sort(v, v + n);
double ans = v[0];
rep(i, n - 1) { ans = (ans + v[i + 1]) / 2; }
cout << ans << endl;
return 0;
} | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 61,557,762 |
#include <iostream>
using namespace std;
#define INF 10000
#define MAX_V 10
int d[MAX_V][MAX_V];
int n, m, a, b, c, num, t;
void Init(){
t=INF; m=0;
for(int i=0; i<MAX_V; i++)
for(int j=0; j<MAX_V; j++)
i==j ? d[i][j]=0 : d[i][j]=INF;
}
void Input(){
for(int i=0; i<n; i++){
cin>>a>>b>>c;
m = max(a, max(b,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, C, K;
cin >> N >> C >> K;
vector<ll> time(N);
for (int i = 0; i < N; i++) {
cin >> time[i];
}
sort(time.begin(), time.end());
ll count = 1;
ll j = 0;
for (ll i = 0; i < N; i++) {
if... | 0 | 24,993,078 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N], B[N];
for(int i=0;i<N;i++){
cin >> A[i];
B[A[i] - 1] = i + 1;
}
for(int i=0;i<N;i++){
cout << B[i];
if(i != N-1)cout << " ";
}
cout << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin>>s>>t;
bool flag=false;
for(int i=s.length()-t.length();i>=0;i--){
flag=true;
for(int j=0;j<t.length();j++){
... | 0 | 65,455,323 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n;
int main(void){
cin >> n;
unordered_map<lli, lli> mp;
rep(i, n){
lli a;
cin >> a;
mp[a]++;
}
lli ans = 0;
for(auto i : mp){
if(i.first <= i.second) ans+=i.second-i.first;
else ans+=i.second;
... | #include <iostream>
#include <vector>
#include <queue>
typedef long long ll;
int bfs(std::vector<std::vector<int>> A)
{
int H = A.size();
int W = A[0].size();
std::queue<ll> Q;
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
if (A[i][j] == 0)
{
... | 0 | 85,083,534 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N+1);
for (int i = 0; i < N; i++) {
cin >> A.at(i+1);
}
int p = 1;
int r = 0;
while (p != 2) {
if (r > N - 1) {
r = -1;
break;
}
p = A.at(p);
r += 1;
}
cout << r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,Dr,Ds,Dp;
cin >> N >> K >> Dr >> Ds >> Dp;
char c;
vector<string>zyan(N);
for (int i = 0; i < N; i ++) {
cin >> c;
zyan.at(i) = c;
}
int i = 0,answer = 0;
for (i = 0; i < K; i ++) {
if (zyan.at(i) == "r") {
answer += Dp;
... | 0 | 88,309,584 |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) for (__typeof(da... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 77,590,701 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main() {
int x,a,b;
cin >> x >>a >>b;
if(a>=b) {cout <<"delicious" << endl;
return 0;}
if(b-a<=x) {
cout << "safe" <<endl;
return 0;
}
else cout << "dangerous" <<endl;
... | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | 0 | 32,265,083 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k, a, b; cin >> k >> a >> b;
ll ans=1;
if(2<b-a && 2<=k-(a-1)){
k -= a-1;
ans += k/2*(b-a) + k%2 + a-1;
}else{
ans += k;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inlin... | 0 | 18,112,181 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); ++i) {
if(n[i] == '7') {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
} | 0 | 2,730,829 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int64_t K, S, ans;
cin >> K >> S;
ans=0;
for (int X=0; X<=K; X++) {
for (int Y=0; Y<=K; Y++) {
if (0<=S-X-Y && S-X-Y<=K) {
ans=ans+1;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int md;
int add(int x, int y) {
x += y;
if (x >= md) {
x -= md;
}
return x;
}
int mul(int x, int y) {
return (int)((long long)x * y % md);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n >> md;
string s;
cin >> s;
map<int,... | 0 | 17,943,947 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int wk_max=0, cnt=0;
for(int i=0;i<n;i++){
int h;
cin>>h;
if(h>=wk_max){
cnt++;
wk_max=max(h,wk_max);
}
}
cout<<cnt<<endl;
return 0;
} | #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... | 0 | 4,172,231 |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ll n,i,j,k,c=0,min=10000000000;
cin>>n;
ll a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
if(a[i]<=min){
min=a[i];c++;}
}
cout<<c;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n,a[200005];
int k=1;
int ans;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==k){
k++;
}else{
ans++;
}
}
if(k==1){
cout<<-1<<e... | 0 | 55,987,879 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x) cerr << #x << ... | #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 | 68,851,628 |
#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;
const int INF = 1e9 + 10;
const ll MOD = 1000000007;
int dp[100000 + 100] = {INF};
int main() {
ll N, M;
cin >> N >> M;
unordered_map<int, int> up;
REP(i, M) {
i... | #include <iostream>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
namespace BasicMath {
static UInt GreatestCommonDivisor(UInt a, UInt b);
static UInt LeastCommonMultiple(UInt a, UInt b);
UInt GreatestCommonDivisor(UInt a, UInt b) {
if (b == ... | 0 | 43,318,194 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int N, A, B, C;
vector<int> L(8);
int DFS(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a,b,c}) == 0) return 1<<30;
else return abs(A-a) + abs(B-b)... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main()
{
int A, B, N, i = 0;
cin >> A >> B >> N;
while (1)
{
A /= 2;
B += A;
i++;
if (i == N)
{
break;
}
B /= 2;
A += B;
i++... | 0 | 13,657,391 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
for(int i=1;i<=1000000000;i++){
int c=i*0.08;
int d=i*0.1;
if(c==a&&d==b){
cout<<i<<"\n";
return(0);
}
}
cout<<"-1\n";
return(0);
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
typedef long long ll;
vector<ll> A;
vector<ll> nxt;
ll sum[1005];
ll tmp;
int main() {
int n,k;
cin >> n >> k;
for(int i = 0; i < n; i++) {
ll a;
cin >> a;
sum[i+1] = sum[i] + a;
}
for(int i = 0; i < ... | 0 | 60,330,640 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
char c=s[0];
int ans=1,flag=1;
for(int i=1;i<4;++i){
if(s[i]==c) ++ans;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
const ll INF = 1e16;
void solver(ll N, ll A, ll B, ll &ans){
if(A > B) ans = 0;
else if(N == 1){
if(A == B) ans = 1;
else ans = 0;
}
else{
ll min_sum{}, max... | 0 | 65,356,452 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
int n, m; cin >> n >> m;
vector< vector<int> > v(m);
map<int, int> map;
int i = 0;
while (i < m) {
int k;
cin >> k;
int j = 0;... | 0 | 8,438,495 |
#include<iostream>
using namespace std;
int par[100000];
void init(int n){
for(int i=0; i<n; i++) par[i] = i;
}
int root(int x){
if(par[x] == x){
return x;
}else{
return par[x] = root(par[x]);
}
}
bool same(int x, int y){
return root(x) == root(y);
}
void unite(int x, int y){
x = root(x);
y = root... | #include<iostream>
#include<cstring>
#include<cstdio>
#define INF 0x3f3f3f3f
using namespace std;
const int N=25;
int c[N];
int n,m,x;
int a[N][N];
int ans=INF;
int main()
{
cin>>n>>m>>x;
for(int i=1;i<=n;i++){
cin>>c[i];
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<(1<<n);i++){
int sum=0;
... | 0 | 67,027,620 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = prior... | 0 | 9,707,911 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(a - c) <= d || (abs(a - b) <= d && abs(b - c) <= d))
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define... | 0 | 80,866,257 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
bool ans = false;
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
if (i*4+j*7==n) ans=true;
}
}
cout<<(ans ? "Yes":"No")<<endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifdef hacks
#include <boost/math_fwd.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define... | 0 | 70,524,937 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main(void)
{
ll k;
cin >> k;
deque<ll> q;
if (k < 10)
{
cout << k << endl;
return 0;
}
rep(i, 9) q.emplace_back(i + 1);
k -= 9;
while (k != 0)
{
ll i = q.front();
q... | 0 | 36,271,807 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#include <boost/hana/functional/fix.hpp>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T>
void debug(const std::vector<T>& v) {
debug_iter(v.begin(), v.end());
}
template ... | 0 | 16,259,356 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<time.h>
#include<climits>
#include<string>
int n,k,a[111000],dp[111000];
void marota(){
std::cin>>n>>k;
for (int i=1;i<=n;i++){
std::cin>>a[i];
}
a[0]=a[1];
for (int i=2;i<=n;i++){
dp[i]=1e9+123;
... | #include <bits/stdc++.h>
#define ll long long
#define ch char
#define st string
using namespace std;
ll a,b,c,d,e,f,g,h;
void Urvatullo_Atoev()
{
cin>>a;
if(a>=400 && a<=599)
{
cout<<8;
}
else if(a>=600 && a<=799)
{
cout<<7;
}
else if(a>=800 && a<=999)
{
cout<... | 0 | 43,111,418 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
char x,y;
cin >> x >> y;
cout << (x > y? '>':x == y? '=' : '<') << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
long long N ,count = 0;
cin >> N;
vector<string> st(N);
map<string,long long> str;
froop1(0,N){
string s;
cin >> s;
sort(s.begin(),s.end());
st.at(... | 0 | 91,656,589 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).... | 0 | 44,951,283 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
vector<int> arr(n);
for(int i = 0; i<n; i++){
cin>>arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for(int i = 1; i < n; i++){
for(int j = 1; i-j >= 0 && j<=k; j++){
dp[i] = min(abs(arr[i] - arr[i-j]) + dp[i-j], ... | #include <iostream>
using namespace std;
int main() {
int h, y;
cin >> h >> y;
while (h != 0 || y != 0) {
if (h == 1 || h == 2) {
for (int i = 0; i < h; i++) {
for (int s = 0; s < y; s++) {
cout << "#";
}
cout << endl;
... | 0 | 61,583,919 |
#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 rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespa... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 29,058,363 |
#include <stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int N, Y,i,j;
cin >> N;
cin >> Y;
for ( i = 0; i <= N; i++) {
for ( j = 0; j+i <= N; j++) {
if (Y - (10000 * i) - (5000 * j) - (1000 * (N - i - j)) == 0) {
if (i+j+(N-i-j)==N) {
cout << i << " ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 17,790,328 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
int N, M;
vector<vector<int>> graph;
vector<bool> seen;
int cnt = 0;
void dfs(int v)
{
if (seen[v]) return;
seen[v] = 1;
for (int nv : graph[v]) {
if (seen[nv]) c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string s;
cin >> s;
int n = s.length() + 1;
vector<int> a(n);
rep(i,n-1){
if(s[i] == '<'){
a[i+1] = m... | 0 | 17,181,903 |
#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... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 100,578,450 |
#include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for(int i=a; i<b; i++)
#define mem(arr, val) memset(arr, val, sizeof(arr))
#define MOD 1000000007
#define INF 1000000001
#define epsilon 1e-15
typedef long long int ll;
typedef unsigned long long int ull;
int gcd(int a, int b){
if(b==0) return a;
... | 0 | 33,765,011 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m;
int main(){
cin>>n;
m = (n-1)/2;
cout<<m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, y;
cin >> n >> y;
rep(i, n+1){
rep(j, n+1){
if ((y - 10000 * i - 5000*j) % 1000 == 0){
ll c = (y - 10000 * i - 5000*j) / 1000;
... | 0 | 21,675,705 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string C1, C2;
cin >> C1 >> C2;
if (C1.at(0) == C2.at(2) && C1.at(1) == C2.at(1) && C1.at(2) == C2.at(0)) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
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)
int n,a,b;
bool memo[300001]={true};
signed main() {
scanf("%d%d%d",&n,&a,&b);
if (n > a*b || n < a+b-1) puts("-1");
else {
int now=b,cnt=n;
while(1) {
rep(i,b) {
... | 0 | 3,590,031 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.