code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <climits>
#include <vector>
#include <cmath>
using namespace std;
vector<int> A;
vector<int> g;
int n, m;
int cnt;
auto prn=[=](){
for(auto a : A)
cout<<a<<"\n";
};
void _insSort(int g){
for(int i=g-1;i<n;i++){
int maxi=i;
for(int j=i+g;j<n;j+=g... | #include <iostream>
#include <cmath>
using namespace std;
int insertionSort(int a[], int n, int g){
int cnt = 0;
for(int i=g;i<n;++i){
int v = a[i];
int j = i - g;
while(j>=0 && a[j]>v){
a[j+g] = a[j];
j = j - g;
++cnt;
}
a[j+g] = v;
}
return cnt;
}
int* interleavedlist(int n, int *m){
int i =... | 1 |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
bool is_prime(long long N) {
if (N == 1) return... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
int main()
{
int k,t;
cin >> k >> t;
vector<int> a(t);
for (int i = 0; i < t; i++)
{
cin >> a[i];
}
sort(all(a));
reverse(all(a));
int ans = max(a[0] - 1 - (k - a[0]) ,0);
cout << ans... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
typedef pair<int,int> ii;
priority_queue<int> q;
vector<ii> v;
int n, sum = 0;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 0 ; i < n ; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int N; cin >> N;
vector<tuple<int, int, int>> A(N);
for (int i = 0; i < N; i++) {
int h, p; cin >> h >> p;
A[i] = make_tuple(h + p, h, p);
}
sort(begin(A), end(A));
const Int INF = 1e18;
vector<... | 1 |
#include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
bool field[32][32];
const string dic="NESW";
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
while(true){
int n; cin>>n;
if(n==0) return 0;
for(int i=0;i<32;i++) for(int j=0;j<32;j++) field[i][j]=false;
for(int i=0;i<n;i++){
int x,y; cin>>x>>y;... | 1 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth <<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n&1)for(int i=1;i<=m;i++){
printf("%d %d\n",i,n-i);
}
else{
int cnt = 0;
for(int i=1;cnt<m&&i<=n/4;cnt++,i++){
printf("%d %d\n",i,n/2-i+1);
}
int cur = 1;
for(int i=n/2+1;cnt<m;i++,cnt++){
printf("%d %d\n... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include<bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
s.find_by_order(x) xth element in set
x.order_of_key(x) number of elements <x*/
#define ll long... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#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 int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int a, b, c;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min(a,b)+min(c,d)<<endl;
}
| 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 n;
cin >> n;
int k = 111;
for(int i = 1; i < 10; i++){
if(k >= n){
cout << k << endl;
return 0;
}
k += 111;
}
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;cin>>n;
for(int i = n;i<10000;i++){
string str = std::to_string(i);
if(str[0] == str[1]&&str[1] == str[2]){
cout<<i;
return 0;
bre... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
int main(){
int n;
cin >> n;
vi a(n+1);
rep(i,n){
int x;
cin >> x;
a[i+1]=x;
}
int m=0;
vi b(n+1);
for(int i=n;i>0;i--){
for(int ... | #include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il voi... | 0 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int... | #include <iostream>
using namespace std;
int e, m;
int main(void){
while(cin >> e && e != 0){
m = 1000000;
for(int y = 0; y <= 1000; y++){
for(int z = 0; z <= 100; z++){
int x = e - y * y - z * z * z;
if(x < 0) continue;
if(x + y + z < m) m = x + y + z;
}
}
cout <... | 0 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_A... | #include<iostream>
#include<vector>
using namespace std;
int main(){
string s;
cin >> s;
for(int i=0;i<s.size();i++){
if(s[i]=='h'){
if(s[i+1]=='i'){
i++;
}else{
cout << "No" << endl;
return 0;
}
}else{
cout... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string buf;
while (cin >> buf) {
int amount = 0;
while ( !(buf.empty()) ) {
switch ( buf.at(0) ) {
case 'M':
buf.erase( buf.begin() ); amount += 1000; break;
case 'D':
buf.erase( buf.begin() ); amount += 500; break;
ca... | #include <iostream>
using namespace std;
int main()
{
long long int s=0,r1,r2;
cin>>r1>>r2;
if(r1==1)
s+=300000;
if(r1==2)
s+=200000;
if(r1==3)
s+=100000;
if(r2==1)
s+=300000;
if(r2==2)
s+=200000;
if(r2==3)
s+=100000;
if(r1==1 &&r2==1)
s+=400000;
... | 0 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
//ll SUN, MON, TUE, WED, THU, FRI, SAT;
string s;
cin>>s;
if(s=="SUN") cout<<7<<endl;
if(s=="MON") cout<<6<<endl;
if(s=="TUE") cout<<5<<endl;
if(s=="WED") cout<<4<<endl;
if(s=="THU") cout<<3<<endl;
if(s=="FRI") cout<<2<<endl;
if(s=="SAT") ... | /*
@uthor: Varun Mishra
"varun21999" -> Codechef, Codeforce, Hackerrank, Hackerearth;
*/
//#include<boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, x;
vector<int> A;
int ans = 0;
cin >> N >> x;
for (int i = 0; i < N; ++i)
{
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
for (int i = 0; i < N;... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
ll dp_real[2][301][301];
ll dp_suff[2][301][301];
ll dp_diag[2][301][301];
const ll p = 998244353LL;
int main()
{
ios_base::sync_with_stdio(0)... | #include<bits/stdc++.h>
using namespace std;
const int N = 18, mod = 1e9 + 7;
int dp[44][1 << N], x, y, z;
int yo(int n, int mask) {
mask &= (1 << 18) - 1;
if (mask >> x & 1 && mask >> (x + y) & 1 && mask >> (x + y + z) & 1) return 0;
if (n == 0) return 1;
int &ret = dp[n][mask];
if (ret != -1) return ret;
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define foreach(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define chmax(a,b) a=max(a,b)
int n,Q,bl;
int c[500005];
int ans=0,cnt[500005];
struct query{
int l,r,id;
}q[500005];
int qans[500005];
bool cmp(query a,query b){
return (a.r/bl)==(b.r/bl)?a.l<b.... | #include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TEMP_T T cums(T& v){ T r(v.size()); partial_s... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int Mod = 998244353;
int fpow(int x, int y) {
int res = 1;
while (y) {
if (y & 1) res = 1ll * res * x % Mod;
x = 1ll * x * x % Mod;
y >>= 1;
}
return res;
... | #include<bits/stdc++.h>
using namespace std;
const bool DBG = 1;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a,b) TRACE(for(auto it=a; it!=b;) cout<<*(it++)<<" ";cout<<endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).beg... | 0 |
#include<bits/stdc++.h>
#define title "title"
#define ll long long
#define ull unsigned ll
#define fix(x) fixed<<setprecision(x)
#define pii pair<ll,ll>
#define vint vector<ll>
#define pb push_back
using namespace std;
void Freopen(){
freopen(title".in","r",stdin);
freopen(title".out","w",stdout);
}
ll read(){
ll g=... | #include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
ll S;
cin >> N >> S;
ll X[N], P[N];
for (int i = 0; i < N; ++i) {
cin >> X[i] >> P[i];
}
queue<ll> neg, pos;
// Sより前、後にある座標をそれぞれ両端から入れていく
... | 1 |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define int long long
#define mod 1000000007
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {an... | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | //g++ -std=c++14 test.cpp -o test.out
//全部開催すると仮定した後、1つずつ減らして調べていく
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <util... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int T,A,n;
cin >> n >> T >> A;
T--,A--;
vector<vector<int>> v(n)... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = in... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, x;
vector<int> a;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
}
reverse(a.begin(), a.end());
for(int i = 0; i < n; i++) {
... | #include<stdio.h>
int main(void)
{
int a[101],s,i,d;
scanf("%d",&s);
for(i=1;i<=s;i++){
scanf("%d",&a[i]);
}
d=1;
for(i=s;i>=1;i--){
d++;
printf("%d",a[i]);
if(d<=s){
printf(" ");
}
}
printf("\n");
return 0;
} | 1 |
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 998244353;
int main(){
int K, N;
while(cin >> K >> N){
vector<vector<long long>> pair(K+1, vector<long long>(N+1, 0));
vector<vector<long long>> solo(K+1, vector<long long>(N+1, 0));
pair[0][0] = 1;
sol... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int inf = 1 << 28;
int w, h;
int a[21][21];
int sx, sy, gx, gy;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
bool check(int x, int w) { return 0 <= x && x < w; }
int dfs(int x, int y, int cnt) {... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
using namespace std;
st... | //C
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main(){
string d="";
d.resize(52);
for(int i=0;i<26;i++)d[i]='a'+i;
for(int i=0;i<26;i++)d[i+26]='A'+i;
int num;
//cout<<d<<endl;
while(true){
cin>>num;
if(num==0)break;
string ans="",next;
int key[200];
fo... | 0 |
#include <cstdio>
using namespace std;
int main(void){
int a[1000],b[1000],c[1000],i,j,r[1000],n,ans[303],abc;
for(j=0;j<6;j++){
scanf("%d%d%d%d",&a[0],&b[0],&c[0],&n);
if(a[0]==0) return 0;
abc=a[0]+b[0]+c[0];
for(i=0;i<=abc+1;i++) ans[i]=2;
for(i=0;i<n;i++) scanf("%d%d%... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, init, n) for(int i = init; i < (n); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
int to, cost;
};
const int MOD = 1e9 + 7;
const int iINF ... | 1 |
#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>;
vector<ll> f(ll n) {
vector<ll> res;
for (ll a = 2; a*a <= n; a++) {
if (n%a != 0) continue;
while (n%a == 0) {
n /= a;
}
res.p... | #include <bits/stdc++.h>
#define max 1000007
#define ll long long int
using namespace std;
vector <ll> primes;
void sieve()
{
bool isprime[max+1];
for(ll i=0;i<=max;i++) {
isprime[i] = true;
}
isprime[0]=false;
isprime[1]=false;
for(ll i=3;i*i<=(max);i=i+2)
{
if(isprime[i]) {... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <queue>
using namespace std;
#define loop(i,N) for(ll (i)=0; (i)<(N);++(i))
struct TEMP_OMAZINAI_ { TEMP_OMAZINAI_() { std::ios::sync_... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n; cin >> n;
int ans = 0;
multiset <ll> m;
for (int i = 0; i < n; i++) {
ll take; ... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
vector<int> hands;
int tmp;
while(cin >> tmp){
hands.push_back(tmp);
cin.ignore();
cin >> tmp;
hands.push_back(tmp);
cin.ignore();
cin >> tmp;
hands.push_back(tmp);
cin.ignore();
cin >> tmp;
hands.push_bac... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int straight(int[]);
int main() {
int ans, h[5];
while(scanf("%d,%d,%d,%d,%d", &h[0], &h[1], &h[2], &h[3], &h[4])!=EOF) {
ans=0;
for(int i=0; i<4; i++) {
for(int j=i+1; j<5; j++) {
if(h[i]==h[j])
ans++;
}
}
swi... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << # x << "; "<< x << endl
int main() {
long long X, Y;
cin >> X;
Y = X;
long long happy = 0;
X = X / 500;
happy += 1000 * X;
Y -= X * 500;
Y = Y / 5;
happy += Y * 5;
cout << happy << endl;
}
| #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)... | 0 |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#in... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int x=h1*60+m1;
int y=h2*60+m2;
cout<<y-x-k;
}
| 1 |
#include <iostream>
#include <math.h>
using namespace std;
void Solve(int a)
{
const double pi = 3.14;
float ans;
ans = 2 * pi * a;
cout << ans;
}
int main()
{
int x;
cin >> x;
Solve(x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, x, ans = 0;
cin >> N;
for (int i = N; i > 0; i--) {
x = sqrt(i);
x = x * x;
if (i == x) {
ans = i;
break;
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
ll MOD=1000000007;
int inf=1000000000;
ll INF=10000000000000000;
int main(){
int n;
ll x;
cin >> n >> x;
vector<ll> b(n),l(n),u(n);
vector<pair<ll,ll>> a(n);
... | #include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <memory.h>
#include <cmath>
#include <array>
using namespace std;
void re(int& x);
template<class T, class... Ts> void re(T& t, Ts&... ts);
void pr(long long x);
void ... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main ()
{
ll a, z;
cin>>a;
z = a+a*a+a*a*a;
cout<<z<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int s_Len = S.length();
if (s_Len == 3) {
reverse(S.begin(), S.end());
}
cout << S << endl;
}
| 0 |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define EPS 1e-6
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 10;
int T;
int main()
{
int a, b, c;
while(cin >> a >> b >> c){
cout << c << " " << a << " " << b << endl;
}
return 0;
}
| #include <bits/stdc++.h>
// #include <chrono>
// #include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define v... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> cur (n);
for (int i = 0; i < n; i++) {
cin >> cur[i];
}
sort(cur.begin(), cur.end());
int ans = 0;
for (int k = 30; k >= 1; k--) {
int t... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define en "\n"
#define ITER(i,a) for( typeof(a.begin()) i=a.begin();i!=a.end();i++)
#define mod 1000000007
#define mpp make_pair
#define mes(a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll INFS=1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
in... | 0 |
#include<stdio.h>
#include<string.h>
int main(void) {
int a[10000],n,b=0,i,x,d=3;
char r[10000];
char s[10000];
scanf("%d", &n);
sprintf(s, "%d", d);
for(i = 1; i <= n; i++) {
sprintf(r,"%d", i);
if (i % 3 == 0) {
a[b] = i;
b++;
}
else if (strstr(r,s) != NULL) {
a[b] = i;
b++;
}
}
for (x =... | #include<iostream>
using namespace std;
int main(int argc,char* argv[]){
int input,num,tmp;num=1;cin >> input;
while(num<=input){
if(num%3==0){cout<<" "<<num;num++;}
if(num>input) break;tmp=num;
while(tmp!=0){if(tmp%10==3){ cout<<" "<<num;break;}tmp/=10;}
num++;}
cout<<endl;} | 1 |
#include <stdio.h>
#include <math.h>
double dist(int x1, int y1, int x2, int y2)
{
return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
}
int main()
{
int n; scanf("%d", &n);
int x[8], y[8];
double ans = 0.0;
for (int i=0; i<n; i++) scanf("%d %d", &x[i], &y[i]);
for (int i=0; i<n; i++)
{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
int main()
{
int n;
double x[10], y[10], ans = 0.0, count = 0.0;
c... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll F(ll A, ll B){
string bufA = to_string(A), bufB = to_string(B);
return max(bufA.size(), bufB.size());
}
int main(){
ll N;
ll ans = to_string(N).size();
cin >> N;
for(ll i = 1; i <= sqrt(N); ++i){
if(N % i == 0) ans =... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int64_t n;
string s = "";
cin >> n;
while(n!=0)
{
n--;
s += 'a' + n % 26;
n /= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
} | //https://atcoder.jp/contests/abc146/tasks/abc146_a
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string x;
cin>>x;
if(x=="SUN")
{
cout<<"7"<<"\n";
}
else if(x=="MON")
{
cout<<"6"<<"\n";
}
else if(x=="TUE")
{
cout<<"5"<<"\n... | 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 = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | 0 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int A, B, C, D;
int main(int argc, char* argv[]) {
cin >> A >> B >> C >> D;
int L = A + B;
int R = C + D;
if (L > R)
cout << "Left" << endl;
else if (L == R)
cout << "Balanced" << endl;
else
cou... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int a, b; cin >> a >> b;
if(a == b || a - 1 == b || a == b - 1) cout << "Yay!" << endl;
... | #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... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
vector<int> alp(26, 0);
for(char d : s){
alp[d - 'a'] = 1;
}
bool f = true;
for(int i = 0; i < 26; i++){
if(alp[i] == 0){
f = false;
cout << char(i + 'a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < (int)s.size(); i++) {
m[s.at(i)]++;
}
for (char i = 'a'; i <= 'z'; i++) {
if (m[i] == 0) {
cout << i << endl;
return 0;
}
... | 1 |
#include <bits//stdc++.h>
using namespace std;
#define int long long
signed main() {
int A,N,Max=0;
cin >> N;
long long goukei=0;
for(int i=0;i<N;i++){
cin >> A;
goukei+=max(Max-A,(int)0);
Max=max(A,Max);
}
cout << goukei << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
ll b[MAX_N];
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld %lld"... | 0 |
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_P = 10020;
bool prime[MAX_P];
void init()
{
for (int i = 0; i < MAX_P; i++)
prime[i] = true;
prime[0] = prime[1] = false;
for (int i = 2; i * i < MAX_P; i++)
if (prime[i])
for (int ... | #include<iostream>
#include<string>
#include<cstring>
bool find(const std::string &text, const std::string pattern){
int text_i=0,pattern_i=0;
while(text_i<text.size()&&pattern_i<pattern.size()){
if(text[text_i]==pattern[pattern_i]) {
text_i++;
pattern_i++;
}else{
pattern_i=0;
text_i=text_i-pattern_i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p[i];
}
int L;
cin>>L;
vector<vector<int>> dp(N,vector<int>(17));
for(int j=0;j<17;j++){
for(int i=0;i<N;i++){
if(j==0){
if(p[i]+L>=p[N-1]){
dp[i][0]=N... | #include<bits/stdc++.h>
using namespace std;
const long long N=2e5+5;
const long long inf=0x3f3f3f3f;
struct pl
{
long long x;long long y;long long jyz;
}p1[N];
vector <pl> xxx[N],yyy[N],zzz[N*2],fff[N*2];
long long cntx,cnty,cntz,cntf,n,ans=inf;
string s;
bool cjy(pl a,pl b)
{
if (a.x>b.x) return 0;
if (a.x<b.x) r... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, N) for (long long i = 0; i < (N); i++)
#define FORR(i, a, b) for (long long i = (a); i >= (b); i--)
#define REPR(i, N) for (long long i = n; i >= 0; i--)
#define SORT(v, n) sort(v, v + n);
#define VS... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
//using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
int getrandmax() {
static uint32_t y = time(NULL);
y ^= (y... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
vector<long long> create_table(vector<long long> pattern) {
vector<long long> table(pattern.size()+1, 0);
long long j = 0;
for (long long i = 1; i < pattern.size(); i++) {
if (patte... | ///
// File: alds1_8_c.cpp
// Author: ymiyamoto
//
// Created on Sun Oct 15 01:12:42 2017
//
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct tree_t {
tree_t *left;
tree_t *right;
tree_t *parent;
int64_t value;
tree_t(tree_t *par, int64_t val)
{
l... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; ++i) // マクロ
using namespace std; // stdの省略
using pii = pair<int, int>; // pairの略記
using ll = long long; // long longの略記
int main(void) {
int r;
cin >> r;
cout << 2*r*M_PI << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
cout << A * B << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,count=0;
cin>>a>>b;
for(int i=a;i<=b;i++)
{
string s=to_string(i);
int n=s.length();
if(s[0]==s[n-1] && s[1]==s[n-2])
{
count++;
}
}
cout<<count<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int res = 0;
for (int i = A; i <= B; i++) {
if (i/10000 == i%10) {
if (i/1000%10 == i%100/10) {
res += 1;
}
i += 9;
}
}
cout << res << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << "... | #include <stdio.h>
#include <math.h>
#define MAXINPUT 100
int main(void){
int h[MAXINPUT],w[MAXINPUT];
int ansh[MAXINPUT]={},answ[MAXINPUT]={};
int i=0,j=0;
int ans=0;
int num=0;
int k;
while(i<MAXINPUT){
scanf("%d %d",&h[i],&w[i]);
if(h[i]==0 && w[i]==0)break;
i++;
num++;
}
for(i=0;i<num;i++,ans=0){... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
double K=0;
vector<int> X(N),Y(N);
for(int i=0;i<N;i++){
cin >> X.at(i) >> Y.at(i);
}
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
int X2=X.at(i)-X.at(j);
int Y2=Y.at(i)-Y.at(j);
K+=sqrt(X2*X2+Y2*Y2);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n;
cin >> n;
vector<int> x(n), y(n), per(n);
rep(i, n) cin >> x[i] >> y[i];
... | 1 |
# 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 _USE_MATH_DEFINES_
#define ll lon... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int ed(string x,string y){
vector<vector<int>> tb(vector<vector<int>>((int)x.size()+1,vector<int>(y.size()+1,0)));
for(int i=0;i<(int)x.size()+1;i++) tb[i][0]=i;
for(int i=0;i<(int)y.size()+1;i++) tb[0][i]=i;
int tmp;
for(int i=1;i<(int)x... | 0 |
#include<cstdio>
const int N=1000005;
int n,he[128],nx[N],a,qu[N*2],hd,tl,d;char s[N],t[N];
inline int mx(int x,int y){return x>y?x:y;}
int main()
{
scanf("%d%s%s",&n,s+1,t+1),hd=n+1,tl=n;
for(int i=1;i<=n;++i)nx[i]=he[s[i]],he[s[i]]=i;
for(int i=n;i;--i)
{
if(hd>tl||i<qu[hd]-d)
{
hd=n+1,tl=n,d=0;
if(s[i]... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(1e6)+10;
int n,m,sum,s,a[maxn],b[maxn];
char S[max... | 0 |
#include<bits/stdc++.h>
using namespace std;
char str[100100];
int ty[4][100100];
main()
{
int n;
scanf("%d",&n);
scanf("%s",str);
ty[0][0]=ty[0][1]=ty[1][0]=ty[2][1]=0; // sheep
ty[1][1]=ty[2][0]=ty[3][0]=ty[3][1]=1; // wolf
for(int i=1;i<n;i++)
{
if(str[i]=='o')
{
... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 1 |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
//#pragma GCC optimize("unroll-loops")
#ifdef __APPLE__
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstrin... | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;A++)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD ((ll)1e9+7)
ll N,S;
vector<pll> xpv[2];
ll i, j, k,ans;
bool ck(ll t,ll aa,... | 0 |
#include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>... | #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>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, 0, ... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI=acos(-1.0);
int N,Q; string S; vi l,r;
void input()
{
cin>>N>>Q;
cin>>S;
for(int i=0;i<Q;++i){
int a,b; cin>>a>>b;
l.emplace_back... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<string> vec(3);
rep(i, 3) {
cin >> vec[i];
vec[i] += 'z';
}
vector<int> card_idx(3, 0);
int player = 'a' - 'a';
char now = vec[player][card_idx[player]];
card_idx[... | 0 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s,... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int s[10001];
void sieve() {
for(int i = 0; i < 10001; i++) s[i] = 1;
s[0] = s[1] = 0;
for(int i = 2; i <= sqrt(10001); i++) {
if(s[i]) {
for(int j = i * i; j < 10001; j += i) {
... | 0 |
#include <cstdio>
using namespace std;
typedef long long int LL;
const int Max_N(100050);
namespace io
{
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+2;
int ar[N],num[N];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,i,j,k,l,r,s,ans=0,lst=-1;
cin>>n>>s;
for(i=1;i<=n;i++){
cin>>ar[i]>>num[i];
}
l=1;
r=n;
while(true){
if(ar[r]<s){
ans+=s-ar[l];
break;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 1e9+7;
string s;
ll d, n;
ll dp[10005][101][2]; // k = 0, cannot cross limit, k = 1 can
ll solve(ll i, ll sum, ll k){
if(i == n) return sum == 0;
if(dp[i][sum][k] == -1) {
ll dig = s[i] - '0';
if(k) dig = 9;
l... | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 |
/*
* RD
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifndef rd
#define endl '\n'
#endif
#define deb cout<<"Line: "<<__LINE__<<" plz "
#define pb push_back
#define fi first
#define se second
#define int long long
typedef long long ll;
#define pii p... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define lc now<<1
#de... | 1 |
#include<bits/stdc++.h>
using namespace std;
int const nax = 1e6 + 10;
char s[nax];
int n;
int dp[nax][2];
int d;
int main () {
scanf("%s", s + 1);
n = strlen(s + 1);
s[0] = '0';
dp[n + 1][1] = 1;
for (int i = n ; i >= 0 ; -- i) {
d = s[i] - '0';
dp[i][0] = min(dp[i + 1][1] + 10 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string ns;
getline(cin, ns);
int a = 0, b = 1;
for (auto c : ns) {
int d = c - '0';
int a_ = min(a + d, b + 10 - d);
b = min(a + d + 1, b + 9 - d);
a = a_;
}
cout << a << '\n';
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int>t(N);
for (int i = 0;i<N;++i) {
cin >> t[i];
}
int ans = 0;
for (int i = 0;i<N-1;++i) {
ans += min(T, t[i + 1] - t[i]);
}
ans += T;
cout << ans << endl;
return 0;
} | // review
#include <iostream>
using namespace std;
int n, m;
void solve() {
int second = m & 1 ? m + 1 : m + 2;
int cnt = 1;
int cnt2 = 0;
for (int i=0;i<m;i++) {
if (i < m / 2) {
cout << cnt << " " << (second - cnt) << endl;
cnt++;
} else {
cout << cnt2 + second << " " << (2 * m + ... | 0 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long ll;
int ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=300100,MOD=1e9+7;
const int automata[8][2]={{3,1},{5,2},{2,2},{4,7},{3,3},{6,1},{5,5},{3,1}};
char ch[MAXN];
int dp[MAXN][8],len;
int main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>ch;
len=strlen(ch);
dp[len][1]=dp[len][2]=1;
for(regis... | #include <cstdio>
#include <cstring>
using namespace std;
char s[300001];
long long b[300001];
int c[300001];
long long dp[2][3];
bool can(int x, int c) {
return (s[x] == '?') || (s[x] == '0' + c);
}
int main() {
int n, m = 1000000007, i, j, k, l;
long long ans = 0;
scanf("%s", s);
n =... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
ll t;
cin >> n >> t;
vector<ll> a(n);
ll ans = 0;
ll lim = a[0] + t;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
if(i == 0) {
ans = t;
continue;
}
if(lim > a[i]){
ll ext = (a[i... | #include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int a,b,ans;
cin>>a>>b;
ans=0;
ans=ans+max(a,b);
ans+=max(max(a-1,b-1),min(a,b));
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(en... | 0 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
using namespace std;
int main()
{
int n;
while(1){
cin >> n;
if(n == 0) break;
int key[200];
char s[200... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 1 |
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
using namespace std;
in... | #include <iostream>
#include <iomanip>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,j) for(int i=0;i<j;i++)
bool has3(int p){
while(p){
if(p % 10 == 3) return true;
p /= 10;
}
return false;
}
void call(int n){
REP(i,1,n + 1){
if(i % 3 == 0 || has3(i))
cout << " " << i;
}
}
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
int ans = 2*n;
for(int i = 1;i <= n;i++){
string sx = s.substr(n-i,i);
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
bool isJudge(lli bit){
... | 0 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int need[10] = {0, 2,5,5,4,5,6,3,7,6};
const int N = 10005;
string dp[N];
void chmax (string& s, string t) {
if ((int) s.size() < (int) t.size()) s = t;
else if ((int) s.size() < (int) t.size()) return;
for (int i = 0; i < (int) s.size(... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1)res=res*x%mod;
x=x*x%mod;
n>>=1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vect... | 1 |
const long long MOD = 1e9 + 7;
const int N = 203010;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>
using namespace std;
#define int long long
typedef long long ... | #include <cstring>
#include <algorithm>
#include <cstdio>
#define int long long
#define ri register int
#define N 100005
using namespace std;
int n,m,v,p,t=0,ans,a[N]= {0};
template <typename T> inline void read(T &x) {
T c=getchar(),f=0;
for (; c<48||57<c; c=getchar()) if (c=='-') f=1;
for (x=0; 48<=c&&c<=... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll v[200009];
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
ll n,t,ans =0;
cin>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ret = 0;
for (int i = A; i <= B; i++) {
int s1, s2, s4, s5;
s1 = i / 10000;
s5 = i % 10;
if (s1 != s5) {
continue;
}
s2 = (i / 1000) % 10;
s4 = (i / 10) % 10;
if (s2 ==... | 0 |
#include <bits/stdc++.h>
#define MAX 60
#define browse for (int i = 0; i < MAX; ++i) for (int j = 0; j < MAX; ++j) for (int ii = 0; ii < MAX; ++ii) for (int jj = 0; jj < MAX; ++jj)
using namespace std;
int n, cnt[MAX][MAX], a, b;
long long y, ans;
long double x;
int main() {
cin >> n;
while (n--) {
... | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
... | 0 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typedef vector<int> VI;
typedef vector<VI>... | #include<iostream>
#include<vector>
#include<string>
#include<sstream>
using namespace std;
vector<string> split(const string &s, char delimiter)
{
vector<string> ret;
size_t now = 0, find;
while ((find = s.find_first_of(delimiter, now)) != string::npos)
{
ret.push_back(string(s, now, find - now));
now = find ... | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,s,r=999;
cin>>N;
for(int i=0;i<N;i++){
cin>>A;
s=0;
while(A%2==0){
s++;
A/=2;
}
if(s<r)r=s;
}
cout<<r<<endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
struct Node {
int key;
Node *parent, *left, *right;
};
Node* NIL;
int m;
Node* root;
void init() {
NIL = new Node;
NIL->parent = NIL;
NIL->left = NIL;
NIL->right = NIL;
r... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
class Dice
{
private:
int surf[6];
public:
void set_surf(int* input);
void roll(char orient);
void disp_top();
};
void Dice::set_surf(int* input)
{
memcpy(surf, input, 6*sizeof(int));
}
void Dice::roll(char ... | 0 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
const int maxn = 5e5 + 1;
using namespace std;
int n;
string s;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
int n ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | 1 |
#include <stdio.h>
const int MAX_V = 1000000;
int prime[MAX_V];
int main() {
int i, k, v, n, max = 0;
for(i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]){
for(k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
}
}
while(1){
scanf("%d",... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <string.h>
#include <cmath>
#include <queue>
#include <string>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<int,int>
#define ff firs... | 1 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int lislis[1003000];
int main(){
while(1){
int N,M;
cin>>N>>M;
if(N==0&&M==0)break;
int lis[1002]={0};
for(int i=1;i<=N;i++)cin>>lis[i];
for(int i=0;i<1003000;i++)lislis[i]=0;... | 1 |
#include<bits/stdc++.h>
#define L long long
#define vi vector<int>
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define aa first
#define bb second
#define xx aa.aa
#define yy aa.bb
#define zz bb
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
int n,m,p;
L f[600000],g... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long inf = 1e18;
int n, MAX, A, B;
int x[N];
long long sum[N];
struct SegmentTree {
long long T[N << 2], lz[N << 2];
void init() {
for (int i = 1; i < (N << 2); ++i) {
T[i] = inf;
lz[i] = 0;
}
}
#define mid ((l + r) >> 1)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
int ans,count,s;
ans=x%500;
count=ans%5;
s=(x-ans)/500*1000+(ans-count)/5*5;
cout<<s<<endl;
} | #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... | 0 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <li... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, k, ans;
int a[maxn];
bool sec[maxn];
vector<int> E[maxn];
int dfs(int x)
{
int ret = 0;
for(auto v : E[x])
ret = max(ret, dfs(v));
++ret;
if(ret == k && !sec[x]) ++ans, ret = 0;
return ret;
}
int main()
{
scanf("%d%d", &n, &k);
fo... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int N, M, K, A, B, C, D[100000], vis[100000];
map<int, ve... | 0 |
#include<iostream>
using namespace std;
const int BUF = 2000005;
const int MOD = 1000000007;
int add(int a, int b) {
return (a + b) % MOD;
}
int sub(int a, int b) {
return (a - b + MOD) % MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int nNum;
int a[BUF], b[BUF];
void read() {
cin >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> A(N);
for (long i = 0; i < N; i++) cin >> A.at(i);
sort(A.rbegin(), A.rend());
long a = 0, b = 0;
for (long i = 0; i + 1 < N; i++) {
if (A.at(i) == A.at(i + 1)) {
if (!a) a = A.at(i++);
else... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin>>a>>b;
if (a == 1 && b == 1) {
cout<<"1 2"<<endl;
cout<<"#."<<endl;
return 0;
}
if (a == 1 || b == 1) {
cout<<"50 100"<<endl;
} else {
cout<<"100 100"<<endl;
}
if (a > 1) {
--b;
for (int i=0; i<50; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
A--; B--;
vector<vector<int>> G(100, vector<int>(100));
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 100; j++) G.at(i).at(j) = 1;
}
int wy = 1, wx = 1;
while (A > 0) {
G.at(wy).at(wx) = 0;
A--;
if (w... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
for(;cin>>n;)
{
int data[n];
int dmax=0;
for(int i=0;i<n;i++)
{
cin>>data[i];
dmax=max(dmax,data[i]);
}
for(int i=1;i<=dmax/2;i++)
{
bool flag=true;
for(int j=0;j<n;j++)
{
if(data[... | #include <iostream>
using namespace std;
bool isMatch(int x) {
if (x % 3 == 0) return true;
do {
if (x % 10 == 3) return true;
} while (x /= 10);
return false;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
if (isMatch(i)) cout << ' ' << i;
}
cout << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(... | 1 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<bool> IsCorrect(N, false);
vector<int> Penalties(N, 0);
for(int i=0; i<M; i++){
int p;
string s;
cin >> p >> s;
p=p-1;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
inline int read(){
register int x=0,f=1;register char ch=getchar();
while(ch<'0'||ch>'9')f=ch=='-'?-1:f,ch=getchar();
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int last[N], root[N];
struct seg{
int l, r;
in... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct Node{
int key;
Node *parent, *left, *right;
};
Node *root, *NIL;
void insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left = NIL;
z->right = NIL;
wh... | #include "stdio.h"
#include"queue"
#include "climits"
using namespace std;
queue<int>Q;
int island;
int query;
int kind;
int start;
int goal;
int connect[101][101] = {};
int price;
int dis[101] = {};
int main() {
scanf("%d %d", &island, &query);
while (island != 0) {
for (int i = 0; i < 101; i++) {
for (int j... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | #include <bits/stdc++.h>
using namespace std;
#ifdef KACTL
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
#endif
#define all(x) begin(x), end(x)
using ll = int64_t;
using ld = long double;
using pii = pair<int32_t, int32_t>;
using vi = vector<int32... | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | #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... | 1 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define NMAX 502
#define DIM 7920
int d[DIM], p[DIM];
long long sol[NMAX][NMAX];
void ciur(int n) {
for (int i = 2; i <= n; i++) {
if (d[i] == 0) {
p[++p[0]] = i;
for (int j = i + i; j <= n; j += i) {
... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long int n,tem;
cin>>n;
vector<long int>p;
for(long int i=0;i<n;i++)
{
cin>>tem;
p.push_back(tem);
}
long int c=1,mini=p[0];
for(long int i=1;i<n;i++)
{
if(mini>=p[i])
{
c++;
... | 0 |
#include <bits/stdc++.h> // {{{
#define ARG4(_1, _2, _3, _4, ...) _4
#define rep(...) ARG4(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define REP(i, a) FOR(i, 0, a)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(...) ARG4(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define RREP(i, a) RFOR(i, 0, a)
#define R... | /* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n)... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.