code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int N,K;
cin >> N >> K;
if(N%K==0){
cout << 0 << endl;
}
else{
cout << 1 << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 157,498 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "/home/v-o_o-v/deb.h"
#define deb(x...)cerr << "[" << #x << "] = [";_print(x);
#else
#define deb(x...)
#endif
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).r... | 0 | 54,543,878 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >>a>>b>>c;
bool ans=true;
for(int i=1;;i++){
if((a*i)%b==c){
break;
}
if(i==1){
d=(a*i)%b;
}
if(i!=1 && (a*i)%b==d){
ans=false;
break;
}
}
if(ans){
cout << "YES" <<endl;
}
else{... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#include<map>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int N; cin >> N;
vector<ll> v(N);
cin >> v[0];
for(int i=1; i<N... | 0 | 7,799,656 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int main()
{
vector<int> a(5);
for (int i = 0; i < 5; i++)
{
cin >> a.at(i);
}
sort(a.begin(), a... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <limits>
#include <unordered_map>
using namespace std;
using str = string;
#define rep(a,l,r) for(int a=(l);a<(r);a++)
#define get cin>>
#define put cout<<
void run() {
long a; get a;
long b; get b;
if (a + b == 1... | 0 | 59,142,605 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
typedef long long int ll;
ll mod=1e9+7;
int main(){
int n; cin >> n;
string s; cin >> s;
for(int i=0;i<2*n;i++){
if(i%2==0){
s[i]=(s[i]=='B'?'W':'B');
}
}
ll ans=1;
ll w=0... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin>> H >>W;
vector<vector<char>> a(H, vector<char>(W));
vector<bool> row(H, false);
vector<bool> col(W, false);
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>a[i][j];
if(a[i][j]=='#'){
... | 0 | 23,082,432 |
#include <iostream>
#include <vector>
#include <set>
#include <utility>
#include <algorithm>
struct paircomp {
using T = std::pair<long long, long long>;
bool operator()(const T& l, const T& r) const {
return l.first > r.first || (!(r.first > l.first) && l.second < r.second);
}
};
int main() {
l... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
signed main(){
int n,m;cin>>n>>... | 0 | 9,252,866 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int* A = new int[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
int mini = i;
for (int j = i+1; j < N; j++) {
if (A[j] < A[mini]) {
mini = j;
}
}
if (... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 100,078,404 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
string str,ord,c;
cin >> str;
cin >> n;
for(int i = 0;i < n;i++){
int a,b;
cin >> ord >> a >> b;
int len = b-a;
if(ord == "print"){
cout << str.substr(a,len+1) << "\n";
}
else if(ord == "reverse"){
string swap,swap2;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VE... | 0 | 22,322,837 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(... | 0 | 30,076,510 |
#include <bits/stdc++.h>
#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)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
using pint = pair<int, int>;
template <class T>
inli... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 67,639,540 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include <iostream>
#include <string>
using namespace std;
string line[30];
int w, h, x, y, sum;
void countup(int x, int y){
if(line[y][x] != '#'){
line[y][x] = '#';
countup(x,y-1);
countup(x,y+1);
countup(x+1,y);
countup(x-1,y);
sum++;
}
return;
}
int main(){
while(cin >> w >> h){
if (!w && !h) break... | 0 | 35,335,091 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int S, W;
bool ans = true;
cin >> S >> W;
if(W >= S)
ans = false;
if(ans) cout << "safe" << "\n";
else cout << "unsafe" << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e;
vector<int> dishes(5);
rep(i, 5) cin >> dishes[i];
int m = dishes[0] % 10;
int idx = 0;
for(int i = 1; i < 5; i++) {
if(dishes[i] % 10 < m &&... | 0 | 62,852,857 |
#include<bits/stdc++.h>
#define N 5000000005
#define sag (root+root+1)
#define sol (root+root)
#define ort ((bas+son)/2)
#define mod 1000000007
using namespace std;
typedef long long ll;
ll n, m, v, p;
ll arr[(ll)1e5+5];
bool check(ll ind) {
ll sayi = arr[ind] + m;
ll arttir = ind;
ll sonlar = p-1;
ll ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++) cin >> S[i];
vector<vector<int>> cntV(H, vector<int>(W)), cntH(H, vector<int>(W));
for (int y = 0; y < H; y++) {
int cnt = 0;
int l = 0;
fo... | 0 | 35,300,634 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int count = 0;
for(int i=0;i<s.size();i++){
if(s[i] == 'x')count++;
}
if(count < 8)cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
string rotation ( string S ){
int N = S.size();
char last = S[0];
for ( int i = 0; i < N-1; ++i){
S[i] = S[i+1];
}
S[N-1] = last;
return S;
}
int main() {
string S,T;
cin >> S >> T;
bool flg = false;
int N = S.size();
for ... | 0 | 85,247,912 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long S;
cin>>S;
long long Ans=0;
if(S%2==1){cout<<0<<endl;}else
{S=S/10;Ans+=S;while(S>0){Ans+=S/5;S=S/5;}cout<<Ans<<endl;}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) (a).begin(),(a).end()
#define SORT(a) sort(all(a))
#define rSORT(a, i) sort(all(a),(i))
using ll = long long;
constexpr ll INF = 10000000000;
constexpr ll MOD = 1000000007;
constexpr int MAX = 2000200;
constexpr double EPS = 1E-11;
u... | 0 | 55,932,930 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
priority_queue<double,vector<double>,greater<double>> Q;
for(int i=0;i<N;i++){
double A;
cin >> A;
Q.push(A);
}
for(int i=0;i<N-1;i++){
double A=Q.top();
Q.pop();
double B=Q.top();
Q.pop();
Q.push((A+B)/... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | 0 | 64,243,392 |
#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"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int x,rem;
int f=0, o=0;
cin >> x;... | 0 | 45,261,549 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
sort(a.begin(),a.end());
int j = 0, k = N - 1;
while(1) {
if (a.at(j) > A) {
break;
}
j++;
}
while(1) {
if (a.at(k) < B + 1) ... | #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;
map<int,int> mp;
for(int i=1; i<=n; i++){
int a;
... | 0 | 4,618,871 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int X,A;
cin>>X>>A;
if(X<A)
{
cout<<"0"<<endl;
}
else
{
cout<<"10"<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 91,248,520 |
#include <bits/stdc++.h>
using namespace std;
int n,a,b,cost;
vector<int>ans;
int main(){
scanf("%d%d%d",&n,&a,&b);
if(a*1LL*b < n || a + b - 1 > n)return puts("-1"),0;
for(int i = n - a + 1;i <= n;i++)ans.push_back(i);
n-=a;
for(int i = b - 1;i >= 1;i--){
int t = min(n - i + 1,a);
for(int j = n - t + 1;j <= n... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
if(n < 1200) {
cout << "ABC" << endl;
return 0;
}
else if(n < 2800) {
cout << "ARC" << endl;
return ... | 0 | 94,321,944 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 25,002,683 |
#include <stdio.h>
int n;
char a[200010];
long long t[200010];
long long mod = 1e9+7;
long long ans = 1;
int main(){
scanf("%d",&n);
scanf("%s",a);
for(int i=0;i<2*n;i++){
if(a[i]=='B'){
if(i>0) t[i] = t[i-1]+(t[i-1]%2?-1:1);
else t[i] = 1;
} else {
if(i>0) t[i] = t[i-1]+(t[i-1]%2?1:-1);
else t[i] = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<clas... | 0 | 46,933,836 |
#include <iostream>
using namespace std;
int main() {
int n, ans;
while (cin >> n) {
ans = 0;
for (int i=0;i<10000;i++) {
int a = i%10, b = i%100/10, c = i%1000/100, d = i%10000/1000;
if (a + b + c + d == n) {
ans++;
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_st... | 0 | 11,275,583 |
#include"bits/stdc++.h"
#define sz(a) (int)a.size()
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n; vector<int>a(n),v1(n),v2(n); for(int i=0;i<=n-1;i++){ cin>>a[i]; }
v1[0]=a[0]; v2[n-1]=a[n-1]; for(int i=1;i<=n-1;i++) v1[i]=max(a[i],v1[i-1]); for(int i=n-2;i>=0;i--... | #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 len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 71,817,358 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
unsigned long long int n;
cin>>n;
cin>>s;
if(n>=s.size())
cout<<s;
else{
s.erase(s.begin()+n,s.end());
s.append("...");
cout<<s;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<int,int> pii... | 0 | 55,368,154 |
#ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main()
{
int t[5];
for (auto& ti : t)
cin >> ti;
auto total = 0;
for (auto ti : t)
total += (ti + 9) / 10 ... | #include <bits/stdc++.h>
#include <algorithm>
#include <utility>
typedef long long int lli;
using namespace std;
int main(){
int w,h,n,x,y,a;
cin >> w >> h >> n;
int max_x=w;
int min_x=0;
int max_y=h;
int min_y=0;
for(int i=0; i<n; i++){
cin >> x >> y >> a;
if(a==1){
... | 0 | 73,239,251 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char* argv[]) {
int N, A;
cin >> N >> A;
if (N % 500 <= A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n)... | 0 | 16,008,433 |
#include <iostream>
#include <map>
std::pair<int, int> FibonacciPair(int Index)
{
if(Index == 0) return std::make_pair(0, 1);
if(Index == 1) return std::make_pair(1, 1);
std::pair<int, int> Prev = FibonacciPair(Index - 1);
return std::make_pair(Prev.second, Prev.first + Prev.second);
}
int FibonacciNumber(int Index... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[]) {
while(true){
int N;
cin >> N;
if(N==0) break;
vector<int> a;
for(int i=0;i<N;i++){
int b;
cin >> b;
a.push_back(b);
... | 0 | 59,656,501 |
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int num[n+1] = {0};
for(int i = 0; i < n; i++){
num[a[i]]++;
}
sort(num, num+n+1, greater<int>());... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <unordered_map>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#else
... | 0 | 54,943,352 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t 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()
#define chmax(x,y) x=max(x... | #if 0
accept?????????
40?????????????????£???
???????????¨??????????????¢?´¢???????????????????????????
???????????????????????????????????°????????????????????????
31-169584????????????????????????????????¨??£??????????????????????????£????????§????????????????????????????????????
#endif
#include <queue>
#include <ios... | 0 | 50,490,321 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
for(int i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2;
return 0;
}
}
for(int i=0;i<s.siz... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 255,845 |
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define test ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
int main() {
int n; cin >> n;
int a[n]; rep(i,n) cin >> a[i];
int ans = 0, cnt = 0;
rep(i,n-1) {... | 0 | 53,361,469 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll sum = 0;
int n, m;
cin >> n >> m;
ll res = 0;
map<ll, int> freq;
for (int i = 0; i < n; i++) {
ll in;
cin >> in;
in %... | 0 | 3,772,525 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n, tp = 0, hp = 0;
cin >> n;
REP(i, n) {
string t, h;
cin >> t >> h;
int r = strcmp(t.c_str(), h.c_str());
if (r == 0) {tp++; hp++;}
else if (r > 0) tp += 3;
... | #include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define n0 co... | 0 | 74,851,996 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 100000005;
int main() {
int n;
cin >> n;
vector<int> as(n, INF);
vector<int> bs(n - 1);
rep(i, n - 1) { cin >> bs[i]; }
for (int i = n - 2; 0 <= i; i--) {
as[i + 1] = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n-1),s(n-1),f(n-1);
rep(i,n-1) cin >> c.at(i) >> s.at(i) >> f.at(i);
vector<int> time(n);
for(int i=0; i<n-1; i++){
time.at(i)+=s.at(i)+c.at(i);
... | 0 | 73,718,632 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B, C;
cin >> A >> B >> C;
vector<int> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
int min = 100000;
for (int i = 0; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make... | 0 | 36,369,998 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
int N;
cin >> N;
ll sum = 0;
ll minB = INF;
for (int i = 0; i < N; i++) {
ll A, B;
cin >> A >> B;
sum += A;
if (A > B) minB = min(minB, B);
}
if (minB == INF) cout << 0 << en... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 92,945,935 |
#include <stdio.h>
#define BUF_SIZE 256
class stack10 {
private:
int stack[10];
int index;
public:
stack10() {
for (int i=0; i<10; i++) stack[i]=0;
index=0;
}
void PutTrain(int n) {
if (index<10) stack[index++] = n;
else printf("error: put\n");
}
int PopTrain() {
if (index>0) return stack[--index];... | #include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long ll;
const int maxn=1e5+7;
const int mod=1e9+7;
char c[maxn];
ll pow(ll a,ll b)
{
ll ans=1;
a%=mod;
while(b)
{
if(b&1)
ans=(ans*a)%mod;
a=a*a%mod;
b>>=1;
}
return an... | 0 | 74,641,154 |
#include <iostream>
#include <cstdio>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int parent(int i) {return i/2;};
int left(int i) {return 2*i;};
int right(int i) {return 2*i+1;};
int main(){
int H,A[250];
scanf("%d",&H);
REP(i,H) scanf("%d",&A[i]);
REP(i,H){
printf("node %d: key = %d, ",i+1,... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <time.h>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,... | 0 | 27,163,147 |
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
const int MAXN =1e5+10;
int k;
struct VER{
int x,w;
};
bool vis[MAXN];
deque<VER> q;
void bfs(){
VER v;
v.w=1;
v.x=1;
q.push_front(v);
while(!q.empty()){
VER t=q.front();
q.pop_front();
vis[t.x]=true;
if(t.x==0){
cout<<t.w<<endl;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 64,017,722 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
ll gcd(ll a, ll b){
if (a % b == 0)
{ return(b);}
else{return(gcd(b, ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
using vll = vector<ll>;
using vdouble = vector<do... | 0 | 53,317,573 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | 0 | 100,100,856 |
#include <iostream>
#include <cmath>
using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, s, n) for(ll i = s; i < n; i++)
using namespace std;
int main(){
ll n;
cin >> n;
ll x = 0;
ll y = 100000000000000;
rep2(i, 1, sqrt(n)+1){
if (n % i == 0){
if (i + n/i < x + y){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 1000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::sync_... | 0 | 8,289,344 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
rep(j, s.size()) {
if(i == j) continue;
if(s.at(i) == s.at(j)) cnt++;
}
}
if(cnt == 4) cout << "Yes" <<... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 | 41,535,836 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int d[1010][1010];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
int H,W;
cin>>H>>W;
char maze[H][W];... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i*i <= x; i++) {
if (x % i == 0) return false;
}
return t... | 0 | 24,657,596 |
#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...... | #include <bits/stdc++.h>
using namespace std;
long long f(long long X, int N, vector<long long> &cnt1, vector<long long> &cnt2){
if (N == 0){
return 1;
} else if (X == 1){
return 0;
} else if (X <= cnt1[N - 1] + 1){
return f(X - 1, N - 1, cnt1, cnt2);
} else if (X <= cnt1[N - 1] + 2){
return cnt... | 0 | 33,174,360 |
#include<iostream>
using namespace std;
int main(void){
int A, B, K;
bool result{false};
cin >> K >> A >> B;
if(A%K == 0){
result = true;
}
else if((A/K+1)*K<=B){
result = true;
}
if(result){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 0 | 77,156,919 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
char s[13];
int i=0;
cin >> s;
while(s[i]!='\0'){
if(i==4) printf(" %c", s[i]);
else printf("%c", s[i]);
i++;
}
printf("\n");
return 0;
} | #include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <string>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { co... | 0 | 80,966,963 |
#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;
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; } re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
priority_queue<ll> pq;
string s;
while(cin>>s && s!="end")
{
ll x;
if(s=="insert")
{ cin>>x;
pq.push(x);
}
else {
x=pq.top();
pq.pop();
printf("%lld\n",x);
}
}
return 0;
} | 0 | 59,471,494 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
ll int n,a, b;
cin >> n >> a >> b;
if(a > b || (n == 1 && a != b)) {
cout << 0 << endl;
return 0;
} else if(a == b && n == 1) {
cout << 1 << endl;
return... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 2,520,120 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, x;
while (cin >> n >> x) {
if (n == 0 && x == 0) break;
int count = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
if (i + j +... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (2 > (b - a)) {
cout << k + 1 << '\n';
} else {
if (k < a - 1) {
cout << k + 1 << '\n';
} else {
k -= (a - 1);
ll x = a;
x += (k / 2) * (b - a) + k % 2;
cout << x << '\n';
}
}
... | 0 | 16,534,961 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int n, s;
bool used[10];
lli dfs(bool used[10], int now, int sum)
{
if (sum > s) return 0;
if (now == n) {
if (sum == s) return 1;
return 0;
}
int res = 0;
for (int i = 0; i < 10; ++i) {
if (used[i]) continue;
used[i] = true;
res +=... | 0 | 57,182,003 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W; cin >> H >> W;
string S[H]; for (int i = 0; i < H; i++) cin >> S[i];
int L[H][W];
for (int i = 0; i < H; i++) {
int l = 0, r = 0, a = 0;
while (r != W) {
if (S[i][r] == '.') {
if (a == 0) l = r;
a++;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
int dp[110][2][110];
signed main(){
string s;cin >> s;
int K;
cin >> K;
int n = s.size();
dp[0][0][0] = 1;
rep(i,n)rep(j,2)rep(k,4){
... | 0 | 95,328,327 |
#include <string>
#include <iostream>
#include <vector>
#include <stack>
#include <math.h>
#include <iomanip>
#include <queue>
#include <map>
#include <list>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define MAX 1400
#define LARGENUM 1000000007
#de... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 87,915,800 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 52,405,529 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll SIZE = 2e5+200;
int main() {
ll n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) cin >> arr[i];
ll curr = 1;
for (auto x : arr) {
if (x == curr) {
curr++;
}
}
if (curr == 1... | #include <iostream>
#include <fstream>
#include <sstream>
#include <cmath>
#include <math.h>
#include <cstring>
#include <string.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
... | 0 | 66,382,967 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 5005;
const int MAX_K = 5005;
int N, K;
vector<int> a;
bool dp[MAX_N][MAX_K];
bool solve(int x){
memset(dp, false, sizeof(dp));
dp[... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 62,440,900 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
cin>>n;
cout<<800*n-(n/15)*200<<'\n';
} | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
int main(){
string s;
cin >> s;
map<ll, ll> ma;
ma[0] = 0;
vector<ll> nodes;
for(ll i = 0; i < s.size(); i++){
ll tmp = (nodes.size() ? nodes[nodes.size() - 1] : 0);
node... | 0 | 83,508,943 |
#include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 62,927,653 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
map<string, ll> M;
rep(i, N){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#def... | 0 | 63,672,752 |
#include<iostream>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
#include<functional>
template<typename T, int NN>
struct bit {
typedef std::function<T(T,T)> OP;
T data_[NN], e_;
OP& op_;
bit(OP& op, T e) : op_(op), e_... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define int long long
#defi... | 0 | 53,294,573 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
#define REP(i,m,n) for(LL i=(m);i<(n);i++)
#define RR... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 1,801,045 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define drep2(i, m, n) for(int i=int(m-1); i>=int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
#define fst first
#define snd second
... | 0 | 42,405,829 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple
bool check(int x) {
int s = round(sqrt(x));
return x == s * s;
}
const int N = 1100;
int n;
int d;
vector<int> v[N];
signed m... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
using namespace std;
string list = "0123456789";
int MCXItoINT(string s)
{
int l=s.length(), n=0, b=1;
string t;
for(int i=0; i<l; i++){
t = s.substr(i,1);
if(t=="m"){n += (b*1000); b=1;}
else if(t=="c"){n += (b*100); b=1;}
else if(t... | 0 | 42,428,463 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, k) for (int i = (s); i < (int)(k); i++)
int main(){
vector<vector<int>> A(3,vector<int>(3));
rep(a,0,3){
rep(b,0,3){
cin >> A.at(a).at(b);
}
}
int n;
cin >> n;
vector<vector<bool>> C(3,vector<bool>(3,fals... | #include <iostream>
#include <string>
using namespace std;
string ls="qwertasdfgzxcvb";
int main()
{
string s;
while(cin >> s, s!="#")
{
bool l=false;
for(int i=0; i<ls.size(); i++)
if(ls[i]==s[0]) l=true;
int ret=0;
for(int i=1; i<s.size(); i++)
{
bool lr=false;
for(int j=0; j<ls.size(); j++)
... | 0 | 12,482,787 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
const double PI = 3.14159265358979323846;
const ll MOD = (pow(10, 9) + 7);
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chm... | 0 | 71,518,177 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
ll n,r=0;cin>>n;
ll m=n,ans=0,a[1000000];
fill(a,a+1000000,0);
for(ll i=2;i*i<=n;i++){
if(m%i==0){
while(m%i==0){
a[r]++;
m=m/i;
}
r++;
}
}
ll j=1;
for(int i=0;i<r;i++){
while(a[i]-j>=0... | 0 | 18,419,752 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
const int N = 102;
int dp[N][N][N+N];
int n, m;
char s[N][N];
int f(int i, int j, int k) {
int& ret = dp[i][j][k];
if(ret != -1) return ret;
if(i == n && j == m) {... | 0 | 59,148,576 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
int num_front=0;
int num_back=0;
cin >> n;
cin >> s;
for(int i=0; i<n; i++){
if(s[i]=='('){
num_front++;
}
if(s[i]==')'){
if(num_front!=0){
... | #include <iostream>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
string result;
if(A.size() > B.size())
{
result = "GREATER";
cout << result << endl;
return 0;
}
else if (A.size() < B.size())
{
result = "LESS";
cout << result << en... | 0 | 31,797,927 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { ... | #include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,ans=0,cnt=1,i;
cin>>n;
ll a[n];
for(i=0; i<n; i++)
cin>>a[i];
for(i=0; i<n; i++)
{
if(a[i]==cnt)
{
cnt++... | 0 | 79,642,736 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#defi... | 0 | 9,262,538 |
#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 <bits/stdc++.h>
using namespace std;
int main(){
int n,h,w;
cin >> n >> h >> w;
int a[n],b[n];
int cnt = 0;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
if(a[i] >= h && b[i] >= w){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 0 | 66,249,248 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;++i)
string s[1010];
int chy[10], chx[10];
int d[1010][1010];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int h, w, n, ans;
void bfs(){
REP(i,n){
int sy = chy[i], sx = chx[i];
int gy = chy[i+1], gx = chx[i+1];
queue<in... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void c_grid_repating2(void) {
int h, w;
char s[51][51];
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) cin >> s[i][j];
}
for (int j = 0; j... | 0 | 18,492,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A <= 8 && B <= 8) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
ll K;
cin >> K;
ll siz=S.size();
ll X=0;
ll counter=0;
for(ll i=0;i<siz-1;i++){
if(S.at(i)==S.at(i+1)){counter++;
}
else{
X+=(counter+1)/2;
c... | 0 | 16,965,398 |
#include <stdio.h>
#include <ctype.h>
int main(void)
{
int i=0;
char str[1200];
scanf("%[^\n]",str);
for(i=0; (!(str[i])) == '\0'; i++){
if(isupper(str[i]))
str[i] = tolower(str[i]);
else
str[i] = toupper(str[i]);
}
printf("%s\n",str);
return(0);
} | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b+a); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using... | 0 | 65,072,298 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) if (i % 2 == 0) cout << s.at(i); cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 88,297,583 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 50
int main() {
int N, M;
string A[MAX], B[MAX];
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < M; i++) {
cin >> B[i];
}
string ans = "No";
for (int x = 0; x <= N - M; x++) {
for (int y = 0; y <= N - M; y++) {
b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int,int> pi;
typedef tuple <int,int,int> ti;
#define forn(i,a,n) for(int i = a; i < n ; i++)
#define mem(str,a) memset(str, a, sizeof(str));
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(nullptr)
con... | 0 | 95,027,944 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int main() {
int x, y, z, k;
cin >> x >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (cin >> tcs) rep(tc, tcs)
#define sz(x) (int)x.size(... | 0 | 67,444,479 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
char c;
cin >> c;
bool ans = false;
switch (c) {
cas... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n'... | 0 | 67,386,483 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, K; cin >> N >> K;
vector<ll> A(N);
REP(i, 0, N) cin >> A[i];
vector<ll> S;
REP(i, 0, N) {
S... | 0 | 22,333,571 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
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 l... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
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 / gcd(a, b)* b;
... | 0 | 80,681,234 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 12,262,661 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 90,680,608 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = LLONG_MIN;
ans = max(ans, a*c);
ans = max(ans, a*d);
ans = max(ans, b*c);
ans = max(ans, b*d);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;cin>>a>>b>>c>>d;
if(fabs(c-a)>d&&(fabs(a-b)>d||fabs(c-b)>d))cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | 0 | 30,484,475 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int n;
char k[100][2];
int m;
char a;
while (cin >> n) {
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> k[i][0] >> k[i][1];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
for (int i = 0; i < n; i++) ... | #include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define per(i,x,y) for (int i=(x); i>=(y); i--)
#define ll long long
#define N 300010
using namespace std;
int n,a,b,now,t1,t2,k1,k2,d[N];
int main(){
bool flag=0;
scanf("%d%d%d",&n,&a,&b);
per (i,b,1) d[b-i+1]=i;
a--; now=b;
if (a){
t1=(n-b... | 0 | 80,048,124 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <math.h>
#include <queue>
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >>... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) ... | 0 | 68,504,517 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main(){
int a;
char ca;
cin>>ca;
a=int(ca);
if(int('a')<=ca && int('z')>=ca) cout<<'a'<<endl;
else if(int('A')<=ca && int('Z')>=ca) cout<<'A'<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll (i) = 0; (i) < (n); (i)++)
#define For(i, a, n) for (ll (i) = (a); (i) < (n); (i)++)
#define prl(x) cout << (x) << endl
#define pr(x) cout << (x)
template <typename A, typename B>
string to_string(pair<A, B> p);
template <type... | 0 | 74,321,481 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> v(n + 1,... | #include <bits/stdc++.h>
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define eb emplace_back
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Vi = vector<int>;
void run() {... | 0 | 4,116,083 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 46,130,847 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 100000;
cin >> n;
for (int i = 0; i < n; ++i) {
m *= 1.05;
if (m % 1000) {
m += 1000 - m % 1000;
}
}
cout << m << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, m;
cin >> n >> m;
vector < ll > a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
a[i] /= 2;
}
ll lcm = 1;
for(int i = 0; i < n; i++){
lcm = (a[i]... | 0 | 35,469,158 |
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll n;
std::cin >> n;
std::vector<ll> a(n);
ll min = 10000000, max = -10000000, sum = 0;
for(auto& i : a){
std::cin >> i;
sum += i;
... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
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 ... | 0 | 22,754,088 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
#define PI 3.14159265358979323846264338327950L
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class DICE{
private:
int temp;
public:
int ii,iii,ji,ij;
int ans,foo,fooo;
int dice[6];
int cpyDice[6];
void cpy(){
for(ii=0;ii<6;ii++){
cpyDice[ii]=dice[ii];
}
}
void rollN(){roll(1,5,4);}
void rollS(){roll(4,5,1);}
void r... | 0 | 39,821,992 |
#include <iostream>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
rep(i,max(a, b)) cout << min(a, b);
cout << endl;
return 0... | #include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <algorithm>
#include <stack>
#include <cstdlib>
#include <iomanip>
#include <ctime>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long... | 0 | 96,217,906 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
int main() {
string s,t;
cin >> s >> t;
if(s==t) {
cout << "Yes" << endl;
return 0;
}
bool ok = false;
for(int i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | 0 | 48,051,530 |
#include <string>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <iostream>
#include <cstdio>
#include <set>
#include <complex>
#include <fstream>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ll ... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | 0 | 26,102,807 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long long fact[kmax], f... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> paint(H+2, vector<char> (W+2, '.'));
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++){
char s;
cin >> s;
paint[... | 0 | 85,258,932 |
#include <iostream>
#include <algorithm>
int main(){
int aiNums[3] = {};
scanf("%d %d %d", aiNums, &aiNums[1], &aiNums[2]);
std::sort(aiNums, aiNums + 3);
printf("%d %d %d\n", aiNums[0], aiNums[1], aiNums[2]);
return 0;
} | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
vector<vector<ll> > v;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with... | 0 | 45,124,184 |
#include<iostream>
#include<vector>
#include<string>
const int ALPHABET = 'z' - 'a' + 1;
int main(){
int n;
std::cin >> n;
std::vector<std::vector<int>> alphabet(n, std::vector<int>(ALPHABET, 0));
for(int i = 0; i < n; i++){
std::string S;
std::cin >> S;
for(int j = 0; j < S.size... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w,h,a[100][100],n,x,y;
while(cin >> w >> h, w, h){
for(int i=0;i<=w;i++){
for(int j=0;j<=h;j++) a[i][j] = 0;
}
a[0][1] = 1;
cin >> n;
for(int i=0;i<n;i++){
cin >> x >> y;
a[x][y] = -1;
}
for(int... | 0 | 55,274,386 |
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int W, H, x, y;
cin >> W >> H >> x >> y;
int num;
if (W % 2 == 0 && H % 2 == 0 && W / 2 ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>
#includ... | 0 | 18,058,888 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 3000005;
int fac[MAX], inv[MAX], finv[MAX];
int mod = 1e9+7;
signed main(){
int n,k;
cin >> n >> k;
int c = 0,d = 0, ans = 0;
if(k%2){
c = n/k;
ans = c*c*c;
}
else{
d = n/(k/2);
c = n/k;
ans = pow(d-c, 3)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
int k;
string s;
cin >> k >> s;
if(s.length() <= k){
cout << s << endl;
}else if(s.length() > k){
rep(i,k){
cout << s[i] ;
}
cout << "..... | 0 | 40,653,298 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.