code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << x << "\n"
constexpr int mod = 1000000007;
using namespace std;
int n, k, a[123456], ans;
int f1(int a, int p) {
if (p == 1)return a;
if (p % 2)return f1(a, p - 1) * a % mod;
else return f1(a * a % mo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll dp[100005];
ll fast_pow(ll val, ll pw){
if(pw == 0)
return 1;
ll tmp = fast_pow(val, pw/2), ans;
ans = (tmp*tmp)%mod;
if(pw%2==1)
ans = (ans*val)%mod;
return ans;
}
ll num_div(int n, int maxi, int pw){
ll prod;
... | 1 | 57,726,916 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int f(int x)
{
int res = 0;
while (x) {
x /= 10;
++res;
}
return res;
}
signed main()
{
cout << fixed << setprecision(10);
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; ++i)... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 1 | 9,365,165 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
string s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if ((n[0] == n[1]) && (n[1] == n[2])) {
cout << "Yes" << endl;
}
else if ((n[1] == n[2]) && (n[2] == n[3])) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 68,603,214 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K; cin >> N >> K;
vector<long long>sum(N + 2);
sum.at(0) = 0;
for (long long i = 0; i <= N; i++) {
sum.at(i + 1) = sum.at(i) + i;
}
long long ans = 0;
for (long long j = K; j <= N + 1; j++) {
ans += sum.at(N + 1) - sum.at(N + 1 - j) - su... | 1 | 58,184,911 |
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,sum=0;
cin>>n;
vector<long long> v(n), l(n);
for(long long &i:v)cin>>i,sum+=i;
long long g=n*(n+1)/2;
if(sum%g){
cout<<"NO";
return 0;
... | 1 | 33,969,611 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int m,h,len;
while(1){
char s[210],t[210]="";
scanf("%s",s);
if(strcmp(s,"-")==0) break;
len=strlen(s);
scanf("%d",&m);
rep(i,0,m){
scanf("%d",&h);
rep(j,0,h){
t[j+len-h]=s[j];
}
re... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int number;
string str;
while (1) {
cin >> str;
if (str == "-") break;
cin >> number;
for (int i = 0; i < number; i++) {
int move;
string strC;
cin >> move;
strC = str.substr(move, str.length());
str.erase(move, str.le... | 1 | 28,831,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int s;
cin >> s;
if(s == 25){
cout << "Christmas" << endl;
}else if(s == 24){
cout << "Christmas Eve" << endl;
}else if(s == 23){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string xmaseve (string xmas, int n) {
if (n==25)
return xmas;
else if (n<25) {
return (xmaseve(xmas, n+1) + " Eve");
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n;
cin >> ... | 1 | 22,835,047 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
while(true){
cin >> s;
if(s=="-") break;
int m,h;
cin >> m;
for(int i=0;i<m;i++){
cin >> h;
s = s.substr(h, s.size()-h) + s.substr(0,h);
}
cout << s <<... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
while(1) {
char s[210];
int n, a;
scanf("%s", s);
if(s[0] == '-' && s[1] == '\0') break;
cin >> n;
string s1 ... | 1 | 50,780,819 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(),... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
#define DEBUG 0
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int,int> pint;
static const ll MOD = 1000000007;
stati... | 1 | 50,350,589 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
#include <deque>
#include <queue>
usin... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | 1 | 42,598,651 |
#include <iostream>
using namespace std;
void ABC70(void);
void ABC71(void);
void ABC72(void);
void ABC73(void);
void ABC75(void);
void ABC77(void);
void ABC78(void);
void ABC79(void);
int main(void){
ABC75();
}
void ABC75(void){
int a,b,c;
cin>>a>>b>>c;
if(a==b)cout<<c<<endl;
if(a==c)cout<<b<<endl;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%... | 1 | 3,017,058 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
const int inf=1e9;
int main(){
int a,b;cin>>a>>b;
if(a%3==0||b%3==0||(a+b)%3==0)cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
return 0;
} | 1 | 12,024,853 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
ll K;
ll ans_max = -1;
ll ans_min = INF;
int mai... | 1 | 35,138,981 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #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... | 1 | 14,492,365 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, k;
cin>>n>>k;
if(k&1){
cout<<(n/k)*1LL*(n/k)*(n/k)<<endl;
}else{
ll ans = (n/k)*1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, x, y, ans=0;
cin >> n >> k;
if(k%2==0) {
x=n/k;
y=(n+k/2)/k;
ans+=x*x*x;
ans+=y*y*y;
}
else {
x=n/k;
ans=x*x*x;
}
cout << ans;
} | 1 | 93,652,002 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int k;
cin >> s >> k;
for(int i =0; i<(int)s.length();i++){
if(s[i]=='1' && k==i+1) {cout << 1; return 0;}
if(s[i]!='1') {cout << s[i]; return 0;}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
string s;
cin >> s;
ll k;
cin >> k;
int ans = 1;
for(ll i=0LL; i<k; i++){
if((s[i]-'0'!=1)){
ans = s[i]-'0';
break;
}
}
cout ... | 1 | 70,293,084 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
vector<int>arr(n);
for(int i=1; i<n; i++)
cin>>arr[i];
for(int i=2; i<n-1; i++)
{
if(arr[i]>arr[i-1] && arr[i]>arr[i+1])
arr[i]=max(arr[i-1],arr[i+1]);
}
vector<int>ans(n+1);
ans[1]=arr[1];
int sum=arr[... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
int main(){
int n,ans=0;
cin>>n;
vector<int> b(n);
REP(i,n){cin>>b[i];}
ans+=(b[0]+b[n-2]);
REP(i,n-1){
ans+=min(b[i],b[i+1]);
}
cout<<ans<<endl;
return 0;
} | 1 | 24,475,746 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<l... | 1 | 67,904,326 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
c... | #include <bits/stdc++.h>
#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 int inf{int(1e9)};
int main(void){
int A, B, C, D;
cin >> A >> B >> C >> D;
if (B < C || D < A) cout << 0 << endl;
else cout << min... | 1 | 80,762,302 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, ans;
cin >> N;
vector<ll> T(N);
for(ll i = 0; i < N; i++) {
cin >> T.at(i);
if(i == 0) ans = T.at(0);
else ans = lcm(ans, T.at(i));
}
cout << ans... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 18,809,802 |
#include<iostream>
#include<sstream>
using namespace std;
int toNumber(string s){
int n=0,m=1;
for(int i=0;i<s.length();i++){
int k=1;
switch(s.at(i)){
case 'm':
k*=10;
case 'c':
k*=10;
case 'x':
k*=10;
case 'i':
n+=k*m;
m=1;
break;
default:
if('0'<=s.at(i)&&s.at(i)<='9'... | #include<iostream>
using namespace std;
char c[4] = {'m','c','x','i'};
int hun[4] = {1000,100,10,1};
int getsum(string a, string b){
int ina = 0, inb = 0;
int status = 1, kake = 0;
for(int i = 0; i < a.length(); i++){
if(a[i] >= '0' && a[i] <= '9') status = a[i]-'0';
else{
if(a[i] == 'm') kake = 100... | 1 | 91,002,729 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main()
{
ll X;
cin >> X;
for (ll i = 0; i < X; ++i)
{
if (100 * i <= X && X <= 105 * i)
{
cout << 1 << endl;
return 0;
}
}
... | #include <iostream>
#include <vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int x;
cin >> x;
int s = x/100;
int t = x % 100;
if(t > s*5) {
cout << 0 << endl;
return 0;
... | 1 | 94,693,391 |
#include <iostream>
#include <cmath>
using namespace std;
bool check(int in){
for (int i = 3; i<=sqrt(in); i+=2){
if (i != 5 && i % 5 == 0) continue;
if (in % i == 0)
return false;
}
return true;
}
int PrimeNumber(int in, int start){
int count = 0;
if (in >= 2 && start==3) count++;
for (int i = start; i <=... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long lo... | 1 | 7,751,010 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return(b);
} else {
return(gcd(b, a % b));
}
}
int main() {
int N, K;
cin >> N >> K;
int a0;
cin >> a0;
int val = a0;
int MAX = val;
for (int ii = 1; ... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break;
else gcdmax%=gc... | 1 | 81,887,111 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
set<int>S;
S.insert(a);
S.insert(b);
S.insert(c);
int ans=S.size();
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
int cnt = 0;
if(a != b)cnt++;
if(a != c)cnt++;
if(b != c)cnt++;
if(cnt != 0)cout << cnt;
else cout << 1;
} | 1 | 91,528,598 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | 1 | 68,010,476 |
#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 <iostream>
#include <vector>
#include <queue>
#include <math.h>
#include <unordered_map>
#include <cstring>
#include <algorithm>
#include <set>
#include <climits>
#include <numeric>
using namespace std;
typedef long long int64;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
template<typename T>
bool chmax... | 1 | 5,435,740 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ab = abs(a - b);
int bc = abs(b - c);
int ca = abs(c - a);
if (ca <= d) cout << "Yes" << endl;
else if (ab... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
... | 1 | 84,981,710 |
#include <iostream>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int w, h, x, y;
cin >> w >> h >> x >> y;
int p;
if ((double)x == w/2.0 && (double)y == h/2.0) p = 1;
else p = 0;
cout << (double)w * (double)h / 2.0 << ' ' << p << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 91,615,963 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
string S;
int cnt_0, cnt_1;
int main(){
cin >> S;
rep(i, S.size()){
if (S[i]=='0') cnt_0++;
else cnt... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string S;
int main(void) {
cin >> S;
int cnt_0 = count(S.begin(), S.end(), '0');
int cnt_1 = S.length() - cnt_0;
int cnt = min(cnt_0, cnt_1);
cout << cnt * 2 << '\n';
return 0;
} | 1 | 15,992,808 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
string ans;
for (int i = 0; i < n; i++) {
if (i + m - 1 >= n) break;
bool pas... | 1 | 37,869,490 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;
bool solve(){
int n;
cin>> n;
if(!n) return false;
char a[2][1<<10];
for(int i=0;i<n;i++){
cin>> a[0][i]>>... | #include<iostream>
#include<cstdio>
#include<map>
using namespace std ;
int main(){
int n;
char a,b;
for(;;){
map<char,char> a2b;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> a >> b;
a2b[a]=b;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a2b.count(a)==0){
cout<... | 1 | 9,952,217 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, a, b, val;
cin >> n >> a >> b;
vector<int> ans(3, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int>P(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
vector<int>stock(3, 0);
for (int i = 0; i < N; ++i) {
if(P[i] <= A) {
stock[0]++;
... | 1 | 38,661,489 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi
{
public:
Combi();
long long Combinat... | #include<bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(4);
for(int i=0;i<4;i++) {
cin >> n.at(i);
}
sort(n.begin(), n.end());
vector<int> ans={1,4,7,9};
bool flag=true;
for(int i=0;i<4;i++) {
if(ans.at(i)!=n.at(i)) {
flag=false;
break;
}
}
if(flag) {
cout <... | 1 | 58,822,078 |
#include<stdio.h>
int main()
{
int i, j;
int H, W;
scanf("%d%d", &H, &W);
while (H != 0 || W != 0) {
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if(i==0||i==H-1||j==0||j==W-1)
printf("#");
else printf(".");
}printf("\n");
}
printf("\n");
scanf("%d%d", &H, &W);
}
} | #include<iostream>
#include<vector>
int main()
{
int H, W;
while (1) {
std::cin >> H >> W;
if (H == 0 && W == 0)break;
for (auto i = 0; i < H; i++) {
for (auto j = 0; j < W; j++) {
if (i == 0 || i == H - 1 || j == 0 || j == W - 1)
std::cout << '#';
else
std::cout << '.';
}
std::cout <... | 1 | 8,433,144 |
#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 << " = " <... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for... | 1 | 29,797,767 |
#define _GLIBCXX_DEBUG
#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>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#d... | #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... | 1 | 14,838,644 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N,K;
cin >> N >> K;
cout << !(N % K == 0) << endl;
} | #include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef int64_t intl;
int main(){
int N,K;
cin >> N>>K;
if ( N%K ==0){cout << 0;}
else {cout <<1;}
} | 1 | 84,932,547 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
int n = s.size();
bool ok = true;
rep (i, n / 2)
if (s[i] != s[n - 1 - i])
ok = false;
rep (i, (n - 1) / 2 / 2)
if... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 1 | 21,216,629 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<iomanip>
using namespace std;
typedef long long ll;
int main() {
int a, b, c; cin >> a >> b >> c;
cout << (c - (a - b) >= 0 ? c - (a - b) : 0) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int left=c-(a-b);
if(left<0){
left=0;
}
cout<<left;
return 0;
} | 1 | 85,054,739 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i) cin >> a[i];
sort(a.begin(), a.end());
if (a.back() == a[0]) cout << "Yes" << endl;
else cout << "No" << endl;
} | #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)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int A, B, C;
ci... | 1 | 25,570,521 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
stack<char> q;
for(int i=0;i<s.length();i++)
{
if(s[i]=='0' || s[i]=='1')
q.push(s[i]);
else if(!q.empty() && s[i]=='B')
q.pop();
}string k;
while (!q.empty())
{
k+=q.top();
q.pop();
... | #include <stdio.h>
#include <string.h>
int main(){
char s[11];
scanf("%s", &s);
int len = strlen(s);
for(int i=0; i<len; i++){
int detectB = 0;
if(s[i]=='B' && i!=0){
int j=i;
int k = 1;
while(s[j]=='B'){
s[i-k] = 'B';
k++;
j++;
}
detectB++;
}
}
for(int i=0; i<len; i++){
if(s[i]... | 1 | 87,724,272 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int N, A, B;
int p, ans;
int one = 0;
int two = 0;
int three = 0;
cin >> N;
cin >> A >> B;
for (int i = 0; i < N; i++) {
cin >> p;
... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP1(i,a,b) for(int i=(a);i<=(b);i++)
#define em emplace_back
#define ALL(x) (x).begin(),(x).end()
#define F first
#define S second
#define mkp make_pair
#define pii pair<int,int>
#define oi ios::sync_wit... | 1 | 70,621,855 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#defi... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<vector<Int> > G(n);
for(Int i=1;i<n;i++){
Int x... | 1 | 2,114,827 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#d... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n, l; cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string ans="";
rep(i, n){
ans.append(s[i]);
}
cout << ans << endl;
return 0;
} | 1 | 68,003,672 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long counter=0;
long long n;
cin>>n;
long long b[n]={};
long long a[n]={};
for(long long i=0; i<n; i++){
cin>>a[i]>>b[i];}
for(long long i=n-1; i>=0; i--){
if((a[i]+counter)%b[i]==0){
continue;}
else{
counter+=b[i]-(a[i]+counter)%b[i];}}
cout<<counter<<end... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<ll> a, b;
... | 1 | 9,343,730 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
int main() {
string s; cin >> s;
ll n = s.size();
ll k; cin >> k;
ll tail = 0;
ll ans = 0;
ll count = 0;
l... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 1 | 81,265,086 |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int alpha[n]['z' - 'a' + 1];
for (int x = 'a'; x <= 'z'; x++)
{
for (int j = 0; j < n; j++)
{
alpha[j][x - 'a'] = 0;
}
}
for (int i = 0; i < n; i... | #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<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 1 | 21,602,016 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll H, W;
void solve()
{
if(H%3==0 || W%3==0) cout << 0 << '\n';
else{
ll ans = 1e18;
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));... | 1 | 35,419,419 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> vc;
int n;
while(cin >> n){
if(n != 0){
vc.push_back(n);
}
else{
cout << vc.back() << endl;
vc.pop_back();
}
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int a[10] = {0}, i = -1, n;
while(cin >> n) {
if(n == 0) {
cout << a[i--] <<endl;
} else{
i++;
a[i] = n;
}
}
return 0;
} | 1 | 40,714,954 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed <... | #include <iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i#... | 1 | 1,759,526 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int64_t i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
#define PI 3.14159265358979
const int INF = 1 << 29;
using namespace std;
int main(){
string S;
cin >> S;
int64_t count_d = 0, count_u = 0, ans = 0;
int64_t cor = 0;
b... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s; cin >> s;
int n = s.size();
vector<ll> l(n, 0);
REP(i, n) if (s[i] == '<') l[i] = 1;
REP(i, n - 1)
if (l[i + 1] !... | 1 | 72,563,901 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
vector<int> A, B;
int calc(int b) {
int ret = 0;
for (int i = 1; i <= N; i++) {
ret += abs(A[i-1] - (b + i));
}
return ret;
}
signed main() {
cin >> N;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n+1);
for(int i=1; i<=n; i++) {
int t;
... | 1 | 43,952,717 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
vector<long long> divisors(long long a){
vector<long long> res;
for(long long i=1;i*i<=a;i++) if(a%i==0) {
res.emplace_back(i);
if(i*i<a) res.emplace_back(a/i);
}
sort(res.begin(),res.end());
return res;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
long long ans = 0;
set<long long> st;
for( long long n = 1; n * n < N; n++ ) {
long long mul = N - n;
if( mul % n == 0 ) {
long long m = mul / n;
if( st.count( m ) == 0 && N / m == N % m ) {
ans += m;
st.insert( m )... | 1 | 79,772,381 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long m,n,i,j,x,y,z,a[300000],k=0,cnt=0,b[300000];
cin>>n>>m;
memset(a,0,sizeof(a));
for(i=0;i<m;i++)
{
cin>>x>>y;
a[x]=y;
if(x==1)
{
b[k]=y;
k++;
}
}
for(i=0;i<k;i++... | 1 | 63,900,481 |
#include<bits/stdc++.h>
using namespace std;
int s[101];
int main(){
int n;
while(cin>>n,n){
int sum=0;
for(int i=0;i<n;++i) cin>>s[i];
sort(s,s+n);
for(int i=1;i<n-1;++i) sum+=s[i];
cout<<sum/(n-2)<<endl;
}
return 0;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<stdlib.h>
#include<set>
#include<string>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#define INF 99999999
using namespace std;
int main(){
int n;
cin >> n;
do{
int point[110];
int sum = 0;
for (int i = 0; i < n;i++){
cin... | 1 | 16,979,832 |
#include<bits/stdc++.h>
using namespace std;
const long long N=2e3+10;
const long long MOD=1e9+7;
long long a[N];
long long s,ans;
int main(){
scanf("%lld",&s);
a[3]=1;
for(int i=4;i<=s;i++)
a[i]=(a[i-1]%MOD+a[i-3]%MOD)%MOD;
printf("%lld",a[s]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define deb(x) cerr << "\n" \
<< #x << "=" << x << "\n";
#def... | 1 | 27,640,491 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if(A.at(0) == '7') {
cout << "Yes" << endl;
}
else if(A.at(1) == '7') {
cout << "Yes" << endl;
}
else if(A.at(2) == '7') {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include<stdio.h>
int main(){
int r,n,cnt=0;
scanf("%d",&n);
while(n>0){
r=n%10;
if(r==7){
printf("Yes");
cnt++;
break;
}
n=n/10;
}
if(cnt==0){
printf("No");
}
return 0;
} | 1 | 77,903,492 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 10e10;
const ll MINF = -10e10;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef priority_queue<P,... | 1 | 48,503,415 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(x) cout << x << endl;
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int val,n;
cin>>val>>n;
int ans=0;
while(n--)
... | 1 | 4,671,039 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
bool ok = false;
for(int i = 0; i < s.size(); i++){
if(s[i] == '7'){
ok = true;
break;
}
}
if(ok){
cout << "Yes\n";
}else{
cout << "No\n";
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()
#define P pair<int,int>
#define mod 1... | 1 | 27,487,938 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int R, S, P;
int func(char w){
int val;
if(w == 'r') val = R;
if(w == 's') val = S;
if(w ==... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;
ll score = 0;
vector<bool> ok(n, true);
for(int i=0; i<n; i++){... | 1 | 74,225,201 |
#include <bits/stdc++.h>
#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 sl(n) scanf("%lld", &n);
#define si(n) scanf("%d", &n);
#define RepAll(a) for(auto x: a)
#define cout(ans) cout << ans << endl;
typedef long long ll;
const int mod = 1e9+7;
using namespace... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1e9+7;
int main(){
int n,m;
cin>>n>>m;
vector<ll> x(n),y(m);
for(int i=0;i<n;i++) cin>>x[i];
for(int i=0;i<m;i++) cin>>y[i];
auto calc=[](vector<ll> v){
int n=v.size();
ll res=0;
for(int i=0;i+1... | 1 | 89,599,121 |
#include <iostream>
using namespace std;
int main(void){
long long h,w;
cin>>h>>w;
if (h==1 |w==1){
cout<<1;
}
else{
cout<<((h*w+1)/2);
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll H,W;
cin >> H >> W;
if (H == 1 || W == 1) cout << 1 << endl;
else{
if ((H * ... | 1 | 2,737,361 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
for(int x=1 ; x<=100000 ; x++)
{
if((b*x+c)%a==0) {fl=1 ; break ;}
}
if(fl) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
} | #include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y)
{
int ret=1;
for(int i=2;i<=min(x,y);i++)if(x%i==0&&y%i==0)ret=i;
return ret;
}
int main()
{
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
int g=gcd(A,B);
if(C%g==0)printf("YES\n");
else printf("NO\n");
return 0;
} | 1 | 48,478,634 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using pii = pair<int,int>;
int n,m,vis[100001],dist[100001];
vector<pii> adj[100001];
bool solve(int s) {
queue<int> que;
que.push(s);
vis[s]=1;
while(!que.empty()) {
int cur=que.fron... | #include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int> > graph[100010];
bool visited[100010] = {};
int dist[100010];
int n, m;
bool dfs(int i, int cost){
if(visited[i]){
return dist[i] == cost;
}
visited[i] = true;
dist[i] = cost;
for(int j = 0;j < graph[i]... | 1 | 80,530,960 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool kaibun(int i)
{
int a, b, c, d, e;
e = i % 10;
i = (i - e) / 10;
d = i % 10;
i = (i - d) / 10;
c = i % 10;
i = (i - c) / 10;
b = i % 10;
i = (i - b) / 10;
a = i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 1 | 35,015,638 |
#include<iostream>
using namespace std;
int main()
{
int H = 0, W = 0, count = 0, a[10000] = { 0 };
while (1){
cin >> H >> W;
if (H == 0 && W == 0) break;
a[count] = H, a[++count] = W;
count++;
}
int i = 0;
while (i < count){
for (int j = 0; j < a[i]; j++){
for (int k = 0; k < a[i + 1]; k++){
cout... | #include <iostream>
int main(int argc, char const* argv[])
{
int h, w;
do {
std::cin >> h >> w;
for (size_t i = 0; i < h; i++)
{
for (size_t j = 0; j < w; j++)
std::cout << "#";
std::cout << std::endl;
}
if(h != 0 && w != 0)
std::cout << std::endl;
} while(h != 0 && w != 0);
return 0;
} | 1 | 32,615,465 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
long n;
cin >> n;
queue<long> num;
long ans[n+1];
rep(i,n+1)ans[i] = 0;
num.push(0);
ans[0] = 0;
while(num.size()){
long now = num.front();
num.pop();
if(now==n)break;
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> dp(n + 1, 100000000);
dp[0] = 0;
vector<ll> cost;
cost.push_back(1);
ll tmp;
tmp = 6;
while (tmp <= n) {
cost.push_back(tmp);
tmp *= 6;
}
tmp = 9;
while (tmp <= n) {
cost.push_back(tmp);
tmp *=... | 1 | 4,420,274 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
if ((long long) A * B < N){
cout << -1 << endl;
} else if (A + B - 1 > N){
cout << -1 << endl;
} else {
vector<int> cnt(B, 1);
cnt[0] = A;
int M = N - A - B + 1;
for (int i = 1; i < B; i++){
... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
using ll=long long;
ll n,a,b;
int main()
{
cin>>n>>a>>b;
if (n<=a+b-2 || n>a*b)
{
cout<<-1<<endl;
return 0;
}
vector <ll> res;
for (ll i=b-1;i>=0;--i) res.push_back(i);
if (a!=1)
{
ll rem=n-b,p=rem/(a-1),r=rem%(a-1);
ll b=r,c=a-1-... | 1 | 92,069,565 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
string s,t; cin>>s>>t;
int n=s.length();
bool ok=... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
string s,t;
cin>>s;
cin>>t;
bool f=false;
f(i,0,s.size()){
s=s[s.size()-1]+s;
s.erase(s.size()-1);
if(s==t){
f=true;
}
}
if(f){
cout<<"Yes"<<en... | 1 | 69,392,930 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
#define MP(a,b) make_pair((a),(b))
#define MT(...) make_tuple(__VA_ARGS__)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... ... | 1 | 21,507,877 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include<iostream>
using namespace std;
int main()
{
int x,y,a,s,m;
cin>>x>>y>>a;
s=y+a;
if(s>x){cout<<s-x<<endl;}
else{cout<<"0"<<endl;}
} | 1 | 79,418,347 |
#include<iostream>
using namespace std;
int main(void){
int A, B, C;
cin >> A >> B >> C;
for ( int i = 0; i < 10; i++ ){
cout << A * C - B << endl;
C = A * C - B;
}
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int r, D, X; cin >> r >> D >> X;
int ans = X;
rep(i, 10... | 1 | 70,640,022 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if(max((y + r), H) > H || max((x + r), W) > W || x < 0 || y < 0){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main() {
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
if (x - r < 0 || x + r > w) cout << "No" << endl;
else if (y - r < 0 || y + r > h) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | 1 | 56,441,705 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int r;
cin>>r;
if(r!=0&&r<=100){
cout<<(3.14*r*r/3.14);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | 1 | 80,644,505 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1;
int dy = y2 - y1;
int x3 = x2 - dy;
int y3 = y2 + dx;
int x4 = x3 - dx;
int y4... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+5;
void solve(){
int x,xx,y,yy;
cin>>x>>y>>xx>>yy;
int dx = xx-x;
int dy = yy-y;
cout<<xx-dy<<" "<<yy+dx<<" "<<x-dy<<" "<<y+dx<... | 1 | 1,412,423 |
const long long MOD = 1e9 + 7;
const int N = 203010;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>
using namespace std;
#define int long long
typedef long long ll;
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0); ios_base::sync_with_s... | 1 | 54,146,385 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(i, s, e) for (int i = (s); i <= (e)... | #include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int main()
{
string bs[10]={
"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz",
};
int tc; scanf("%d",&tc);
while(tc--){
char s[1025]; scanf("%s",s);
int n=strlen(s);
for(int i=0,j;i<n;i=j+1){
string& b=bs[s[i]-'0'];
... | 1 | 53,201,298 |
#include <stdio.h>
#include <string.h>
int main(){
char A[15], B[15], C[15];
scanf("%s %s %s", &A, &B, &C);
int lastCharA = strlen(A) - 1;
int lastCharB = strlen(B) - 1;
if(A[lastCharA] == B[0] && B[lastCharB] == C[0]){
puts("YES");
}
else{
puts("NO");
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
char a[11], b[11], c[11];
scanf("%s %s %s", a, b, c);
int l1 = strlen(a);
int l2 = strlen(b);
if(a[l1 - 1] == b[0] && b[l2 - 1] == c[0]) {
puts("YES");
}
else puts("NO");
return 0;
} | 1 | 98,572,416 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x[i];
}
vector<int> right(n);
for(int i=0; i<n-1; i++){
right[i] = x[i+1] - x[i];
}
right[n-1] = -1;
int klim = log... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll mod=1000000007;
const ll INF=1e15;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define U_ERASE(V) V.erase(unique... | 1 | 43,900,589 |
#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> pii;
typedef pair<int,pii> P;
typedef long long ll;
typedef pair<ll,ll> pll;
... | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
#define rep(i,m,n) for(int i=m;i<n;i++)
int main(){
int n,m;
cin>>n>>m;
vector<P> edge[n];
rep(i,0,m){
int a,b,c;
cin>>a>>b>>c;
edge[a-1].push_back(P(b-1,c));
edge[b-1].push_back(P(a-1,c));
}
set<P> st;
rep(i,0,n){
in... | 1 | 11,013,187 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
const int N = 300005;
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
void cs(int &x)
{
cout << "Case #" << x << ": ";
}
bool cmp(string a, string b)
{
return a + b < ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout <<... | 1 | 93,587,188 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){int h,w; cin>>h>>w; char a[h][w]; int dp[h][w]; rep(i,h)rep(j,w) cin>>a[i][j],dp[i][j]=0; dp[0][0]=1; rep(i,h)rep(j,w){if(i>0) dp[i][j]+=dp[i-1][j];if(j>0) dp[i][j]+=dp[i][j-1];dp[i][j] %= 1000000007;if(a[i][j]=='#')... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl '\n'
#define pb push_back
const int N=1e5+1;
const int INF=1e9+7;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
char A[n][m];
for(int i=0;i<n;i++)
{
for(int j=0... | 1 | 23,758,183 |
#include<bits/stdc++.h>
using namespace std;
vector<long long>adj[100005];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (... | 1 | 40,168,547 |
#include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define mod 1000000007
#define pi 2*acos(0)
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
using namespace std;
int main()
{
io;
double d, t, s; cin >> d >> t >> s;
if (d / s <= t)cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
if (s * t >= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 79,647,476 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef vector<P> vec;
typedef vector<vec> mat;
int main() {
int N;
while (cin >> N, N) {
mat m(10);
vector<vector<int> > dp(10, vector<int>(10, 1 << 28));
for (int i = 0; i < N; i++) {
int a, b, c;
... | 1 | 9,065,252 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define nl '\n'
int main()
{
optimize();
int n,l;
cin>>n>>l;
vector<string>v(n);
for(int i=0;i<n;i++)
{
string s;
cin>>s;
v.push_back(s);
}
sort(v.... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> vec;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
vec.push_back(s);
}
sort(vec.begin(), vec.end());
string res;
for (string s : vec) {
res += s;
}
cou... | 1 | 20,251,907 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int a[n];
M mp;
rep(i, n) {
cin >> a[i];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) (x).rbegin(), (x).rend()
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
map<int,int>val;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
val[x]++;
val[x-1... | 1 | 68,607,199 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i <= (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int k, s;
cin >> k>> s;
int count = 0;
rep(i, k){
rep(j, k){
int l = s - (i + j);
if (l >= 0 && l <= k){
++count;
}
}
}
c... | #include <iostream>
#include <math.h>
using namespace std;
int main()
{
int K, S;
cin >> K >> S;
int cont = 0;
for (int X = 0; X <= K; X++)
{
for (int Y = 0; Y <= K; Y++)
{
int Z = S - X - Y;
if (Z >= 0 && Z <= K)
cont++;
}
}
cout << cont;
return 0;
} | 1 | 28,318,032 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong N,M;
llong P,Y;
llong index=0;
llong rank;
cin... | 1 | 90,034,555 |
#include<stdio.h>
int main(){for(int i=9;i<90;i++)printf("%dx%d=%d\n",i/9,i%9+1,i/9*(i%9+1));} | #include <iostream>
using namespace std;
int main(void){
int x,y,z;
for(x = 1; x < 10; x++){
for(y = 1; y < 10; y++){
z = x*y;
std::cout << x << "x"<< y << "=" <<z<< std::endl;
}
}
} | 1 | 86,459,920 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
class Heap{
public:
Heap(){
array = new long long[2000000];
n = 0;
}
void insert(long long data){
array[n] = data;
int tmp = n;
while(tmp != 0 && array[tmp] > array[(tmp-1)/2]){
std::swap(array[tmp], array[(tmp-1)/2]);
t... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#i... | 1 | 8,947,748 |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
using... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector v(n,0L);
for (int i=0; i<n; i++) cin >> v[i];
long ans = 0;
for (int i=0; i<=k; i++) {
for (int j=0; j<=k; j++) {
if (i+j>n || i+j>k) continue;
... | 1 | 9,875,890 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
int n=0, ph=0, pt=0;
string ct, ch;
cin >> n;
for(int i=0;i<n;i++) {
cin >> ct >> ch;
if(ct == ch) {
pt++;
ph++;
continue;
}
for(int j=0;j<fmin(ct.size(), ch.size... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
string taro, hanako;
int x1 = 0, x2 = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> taro >> hanako;
if(taro == hanako){
x1++;
x2++;
}
else if(taro < hanako) x2 += 3;
else x1 += 3;
}
cout << x1 << " " << x2 << endl;
... | 1 | 98,575,271 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = 1e9+7;... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | 1 | 44,160,126 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin>>k;
long a,b,c;
a=k/50+50;
b=k%50;
c=a-b-1;
int x[55]={0};
int xx=0;
cout<<50<<endl;
for(int i=0;i<50;i++)
{
if(i<b)
{
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7;
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).begin(), (v).end(... | 1 | 44,202,932 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<ll>> ans(H, vector<ll>(W, 1));
for (ll i = 0; i < B; ++i) {
for (ll j = 0; j < W; ++j) {
ans.at(i).at(j) = (ans... | 1 | 63,986,113 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... | 1 | 64,527,154 |
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int A, P; cin >> A >> P;
cout << (A * 3 + P) / 2;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 1 | 53,316,862 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.