code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <cstdio>
int K, X;
int main() {
scanf(" %d%d", &K, &X);
puts((K * 500 >= X) ? "Yes" : "No");
return 0;
} | #include <stdio.h>
int H,W,i,j;
int main(){
for(;;){
scanf(" %d %d",&H,&W);
if(H==0&&W==0){
return 0;
}
for(i=0;i<H;i++){
for(j=0;j<W;j++){
printf("#");
}
printf("\n");
}
printf("\n");
}
} | 0 | 36,940,122 |
#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... | #include<stdio.h>
#include<math.h>
using namespace std;
struct Pos {
double x,y;
};
void kock(int n, Pos p1, Pos p2) {
if(n==0){
return;
}
Pos s,t,u;
double th = 60*M_PI/180;
s.x=(2.0*p1.x+1.0*p2.x)/3.0;
s.y=(2.0*p1.y+1.0*p2.y)/3.0;
t.x=(1.0*p1.x+2.0*p2.x)/3.0;
t.y=(1.0*p1.y+... | 0 | 33,586,174 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#de... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | 0 | 72,130,445 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <iostream>
#define REP(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int n, m;
char table[256];
char c, d;
int main(void) {
while(1) {
cin >> n;
if(n == 0) break;
REP(i, 0, 256) table[i] = (char) i;
REP(i, 0, n) {
cin >> c >> d;
table[c] = d;
}
cin >> m;
REP... | 0 | 42,465,973 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n;
cin >> n;
vector<string> s(n);
vector<ll> t(n);
rep(i, 0, n) cin >> s[i] >> t[i];
string x;
cin >> x;
ll ans = 0;
bool f... | 0 | 54,335,013 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<vector<int>> ab(M, vector<int>(2));
vector<vector<int>> ba(M, vector<int>(2));
for (int i=0; i<M; i++)
{
int x, y;
cin >> x >> y;
ab[i][0] = x;
ab[i][1] = y;
ba[i][0]... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 998244353;
int main(){
int n;
cin >> n;
int t;
cin >> t;
if(t != 0) {
puts("0");
return 0;
}
--n;
vector<int> d(n);
rep(i, n) {
cin >> d[... | 0 | 79,974,621 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long A,B;cin>>A>>B;
long C,D;cin>>C>>D;
long ans=0;
ans += B/C;
ans += B/D;
ans -= (A-1)/C;
ans -= (A-1)/D;
long S=gcd(C,D);
ans -= ((B/C)*S)/D;
ans += (((A-1)/C)*S)/D;
cout<<B-A+1-ans<<endl;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 9,465,312 |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,h,w;
std::cin>>n>>h>>w;
vector <int> a;
vector <int> b;
int i,count=0;
int input;
for(i=0;i<n;i++)
{
std::cin>>input;
a.push_back(input);
std::cin>>input;
b.push_back(input);
if(a[i]>=h&&b[i]>=w)
count+... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define OP ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; ... | 0 | 27,022,113 |
#include<iostream>
typedef struct{
char c;
int i;
}card;
void BubbleSort(card*, int);
void SelectionSort(card*, int);
int main(){
int i, N, flag;
std::cin >> N;
card B[N],S[N];
for(i=0; i<N; i++){
std::cin >> B[i].c >> B[i].i;
S[i] = B[i];
}
BubbleSort(B, N);
SelectionSort(S, N);
bool boo=tr... | #include<iostream>
#include<cstdio>
int main(){
int a,b,c,d,e;
std::scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
int flag = 0,temp;
do{
flag = 0;
if(a<b){
temp = a;
a = b;
b = temp;
flag = 1;
}
if(b<c){
temp = b;
b = c;
c = temp;
flag = 1;
}
if(... | 0 | 9,777,816 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | #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 | 4,100,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 0 | 85,646,443 |
#include <iostream>
#include <string>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n;
string f[100];
int main() {
int i;
while (cin >> n) {
if (!n) break;
rep(i, n) cin >> f[i];
int ans = 0;
for (i = 0; i + 1 < n; i += 2) {
if (f[i][0] != f[i + 1][0]) {
ans++;
}
}
cout << an... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
int i=0;
vector<pair<int,int>>vp;
while(i<v.size()){
int prev=v[i];
i... | 0 | 70,697,109 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
int mod(int A, int M) {return (A % M + M) % M;}
const int INF = 1LL << 60;
template <class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template <class T> bool chmax(T& a, T b) {if (a < b) {a... | #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... | 0 | 60,289,246 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
long long x = min(a, k);
a -= x;
k -= x;
x = min(b, k);
b -= x;
cout << a << " " << b;
return 0;
} | 0 | 77,802,118 |
#include <algorithm>
#include <utility>
#include <cstdio>
#include <map>
using ll = long long;
int fa[100005], sz[100005];
ll arr[100005], val[100005];
std::pair<ll, int> app[100005];
std::map<ll, int> idx;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%lld", arr + i);
idx[arr[i]] = ... | #include<iostream>
#include<vector>
#include<string>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> ship(n);
for(int i = 0; i < m; i++){
int a, b;
std::cin >> a >> b;
a--; b--;
ship[a].push_back(b);
ship[b].push_back(a);
}
int now... | 0 | 100,446,705 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string table[]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
char str[1280];
int a;
cin>>a;
for(int i=0;i<a;i++){
cin>>str;
int r=0;
char now='0';
for(int i=0;str[i];i++){
if(now!=str[i]){
if... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 35,098,941 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define mp make_pair
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-5;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>v... | 0 | 4,091,203 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin >> n >> m;
vector<pair<long long,long long>> v;
for(int i=0;i<n;i++){
long long a,b;
cin >> a >> b; v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
long long purchaseNum = m;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | 0 | 95,163,815 |
#include<iostream>
int a,b,c;
int n=0;
int main(){
std::cin>>a>>b>>c;
for(int i=a;i<=b;++i){
if(c%i==0)n+=1;
}
std::cout<<n<<std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
char s[50][50];
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin >> s[i][j];
}
}
bool flg = true;
int cnt =0;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0}... | 0 | 56,600,177 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
long long dp[100010];
long long h[100010];
template<class T> void chmin(T &a, T b) {
if (a>b) {
a = b;
}
}
template<class T> inline void chmax(T &a, T b) {
if (a<b) {
a = b;
}
}
int main() {
int n; cin >> n;
int m; cin >... | 0 | 20,064,325 |
#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.... | #include <bits/stdc++.h>
using namespace std;
class card{
public:
int N;
vector<int> value;
vector<char> cha;
vector<string> init_array;
vector<string> array;
vector<string> Barray;
vector<string> Sarray;
void set(void){
cin >> N;
value.resize(N);
cha.resize(N);
init_array.resize(N);
array.resize(N);
... | 0 | 87,664,040 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define... | 0 | 80,548,336 |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll K, A, B, ans;
cin >> K >> A >> B;
if (A + 2 >= B || K < A) {
ans = K + 1;
} else {
K -= A - 1;
ans = A + (B - A) * (K / 2) + K % 2;
}
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 47,686,371 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
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 ll MOD=1000000007,MOD2=998244353;
int main() {... | #include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)
#def... | 0 | 37,610,771 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
typedef long long ll;
const ll inf = 4e18;
const ll mod = 1e9+7;
#define print(X) cout << X << endl
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all... | 0 | 82,069,869 |
#include<iostream>
using namespace std;
#define ll long long
int main(){
ll n, u, k, v;
cin >> n;
ll A[n][n];
for (ll i=0; i<n; i++){
for(ll j=0; j<n; j++){
A[i][j] = 0;
}
}
for(ll i=0; i<n; i++){
cin >> u;
cin >> k;
for(ll j=0; j<k; j++){
... | #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 pii pair<int,int>
const long long MOD=1000000007;
int main(){
int n;
cin>>n;
double sum=0;
rep(i,n){
double x;
string u;
cin>>x>>u;
... | 0 | 58,116,840 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int S;
cin >> S;
int A = S;
int count = 0;
for(int i = 1; i <= A; i++){
if(i < 10){
count++;
}
else if(i >= 100 && i < 1000){
count++;
}
else if(i >= 10000 && i < 100000){
... | #include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef pair<int,int> II;
type... | 0 | 33,350,231 |
#include<stdio.h>
int d,s;
int main(){
while(scanf("%d",&d)!=EOF){
s=0;
for(int i=d;i<600;i+=d){
s+=i*i*d;
}
printf("%d\n",s);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string s;
cin >> s;
ll ans = 0;
ll hd = 0, bk = s.size()-1;
while(bk - hd > 0){
if(s[hd] == s[bk]){
hd++;
bk--... | 0 | 2,501,208 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
typedef pair<int,int> pii;
vector<int> sim(vector<int> vec,int n){
vector<int> new_vec(n,0);
rep(i,n){
int l = max(0,i-vec[i]);
int r = min(n-1,i+v... | 0 | 66,841,410 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | 0 | 82,227,768 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 47,653,977 |
#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<ll, ll>;
ll n;
int main() {
vector<ll> v(4);
rep (i, 4) {
cin >> v[i];
}
cin >> n;
n *= 4;
vector<ll> want(4, 0);
vector<P> vperL(4);
rep (i, 4) {
vperL[i] = make_pai... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> num(100000,0);
for(int i = 0; i < N; i++){
num.at(vec.at(i))++;
... | 0 | 72,691,227 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, int> LP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > ... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);ci... | 0 | 23,745,942 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pi... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod = 1e9+7;
using P = pair... | 0 | 39,802,873 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C, D, c, d, cd;
cin >> A >> B >> C >> D;
c = (B / C) - (A - 1) / C;
d = (B / D) - (A - 1) / D;
cd = (B / lcm(C, D)) - (A - 1) / lcm(C, D);
cout << (B - (A - 1)) - c - d + cd << endl;
} | #include<iostream>
using namespace std;
bool flag;
int w,h,x,y,r;
char ans[2][10]={
"No",
"Yes"
};
int solve(){
if(x<=0||y<=0)return flag=0;
if(r>h-r||r>w-r)return flag=0;
if(x>=r&&x<=w-r){
if(y>=r&&y<=h-r)return flag=1;
}
return flag=0;
}
int main()
{
flag=0;
cin>>w>>h>>x>>y... | 0 | 52,388,152 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
l... | 0 | 1,678,579 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | 0 | 41,868,682 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#define N 100000
using namespace std;
typedef struct{
int parent;
vector<int> decent;
int dd;
} Node;
Node node[N];
int d[N];
int dep(int);
void swap(int *,int *);
int main(){
int n,id,k,a;
cin>>n;
for(int... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 20,285,864 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <complex>
#include <random>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int>... | #include<iostream>
#include<stdio.h>
#include<ios>
#include<cmath>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<assert.h>
#include<bitset>
#include<tuple>
#include<climits>
#include<deque>
#include<utility... | 0 | 6,909,421 |
#include <iostream>
#define MOD 1000000007
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N];
for (long long i = 0; i < N; i++) cin >> A[i];
long long pow_2[61];
for (long long i = 0; i < 61; i++){
if (i == 0) pow_2[i] = 1;
else {
pow_2[i] = pow_2[i - 1] * 2;
}
}
... | #include <iostream>
using namespace std;
int main(){
int n,count=0,min;
cin>> n;
int num[n];
for(int i = 0;i <n;i++)
cin>>num[i];
for(int i= 0;i<n;i++){
min = i;
for(int j = i;j<n;j++){
if(num[j]<num[min])
min = ... | 0 | 544,259 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string s;
cin >> s;
string ans = "";
deque<char> q;
rep(i, s.size())
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = int... | 0 | 93,833,154 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::istringstream iss(s);
std::string a;
std::string b;
std::string c;
iss >> a >> b >> c;
if (a[a.size() - 1] == b[0] &&
... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T... | 0 | 4,171,310 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4][3][10];
int b,f,r,v,x;
cin >> x;
for(int bb=0;bb<4;bb++){
for(int ff=0;ff<3;ff++){
for(int rr=0;rr<10;rr++){
a[bb][ff][rr]=0;
}
}
}
for(int i=0;i<x;i++){
cin >> b>> f>> r>> v;
a[b-1][f-1][r-1]+=v... | 0 | 45,879,467 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N;
cin>>N;
bool ans=true;
for(int i=0;i<3;i++){
if(N.at(i)=='7'){
cout<<"Yes"<<endl;
ans=false;
break;
}
}
if(ans){
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#d... | 0 | 23,497,887 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue <T, vector<T>, greater<T>>;
template<typename T, typena... | 0 | 25,228,550 |
#include <stdio.h>
#include <string.h>
#include <math.h>
int mini(int a, int b){
if (a>=b) return b;
else return a;
}
int main ()
{
int c=0, c2=0;
char s[100005];
scanf ("%s", s);
for (int i=1;i<strlen(s);i=i+1) {
if (s[0]=='0') {
if (i%2==1 && s[i]=='0') c++;
els... | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;++i){
cin >> x[i] >> y[i];
}
long long ans=LLONG_MAX;
for(int xi=0;xi<n;++xi){
for(int xj=0;xj<n;++xj){
... | 0 | 48,634,493 |
#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 =(1e9)+7;
using P = pair<ll,ll>;
ll com(ll n,ll r){
ll ret=1;
for (int i = 0; i < r; ++i) {
ret*=n-i;
}
ll d=1;
for (int i = 0; i < ... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<long long>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sll set<long long>
#define si set<int>
#define sti stack<int>
#define stkl stack<ll>
#define qi queue<int>
#define pb push_back
#define ff f... | 0 | 34,431,030 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, p;
string s;
cin >> n >> p >> s;
long long ans = 0;
if(p == 2 || p == 5 ){
for(int i=0; i<n; ++i){
if((s[i]-'0')%p == 0){
ans += i+1;
}
}
cout << ans << endl;
return 0;
}
map<int, int> mp;
++mp[0];
int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 16,616,002 |
#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;}
cons... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 0 | 24,769,087 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #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<long long> leaf(n + 1);
for (int i = 0; i <= n; i++) {
cin >> leaf[i];
}
vector<long long> max_node(n + 1), min_node(n + 1);
if (leaf[0] > 1) {
... | 0 | 86,809,595 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int l;
int t;
int kyaku = 0;
cin >> N;
for (int i = 0; i < N; i++){
cin >> l >> t;
kyaku += t - l + 1;
}
cout << kyaku << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) ans.at(A.at(i) - 1) = i + 1;
for (int i = 0; i < N; i++) {
if (i == N - 1) cout << ans.at(... | 0 | 15,036,225 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include<iostream>
#include<string>
using namespace std;
int N_MAX = 300;
int main()
{
int n,i,j,b,ii,jj,res=0;
bool f;
string s[N_MAX];
cin >> n;
for(i=0;i<n;i++)
cin >> s[i];
for(b=0;b<n;b++){
f=false;
for(i=0;i<n;i++){
ii=i-b;
if(ii<0) ii+=n;
for(j=0;j<n;j++){
jj=j+b... | 0 | 40,979,228 |
#include <iostream>
using namespace std;
int main() {
int k[110][110];
int n,l,a,b;
cin>>n;
for(int j=0;j<n;j++){
cin>>l>>a;
for(int i=0;i<a;i++){
cin>>b;
k[j][b-1]=1;
}
}
int q[105];
for(int j=0;j<n;j++){
q[j]=-1;
if(k[0][j]==1){
q[j]=1;
}
}
q[0]=0;
int u=1;
int m=1;
while(m<=n){
for(int d=0;d<n;d++){
... | #include<iostream>
#include<fstream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<list>
#include<utility>
#include<climits>
#define INF INT_MAX/2
#define EPS 1.0e-7
using n... | 0 | 85,402,468 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> ... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int a, b, c, d[10000];
vector<pair<int, int> >P;
int main() {
while (true) {
cin >> a >> b >> c; P.clear();
if (a == 0)break;
for (int i = 1; i <= a; i++)cin >> d[i];
for (int i = b; i <= c; i++) {
P.push_back(make_pair(d[i] - d[i ... | 0 | 5,156,376 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> money;
money.push_back(1);
int p = 6;
for(int i=0; p<=n; i++){
money.push_back(p);
p *= 6;
}
p = 9;
for(int i=0; p<=n; i++){
money.push_back(p);
... | 0 | 68,338,039 |
#include<stdio.h>
int main(void)
{
int x,c;
c=1;
while (scanf("%d",&x),x!=0){
if(x==0) break;
printf("Case %d: %d\n",c,x);
c++;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=100000+10;
int n;
typedef struct
{
int parent;
vector<int> child;
}Node;
Node node[maxn];
int deep[maxn];
void update_deep(int i)
{
if(node[... | 0 | 7,681,847 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c,N=101;
cin >> a >> b >> c;
int color[N] = {};
color[a]++;
color[b]++;
color[c]++;
int sum=0;
for(int i=1; i<N; i++){
if(color[i] > 0){
sum++;
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<int> v(n);
rep(i,n) cin >> v[i];
map<int,int> odd;
map<int,int> even;
int odd1=0;
int o1 = 0;
... | 0 | 4,850,772 |
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << "a ";
if (a > b)
cout << "> ";
else if (a < b)
cout << "< ";
else
cout << "== ";
cout << "b\n";
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
char maze[1001][1001];
int dis[1001][1001];
int main(void){
int H, W, N;
int sx, sy;
cin >> H >> W >> N;
rep(i, H) {
rep(j, W) {
... | 0 | 33,011,214 |
#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)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
int prev = 0;
rep(i, N) {
prev = max(p... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {... | 0 | 19,068,668 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
ll n,x,m,again,idx=1,vis[100001],a[100001],ans=0;
int main(){
cin>>n>>x>>m;
if(n<=1e5){
ll a2=x,idx2=1;
ans+=a2;
while(idx2<n){
idx2++;
a2=(a2*a2)%m;
ans+=a2;
}
cout<<ans<<endl;
return 0;
}
a[1]=x;
vis[a... | 0 | 96,086,047 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> d(K, K);
deque<pair<int,int>> q;
q.emplace_back(1, 1);
while(!q.empty()) {
auto n=q.front().first;
auto s=q.front().second;
q.pop_front();
if(d[n] <= s) continue;
d[n] = s;
q.emplace_front((n*10)%K... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 | 23,797,336 |
#include <bits/stdc++.h>
using namespace std;
void CountingSort(vector<int> &A,vector<int> &B,int n,int k){
vector<int> C(k+1);
for(int i=0;i<k+1;i++){
C[i]=0;
}
for(int i=1;i<n+1;i++){
C[A[i]]++;
}
for(int i=1;i<k+1;i++){
C[i]=C[i-1]+C[i];
}
for(int i=n;i... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 86,271,295 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
bool guumojiretu(string A) {
int flag = 0;
rep(i,A.size()/2) {
if (A[i] != A[i + A.size()/2]) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using Graph = vector<vector<int>>;
using ll = long long;
int main() {
int n,m;
cin>>n>>m;
vector<int> a(n);
int sum=0;
rep(i,n){
cin>>... | 0 | 21,432,333 |
#include<bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define RFOR(i,a,b) for(long i=(a);i>=(b);--i)
#define REP(i,a) FOR(i,0,a)
#define RREP(i,a) RFOR(i,a,0)
#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_END;++i)
#define REACH(i,a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n);
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;i++){
cin >> t[i] >> x[i] >> y[i];
}
bool flg=true;
if(x[0]+y[0]>t[0]){flg=false;}
if(x[0]+y[0]<=t[0]){
if((x[0]+y[0]-t[0])%2==1){flg=false;}
}
... | 0 | 52,994,463 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++){
cin >> s[i];
}
int ans=0, acount=0, bcount=0, abcount=0;
for (int i = 0; i < N; i++){
if (s[i][0]=='B'){
bcount++;
}
if (s[i][s[i].size()-1]=='A'){
... | #include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(x) (int)x... | 0 | 99,388,161 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw" << endl;
else if (A == 1)
cout << "Alice" << endl;
else if (B == 1)
cout << "Bob" << endl;
else if (A > B)
cout << "Alice" << endl;
else if (A < B)
cout << "Bob" << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
ll mod = 1000000007;
ll ans = 1<<29;
int main() {
ll n,k;
cin>> n >> k;
vector<pair<ll,ll>> P (n);
rep(i,n){
... | 0 | 98,615,052 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Dice {
public:
int label1;
int label2;
int label3;
int label4;
int label5;
int label6;
Dice() {
label1 = 0;
label2 = 0;
label3 = 0;
label4 = 0;
label5 = 0;
label... | 0 | 81,859,437 |
#include<stdio.h>
int main(void){
int x;
char a[] = "ABC",b[] = "ARC";
scanf("%d",&x);
if(x >= 1200)
printf("%s",b);
else
printf("%s",a);
return 0;
} | #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 < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (... | 0 | 34,693,152 |
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main() {
ll n;
ll a[200010];
ll sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
typedef pair<int,int> pi;
#define FAST ios_base::sync_with_stdio(0);
const int maxn = 100010;
int n,k;
deque <int> dq;
void fail() {
cout << "-1";
exit(0);
}
int32_t main() {
cin >> n >> k;
if (k > (1<<n)-1) fail();... | 0 | 51,169,757 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int>> vec(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
{
int u, k, tmp; cin >> u >> k;
for (int j = 0; j < k; j++)
{
cin >> tmp;
vec.at(i).at(tmp-1)=1;
... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB(x, v) x.push_back(v);
#define M_P(a, b) make_pair(a, b)
#define pll pair<ll, ll>
#define ll long long
#define mll map<ll, ll>
#define vl vector<ll>
#define fa(x, v) for(auto x: v)
#define fr(i, a, b) f... | 0 | 25,679,149 |
#include<iostream>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
t.pop_back();
if (s == t)cout << "Yes";
else cout << "No";
return 0;
} | # 1 "a.cpp"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "a.cpp"
# 1 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 1
# 11 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp"
# 1 "/home/tysm/dev/cpplib/bin/../stdlib/bits/stdc++.h" 1
#include<bits/stdc++.h>
# 12 "/home/tysm/dev/cpplib/bin/../include/cpplib/... | 0 | 77,881,735 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll Mod = 1000000007;
ll H,W;
ll Cal(ll x,ll y) {
ll res = (x * W) + y;
return res;
}
int main() {
int N;
cin >> H >> W;
cin >> N;
ll a[N],b[N];
ll ans[10];
for (int i = 0; i < 10;... | 0 | 57,998,251 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RNG(i,from,to) for(int i=(from); i<(int)(to); i++)
#define gcd(i,j) __gcd((i), (j))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vecll;
template<typename S, typename T> string to_string(pair<S, T... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s.at(i);
vector<vector<int>> cnt(h,vector<int>(w,0));
... | 0 | 10,104,973 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cntl = 0, cntr = 0, addr, addl;
for (int i=0; i<N; i++) {
if (S[i] == '(')
cntl++;
else if (S[i] == ')' && cntl == 0)
cntr++;
else
cntl--;
}
addr = cntr;
cntr = 0;
cntl = 0;
f... | 0 | 51,212,197 |
# include <iostream>
# include <cstdio>
# include <cmath>
# include <algorithm>
using namespace std;
struct Node{
long long d;
long long c;
}N[400010];
int cnt = 0;
bool cmp(struct Node a,struct Node b)
{
if (a.d==b.d) return a.c<b.c;
return a.d>b.d;
}
int main(void)
{
long long X,Y,A,B,C;
scanf... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | 0 | 22,290,574 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -... | 0 | 57,761,898 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegi... | 0 | 87,951,839 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
unsigned int factorial(unsigned int n){
if (n==0) return 1;
else return n*factorial(n-1);
}
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
const int maxn=55;
int n,m,a[maxn],b[maxn],ans=0;
int main()
{
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
int k=min(n,m);
for(int l=0;l<=k;l++)
{
for(int r=0;r<=k-l;r++)
{
for(int i=0;i<l;i++) b[i]=a[i];
for(int j=0;j<r;j++) b[l+j]=a[n-... | 0 | 77,503,612 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int x,n;
cin >> x >> n;
int p[110];
rep(i, 110) p[i] = i;
rep(i,n){
int k;
cin >> k;
p[k] = 0;
}
int cnt = 2000... | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<ll, ll>
#define nyan "(=^･ω･^=)"
#define read_input freopen("in.txt","r", stdin)
#define print_output freopen("out.txt","w", stdout)
typedef long long ll;
typedef long double ld;
using namespace std;
const ll maxn = 4e3+10;
ll pre[4][maxn], a[... | 0 | 30,221,111 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < k; ++i) ans += a[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 64,659,440 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fr(i,n) for(int i=0;i<n;i++)
#define frr(i,n) for(int i=1;i<=n;i++)
#define ms(x,i) memset(x,i,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
... | 0 | 85,526,412 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> V(N,vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++)
cin >> V.at(i).at(j);
}
int count = 0;
for (int k = 0; k < N - 1; k++) {
for (int l = k + 1; l < N; l++) {
... | 0 | 11,652,548 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define reps(i,f,n) for(int i=f;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define m1 cout<<"move1"<<endl
#define m2 cout<<"move2"<<endl
#define m3 cout<<"move3"<<endl... | #include<bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
int MAX=1e8;
int n;
int a[100005],dp[100005];
int f(int idx)
{
if(idx==n-1)
return 0;
int &ret=dp[idx];
if(ret!=-1)
return ret;
ret=f(idx+1)+abs(a[idx]-a[idx+1]);
if(idx+2<n)
ret=min(ret,f(idx+... | 0 | 32,432,241 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, n;
cin >> x >> n;
vector<int> a(105);
rep(i, n) {
int p;
cin >> p;
a[p] = 1;
}
int l = x, r = x;
int ans = x;
while (1) {
if (... | 0 | 100,352,353 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 94,794,165 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;i++)
#define per(i,a,b) for(int i=(b),i##_st=(a);i>=i##_st;i--)
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define debug(x) cerr<<#x" = "<<x<<endl
#define Debug(...) fprintf(stderr, __VA_... | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | 0 | 91,286,771 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typed... | 0 | 74,207,938 |
#include <cstdint>
using namespace std;
#define MEMO_SIZE 45
int64_t memo[MEMO_SIZE];
void fib_init()
{
for (uint32_t i = 0; i < MEMO_SIZE; i++) {
memo[i] = -1;
}
}
uint32_t fib(uint32_t i)
{
if (i == 0) {
return memo[0] = 1;
} else if (i == 1) {
return memo[1] = 1;
} else {
if (memo[i] != -1)... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i < int(n); i++)
using ll = long long;
using namespace std;
const ll MOD = 1e9+7;
ll modpow(ll a, ll n, ll p) {
ll res = 1;
while (n) {
if (n & 1) res = res * a % p;
a = a * a % p;
n >>= 1;
}
return res;
}
int main(){
st... | 0 | 1,616,417 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;scanf("%d%d",&n,&m);
int l=1,r=m+1;
while(l<r)printf("%d %d\n",l++,r--);
l=m+2,r=2*m+1;
while(l<r)printf("%d %d\n",l++,r--);
return 0;
} | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n; c... | 0 | 53,057,279 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int i = s.size() - 1;
string t;
while(i >= 0) {
t.push_back(s[i]);
if (t == "maerd" || t == "remaerd" || t == "esare" || t == "resare")
t.clear();
-... | #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 = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if... | 0 | 637,974 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#incl... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s; int n, ans = 0, a = 0, b = 0, ab = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
int l = s.length();
if (s[0] == 'B' && s[l-1] == 'A')
ab++;
else if (s[0] == 'B')
... | 0 | 91,011,092 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#define FOR(i, a) for(int i=0;i<(int)a;++i)
typedef long long ll;
using namespace std;
void solver() {
int N;
while (cin >> N) {
int ans = 0;
FOR(a, 10)FOR(b, 10)FOR(c, 10) {
int d = N - (a + b + c);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
set<int> s;
for(int i = 0;i... | 0 | 11,627,727 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
double a;
cin >> a;
sum += 1 / a;
}
printf("%12f", 1 / sum);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
if(n==1)
{
cout<<1;
return 0;
}
ll bans=1;
ll ans=3;
for(int i=2;i<n;i++)
{
ans=ans+bans;
bans=ans-bans;
}
... | 0 | 88,553,325 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
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(){
string S;
cin >> S;
S += ".";
vector<pa... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 0 | 27,670,319 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n, n){
int cnt=0;
n=1000-n;
cnt+=n/500;
n%=500;
cnt+=n/100;
n%=100;
cnt+=n/50;
n%=50;
cnt+=n/10;
n%=10;
cnt+=n/5;
n%=5;
cout<<cnt+n<<endl;
}
return 0;
} | #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() {
ll N, M;
cin >> N >> M;
ll a, b;
vect... | 0 | 4,421,687 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>c>>a;
while(c>=500){
c-=500;
}
if(c<=a){
cout<<"Yes";
}
else{
cout<<"No";
}
} | #include<bits/stdc++.h>
using namespace std;
long long n,m,a[300001],b[300001],s[300001];
inline long long read()
{
long long sum=0,x=1;
char ch=getchar();
while (ch<'0'||ch>'9')
{
if (ch=='-')
x=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9')
{
sum=sum*10+ch-'0';
... | 0 | 3,133,156 |
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
while (n > 0) {
int x = n % 10;
if (x == 7) {
cout << "Yes";
return 0;
}
n = n / 10;
}
cout << "No";
} | 0 | 90,514,907 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 0 | 4,180,135 |
#include <deque>
#include <cstdio>
using namespace std;
#define ll long long
int main(){
ll N;
scanf("%lld", &N);
ll a[N], ps = 0, ns = 0;
deque<ll> p, n;
for (ll i = 0; i < N; i++){
scanf("%lld", &a[i]);
if (a[i] > 0){
p.emplace_back(a[i]);
ps += a[i];
}else if (a[i] <= 0){
n.emplace_back(a[i]);
... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 36,862,534 |
#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>;
const int INF = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
if (n==1) {
cout << ans << endl;
return 0;
}
rep(i, n-1) ans *= (k-1);
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) { \
cerr << ((hoge) ? ",... | 0 | 100,829,984 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.