code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#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 risi (0.05)
using namespace std;
int... | #include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <string>
#include <map>
#include <list>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char c[H][W];
for(int i=0; i<H; ++i){
for(int j=0; j<W; ++j){
cin >> c[i][j];
}
}
char resC[2*H][W];
for(i... | 0 | 69,328,803 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int n, tp = 0, hp = 0;
string t,h;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> t >> h;
if(t > h){
tp +=3;
} else if(t == h){
tp +=1;
hp +=1;
} else {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 5,882,809 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n, h, m;
string str, c;
cin>>str;
if (str == "-") break;
cin>>m;
for(int i = 0; i < m; i++){
cin>>h;
c = str;
str = "";
for(int j = h; j < (int) c.size(); j++) {
str += c[j];
}
for(int j = 0; j < h; j++){
str ... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 5,233,088 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
ll n,t,x; cin>>n>>t;
ll px=-1,ans=0;
for(ll i=0;i<n;i++){
cin>>x;
ans+=t;
if(px!=-1) ans-=max((ll)0,px-x+t);
px=x;
}
cout<<ans;
} | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
string S;
cin >... | 0 | 29,651,039 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | #include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#inc... | 0 | 98,264,120 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,ans=0,count=0;
cin>>N;
vector<int> H(N);
for(int i=0;i<N;i++)
cin>>H.at(i);
for(int i=0;i<N-1;i++){
if(H.at(i)>=H.at(i+1)){
count++;
}
else{
ans=max(ans,count);
count=0;
}
}
cout<<max(ans,count)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
}
ll an... | 0 | 29,185,134 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
ll n ; cin >> n;
ll ans = 0;
for(int i=1;i<(int)(sqrt(n)+1);i++){
if(n%i != 0) continue;
... | #include <iostream>
using namespace std;
int main(void){
int x,y;
for(;;){
cin>>x>>y;
if(x==0&&y==0){
break;
}
if(x>y){
swap(x,y);
}
cout<<x<<" "<<y<<endl;
}
} | 0 | 38,448,031 |
#include <iostream>
#include <algorithm>
using namespace std;
int n, sum = 0, big = -1, i, x;
int main(){
cin >> x;
if (x < 1200){
cout << "ABC" << endl;
}
else
cout << "ARC" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
string S; cin >> S;
vector<set<int>> x(10);
for(int i = 0; i < N; i++){
int d = S[i] - '0';
x[d].insert(i);
}
int ans = 0;
for(int a = 0; a <= 9; a++){
for(int b = 0; b <= 9; b++){
... | 0 | 85,083,786 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <iostream>
int main() {
int a,b,c;
std::cin >> a >> b >> c;
if (a < b && b < c && a!=b && b!=c && c!=a) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
} | 0 | 85,314,156 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool yn=false;
for(int i=0;i<N/7+1;i++){
bool fin=false;
for(int j=0;j<N/4+1;j++){
if(4*j+7*i==N){
yn=true;
fin=true;
break;
}
}
if(fin==true)break;
}
if(yn==true)cout << "Yes"<<endl... | #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 | 46,539,604 |
#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>;
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) { a = b; return true; } re... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli h, n;
int main(void){
cin >> h... | 0 | 46,703,363 |
#include <iostream>
using namespace std;
int main() {
long long int n, res;
res = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
res *= i;
}
cout << res << endl;
return 0;
} | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#i... | 0 | 47,790,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-... | #include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int main() {
while( 1 ) {
int n;
bool state = false;
bool lstate = false;
bool rstate = false;
int counter = 0;
cin >> n;
if( !n ) {
break;
}
for( int i = 0; i < n; i++ ) {
string s;
cin... | 0 | 23,725,335 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin... | #include <bits/stdc++.h>
using namespace std;
int64_t INF = 10000000000;
int main()
{
int64_t H, W, d1 = INF, d2 = INF, d3 = INF, d4 = INF;
cin >> H >> W;
if (W >= 3)
{
d1 = (W % 3 == 0) ? 0 : H;
if (d1 == 0)
{
cout << 0 << endl;
return 0;
}
}
if (H >= 3)
{
d2 = (H % 3 == 0... | 0 | 49,418,568 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
#define rot(s, k) rotate(s.begin(), s.begin()+ s.size()-(k%s.size()), s.end());
map<int, int> yes;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> arr(n);
for(int i{}; i<n; i++){
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 61,254,989 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n) {
int sum = 0;
int dl[n];
rep(i, n) {
cin >> dl[i];
sum += dl[i];
}
if (dl[m - 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 14,992,091 |
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,a,x;
cin>>x>>a;
i=(x<a)?0:10;
cout<<i<<endl;
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (i == 3) {
cout << S[i] << " ";
}
else {
cout << S[i];
}
}
cout << endl;
} | 0 | 87,809,523 |
#include<iostream>
#include<algorithm>
#define f first
#define s second
using namespace std;
int main(){
int n,m;
pair<int,int>d[10000];
while(cin>>n>>m&&n!=0){
int an=0,k=0;
for(int i=0;i<n;i++)cin>>d[i].s>>d[i].f,k+=d[i].s;
sort(d,d+n);
for(int i=0;m<k;i++){
if(k-m<d[i].s)an+=d[i].f*(k-m);... | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e3 + 77;
int32_t main()
{
fast;
int n;
cin >> n;
int ans = 0, a = 0, b = 0, c =... | 0 | 86,901,616 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI acos(-1)
int main(){
string s,t;
cin >> s >> t;
vector<vector<int>> alfs(26),alft(26);
for(int i = 0;i < (int)s.size();i++){
alfs[s[i] - 'a'].push_back(i);
alft[t[i] - 'a'].push_back(i);
}
for(int i = ... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; ll x; cin >> n >> x;
vector<ll> vec;
for(int i = 0; i < n; i++){
ll t; cin >> t; vec.pb(t);
}
vec.... | 0 | 33,238,370 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
double a, b, c;
double angle;
double sin1;
double cos1;
double s, l ,h;
cin>>a>>b>>angle;
angle = angle*M_PI/180.0;
sin1 = sin(angle);
cos1 = cos(angle);
s = 0.5 * a * b * sin1;
c = a*a + ... | #include<iostream>
using namespace std;
int main(){
int n, m, k, r;
cin>>n;
int a[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
a[i][j] = 0;
for(int i=0;i<n;i++){
cin>>r;
cin>>m;
for(int j=... | 0 | 73,532,717 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
int digits = 0;
while(x > 0){
x /= 10;
digits++;
... | 0 | 9,141,646 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int a, c, d;
string b;
cin >> a;
cin >> b;
cin >> c;
if (b == "+") {
d = a + c;
cout << d;
}
else if (b == "-") {
d= a - c;
cout << d;
}
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
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 l... | 0 | 91,886,385 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
double min = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
min += a.at(i);
}
min = min / (4 * m);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >=... | #include <iostream>
using namespace std;
int main(void){
int a,b,c,d;
cin>>a>>b>>c>>d;
while(1){
if(d<0){
cout<<"No"<<endl;
break;
}
if(a>=b){
b*=2;
}else if(b>=c){
c*=2;
}else{
cout<<"Yes"<<endl;
... | 0 | 87,366,947 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
int cnt = 0;
rep(i, N)
{
int h;
cin >> h;
if (h >= K) cnt++;
}
cout << cnt << endl;
... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 6,765,431 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
int ans;
cin >> A >> B;
if(A.at(0) == B.at(2)) {
ans++;
}
if(A.at(1) == B.at(1)) {
ans++;
}
if(A.at(2) == B.at(0)) {
ans++;
}
if(ans == 3) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int x,y;
cin>>x>>y;
const long long INF=1LL<<60;
long long int ans1=INF,ans2=INF,ans3=INF,ans4=INF;
long long int tmp_x=-1*x;
long long int tmp_y=-1*y;
if (y-x>=0) {
ans1=y-x;
}
if (y-tmp_x>=0) {
... | 0 | 35,829,753 |
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | #include<iostream>
using namespace std;
#define MAX 100005
#define NIL -1
struct Node{int parent, left, right;};
Node Tree[MAX];
int n, Depth[MAX];
void print(int index){
int i, child;
cout << "node " << index << ": ";
cout << "parent = " << Tree[index].parent << ", ";
cout << "depth = " << Depth[index... | 0 | 28,807,067 |
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int row,col,dp[10005][10005];
char grid[10005][10005];
void addSelf(int &x,int y)
{
x += y;
if(x >= mod)
x -= mod;
}
void FuN()
{
for(int i=1 ; i<=row ; i++){
for(int j=1 ; j<=col ; j++){
if(grid[i][j] == '#')
... | #include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int N = 1e5 + 500;
int dp[N][2],n;
vector < int > v[N];
int f(int i,int x,int lst){
if(x == 0 && v[i].size() == 1 && i != 1) return 0;
if(v[i].size() == 1 && i != 1) return 1;
if(dp[i][x] != -1) return dp[i][x];
vector < int > v1,... | 0 | 91,085,515 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define SORT(s) sort((s).begin(),(s).... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 26,520,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int l = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
if(s[i] == ')' && r == l) cnt++;
else if(s... | #include <iostream>
#include <vector>
int main()
{
long long K;
std::cin >> K;
std::vector<long long> lunlun_seq;
lunlun_seq.reserve(K);
for (long long i = 1; i < 10; i++)
{
lunlun_seq.push_back(i);
}
long long index = 0;
while (lunlun_seq.size() < K)
{
long long ... | 0 | 69,129,818 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const unsigned int M = 1000000007;
int main(){
int n;
while(cin>>n){
n<1200?cout<<"ABC"<<endl:cout<<"ARC"<<endl;
}
} | #include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<cmath>
#include<list>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 2000000 + 8;
const int maxv = 10000 + 8;
int n;
int a[m... | 0 | 95,721,850 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
int x;
cin >> x;
if (x < 1200) {
co... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 0 | 52,558,739 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
vector<vector<long long>> Factrization(long long X);
int main(){
long long N, ans;
std::cin >> N;
vector<vector<long long>> facts;
facts = Factrization(N);
ans = N - 1;
for(long long i = 0; i < facts.size(); i++){
i... | 0 | 98,168,990 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<tuple>
#include<ctime>
#include<functional>
#include<cmath>
#include<cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> p;
#define rep(i,... | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
#define ck(a,b) (0<=(a)&&(a)<(b))
using namespace std;
int main(){
int N;
cin>>N;
REP(i,0,N){
int y,m,d;
int ans=0;
cin>>y>>m>>d;
while(y!=1000||m!=1||d!=1){
d++;
if(y%3){
if(d>20-(m+1)%2) d=1,m++;
if(m>... | 0 | 39,231,374 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MAX 414514
set<int> G[MAX];
int indeg[MAX];
bool V[MAX];
vector<int> p;
void bfs(int s){
queue<int> q;
q.push(s);
V[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
p.push_back(u);
for(int v:G[u]){
indeg[v]--;
if... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair ... | 0 | 47,523,484 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c) puts("Yes");
else puts("No");
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | 0 | 78,275,650 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll A, B, K;
cin >> A >> B >> K;
if(A >= K){
cout << A - K << " " << B << endl;
}else if(A < K && K - A <= B){
cout << 0 << " " << B-K+A << endl;
}else if(A < K && K - A ... | #include <stdio.h>
#include <string.h>
int main() {
int a, b, hy;
scanf("%d %d", &a, &b);
int x = a + b + 1;
int y = a;
char n[x];
scanf("%s", &n);
int length = strlen(n);
for(int i = 0; i < x; i++) {
if(n[i] == '-') {
hy++;
}
}
if(length == x && n[y] == '-' && hy == 1) {
printf("Yes");
} else {
p... | 0 | 37,079,046 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
int main(){
int X,N,p[101];
cin>>X>>N;
if(N==0){
cout<<X<<endl;
return 0;
}
for(int i=0;i<N;i++) cin>>p[i];
int ans=X;
for(int i=1;i<=105;i++){
for(int j=0;j<N;j++){
if(ans==... | 0 | 59,827,904 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main()
{
int n, m;
cin >> n >> m;
int a[n];
int b[m];
for(int i = 0;i < n;i++)
cin >> a[i];
for(int i = 0;i < m;i++)
cin >> b[i];
long long x_sum = 0, y_sum ... | #include <bits/stdc++.h>
#define BPhuong "main"
#define maxn 100005
#define maxm
#define fi(i,a,b) for(int i = a; i<= b; i++)
#define fid(i,a,b) for(int i = a; i>= b; i--)
#define se second
#define f first
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define bit(x, i) ((x>>i)&1)
#define oo 1e9
s... | 0 | 92,675,831 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n][3];
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
{
cin>>arr[i][j];
}
}
for(int i=1;i<n;i++)
{
for(int j=0;j<3;j++)
{
arr[i][j]=arr[i][j]+max(arr[(i-1)][(j+1)%3],arr[(i-1)... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
const int kN = 500 + 5;
int n, m, d;
int a[kN][kN];
int main()
{
scanf("%d%d%d", &n, &m, &d);
int mod = d + d;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
int x = (i + j) % mod;
in... | 0 | 10,200,305 |
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 86,104,221 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int n , m;
cin >> n >> m;
vector<pair<ll, ll>> store(n);
rep(i, n){
... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int decode(string s){
string str = "ixcm";
int digit[] = {1,10,100,1000};
int res = 0;
rep(j,0,4){
rep(i, 0, s.size()){
if(... | 0 | 64,753,177 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dl double long
const int INF=0x3fffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 20,454,767 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S, T;
cin >> N >> S >>T;
for (int n = 0;n<N;++n) {
cout << S[n] << T[n];
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using lli = long long int;
using ll = long long;
lli n, m, h, a, b;
std::vector<lli> vec;
std::vector<lli> viewpoints;
int main() {
std::cin >> n >> m;
vec.assign(n+1, 0);
viewpoints.assign(n+1, -1);
for (int i = 1; i <= n; i++) {
std::c... | 0 | 21,178,750 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int a=0,b=0,x;
for(int i=0;i<8;i++){scanf("%d",&x); if(i<=3) a+=x; else b+=x;}
printf("%d\n",max(a,b));
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 0 | 29,175,036 |
#include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define int unsigned long long
#define sz(v) (int)(v).size()
#define mod 100000... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
int n;
int* a = new int[100005];
int* a_copy = new int[100005];
map<int, int> mp;
int cnt;
int ans;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
a_copy[i] = a[i];
}
sort(a_copy + 1... | 0 | 73,061,686 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
int n,x,t;
int ans;
scanf("%d%d%d",&n,&x,&t);
if(n%x==0)
ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 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 1000000007
int main() {
ll ans = 0;
int tmp;
ll ju = pow(10, 9);
ll x, y, s;
cin >> s;
y = (s + ju - 1)/ju;
x = ju * y - s;
cout ... | 0 | 95,765,096 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){
if(a>b) {
a = b;
return true;
}
return false;
}
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
... | #include<iostream>
using namespace std;
int main(){
bool tf=true;
int tedad[3]={1,1,1};
char str[4];
cin>>str;
for(int i=0;i<3;i++){
if(str[i]=='a'){
if(tedad[0]==1){
tedad[0]=0;
}
else{
tf=false;
break;
... | 0 | 4,469,723 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n);
... | #include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = (int)1e9 + 7, INF = (int)1e9;
int main(void) {
ll q, h, s, d, n, s1, s2, s3, ans;
scanf("%lld%lld%lld%lld%lld", &q, &h, &s, &d, &n);
s1 = min(q * 2, h);
s2 = min... | 0 | 17,992,338 |
#include<iostream>
#include<vector>
#define INF (1<<29)
using namespace std;
int main(void){
int n,m;
cin >> n >> m;
vector<int>d(m),dp(n+1,INF);
for(int i=0;i<m;i++)cin >> d[i];
dp[0]=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
if(j+d[i]<=n)dp[j+d[i]]=min(dp[j+d[i]],dp[j]+1);
cout << dp[n] << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 303;
const ll Inf = 1000000000000000000ll;
int n, k;
int H[Maxn];
ll dp[Maxn][Maxn][Maxn];
int main()
{
fill((ll*)dp, (ll*)dp + Maxn * Maxn * Maxn, Inf);
dp[1][0][0] = 0;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; ... | 0 | 24,385,198 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
void swap(int &x, int &y){
int tmp = x;
x = y;
y = tmp;
return;
}
struct UnionFind{
vi par;
UnionFind(int n){
par = vi(n, -1);
}
int root(int x){
if(par[x] < 0) retur... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 500010, inf = 1e9 + 233;
int n;
int p[maxn], a[maxn], b[maxn], deltaa[maxn], deltab[maxn];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &p[i]);
for (int i = 1; i <= n; i++)
a[i] = i, b[i] = n - i + 1;
for (int i = 1; i <= n... | 0 | 70,630,101 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void cmin(T &x, const T &y)
{
if(y < x) x = y;
}
template <typename T> void cmax(T &x, const T &y)
{
if(y > x) x = y;
}
template <typename T> void read(T &x)
{
x = 0; char c = getchar(); bool f = 0;
while(!isdigit(c) && c!='-'... | #include <bits/stdc++.h>
using namespace std;
int main() {
double a,b,c,d,oc,od;
double answer,number1,number2;
cin>>a>>b>>c>>d;
if (a<c) {
oc=c;
c=a;
a=oc;
}
if (b<d) {
od=d;
d=b;
b=od;
}
number1=double (fabs(d-b));
number2=double (fab... | 0 | 90,931,007 |
#include <iostream>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
int main(void){
int N;
cin >> N;
vector<int> A(1 << N);
for(int i = 0; i < (1 << N); ++i) cin >> A[i];
int res = 0;
for(int K = 1; K < (1 << N); ++K){
int firstmax = max(A[K], A[0]), secondmax ... | #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()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | 0 | 82,059,875 |
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | #include<cstdio>
int main(int argc, char const *argv[])
{
int H, W;
while(1){
scanf("%d %d", &H, &W);
if(H==0 && W==0) break;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
printf("#");
}
printf("\n");
}
printf("\n");
... | 0 | 25,714,796 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <utility>
#include <tuple>
#include <string>
#include <cstdint>
#include <vector>
#include <array>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cassert>
using namespace std;
using i64 = int64_t;
i64 n, k, dp[302][302];
vector<i64> h;
int mai... | 0 | 76,951,991 |
#include<cstdio>
int main(){
int a,b;
while(1){
scanf("%d %d",&a,&b);
if((a == 0)&&(b == 0)) break;
if(a<b){
printf("%d %d\n",a,b);
}else{
printf("%d %d\n",b,a);
}
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
using namespace std;
const int max_n= 10000;
int n,W,L,kk,m,V,e,r,ML, MD, E, v, H;
const int INF = 1e9+1;
const int mod = 1e9 + 7;
bool used[max_n][max_n];
string s1,s2;
int x[max_n],y[... | 0 | 87,318,793 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
cout << i << 'x' << j << '=' << i * j << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | 0 | 62,449,995 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<ll>>;
using Graph = vector<vector<ll>>;
using VI = vector<int>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VC = vector<char>;
using PI = pair<int, int>;
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#d... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin>>n;
for(int i=0;i<9;i++){
ans+=111;
if(ans>=n){
cout<<ans<<endl;
break;
}
}
return(0);
} | 0 | 21,384,983 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=300010;
const int inf=2147483647;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return... | #include<bits/stdc++.h>
using namespace std;
void test()
{
int n;
cin>>n;
for(int x=1;true;x++)
{
if(x*n%360==0)
{
cout<<x;
return ;
}
}
}
int main()
{
ios::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
test();
return 0;
} | 0 | 53,585,429 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
const int MAXSSTN = 200010;
class StarrySkyTree{
public:
int size=0;
int depth=0;
int best=0;
int start=0;
long long dat_add[4 * MAXSSTN];
long long dat[4 * MAXSST... | 0 | 47,626,054 |
#include<iostream>
using namespace std;
int main(void)
{
unsigned int n;
cin>>n;
unsigned long long int ans=n;
while(n>1){
ans*=--n;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include "atcoder/dsu"
typedef long long int ll;
using namespace std;
using namespace atcoder;
int main() {
int n, q;
cin >> n >> q;
vector<int> ans;
dsu d(n);
for (int i = 1; i <= q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d... | 0 | 6,706,974 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
int l1 = 1;
int r1 = m+1;
int l2 = m+2;
int r2 = 2*m+1;
for(int i=0;i<m;i++)
{
if(l1 < r1)
{
cout << l1 << ' ' << r1 << '\n';
l1++;
r1--;
}
else if(l2 < r2)
{
c... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100002
#define NIL -1
int n, D[MAX];
struct node{
int p, l, r;
};
node T[MAX];
void printTree(){
for(int i=0;i<n;++i){
printf("node %d: parent = %d, depth = %d, ",i,T[i].p,D[i]);
if(T[i].p == NIL) printf("root, [");
else{
... | 0 | 29,839,257 |
#include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N, M;
int S[11][11] = {0};
int C[11] = {0};
std::cin >> N >> M;
for (int i = 0; i < M; i++) {
std::cin >> C[i];
for (int j = 0; j < C[i]; j++) {
int s;
std::cin >> s;
S[i][j] = (s - 1);
}
... | #include<iostream>
#include<vector>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define ll long long
ll calc(int n, std::vector<ll> cnt){
ll ans=0;
for(int i=2; i<cnt.size(); ++i){
if(cnt[i] >= n-1) ++ans;
}
return ans;
}
int main(){
int n; std::cin >> n;
std::vector<ll> cnt(n+1,0);
fo... | 0 | 14,726,982 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n)
{
ll res=1;
while (n>0) {
if (n&1) res = res*a % mod;
a = a*a % mod;
n >>= 1;
}
return res;
}
int main()
{
ll N, K; cin >> N >> K;
vecto... | #include<iostream>
using namespace std;
int main(){
int A, B,N;
int sum,ans = 0;;
int cur =10;
cin >> N >> A >> B;
for(int i = 1;i <= N;i++){
sum = 0;
cur = i;
while(cur > 0){
sum += cur%10;
cur /= 10;
}
if( A <= sum && sum <= B)
... | 0 | 36,652,030 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 36,337,452 |
#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;
const int MAX_N = 305;
char S[MAX_N][MAX_N];
int main()
{
int N;
cin >> N;
rep(i,N)
{
rep(j,N)
{
cin >> S[i][j];
}
}
int ans = 0;
for (int i = -N+1; i <= N-1; ++i)
{
... | #include<bits/stdc++.h>
using namespace std;
int a[105];
bool b[105]={0};
int main(){
int x,y;
cin>>x>>y;
if(y==0){
cout<<x<<endl;
return 0;
}
for(int i=1;i<=y;i++){
cin>>a[i];
b[a[i]]=true;
}
int i=101;
int max=100005;
int ans=102;
for(int n=101;n>=0;n--){
if(!b[i]){
if(max>=abs(i-x)){
max=a... | 0 | 97,493,971 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
char b;
cin>>b;
if(b=='A')cout<<"T"<<endl;
if(b=='T')cout<<"A"<<endl;
if(b=='G')cout<<"C"<<endl;
if(b=='C')cout<<"G"<<end... | 0 | 95,497,561 |
#include <stdio.h>
int main(void){
int N[3];
int work = 0;
scanf("%d%d%d", &N[0], &N[1], &N[2]);
for (int i = 0; i < 2; i++){
if (N[0] > N[1]){
work = N[0];
N[0] = N[1];
N[1] = work;
}
if (i == 0){
if (N[1] > N[2]){
work = N[1];
N[1] = N[2];
N[2] = work;
}
}
}
printf("%d %d %d\n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, a, b;
int main()
{
cin >> N >> a >> b;
int ans = abs(a - b) % 2;
if (ans == 0)
{
cout << "Alice" << endl;
}
else if (ans == 1)
{
cout << "Borys" << endl;
... | 0 | 93,326,592 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
int a, num[4]={};
for(int i = 0; i < 6; ++i){
cin>>a;
num[a-1]++;
}
int cnt=0;
for(int i=0; i<4; i++){
if(num[i]%2==1){
cnt++;
}
}
if(cnt==0||cnt==2){
cout<<"YES";
}else{
cout<<"NO";
}
} | #include <bits/stdc++.h>
using namespace std ;
int main(){
int X;
cin >> X;
int A=0;
int Ans;
for(int i=1;i<=360;i++){
A = A+X;
A = A%360;
if(A==0){
Ans = i;
break;
}
}
cout << Ans << endl;
} | 0 | 82,480,512 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) {
return atan2(a.second, a.first) < atan2(b.second, b.first);
}
int main ()
{
int n;
cin >> n;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x |... | #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 n, k;
cin >> n >> k;
vector<int> a(n);
for (int& i : a) cin >> i, --i;
vector<int> s(n + 1, 0);
for (int i = 1; i <= n; ++i) (s[i] += s[... | 0 | 27,090,102 |
#include <iostream>
#include <algorithm>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i=0; i< (int)(n); i++)
typedef long long ll;
bool DEBUG = false;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> grid(H);
... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
string s;
while (cin >> s, s != "-") {
int m; cin >> m;
rep(i, m) {
int h; cin >> h;
s = s.substr(h) + s.substr(0, h);
}
cout << s << endl;
}
} | 0 | 42,149,662 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using int64 = long long;
int main() {
double T, X;
cin >> T >> X;
double t = T / X;
cout << t << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <climits>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <functional>
using namespace std;
#define fast ios::sync_with_stdio(false);ci... | 0 | 9,521,359 |
#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 a,b,c,d;
cin >> a >> b >> c >> d;
a=max(a,c);
b=min(b,d);
if(b-a>0) cout << b-a << endl;
else cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | 0 | 46,114,915 |
#include <iostream>
#include <cctype>
#include <cstdio>
using namespace std;
int main() {
char chr;
while(1){
chr=cin.get();
if(chr =='\n')break;
if (isalpha(chr)){
if (islower(chr))chr=toupper(chr);
else chr=tolower(chr);
}
cout<<chr;
}
cout<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
const int N = 10000;
int x = 0;
for(int i = 1; i <= N ; i++)
{
cin >> x;
if ( x == 0 ){ break; }
cout << "Case " << i << ": " << x << endl;
}
return 0;
} | 0 | 46,503,408 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> co... | 0 | 35,519,993 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int n,m;
char cha, chb;
char c;
char *out;
out = new char[100000001];
while(cin >> n, n){
map<char, char> conv;
map<char, char>::iterator itr;
for(int i=0; i<n; i++){
cin >> cha >> chb;
conv.insert(make_pair(cha,... | #include <bits/stdc++.h>
using namespace std;
long long sum, tmp;
unsigned long long ans;
int i, j, n;
int a[200100];
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= n; i++) {
while (j + 1 <= n && (tmp ^ a[j + 1]) == sum + a[j + 1]) {
tmp ^= a[j + 1];
sum += a[j + ... | 0 | 69,885,273 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
const int INF=1e9;
ll devine(ll x,ll y){
if(x<0&&y<0){
if(x%y... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
int a[500010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin>>s;
int n=s.size()+1;
int nn=0;
int sn=0;
int mn=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='<')nn++;
... | 0 | 31,874,728 |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i =a; i<n; i++)
#define ll long long
using namespace std;
int main() {
int A,B,C; cin >> A >> B >> C;
if (A <= C && B >= C) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
void f(int res , string s){
if(res==0){
cout << s << endl;}
else{
for(char c='a'; c<='c'; c++){
f(res -1, s + c);}
}
}
double nCk... | 0 | 43,999,956 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll ans = 1;
ll x = A;
while(x<=B) {
x *= 2;
ans++;
}
ans--;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
vector<pair<int, int> > adj[k];
int dist1, dist2, weight;
for (int i = 0; i < k; i++) {
dist1 = (i * 10) % k;
weight = 0;
if ( dist1 != i ) {
adj[i].push_back(make_pair(dist1, weight));
}
dist2 = (i + 1) % k;... | 0 | 70,700,367 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S, T;
cin >> N >> S >> T;
for (int i = 0; i < N; i++) {cout << S.at(i) << T.at(i);}
} | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod... | 0 | 33,070,033 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv)
{
ll N; cin >> N;
ll res{0};
for (ll i = 0; i < N; ++i)
{
ll a, b; cin >> a >> b;
res += b - a + 1;
}
std::cout << res << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 0 | 85,631,417 |
#include <bits/stdc++.h>
int main() {
std::string S;
std::cin >> S;
if (S[0] == S[1] && S[2] == S[3] && S[0] != S[2]) {
std::cout << "Yes" << std::endl;
return 0;
}
if (S[0] == S[2] && S[1] == S[3] && S[0] != S[1]) {
std::cout << "Yes" << std::endl;
return 0;
}
... | #include <iostream>
#include <list>
#include <vector>
#include <climits>
#include <cmath>
using namespace std;
struct Ten{
double X;
double Y;
};
void out(Ten t){
cout << t.X << " "<<t.Y <<endl;
}
void solve(Ten P1, Ten P2 ,int n){
if(n ==0){
return;
}
Ten s;
Ten u;
Ten t;
Ten v;
v.X=(P2.X-P1.X)/3;
v.Y=(P... | 0 | 1,659,907 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define IOI 101
#define IOIOIOIOI 101010101
int dp[10 * IOI][10 * IOI];
string s, t;
int main() {
for (int i = 0; i < 10 * IOI; i++) {
for (int j = 0; j < 10 * IOI; j++) {
dp[i][j] = IOIOIOIOI;
}
}
cin >... | #include <bits/stdc++.h>
typedef struct Node {
Node *left, *right;
int data;
} Node;
Node base;
void Node_init() {
base.right = &base;
base.left = &base;
return;
}
void Node_insert(int x) {
Node *node = new Node();
node->data = x;
node->right = base.right;
node->left = &base;
base.right->left = no... | 0 | 3,434,441 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
B[i] = A[i];
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
int fst = B[0], sec = B[1... | 0 | 22,711,517 |
#include<bits/stdc++.h>
using namespace std;
struct card {char suzi, mozi;};
card hozon[36];
int hyozi(card hai[36],int a){
for(int i = 0;i<a-1;i++){
cout<<hai[i].mozi<<hai[i].suzi<<" ";
}
cout<<hai[a-1].mozi<<hai[a-1].suzi<<endl;
}
int kakunin(card hai[36],card hozon[36],int a){
for(int i = 0;i<a;i++){
if(hai[... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int x1 , y1 , x2 , y2 ;
cin >> x1 >> y1 >> x2 >> y2 ;
int a=abs(x1-x2);
int b=abs(y1-y2);
int x3 , y3 , x4 , y4 ;
if(x1<=x2&&y1<=y2){
x3=x2-b;
y3=y2+a;
x4=x3-a;
y4=y3-b;
}
if(x1<=x2&&y1>=y2){
x3=x2+b;
y3... | 0 | 39,830,598 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
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 c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 0 | 38,393,946 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
#include<math.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
ll x, y;
cin >> x >> y;
ll ans = 1e18;
rep(d1, 2) r... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, K; cin >> n >> K;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
vector<long long> acc(n + 1);
for (int i = 0; i < n; i++) acc[i + 1] = acc[i] + a[i];
long long ans = 0;
for (int k = 40; k >= ... | 0 | 89,519,151 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> H(N);
for (int i = 0; i < N; i++) cin >> H[i];
vector<int> G[N];
for (int i = 0; i < M; i++) {
int A, B; cin >> A >> B;
G[A-1].push_back(B-1);
G[B-1].push_back(A-1);
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 0 | 1,436,897 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, K;
cin >> n >> K;
string s;
cin >> s;
vector<int> v;
v.push_back(0);
for (int i = 1; i < n; i++)
{
if(s[i]!=s[i-1])
{
v.push_back(i);
}
... | #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() {
string s, t;
cin >> t;
ll k;
cin >> k;
s=t;
if(s==string(s.size(),s[0])) {
cout << s.size()*k/2 << endl;
return 0;
}
ll ans=0;
for(int i=1; s... | 0 | 24,742,736 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num, max, a, b=0;
cin >> num >> max;
vector<long long> list2;
for (long long i=0; i<num; i++) {cin >> a; list2.push_back(a);}
sort(list2.begin(),list2.end());
reverse(list2.begin(),list2.end())... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long lon... | 0 | 26,267,369 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include<bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int h, w, k, ans = 0;
cin >> h >> w >> k;
vector<vector<int>> grid(h, vector<int>(w)), tmp(h, vector<int>(w));
vector<int> H(h);
vector<int> W(w);
for (int i = 0; i < h; i++) H[i] = i;... | 0 | 40,653,347 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e+9 + 5;
const int MAX = 205;
vector<vector<ll> > d(MAX, vector<ll>(MAX, INF));
void floyd() {
for (int k = 0; k < MAX; k++) {
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX;... | 0 | 32,380,928 |
#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
int N; cin >> N;
while(N) {
int x = N%10;
if(x==7) {
cout << "Yes" << endl;
return 0;
}
N/=10;
}
... | 0 | 50,066,509 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define cerr if(1)cerr
#define size(x) (int)x.size()
const int N = 1e6 + 1;
ll a, b;
void solve() {
cin >> a >> b;
if (a > b) swap(a, b);
ll c = sqrt(a * b);
if (c * c == a * b) c--;
if (a == b) cout << 2 * (a - 1);
else if (a + 1 == b) cout << 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> ans(2);
if(n%2 == 1){
for(int l = 1, r = n-1; l < r; l++, r--){
ans.at(0).push_back(l);
ans.at(1).push_back(r);
}
}
else{
bool flag = false;
for(int l = 1, r = n-1; l < r; ... | 0 | 92,628,421 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
long long N;
long long A[200005];
int main(){
cin >> N;
for(long long i = 0; i < N; i++) {
cin >> A[i];
}
set<long long> aset;
for(long long i = 0; i < N; i++) {
if(aset.count(A[i]) != 0) {
cout << "NO" << endl;
return 0;
}
aset.insert(A[i]);
}
cout << "... | 0 | 20,157,592 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int n,m,k;
char a[6][6];
char b[6][6];
void same()
{
for(int i= 0 ;i<n ;i++)
{
for(int j =0 ; j<m ;j++)
b[i][j] = a[i][j];
}
}
void set2(int i , int j)
{
for(int x = 0 ; x < n ; x++)
{
if(i & (1<<x))
{
... | #include <bits/stdc++.h>
using namespace std;
void solve () {
int n;
cin >> n;
unordered_map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mp[x]++;
if (mp[x] > 1) {
cout << "NO";
return;
}
}
cout << "YES";
}
int main(... | 0 | 18,060,674 |
#include <iostream>
using namespace std;
using ULLint = unsigned long long int;
int main() {
ULLint ans = 1; int n; cin >> n;
for (int i = n; i > 0; i--) ans = ans * i;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
bool g[10][10];
int main() {
int n,m;
cin >> n >> m;
rep(i,m) {
int a,b;
cin >> a ... | 0 | 29,751,935 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | 0 | 2,677,682 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
long long max_A = A[0], ans = 0;
for (int i = 1; i < N; ++i) {
if (A[i] < max_A) {
ans += max_A - A[i];
} else {
max_A = A[i];
}
}
... | #include<bits/stdc++.h>
#define int long long int
#define pb push_back
#define inf 1e9
#define pp pop_back
#define pii pair<int,int>
#define vec vector<int>
#define mp make_pair
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
i... | 0 | 17,321,131 |
#include <stdio.h>
#include <ctype.h>
int main(void)
{
char str;
int num;
int cou[26];
int i;
char alp;
for(i=0; i<26; i++){
cou[i] = 0;
}
while(scanf("%c",&str) != EOF){
if(isalpha(str)){
if(isupper(str)){
str = tolower(str);
}
num = str - 'a';
cou[num]++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int count = false;
string s;
for(int i = a; i <= b; i++) {
int temp = i, c = true;
int val = 0;
while(temp) {
int r = temp % 10;
temp /= 10;
s[val] = r + '0... | 0 | 76,126,452 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (int i = 0; i < A; ++i) cin >> a[i];
for (int i = 0; i < B; ++i) cin >> b[i];
int mina = INT_MAX;
for (int i = 0; i < A; ++i)
mina = min(mina, a[i]);
int minb =... | #include <stdio.h>
int main(void){
int high[10]={0}, ans[3]={0,-1,-2};
int i,l;
for(i=0; i<10; i++)
scanf("%d",&high[i]);
ans[0]=high[0];
if(ans[0]<high[1]){
ans[1]=ans[0];
ans[0]=high[1];
}else{
ans[1]=high[1];
}
for(i=2; i<10; i++){
if(ans[2]<high[i]){
if(ans[1]<high[i]){
if(ans[0]<high[i]){
... | 0 | 2,262,834 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.