code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,k;
cin>>k>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.end());
int ans=a[0]+k-a[n-1];
for(int i=1;i<n;i++) ans=max(ans,a[i]-a[i-1]);
ans=k-ans;
cout... | #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-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
string s, t;
cin >> s >> t;
int _s = s.size(),... | 0 | 46,881,079 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | #include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i, n) for(int i = 0;i < (n);i++)
#define lint long long
const lint mod=1e9+7;
const lint inf=2.19e15+1;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return fals... | 0 | 7,305,822 |
#include<iostream>
#include<cstring>
using namespace std;
struct Node
{
int data;
Node* next;
Node* prev;
};
class List
{
private:
Node* mother;
public:
List();
~List();
void Ins(int);
void Del(int);
void DelFirst();
void DelLast();
void Show();
};
List::List()
{
mother = new Node;
mother->data = -1;
moth... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<vector<bool>> l(n, vector<bool>(10)), r(n, vector<bool>(10));
l[0][s[0] - '0'] = true;
for(int i=1;i<n;i++){
for(int j=0;j<10;j++){
l[i][j] = l[i-1][... | 0 | 1,891,500 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,ans;
ans=1;
cin>>n;
vector<long long> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
for(int i=0;i<n;i++){
if(a.at(i)==0){
ans=0;
}
}
for(int i=0;i<n;i++){
if(ans!=0 && ans!=-1){
if(1000000000000000000/ans>... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 19,848,442 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
struct Info{
Info(int arg_a,int arg_b){
a = arg_a;
b = arg_b;
}
int a,b;
};
int main(){
int N,... | #include<bits/stdc++.h>
int main(){
int n;std::cin>>n;
std::vector<long long>a(n+2);
for(int i=0;i<n;i++){
std::cin>>a.at(1+i);
}
std::vector<int>ord(n);
std::iota(ord.begin(),ord.end(),1);
std::sort(ord.begin(),ord.end(),[&a](int x,int y){return a.at(x)>a.at(y);});
int N=1;while... | 0 | 52,234,869 |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#de... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | 0 | 75,394,195 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll dis[150][150];
int main()
{
int n,m;
while(cin>>n>>m){
for(int i = 0;i < n;i++)
for(int j = 0;j < n;j++)
... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 48,163,607 |
#include <stdio.h>
#include <iostream>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string.h>
#include <limits.h>
#include <map>
#include <string>
#include <bitset>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | 0 | 47,021,203 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x = y... | #pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
string per(int n) {
string s;
if (n == 0) {
s += '0';
return... | 0 | 63,969,158 |
#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;
cin >> N;
vector<int> C(N-1), S(N-1), F(N-1);
rep(i,N-1) cin >> C.at(i) >> S.at(i) >> F.at(i);
for (int i = 0; i < N; ++i) {
if (i =... | #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 | 73,282,930 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
int cnt = 0;
REP(i, 10) {
auto posA = find(s.begin(), s.end(), i + '0');
if (posA != s.end()) {
REP(j, 10) {
auto posB = find(posA+1, s.end(), j + '0');
if (... | #include <bits/stdc++.h>
using namespace std;
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
int main(){
int N, M;cin>>N... | 0 | 3,735,116 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<n;i++)
#define repr(i,n) for(ll i=n;i>0;i--)
#define all(v) v.begin(),v.end()
#define in cin>>
#define out cout<<
#define en <<endl
const ll INF = 10000000000000;
int main()
{
ll ... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<map>
using namespace std;
#define int long long
#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long
map<pair<i... | 0 | 47,446,299 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
string strs[]={
"dream",
"dreamer",
"erase",
"eraser"
};
bool dp[100001]={true};
for(int i=0;i<s.size();i++){
for(auto e:strs){
int n=i+e.size();
if(n<=s.size()&&!s.compare(i,e.size(),e)){
... | #include<iostream>
#include<algorithm>
using namespace std;
bool IsPrime[1000000];
int PrimeNum[1000000];
int main()
{
for (int i = 0; i < 1000000; i++)
{
IsPrime[i] = true;
}
int count = 0;
PrimeNum[0] = PrimeNum[1] = 0;
for (int i = 2; i < 1000000; i++) {
if (IsPrime[i]) {
... | 0 | 85,563,678 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long t,b,c,d,n,m,i,x,y;
cin>>n;
string s,a,aa;
cin>>s;
if(n%2){cout<<"No"<<endl;}
else
{
x=n/2;
for(i=0;i<x;i++)
{
a+=s[i];
}
for(i=x;i<n;i++)
{
aa+=s[i];
}
if(aa==a)cou... | 0 | 94,256,627 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b && b < c) {
cout << "Yes"
<< "\n";
} else {
cout << "No"
<< "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int >
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define ll long l... | 0 | 70,614,407 |
#include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = prior... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define MAXN 105
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORR(j, i, n) for (int i = j; i < n; i++)
#define FORD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOBIR(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp m... | 0 | 12,792,302 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<stack>
#include<cmath>
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string key="keyence";
int lnth=s.length();
for(int i=0;i<=7;i++){
bool ans=true;
int ind=0;
for(int j=0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string S;
cin >> S;
vector<bool>al(26, false);
for (char s : S) al[s-'a'] = true;
if (S.size() == 26) {
int i = S.size()-1;
while (S[i-1] > S[i]) {
... | 0 | 62,280,363 |
#include <iostream>
#include <ctime>
using namespace std;
int N,M;
void solve()
{
cin >> N >> M;
int X = 1900 * M + 100 * (N-M);
while (M > 0){
X *= 2;
--M;
}
cout << X << endl;
}
int main()
{
cin.tie();
ios::sync_with_stdio(false);
solve();
return 0;
} | #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>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | 0 | 17,531,059 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void) {
while (true) {
string str;
getline(cin,str);
if (str[0] == '.') break;
bool flag = true;
stack<int> s;
for (size_t i = 0; str[i] != '\0'; i++) {
int c = str[i];
if (c == 40) {
s.push(0);
}
el... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 60,191,431 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int ans=s.size(),n=s.size();
rep(i,2){
int cnt=0;
rep(j,n){
if(j%2==0&&s[j]!=(char)(i+'0'))cnt++;
if(j%2==1&&s[j]==(c... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#include<string>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main(){
map<string,int> mp;
int N; cin >> N;
ll tmp, ans;
for(int i=0; i<N; i++){
string s;... | 0 | 46,586,658 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n,m;
cin >> n >> m;
priority_queue<ll> q;
rep(i,n){
ll a;
cin >> a;
q.push(a);
}
while(m>0){
ll t = q.top... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 3e5 + 20;
int pos[maxn] , a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i] , a[i]-- , pos[a[i]] = i;
set<int> st;
st.... | 0 | 67,548,123 |
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#inclu... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <iomanip>
#define PI 3.1415926535
using namespace std;
int n, a = 0, b = 0;
string s, t;
int main(){
cin >> n;
for (int i = 0; i < n;... | 0 | 24,493,826 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#define For(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); (i)--)
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
ty... | # include <bits/stdc++.h>
# define rep(i, n) for (ll i = 0; i < (n); i++)
# define reps(i, n) for (ll i = 1; i <= (n); i++)
# define foreps(i, m, n) for (ll i = (m); i < (n); i++)
# define len(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
... | 0 | 88,075,212 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 0 | 78,873,728 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int LOGN=20;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<ll> x(n);
for(int i=0;i<n;i++) cin>>x[i];
ll l; int q;
cin>>l>>q;
vector<vector<int>> dp(LOGN,vector<int>(n,0));
for(int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 73,299,497 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a<b && b<c)puts("Yes");
else puts("No");
} | #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... | 0 | 82,689,433 |
#include<stdio.h>
int prime[1000000];
int main(){
prime[0]=-1;
prime[1]=-1;
for(int i=2;i<1000000;i++){
if(prime[i]==0){
prime[i]=1;
for(int j=i*2;j<1000000;j+=i)prime[j]=-1;
}
}
int now;
while(~scanf("%d",&now)){
int ans=0;
for(int i=1;i<n... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int m = 61;
int n;
vector<bitset<m>> gaussian_elimination(vector<bitset<m>> b) {
vector<bitset<m>> c(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) c[i][j] = b[i][m - 1 - j];
}
int x = 0;
for (int i = 0; i < n && ... | 0 | 96,240,715 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<int, PII> PIP;
const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 1000 + 10;
int n, m;
void prework(){
}
void read(){
}
char CH[5] = {'R', 'Y', 'G', 'B', 'R'};
int f[MAXN][MAXN];
int g[MAXN][MAXN][... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, P;
cin >> N >> P;
vector < int >A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int oddCount = 0, evenCount = 0;
for (int i = 0; i < N; i++) {
if (A[i] % 2 == 0) {
evenCount++;
} else {
oddCount++;
}
}
if (oddCount == 0) {
if ... | 0 | 20,051,496 |
#include <iostream>
using namespace std;
int main () {
int h,w,c1=0,c2=0,c=0;
char a[110][110];
cin >> h >> w;
for (int i=1;i<=h;i++)
{
for (int j=1;j<=w;j++)
{
cin >> a[i][j];
}
}
for (int i=1;i<=h;i++)
{
for (int j=1;j<=w;j++)
{
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 50,787,598 |
#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;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T>... | 0 | 73,262,512 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string number;
while (cin >> number, number != "0") {
int sum = 0;
for (int i = 0; i < number.size(); i++) {
sum += number[i] - '0';
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n, m;
ll a[2005], b[2005];
ll d[2005][2005], e[2005][2005];
int main()
{
scanf("%lld%lld", &n, &m);
for(ll i = 1; i <= n; i++) scanf("%lld", &a[i]);
for(ll i = 1; i <= m; i++) scanf("%lld", &b[i]);
... | 0 | 28,842,966 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
class WeightedGraph
{
private:
const int INF = 1e9;
int m... | #include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K, Rock, Scissor, Paper;
string T;
cin >> N >> K >> Rock >> Scissor >> Paper >> T;
enum Janken : int32_t { kRock, kScis... | 0 | 77,799,736 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
int mi=int(to_string(n).size());
for(long long i=1;i*i<=n;i++){
if(n%i==0){
mi = min(max(int(to_string(i).size()), int(to_string(n/i).size())),mi);
}
}
cout << mi << '\n';
} | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
typedef long long int ... | 0 | 71,644,101 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> Button(N);
for (int i = 0; i < N; i++) {
int z;
cin >> z;
--z;
Button.at(i) = z;
}
int cnt = 0;
int tmp = 0;
for (;;) {
if (tmp == 1) {
cout << cnt << endl;
break;
}
if (cnt >= N) {
cout << "-1" << end... | #include <iostream>
#include <algorithm>
using namespace std;
int h, w, d;
char color[] = {'Y', 'R', 'G', 'B'};
int main() {
cin >> h >> w >> d;
if (d == 1) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ((i + j) % 2 == 0) {
cout << 'B';
... | 0 | 63,074,194 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | 0 | 74,852,164 |
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
void solve() {
char a[50][50], b[50][50];
int n, m;
bool match = false;
cin >> n >> m;
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
for(... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 92,181,377 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
printf("%dx%d=%d\n", i, j, i*j);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
const int N = 2e5 + 5;
int par[N], sz[N];
int n, m;
void init() {
for (int i = 1; i < N; i++) {
par[i] = i;
sz[i] = 1;
}
}
int find(int u) {
return par[u] == u ? u : par[u] = find(par[u]);
}
void make(in... | 0 | 12,691,091 |
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005;
vector<int> v[maxn];
int dfs(int root, int fa) {
int ret = 0;
for (int i = 0;i < v[root].size();i++) {
int to = v[root][i];
if (to == fa) continue;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod2=1000000007;
ll mod=998244353;
ll inf=1000000000000000000;
double pi=2*acos(0);
#de... | 0 | 47,471,879 |
#include <iostream>
#include <vector>
using namespace std;
typedef pair<char, char> P;
void solve()
{
int n;
while(cin >> n, n)
{
vector<P> trans(n);
for(int i = 0; i < n; ++i)
{
cin >> trans[i].first >> trans[i].second;
}
int num;
cin >> num;
vector<char> c(num);
for(int i = 0; i < num; ++i)
{
... | #include<bits/stdc++.h>
#define ll long long
#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(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | 0 | 30,031,591 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#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++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n, a, b;
cin >> n >> a >> b;
vector<ll> p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<18,INF=1<<30;
int main(){
string ans;
cout<<"? 49999999999"<<endl;
char a;cin>>a;
if(a=='Y'){
for(int i=1;i<=4;i++){
cou... | 0 | 19,920,699 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
int main (){
int n, m;
cin >> n >> m;
if(n % 3 == 0 || m % 3 == 0 || (n+m) % 3 == 0){
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 0 | 46,519,189 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
if(h2 == 0) h2 += 24;
cout << (h2 * 60 + m2) - (h1 * 60 + m1) - k << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N>>M;
vector<vector<ll>> vec(N,vector<ll>(0));
for(ll i=0;i<M;i++) {
ll a,b;
cin>>a>>b;
vec[a-1].push_back(b);
vec[b-1].push_back(a);
}
vector<ll> A(N);
for(ll i=0;i<N;i++)... | 0 | 6,496,188 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
string S;
cin >> S;
long long dp[N];
long long pow_10 = 1;
for (int i = N - 1; i >= 0; i--){
if (i == N - 1) dp[i] = (S[i] - '0') % P;
else {
dp[i] = dp[i + 1] + (S[i] ... | #include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
bool isPrime(int n){
if(n < 2){
return 0;
}
if(n%2 == 0){
return n==2;
}
for(int i=3;i*i<=n;i++){
if(n%i == 0) return 0;
}
return 1;
}
int main() {
string s,t... | 0 | 78,384,567 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
int d;
while (scanf("%d", &d) != EOF) {
long sum = 0;
for (int i=d; i<600; i+=d) {
sum += d*pow(i, 2);
}
cout << sum << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | 0 | 24,705,378 |
#define scanf_s scanf
#include <string>
#include <stdio.h>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <iostream>
using namespace std;
#define PI 3.14159265358
#define _rag(x) (x) * (PI / 180)
void fractale(int n, double p1x, double p1y, double p2x, double p2y)
{
if (... | #include <bits/stdc++.h>
#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(), (a).end()
#define... | 0 | 15,104,488 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
template<class T> inline b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
const int S = 1e9;
int main() {
ll s;
cin >> s;
ll x3, y3;
y3 = (s + S - 1) ... | 0 | 97,974,592 |
#include <iostream>
using namespace std;
int w, h, x, y, r;
void readInput() {
cin >> w >> h >> x >> y >> r;
}
bool isOver() {
if ((x - r) < 0) return true;
if ((x + r) > w) return true;
if ((y - r) < 0) return true;
if ((y + r) > h) return true;
return false;
}
int main() {
readInput();
if (isOver()) {
cout ... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> xy_t;
xy_t a, b, c, p;
double x1, x2, x3, xp, y_1, y2, y3, yp;
double s1, s2, s3;
int main()
{
while(cin >> x1 >> y_1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp)
{
a=xy_t(x1, y_1);
b=xy_t(x2, y2);
c=xy_t(x3, y3);
p=xy_t(xp, yp);
s1=(conj(a-p)*(b... | 0 | 79,811,262 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define vi vector<int>
#define all(a) a.begin(),a.end()
typedef pair<int,int> P;
const long long mod=1000000007;
const long long inf=1ll<<61;
int a[100006],b[100006];
P ab[100006];
signed main(){
int n,m;cin>>n... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
i... | 0 | 43,961,650 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> ppl;
#define ain(a,n) for(ll i=0;i<(n);++i) cin>>(a)[i];
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define... | 0 | 14,662,346 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#includ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 36,324,206 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3,y3,x4,y4;
int n = x2 - x1;
int m = y2 - y1;
if (n >= 0) {
if (m >= 0) {
x3 = x2 - m;
x4 = x3 - n;
y3 = y2 + n;
y4 = y3 - m;
}
else {
x3 = x2 - m;
x4... | #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 <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 68,080,774 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int n, k;
ll ans;
map<int, int> M;
ll norm(ll x) { return (x % k + k) % k;}
ll a[maxn];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++i) scanf("%lld", &a[i]), a[i] += a[i - 1];
M[0] = 1;
for(int i = 1; i <=... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 76,625,870 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b;
cin >> a >> b;
bool flag = true;
if(a % 3 != 0 && b % 3 != 0 && (a+b) % 3 != 0) {
flag = false;
}
if(flag) cout << "Pos... | #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)
#define rre... | 0 | 42,708,766 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum = 0;
int Max = 0, Min = 1000;
rep(i, n) {
int s; cin >> s;
Max = max(Max, s);
Min = min(Min, s);
sum += s;
}
cout << (sum - Max - Min) / (n - 2) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2002;
const LL MOD = 1e9 + 7;
int n, k, a[N];
int main() {
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%d",&a[i]);
}
int cnt=0;
for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)if(a[i]>a[j])cnt++;
LL ans = 1LL * cnt * k % MOD;
... | 0 | 87,085,276 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL IN... | 0 | 16,452,006 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include <bits/stdc++.h>
using namespace std;
bool f(string s){
for(int i=0; i<s.size(); ++i){
if(s[i]!='.'){return false;}
}
return true;
}
bool g(const vector<string> &s, int j){
for(int i=0; i<s.size(); ++i){
if(s[i][j]!='.'){return false;}
}
return true;
}
int main(){
int... | 0 | 25,428,057 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 2,836,495 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <bits/stdc++.h>
#define spc ' '
#define endl '\n'
using namespace std;
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
long long ans = k;
for(int i = 0; i < n; i++){
if(i==0) continue;
ans*=k-1;
}
cout << ans;
return 0;
} | 0 | 75,247,839 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #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;
typedef pair<ll,ll> P;
#define a firs... | 0 | 35,507,432 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll odd(ll x){ return (x+1)/2 % 2;}
ll cal(ll x){
if(x%2==1) return odd(x);
else return odd(x+1) ^ (x+1);
}
int main() {
... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
vector<int> enum_div(int n){
vector<int>... | 0 | 71,307,571 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q,h,s,d,n;
cin>>q>>h>>s>>d>>n;
long long ans=0;
long long two=min({q*8,h*4,s*2,d});
long long x=n/2;
n%=2;
ans+=two*x;
if(n%2==0) cout<<ans<<endl;
else cout<<min({ans+q*4,ans+h*2,ans+s})<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 0) {
} else {
A--;
}
A /= 2;
B += A;
} else {
if (B % 2 == 0) {
} else {
B--;
}
B /... | 0 | 19,690,462 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = b * (n - 1) + a - (a * (n - 1) + b) + 1;
cout << max(0ll, ans) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int h,w,m;
cin >> h >> w >> m;
vector<pair<int,int>> t;
vector<long>a(h),b(w),e(h),f(w);
rep(i,m){
int c,d;
cin >> c >> d;
c--;d--;
t.emplace_back(c,d);
... | 0 | 8,871,406 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
vector<int> grafo[MAXN];
ll dp[MAXN][2];
int N;
ll solve(int v,int c,int p)
{
if(dp[v][c] != -1)
return dp[v][c];
ll tot = 1;
for(int u : grafo[v])
{
if(u == p)
conti... | 0 | 50,673,591 |
#include <bits/stdc++.h>
#include <iterator>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<long long>
#define vpi vector<pair<int,int> >
#define ll long long
#define sz(a) int(a.size())
#define... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_std... | 0 | 54,635,487 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #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(v) v.begin(), v.end()
int64_t gcd(int64_t a, int64_t b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int64_t ... | 0 | 38,247,999 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int n,r,f=0;
cin>>n;
while(n!=0)
{
r=n%10;
n=n/10;
if(r==7)
f++;
}
if(f==0)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_... | 0 | 78,308,447 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if( s[0] != 'A')
{
cout<<"WA";
return 0;
}
int count =0;
for(int i=2;i<=s.length() -2;i++)
{
if(s[i] =='C' )
count++;
}
if( count != 1)
{
cout<<"WA";
... | 0 | 20,486,324 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void solve(int n, vector<int>& arr) {
unordered_map<int, vector<int>> mp;
for (int i=0; i<n; i++) mp[arr[i]].push_back(i);
if (mp[1].size() == 1) {
cout << 1;
return;
}
if (mp[1].size() > 1) {
cout << 0;
return;
}
int cnt = 0;
for (auto a... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define i... | 0 | 19,113,343 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(... | #include <iostream>
#include <string>
using namespace std;
bool isAC(const string &S) {
if (S[0] != 'A') return false;
int cnum = 0;
bool exist = false;
for (int i = 1; i < S.size(); ++i) {
if (i >= 2 && i + 1 < S.size() && S[i] == 'C') ++cnum;
if (S[i] >= 'A' && S[i] <= 'Z' && S[i] !=... | 0 | 81,571,022 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define vecsort(v) sort(v.begin(),v.end())
#define lcm(x,y) (x/__gcd(x,y))*y
#define forn(i,n) for(i = 0 ; i < n ; i+... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cstring>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<vi> vvi;
const i... | 0 | 27,833,384 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <function... | 0 | 91,041,296 |
#include <iostream>
#define int long long int
using namespace std;
signed main()
{
int a, b, k;
cin >> a >> b >> k;
if (k <= a)
a -= k;
else
{
b -= (k - a);
a = 0;
}
if (b < 0)
b = 0;
cout << a << " " << b << endl;
return 0;
} | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? ... | 0 | 5,263,978 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,X,Y;
cin >> n >> m >> X >> Y;
vector<int> x(n),y(m);
for(int i=0;i<n;++i) cin >> x[i];
for(int i=0;i<m;++i) cin >> y[i];
bool ok=true;
if(Y-X<1) ok=false;
if(!ok){
cout << "War" << endl;
return 0;
}
sort(x.begin(),x.end());
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 0 | 93,158,701 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, K;
cin >> N >> K;
vector<int> a(N);
for ( int i = 0; i < N; i++ ) {
cin >> a.at(i);
}
for ( int ki = 0; ki < K; ki++ ) {
vector<int> new_a(N+1);
for ( int i = 0; i < N; i++ ) {
int l = max(... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 93,284,791 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string ... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 82,388,863 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define int ll
const int N = 110;
int k, dp[N];
int solve(string s){
int n = s.size();
for(int i=0 ; i<n ; i++){
int cur = 1e9;
for(int j=i-1 ; j>0 ; j--){
if(s[j] == s[j-1]){
cur = min(cur, dp[j]);
cur = min... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, M, ... | 0 | 90,420,331 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<string> str(... | 0 | 49,694,237 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
sort(a, a + n);
int m = a[n-1];
for (int i=1; i<n-1; i++) {
if (a[i] >= 0) {
m += a[i];
} else {
m -= a[i];
}
}
m -= a[0];
cout<<m<<endl;
int left = a[0];
... | #include<bits/stdc++.h>
#define ll long long
const int maxn = int(1e5) + 7;
using namespace std;
ll inf=1e9+7;
ll a[900009];
ll sum[20];
int main()
{
ll h,w,n;
scanf("%lld%lld%lld",&h,&w,&n);
ll x,y;
int k=0;
ll zo=(h-2)*(w-2);
for(ll i=1;i<=n;i++)
{
scanf("%lld%lld",&x,&y);
... | 0 | 81,345,449 |
#include <bits/stdc++.h>
using namespace std;
const string M[] = {"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
in... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 71,431,720 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
int i, t;
do{
cin >> s;
if ((int)s[0]-48 == 0)
break;
i = 0, t = 0;
while (s[i])
{
t += ((int)s[i] - 48);
i++;
}
cout << t << endl;
} while (1);
return 0;
} | #include<iostream>
using namespace std;
int n, s;
int cou;
void dfs(int i, int sum,int num_of_add) {
if (sum == s&&num_of_add==n) {
cou++;
return;
}
if (n == num_of_add||i==10)return;
dfs(i + 1, sum, num_of_add);
dfs(i + 1, sum + i, num_of_add + 1);
}
int main() {
while (cin >> n >> s,n != 0 || s != 0) {
co... | 0 | 42,888,405 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int cnt = 0;
for(int i = 1; i <= n; i++){
string s = to_string(i);
if(s.size()%2 != 0) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | 0 | 77,743,978 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int number;
cin >> number;
int digit = 10;
int divider = number % digit;
for (int i = 0; i<7; i++){
if(number / digit)divider += (number % (digit*10))/digit;
digit *= 10;
}
if(number%divider == 0){
cout << "Yes... | #include<iostream>
using namespace std;
struct Card{ char suit;int value; };
void bubbleSort(struct Card A[], int N){
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(A[j].value < A[j-1].value){
struct Card t = A[j];
A[j] = A[j-1];
A[j-1] = t;
}
}
}
}
void selectionSort(struct Card A[], int N){
... | 0 | 26,575,027 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,a,b;
cin>>n;
std::deque<long long int> A;
std::deque<long long int> B;
for (int i=0;i<n;i++) {
cin>>a;
A.emplace_back(a);
cin>>b;
B.emplace_back(b);
}
long long int tmp=0;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 | 16,366,290 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define ... | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n,d;
cin>>n>>d;
vector<vector<i... | 0 | 71,380,597 |
#include <iostream>
#include <vector>
using namespace std;
vector<int> v;
const long long MAX = 1e15;
vector<vector<long long>> dp;
signed main(){
int n, k;
cin >> n >> k;
v.resize(n+1);
dp.resize(n+1);
for(int i = 0; i <= n; i++){
dp[i].resize(k+1,MAX);
if(i)cin >> v[i];
}
d... | #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 <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 65,725,807 |
#include<stdio.h>
int main(){
int N;
char D[10][7]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
scanf("%d",&N);
for(int iii=0;iii<N;iii++){char x[1025]={};
scanf("%s",x);
int d=0;char pp;int y=0;
for(int i=0;i<1024;i++)
{if(x[i]!='0'&&x[i-1]==x[i]){d++;if(D[y][d]==NULL){d=0;}}
else if(x[i]!='0'&&x[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 56,572,200 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 47,472,093 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
void solve()
{
int a,b,i;
cin>>a>>b;
if(a<b){
for(i=1;i<=b;i++) cout<<a;
return;
}
else{
for(i=1;i<=a;i++) cout<<b;
return;
}
}
int main()
{
solve();
} | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | 0 | 86,581,509 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 18,086,890 |
#pragma comment (linker, "/STACK:526000000")
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 45,132,050 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string s;
cin>>s;
int ans=0;
int tmp=0;
for(int i=0;i<3;i++){
if(s[i]=='R')
tmp++;
else{
ans=max(ans,tmp);
tmp=0;
}
}
ans=max(ans,tmp);
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 1000000000000000000;
const doub... | 0 | 4,812,604 |
#include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define mm(arr) memset(arr, 1, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
using namespace std;
int main(... | #include<iostream>
#include<cmath>
using namespace std;
int main(){
double x1,x2,x3,x4,y1,y2,y3,y4;
double abx,aby,cdx,cdy,abr,cdr;
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
abx=x1-x2;
aby=y1-y2;
cdx=x3-x4;
cdy=y3-y4;
abr=sqrt(abx*abx+aby*aby);
cdr=s... | 0 | 27,479,473 |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long ll;
#define pb push_back
int main()
{
ios_base::sync_with_... | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | 0 | 28,662,167 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool AC=true;
if (S[0]!='A') AC=false;
int count=0;
for (int i=2; i<S.length()-1; i++){
if (S[i]=='C') count++;
}
if (count!=1) AC=false;
int COUNT=0;
for (int i=0; i<S.length(); i++){
if (S[i]>='A' && S[i]<='Z') COUNT++;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
ll price[4];
rep(i,4){
cin >> price[i];
}
price[0] *= 4; price[1] *= 2;
ll price_1L(min({price[0],price[1],price[2]}));
ll n; ... | 0 | 65,800,268 |
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
struct Node{
int parent;
int depth;
vector<int> children;
};
void solve(vector<struct Node> &node, int x){
for(int i=0;i<node[x].children.size();i++){
node[node[x].children[i]].depth += node[x].depth + 1;
solve(node, node[x].children[... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
bool compare(const pair<int,int> &A,const pair<int,int> &B){
if(A.first!=B.first) return A.first<B.first;
else return A.second<B.second;
}
int main(void){
int n;
while(cin>>n,n){
vector<pair<int,in... | 0 | 26,897,949 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n + 1; i++)
{
ll min, max;
min = i * (i - 1) / 2;
max = (i * (2... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <stack>
#include <cstring>
using namespace std;
int main(){
stack<int> garage;
vector<int> out;
int enter;
while(cin >> enter){
if(enter == 0){
out.push_back(garage.top());
garage.pop();
}
... | 0 | 3,988,499 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
struct Node {
unsigned long long int key;
struct Node *next;
struct Node *prev;
};
struct Node * nil;
void init(){
nil = (struct Node*)malloc(sizeof(struct Node));
nil->prev = nil;
nil->next = nil;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 0 | 68,417,672 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+100;
const int MAX = 1E6;
int n;
int a[N];
int G;
bool vis[N],flag;
int prime[N] = {0},num_prime = 0;
bool isNotPrime[N] = {1, 1};
int sieve(int n)
{
for(int i = 2 ; i < n ; i ++)
{
if(! isNotPrime[i])
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 100010
int n;
bool t[N];
unordered_set<int> v[N];
unordered_set<int>::iterator it;
queue<int> Q;
void BFS(int ... | 0 | 96,405,429 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string g;
cin >> g;
int n;
cin >> n;
for(int w=0;w<g.size();w+=n)
{
cout << g[w];
}
cout << "\n";
return 0;
} | #include <cstdio>
using namespace std;
int
main (
)
{
int n;
scanf ( "%d", &n );
while ( n-- )
{
int y, m, d;
int res = 0;
scanf ( "%d%d%d", &y, &m, &d );
while ( y != 1000 || m != 1 || d != 1 )
{
++d;
if ( y % 3 == 0 )
{
if ( d > 20 )
{
d = 1;
... | 0 | 4,448,816 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 69,557,533 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.