code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <stdio.h>
int main(){
int a;
scanf("%d",&a);
if(a/100==7){
printf("Yes");
}
else if(((a/100)-7)%10==0){
printf("Yes");
}
else if (((a/10)-7)%10==0){
printf("Yes");
}
else if((a-7)%10==0){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | 0 | 66,077,408 |
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
cin >> N;
vector<int> a;
int in;
for (int i = 0; i < N; i++)
{
cin >> in;
a.emplace_back(in);
}
int ans = 0;
for (int i = 0; i < N; i++)
{
if (a[a[i]... | #include <bits/stdc++.h>
#define ll long long int
#define K 1000000007
using namespace std;
ll fact[2001];
ll invfact[2001];
ll power(ll x, ll y, ll m)
{
if (y == 0)
return 1;
ll p = power(x, y/2, m) % m;
p = (p * p) % m;
return (y%2 == 0)? p : (x * p) % m;
}
ll inverseMod(ll a)
{
re... | 0 | 36,018,175 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#define ... | 0 | 14,001,063 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
typedef long long int ll;
typedef long double ld;
const ll N = 1e5+9;
const ll mod =998244353;
#define x first
#define y second
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, D, A;
cin >> N >> D >> A;
vector<P> XH;
rep(i, N) {
i... | 0 | 86,385,042 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>H(N);
for (int n = 0;n<N;++n) {
cin >> H[n];
}
int ans = 0;
int high = 0;
for (int n = 0; n < N; ++n) {
if (high<=H[n]) {
ans++;
high = H[n];
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | 0 | 44,827,788 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void){
int n;
cin>>n;
int ans=0;
for(int i=1;i<=n;i+=2){
int tmp=0;
for(int j=1;j<=i;j++){
if(i%j==0)tmp++;
}
if(tmp==8)ans++;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 2,088,988 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
int n;
cin >> n;
cout << 800 * n - n / 15 * 200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define f(i,j,n) for(int i = j; i <= n; i++)
#define r(i,n,j) for(int i = n; i >= j; i--)
#define mod 1000000007
#define speed ios_base::syn... | 0 | 29,752,173 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | 0 | 27,995,694 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 0 | 32,452,970 |
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int parent[N], siz[N];
void make_set(int v){
parent[v] = v;
}
int find_set(int v){
while(v!=parent[v])
v = parent[v];
return v;
}
void ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | 0 | 51,167,223 |
#include <iostream>
#include <algorithm>
#include <vector>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::vector<int> input(3);
for(auto& i : input){
std::cin >> i;
}
std::sort(input.begin(), input.end());
for(int i=0; i<3; ++i){
std::cout << input[i] << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<pair<int, int>> pys(M);
for(int i=0; i<M; i++)
{
int a, b;
cin >> a >> b;
pys.at(i) = make_pair(a, b);
}
v... | 0 | 77,224,050 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long M) { cout << N * (N - 1) / 2 + M * (M - 1) / 2 << endl; }
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
solve(N, M);
return 0;
} | #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() {
int n, a;
cin >> n;
vector<int> as(n);
rep(i, n) {
cin >> a;
a--;
as[i] = a;
}
int id = 0;
int ans = 0;
rep(i, n) {
if (as[i] != id) {
ans++;
} ... | 0 | 96,224,232 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll K;
cin >> K;
vector<ll> A(K);
for (ll i = 0; i < K; ++i)
{
cin >> A.at(i);
}
if (A.at(K - 1) != 2)
{
cout << -1 << endl;
return 0;
}
ll l = 2, r = 2... | 0 | 96,794,615 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
vector<char> s_sort(s.size()),t_sort(t.size());
for(int i=0; i<s.size(); i++){
s_sort.at(i)=s.at(i);
}
for(int i=0; i<t.size(); i++){
t_sort.at(i)=t.at(i);
}
sort(s_sort.begin(),s_sort... | 0 | 80,486,133 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
static const int INF = 2000000000;
int main(){
ll n, m;
cin >> n >> m;
ll ans;
if (2*n >= m)... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long... | 0 | 32,338,041 |
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int n,m;
int p;
int main()
{
while(cin >> n >> m && n){
pair<int,int> a[10000];
for (int i = 0; i < n; ++i)
{
cin >> a[i].second >> a[i].first;
}
sort(a,a+n);
reverse(a,a+n);
for (int i = 0; i < n; ++i)
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n){
c... | 0 | 77,195,053 |
#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;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const long double PI = acos(-1.0L);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,m;
cin >> a >> b >> m;
int p[a],q[b],x[m],y[m],c[m];
for(int i = 0; i < a; i++){
cin >> p[i];
}
for(int i = 0; i < b; i++){
cin >> q[i];
}
for(int i = 0; i < m; i++){
cin >> x[... | 0 | 80,634,262 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a[k - 1] << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
const double PI=3.14159265358979323846;
const in MOD = 1000000007;
const in INF=1<<30;
usi... | 0 | 43,032,167 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include<math.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = a; i > 0; i--) {
if (a % i == 0 && b % i == 0)k--;
if (k == 0) {
cout << i;
return 0;
break;
}
}
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 0 | 62,320,531 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#include <set>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
bool cont(vector<int> v, int k, int size)
{
for (int i = 0; i < size; i++)
{
... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 18,538,993 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
double N, K;
int n;
cin >> N >> K;
double exp = 0;
for (n =1 ;n<=N;n++){
exp += pow(0.5, fmax(0,ceil(log2(K/n))));
}
std::cout << std::fixed;
std::cout << std::setprecision(12);
std::cout... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 1000000007;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
... | 0 | 26,843,530 |
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int a,b;
char c;
cin>>a>>c>>b;
if(((a&&b)>=1)&&((a&&b)<=pow(10,9)))
{
if(c=='+')
cout<<a+b;
else if(c=='-')
cout<<a-b;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};
long double eps = 1e-9;
long d... | 0 | 45,891,821 |
#include <iostream>
#include <string>
#include <vector>
#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 A, B;
cin >> A >> B;
string S;
cin >> S;
bool postal = true;
rep(i, S.size()) {
if (i == A) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,r,s,p;
string t;
cin >>n>>k>>r>>s>>p>>t;
long long sum=0;
for(int i=0;i<t.size();i++){
if(t[i]=='r')sum+=p;
else if(t[i]=='s')sum+=r;
else sum+=s;
}
for(int i=0;i<t.size()-k;i++){
if(t[i]=='r'&&t[i+k]=='r'){
sum-=p;
... | 0 | 67,555,576 |
#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 log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | #include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cc... | 0 | 36,088,384 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string s;
vector<string> v;
int x,y;
cin>>x>>y;
for(int i=0;i<x;i++) {
cin>>s;
v.push_back(s);
}
sort(v.begin(),v.end());
for(int i=0;i<x;i++) {
cout<<v[i];
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,R;
cin>>N>>R;
if(N>=10){
cout<<R;
}
else{
cout<<100*(10-N)+R;
}
return 0;
} | 0 | 68,962,491 |
#include <bits/stdc++.h>
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main()
{
int n; cin >> n;
vector<ll> a(n);
vector<ll> dp(n,LLINF);
REP(i,n) cin >> a[i];
REP(i,n) *lower_bound(dp.begin(),dp.end(),a[i]) = a[i];
cout << lower_bound(dp.begin(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 14,874,412 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n = 0 ;
cin >> n ;
vector<int> height(n+1), cost(n+1) ;
for(int i = 1 ; i <= n ; i++)
cin >> height[i] ;
cost[1] = 0 , cost[2] = abs(height[2]-height[1]) ;
for(int i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bi... | 0 | 47,706,525 |
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
int main() {
int a,b,k;cin>>a>>b>>k;
rep(i,k){
if(i%2==0){
if(a%2!=0){
... | 0 | 66,367,184 |
#include <bits/stdc++.h>
#include<iostream>
using namespace std;
int main() {
int a;
cin >> a;
string ans = "ABC";
if(a>= 1200)ans = "ARC";
cout << ans;
} | #include <bits/stdc++.h>
#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))
#define INF 1000000000... | 0 | 55,252,256 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n, p;
string s;
cin >> n >> p >> s;
long long res = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < n; i++) {
if ((s[i] - '0') % p == 0) {
res += i + 1;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#if 0
void print_array(vector<int> n) {
for (int i = 0; i < n.size(); i++)
cout << n.at(i) << " ";
cout << endl;
}
#endif
int main() {
string s; cin >> s;
int n = s.size()+1;... | 0 | 25,352,242 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
const long long INF = 1LL << 60;
const int MOD = 1e9 + 7;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } r... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
using namespace std;
#define ll long long
#define mst(a) memset(a, 0, sizeof a)
const int mod = 1e9+7;
const... | 0 | 65,925,057 |
#include <bits/stdc++.h>
using namespace std;
#define NIL -1
struct Node{
int p,l,r;
};
void setDepth(vector<Node> &T,vector<int> &D,int u,int p){
D[u]=p;
if(T[u].r!=NIL){
setDepth(T,D,T[u].r,p);
}
if(T[u].l!=NIL){
setDepth(T,D,T[u].l,p+1);
}
}
void printChildren(vector<Node> &T,... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b,c,k;
cin>>a>>b>>c>>k;
ll sum = 0;
if( k > 0) {
if( k > a){
k = k-a;
sum += a;
}
else{
sum += k;
cout<<sum<<"\n";
return 0;
}
}
if( k > 0) {
if( k > b){
... | 0 | 92,128,445 |
#include<bits/stdc++.h>
using namespace std;
int n;
long long ans=1;
bool zero=false, minuss=false;
int main(){
cin >> n;
for (int i=0;i<n;i++){
long long a;
cin >> a;
if (a==0) zero=true;
else if (ans<=1000000000000000000/a) ans*=a;
else minuss=true;
}
if (zero) cout << 0 << "\n";
else if (minuss) cout ... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main(){
ll N, sum = 0; cin >> N;
ll A[N];
for(int i=0; i<N; i++){
cin >> A[i];
sum += A[i];
}
if(sum % (N*(N+1)/2) == 0){
ll cnt = sum/(N*(N+1)/2), chk = 0;
for(int i=0; i<N; i++){
ll gap = A[(i+1)%N] - A[i]... | 0 | 47,272,957 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <functional>
#include <algorithm>
#define rep(i,a) for(int i=0;i<(a);++i)
const int INF = 1<<30;
#define _m_ 1
struct edge{
int from, to, cost;
edge () {}
edge(int f, int t, int c){
from=f;
to=t;
cost=c;
}
};
typedef std::pair<... | #include<iostream>
#include<vector>
#define ull unsigned long long int
using namespace std;
ull hcf(ull a,ull b){
if(b==0)
return a;
return hcf(b,a%b);
}
ull lcm(ull a,ull b){
ull den=hcf(a,b);
ull result=0;
if(a%den==0){
result=a/den;
result*=b;
}
else{
result=b... | 0 | 19,711,180 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline LL read() {
LL x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * fh;
}
const int N... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S ... | 0 | 7,343,437 |
#include <stdio.h>
int main(void)
{
int H,W,h,w;
for ( ; ; )
{
scanf("%d %d",&H,&W);
if (H == 0 && W == 0)
{
break;
}
for (h = 1; h <= H; h++)
{
if (h == 1 || h == H)
{
for (w = 1; w <= W; w++)
{
printf("#");
if (w == W)
{
... | #include <iostream>
#include <string>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
long long int ans = 0;
long long int k = 0;
long long int l = 0;
long long int r = 0;
for ( long long int i = 0; i < n; i++ ) {
string in;
... | 0 | 26,238,355 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = lon... | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool chm... | 0 | 31,039,737 |
#include<bits/stdc++.h>
using namespace std;
int n, d, A;
struct az
{
int x;
int h;
}q[200005];
int l[200005];
long long f[200005];
long long sum[200005];
bool cmp(az a, az b)
{
return a.x < b.x;
}
int main()
{
scanf("%d%d%d",&n,&d,&A);
for(int i=1;i<=n;++i)
scanf("%d%d",&q[i].x,&q[i].h);
sort(q+1,q+1+n,cmp)... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
while(cin>>n,n){
vector<vector<int> > road(15,vector<int>(15,1<<22));
int maxn = 0;
for(int i = 0 ; i < 15 ; i ++)road[i][i] = 0;
for(int i = 0 ; i < n ; i ++){
int a,b,c;
cin>>a>>b>>c;
road[a][b] = c... | 0 | 71,253,308 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int min(int a,int b){
return a < b ? a : b;
}
int main(void){
int N,M,X;
cin >> N >> M >> X;
int C[N];
int A[N][M];
for(int i=0;i<N;i++){
... | #include <bits/stdc++.h>
int main() {
int N, K;
std::cin >> N >> K;
int max = (N - 1) * (N - 2) / 2;
if (K > max) {
std::cout << -1 << std::endl;
return 0;
}
std::cout << (N - 1) + max - K << std::endl;;
for (int i = 1; i < N; i++) {
std::cout << 1 << " " << i + 1 << ... | 0 | 61,594,507 |
#include<bits/stdc++.h>
bool PN(int x) {
if (x <= 1) return false;
if (x == 2) return true;
for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false;
return true;
}
using namespace std;
int graph[8][8];
int dfs(int v, int n, bool visited[8]){
bool all_visited = true;
for(int i = 0; i < n; ++i){
... | #include <cstdio>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
int p[101];
int dp[101][101];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i+1]);
}
for (int dif = 0; dif < n; dif++) {
for (int i = 1; i <= n-dif; i... | 0 | 73,051,607 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int r; cin >> r;
if(r < 1200){
cout << "ABC" << endl;
return 0;
}
else if(r < 2800){
cout << "ARC" << endl;
return 0;
}
else{
cout << "AGC" << endl;
return... | #include <iostream>
#include <string>
using namespace std;
string revstr( string str ) {
string ret;
for(int i = str.length() - 1; i >= 0; i--)
ret += str[i];
return ret;
}
int main(void){
string str;
cin >> str;
cout << revstr( str ) << endl;
return 0;
} | 0 | 83,986,417 |
#include <iostream>
using namespace std;
int main()
{
int X;
int t;
cin >>X;
cin >>t;
if((X-t) >= 0)
cout << X - t;
else
cout << 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <string>
#include <map>
using namespace std;
int ChangeTimesFormat(string str){
int h = atoi(str.substr(0,2).c_str());
int m = atoi(str.substr(3,2).c_str());
int s = atoi(str.substr(6,2).... | 0 | 73,771,303 |
#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 N;
cin >> N;
int num = (N + 111 - 1) / 111;
cout << num * 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 75,062,000 |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pq priority_queue
#define debug(x) cerr << #x << ": " << x << endl;
#define line() cerr << "---------------" << endl;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<pair<int, int>> vp;
int sum = 0;
for (int i =... | 0 | 90,563,424 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int x,y;
cin >> x >> y;
ll a = 2 * x - y / 2;
ll b = y / 2 - x;
ll result = 2 * a + 4 * b;
if(result == y && a + b == x && a >= 0 && b >= 0) {
cout << "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | 0 | 4,864,931 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main(){
vector<int> height(10);
for (int i = 0; i < 10; i++)
cin >> height[i];
sort(height.begin(), height.end(), greater<int>());
for (int i = 0; i < 3; i++)
cout << height[i] << endl;
} | #include<bits/stdc++.h>
using namespace std;
main(){
int d,t,s;
cin>>d>>t>>s;
if((d+s-1)/s <= t) cout<<"Yes";
else cout<<"No";
} | 0 | 16,475,910 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const int ex[8]={1,1,0,-1,-1,-1,0,1};
const int ey[8]={0,1,1,1... | 0 | 71,784,786 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<vector<char>>A(N,vector<char>(N));
vector<vector<char>>B(M,vector<char>(M));
for(int i=0;i<N;i++){
string S;cin>>S;
for(int j=0;j<N;j++)A[i][j]=S.at(j);
}
for(int i=0;i<M;i++){
string S;cin>>S;
for(int j=0;j<... | 0 | 58,148,892 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
double ans = 0;
for (ll i = 1; i <= n; i++) {
ll tmp = i;
ll cnt = 0;
while (tmp < k) {
tmp *= 2;
cnt++;
}
ll q = n;
while (cnt--) {
q *= 2;
}
ans += (double)1 / q;
}
cout << fixed << s... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 60,625,434 |
#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... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll w,h;
std::cin >> w>>h;
vector<ll> pw(w);
vector<ll> ph(h);
for (int i = 0; i < w; i++) {
std::cin >> pw[i];
}
for (int i = 0; i < h; i++) {
std::cin >> ph[i];
}
sort(pw.begin(),pw.end(... | 0 | 61,730,487 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF 1e18
#define MOD (long) (1e9 + 7)
#define double __float128
struct Node
{
long k;
long count;
bool visited = false;
vector<long> adj;
};
long solve(Node &r, auto &nodes, long n)
{
r.count = r.k * (n - r.k + 1);
long... | 0 | 59,467,937 |
#include<bits/stdc++.h>
#define N 100010
#define ll long long
using namespace std;
ll n, sum, ans, res;
ll a[N], p[70];
void rd(ll &ans)
{
ans = 0; ll f = 1;
char x = getchar();
while(x > '9' || x < '0') {if(x == '-') f = -1; x = getchar();}
while(x >= '0' && x <= '9') ans = ans * 10 + x - '0', x = getc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
#define int ll
#define LOCAL 0
#define dbg(x) cout << #x << " is " << x << "\n"
#define gll(x) scanf("%d",&x)
#define gll2(x,y) scanf("%d%d",&x,&y... | 0 | 82,720,115 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
using namespace std;
using QWORD = uint64_... | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
if (y == 2019) {
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} else if (y > 2019) {
cout << "TBD" << en... | 0 | 39,115,625 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,x; cin>>n;
ll tot_a=0, tot_b=0;
vector<int>a(n),b(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
if(a[i]<b[i]){
int diff=b[i]-a[i];
if(diff%2){
tot_a+=(diff+1)/2;
tot_b++;
}
else... | #include <bits/stdc++.h>
using namespace std;
const int nax = 3e5+5;
struct pair_hash {
inline long long operator()(const std::pair<int,int> & v) const {
return (long long)v.first*nax+v.second;
}
};
int main() {
int h, w, m, x, y;
unordered_set<pair<int, int>, pair_hash> set;
cin >> h >> w >> m;
... | 0 | 20,393,281 |
#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>
#includ... | #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);
int h, n;
cin >> h >> n;
vector<int> v;
for(int i = 0; i < n; i++) {
int input;
cin >> input;
v.push_back(input);
}
int s = accumulate... | 0 | 82,604,067 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
using namespace std;
typedef long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,k;
cin>>n>>k;
P a[n];
ll b[n];
ll c[n];
rep(i,0,n){
ll x,y;
cin>>x>>y;
a[i]=P(x,y);
b[i]=x;
c[i]=y;
}
sort(b,b+n);
sort... | 0 | 52,938,342 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double eps=1e-6,pi=acos(-1);
const int N=1e3+5,M=1e9+7,SEGM=4*N,OO=0x3f3f3f3f;
int t,n,m;
char grid[N][N];
int mem[N][N];
bool valid(int r,int c){
return r>-1&&c>-1&&r<n&&c<m&&grid[r][c]!='#';
}
int solve(int i=0,int j=0){
if(i==n-1&&j==m... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
bool ans = false;
for(int i = 1; i <= B; i++){
if(A * i % B == C){
ans = true;
}
}
if(ans){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
... | 0 | 46,607,015 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define be(v) v.begin(), v.end()
#define ll long long
ll INF = 1e9;
ll mod = 1e9+7;
ll dp[10001];
int main() {
int a,b,c; cin >> a >> b >> c;
cout << c-min(c,a-b) << endl;
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
string o, e;
cin >> o;
cin >> e;
rep(i, e.size()) {
cout << o[i] << e[i];
}
if (o.size() != e.size())
c... | 0 | 17,039,845 |
#include <iostream>
using namespace std;
const int K = 10005;
const int MAX = 2000005;
int B[MAX], C[K];
void countingSort(int A[], int n) {
for (int i = 0; i < K; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
C[A[i]]++;
}
for (int i = 0; i < K - 1; i++) {
C[i+1] += C[i];
}
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define WHITE 0
#define GRAY 1
static const int MAXV = 10000, MAXE = 100000;
int V, E;
vector<int> G[MAXV];
list<int> ans;
int col[MAXV];
int indeg[MAXV];
void bfs(int s) {
queue<int> Q;
Q.push(s);
col[s] = GRAY;
while (!Q.empty()) {
int u = Q.front();
Q.pop();
an... | 0 | 59,799,205 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long a[n];
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
for (int i = 0; i < n - 1; i++) a[i + 1] += a[i];
int k = 0;
for (int i = 0; i < n - 1; i++)
if (a[i] * 3 < a[i + 1]) k = i + 1;
printf("%d\n", ... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll n;
cin>>n;
ll ans = 0;
for(ll i = 1; i < n; i++){
ans += n/i;
if(n%i =... | 0 | 1,408,483 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A= 0, B=0, ans=-1;
cin >> A >> B;
for (int i=B*10; i<10*(B+1); i++){
if ((i * 8)/100 == A){
ans = i;
... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 4,036,276 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int c=0;
for(int i=0;i<=a;i++)
{
c=a-i;
if(4*i+2*c==b)
{
cout<<"Yes"<<endl;
exit(0);
}
}
cout<<"No"<<endl;
} | #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 | 23,917,892 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int dp[100005], a[100005];
int n;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i];
dp[1]=0;
for(int i=2; i<=n; i++)
{
dp[i]=dp[i-1] + abs(a[i]-a[i-1]);
if(i>2)
dp[i]=min(dp[i], dp[i-2] + abs... | 0 | 51,219,462 |
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <algorithm>
#include <stdio.h>
int main(){
int n, m;
std::cin>>n>>m;
int h[n] ,ma[n];
for(int i=1;i<=n;i++){
std::cin>>h[i];
ma[i]=0;
}
for(int i=0;i<m;i++){
int a,b;
std::cin>>a>>b;
ma[a]=s... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 0 | 73,351,739 |
#include <iostream>
using namespace std;
int main()
{
int n,y,m,d;
int y3,yd,m2,md,dd,y2;
cin >> n;
for(int i=0;i<n;i++){
cin >> y >> m >> d;
if(y%3!=0) y2=y+(3-y%3);
else y2=y;
y3 = 334-y2/3;
yd = y3*200 + (1000-y-y3)*195;
m2 = m/2;
if(y%3!=0){
md = yd-39*m2;
if(m%2==1){
dd = md-d+1;
}el... | #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 | 51,768,045 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int inf = 2000000000;
const int maxn = 40000;
#define ll long long
#define pb push_back
#define mp make_pair
#define IO ios_base::sync_with_stdio(false);
int main(){
IO;
int n;
cin>>n;
int p[n],A[n],B[n];
for(int i=0;i<n;i++){
... | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> t(n), v(n);
for(int i = 0; i < n; ++i){
cin >> t.at(i);
}
for(int i = 0; i < n; ++i){
cin >> v.at(i);
}
vector<ll> tstart(n, 0), tend... | 0 | 67,258,483 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<in... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,b;
string s;
vector<char> lst(10);
cin>>a>>b>>s;
bool ans=true;
for(int i=0;i<s.size();i++){
if (i!=a && s[i]=='-'){
ans=false;
break;
}
if (i==a &&... | 0 | 64,454,063 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <queue>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
int n , m;
cin >> n >> m;
int a,b;
vector<int>to[100010];
for(int i=0;i<m;i++){
cin >> a >... | 0 | 70,861,091 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
vector<ll> acc(N + 1, 0), acc_pos(N + 1, 0);
for (int i = 1; i <= N; ++i) {
acc[i] = acc[i - 1] + a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<(n);i++)
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n+2,0);
rep2(i,n+1){
cin >> a[i];
}
ll sum=0;
rep2(i,n+2){
sum+=abs(a[i]-a[i-1]);
}... | 0 | 39,258,692 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll n;
cin >> n;
vector<ll> a(n);
for(auto &e: a) cin >> e;
ll r = 0, t = 0;
for(ll i=0; i<n; i++) {
ll s = max(0ll, (a[i]-(t+1) + t) / (t+1));
r += s;
if(a[i] == t+1... | 0 | 41,882,944 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int64_t Myxor(const int64_t x) {
if (x < 0) {
return 0;
}
int64_t result = 0;
int64_t d = 0;
while ((x >> d) > 0) {
const int64_t L = (1L << d);
if (d == 0 && (x % 4 == 1 || ... | #include<iostream>
using namespace std;
int main()
{
int k=500,x,sum=0,n,i;
cin>>n>>x;
for(i=0;i<n;i++)
{
sum=sum+k;
}
if(sum>=x)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | 0 | 57,546,137 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)
#define rep2(i, s, n) for (int i=s; i<n; i++)
int main() {
int a,b;
cin >> a >> b;
int cnt = 0;
rep2(i, a, b+1) {
string wk = to_string(i);
if (wk[0]==wk[4] && wk[1]==wk[3]) {
cnt++;
}
}
cout << cnt << e... | #include<bits/stdc++.h>
#define int long long
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
int32_t main()
{
FastIO;
int n,t=0;
cin>>n;
int a[n],s=0,ans=INT_MAX;
for(int i=0;i<n;++i)
{
cin>>a[i];
s+=a[i];
}
for(int i=0;i<n-1;++i)
... | 0 | 48,465,364 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K;
cin>>N>>K;
vector<ll>ac(N,0);
vector<ll>ce(K,0);
ll c=0;
ll d=0;
for(ll i=0;i<K;i++){
ll a;
string b;
cin>>a>>b;
if(b=="AC"&&ac.at(a-1)==0){
ac.at(a-1)=i+1;
}
if(b=="WA"){
ce.at(i)=a;
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
voi... | 0 | 40,998,749 |
#pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<... | 0 | 41,321,875 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for(ll i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string N;
cin >> N;
bool seven=false;
for (int i=0;i<3;i++) {
if(N[i]=='7') {
seven = true;
break;
}
}
if(seven==true) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
... | 0 | 57,268,951 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = ss; i < ee; ++i)
int H, W, K;
vector<string> v;
void input() {
cin >> H >> W >> K;
v.resize(H);
for (auto &s : v) { cin >> s; }
}
void solve() {
int ans = 0;
for (int h = 0; h < (1 << H); h++) {
for (int w = 0; w < (1 << W);... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 8580;
int X, Y;
bool dp[2][MAX_N << 1];
char S[MAX_N];
vector<int> vecs[2];
int main()
{
scanf("%s%d%d", S + 1, &X, &Y);
int opt = 0, acc = 0;
bool flag = true;
for (int i = 1; S[i]; i++)
if (S[i] == 'F')
acc++;
... | 0 | 41,986,385 |
#include <bits/stdc++.h>
using namespace std;
#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 push_back
#define all(v) (v).begin(), (v).end... | #include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
void fnDictionary(set<string> &a_rsesKey, vector<string> &a_rvsFind)
{
int iCommandCnt;
cin >> iCommandCnt;
for (int i = 0; i < iCommandCnt; i++)
{
string sCommand;
string sKey;
cin >> sCommand >> sKey;
... | 0 | 32,170,286 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,M;
cin >> N >> M;
vector<vector<int>>xyz(N,vector<int>(3));
for(int i = 0; i < N; i++) {
... | 0 | 70,691,506 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const ll MOD = 998244353;
ll modpow(ll a, ll n, ll MOD) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, cnt = 0, ans = 0;
cin >> n;
if (n < 105) {
cout << 0 << endl;
return 0;
}
for (int i = 105; i <= n; i += 2) {
cnt = 0;
for (int j = 1;... | 0 | 18,111,919 |
#include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <string>
#include <utility>
#include <iomanip>
#include <queue>
#include <algorithm>
#include<set>
#include<unordered_set>
using namespace std;
int root(int a);
bool is_same_set(int a,int b);
void unite(int a,int b);
long long int mpown(l... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
int lcm(int a, int b){
return a*b / gcd(a, b);
}
int main(void){
long long int i=0,j,a,b,c,d,p,q,f,g,h,t,z,m,aa;
cin >> a >> b >> c >> d;
q=lcm(c,d);
p=b/c;
aa=... | 0 | 25,039,093 |
#include <cstdio>
int n,a[200003],max;
long long ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
max=a[1];
for(int i=2;i<=n;i++){
if(max>a[i]) ans+=max-a[i];
else max=a[i];
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 14,524,991 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main(){
int n; scanf("%d", &n);
int maxj = 0;
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
maxj = max(maxj, a[i]);
}
int minj = 0x3f3f3f3f, pos;
for (int i = 0; i < n; i++){
if (abs(a[i] - (maxj + 1) / 2) < minj && a[i] < maxj) minj = abs(... | 0 | 43,809,721 |
#include<bits/stdc++.h>
using namespace std;
long long int a[100100], i, n, temp, width, height;
int main()
{
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
sort(a, a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
temp = height;
height = a[i+1];
widt... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define F first
#define S second
#define um map <ll,ll>
#define rep(i,z,n) for(int i=z;i<n;i++)
#define repi(i,z,n) for(int i=z;i<=n;i++)... | 0 | 74,507,397 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
int s1len = (int)s1.size();
int s2len = (int)s2.size();
vector<vector<int> > D(s1len+1 ,vector<int>(s2len+1, 0));
for(int i=0;i<=s1len;++i){
D[i][0]=i;
}
for(int ... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
{
... | 0 | 70,058,137 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ... | #include <iostream>
#include <string>
#include <vector>
class Card{
public:
Card( const std::string str );
char GetSymbol();
int GetNumber();
std::string GetString();
private:
std::string pair;
};
void MySwap( Card& a, Card& b );
void BubbleSort( std::vector<Card>& vec );
void SelectionSort( std::ve... | 0 | 29,634,755 |
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten53 300005
#d... | #include <iostream>
using namespace std;
int oneDigit(int num)
{
return (num >= 0 && num < 10);
}
bool isPalUtil(int num, int* dupNum)
{
if (oneDigit(num))
return (num == (*dupNum) % 10);
if (!isPalUtil(num/10, dupNum))
return false;
*dupNum /= 10;
return (num % 10 == ... | 0 | 30,650,275 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N;
cin >> N;
string ans = "No";
for(int i=0;i<3;i++){
if(N[i] == '7')ans = "Yes";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
... | 0 | 37,222,074 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string b;
string c = "";
cin >> a;
cin >> b;
if (a >= b.size()) {
cout << b;
return 0;
}
for (int i = 0; i < a; i++) {
c = c + b[i];
}
cout << c;
cout << "...";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 32,339,426 |
#include <stdio.h>
int main(void) {
int i, ans = 0, j, n;
while(scanf("%d", &n) != EOF) {
ans = 0;
for(i = 0; i * n < 600; ++i) ans += n * i * i * n * n;
printf("%d\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
using namespace std;
... | 0 | 72,109,845 |
#include<iostream>
using namespace std;
int makeFibonacci(int n) {
int a[100];
a[0] = 1;
a[1] = 1;
for (int i = 2;i <= n ;i++) {
a[i] = a[i - 2] + a[i - 1];
}
return a[n];
}
int main(void) {
int n;
cin >> n;
int ans = makeFibonacci(n);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | 0 | 29,436,291 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
ll x,t;
cin>>x>>t;
if (x<=t)
cout<<"0\n";
else
cout<<x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<... | 0 | 63,607,463 |
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
unsigned long p = 1;
for (; n > 1; p *= n--) {}
printf("%ld\n", p);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define all(v) v.begin(),v.end()
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Saw... | 0 | 28,303,365 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N,ans;
cin>>N;
ans=N*(N+1)/2;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 37,023,325 |
#include <bits/stdc++.h>
using namespace std;
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end... | #include "bits/stdc++.h"
#define all(x) x.begin(), x.end()
#define rep(i,n) for (i64 i = 0; i < (n); ++i)
#define reps(i,s,t) for (i64 i = (s); i <= (t); ++i)
#define repr(i,s,t) for (i64 i = (s); i >= (t); --i)
#define LF '\n'
#ifdef DBG
#define trace(...) _trace(#__VA_ARGS__, __VA_ARGS__);
#else
#def... | 0 | 27,600,889 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<ll> a(n);
for(int i=0;i<n;i++){
ll ai;
cin>>ai;
a[i]=ai-i-1;
}
sort(a.begin(),a.end());... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
using namespace std;
#define ... | 0 | 88,981,289 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
string kekka = "";
cin >> s >> t;
for(int i = 0; i < t.size(); i++){
kekka += s.substr(i,1) + t.substr(i,1);
}
if(s.size() > t.size()) kekka += s.substr(s.size()-1,1);
cout << kekka;
} | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
#include<map>
using namespace std;
int main(){
int mod=1000000007;
int n,tmp=0;
int a[101]={0};
while (scanf("%d",&n)!=EOF) {
a[n]+=1;
tmp=max(tmp,a[n]);
}
for (int i=1;i<1... | 0 | 95,948,301 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(o... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 1,148,646 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = INF;
for(int i=1; i <= 100; ++i){
int sum = 0;
rep(j... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string str;
cin >> str;
int q;
cin >> q;
string ord, p;
int a = 0, b = 0;
for (int i = 0; i < q; i++) {
cin >> ord >> a >> b;
if (ord == "print") {
for (int j = a; j <= b; j++) {
cout << str[j];
... | 0 | 4,533,702 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long k, n;
string s;
cin >> k >> s;
n = (long long)(s.length());
if (k >= n){
cout << s << endl;
}
else{
cout << s.erase(k) << "..." << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int digit_sum(int n){
int ans=0;
while(1 == 1){
ans += n%10;
... | 0 | 75,212,682 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> n = {a, b, c};
sort(n.begin(), n.end());
int count = 3;
if (n.at(0) == n.at(1)) {
count--;
}
if (n.at(1) == n.at(2)) {
count--;
}
cout << count << endl;
} | #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 _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double pie = acos(-1.0);
const ll MOD = 1e... | 0 | 27,776,218 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.