code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main() {
int num = 1;
int tmp;
while (1) {
cin >> tmp;
if (tmp == 0)
break;
cout << "Case " << num << ": " << tmp << endl;
num++;
}
} | #include<cstdio>
int main(){
for(int i=0;i<10000;i++){
int x;
scanf("%d",&x);
if(x==0){
break;
}
printf("Case %d: %d\n",i+1,x);
}
} | 1 | 38,104,046 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k;
cin >> a >> b >> c >> k;
int cnt{};
while(a >= b) {
b *= 2;
cnt++;
}
while(b >= c) {
c *= 2;
cnt++;
}
cout << (cnt <= k ? "Yes" : "No" ) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int A, B, C;
int K;
cin >> A >> B >> C;
cin >> K;
for (int i = 0; i <= K; ++i)
{
if (A < B * pow(2, i) && B * pow(2, i) < C * pow(2, K - i))
{
cout << "Yes" << endl;
return 0;... | 1 | 3,527,739 |
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 100000
int main() {
int n, m;
cin >> n >> m;
int l, r ;
int tempL=0, tempR=MAX;
for (int i = 0; i < m; i++) {
cin >> l >> r;
tempL = max(l, tempL);
tempR = min(r, tempR);
}
int ans = tempR - tempL + 1;
if (ans < 0) { ans = 0; }
cou... | #include<iostream>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int L=0, R=N+1;
for (int i = 0; i < M; i++){
int Li, Ri;
cin >> Li >> Ri;
if(Li > L) L = Li;
if(Ri < R) R = Ri;
}
if(L <= R){
printf("%d\n", R - L + 1);
}else
{
printf("0\n");
}
} | 1 | 91,168,454 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
int position[26][MAX],Size[26];
char str[MAX];
vo... | #include <iostream>
#include <string>
int main()
{
std::string s;
std::cin >> s;
int i;
for (i = 0; i < s.size() - 2; i++) {
if (s[i] == s[i + 1] || s[i] == s[i + 2]) {
break;
}
}
if (s[s.size() - 1] == s[s.size() - 2]) i = s.size() - 3;
if (i == s.size() - 2) std... | 1 | 82,094,169 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double p... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll ans = 0;
vector<ll> v;
void sliding_window(string s) {
int left = 0, right = 0;
while(left < s.size()) {
while(right+1<s.size() && s[left]==s[right+1]) {
right++;
}
v.push_back(right-left+1);
... | 1 | 41,651,517 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long sum[200020] = { 0 };
v... | 1 | 98,769,952 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int r;
cin >> r;
if(r < 1200) cout << "ABC" << endl;
if(1200 <= r && r < 2800) cout << "ARC" << endl;
if(2800 <= r) cout << "AGC" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int z;
cin>>z;
if(z<1200) cout<<"ABC"<<endl;
else if(z<2800) cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
} | 1 | 73,267,060 |
#include <iostream>
using namespace std ;
int main()
{
int a[10] ;
while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9]){
for(int i=0;i<10;i++)
{
for(int j=0;j<10-1;j++)
{
if(a[j+1]>a[j])
{
int temp=a[j];
a[j]=a[j+1];
... | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int h1=0, h2=0, h3=0, h;
for(int i=1;i<11;i++){
cin >> h;
if(h>h3){
h3 = h;
if(h3>h2){
swap(h3, h2);
if(h2>h1){
swap(h2, h1);
}
}
}
}
cout << h1 << endl;
cout << h2 << en... | 1 | 7,453,638 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 1, mx = 1;
for(int i = 1; i < n; i++) {
if(s[i-1] == s[i]) {
cnt++;
mx = max(mx, cnt);
} else {
cnt = 1;
}
}
if(mx >= 3) cout << "Yes" << endl;
else cout << "No" << en... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, a1, a2;
cin >> N;
a1 = N / 10;
a2 = N - (N/1000 * 1000);
if(a1 % 111 == 0 || a2 % 111 == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 81,274,236 |
#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(){
ll a,b;
cin >> a >>b ;
cout << lcm(a,b) << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
ll gcd(ll a,ll b)
{
if (b==0LL)
return a;
return (gcd(b,a%b));
}
int main()
{
ll a,b;
scanf("%lld%lld",&a,&b);
ll g=gcd(a,b);
ll val=(a*b)/g;
printf("%lld\n",val);... | 1 | 44,785,083 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 1 | 17,059,265 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
vector<int>num(n);
for(int i=0;i<n;i++)
cin>>num[i];
sort(num.begin(),num.end(),greater<int>());
int min=1000000000;
for(int i=1;i<n;i++){
if(min>num[i-1]-num[i])
min=... | #include <stdio.h>
#include <algorithm>
using namespace std;
int n;
int minn = 200;
int a[1002];
int i;int j;int dif;
int main(){
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++) scanf("%d",&a[i]);
minn = 1000002;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
dif = a[i]-a[j];
if(dif<0) dif*=(-1)... | 1 | 91,269,526 |
#include<stdio.h>
int main()
{
int a[10], b[100] = {0}, bingo=0, x;
scanf("%d%d%d%d%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&x);
for(int i=0;i<x;i++){
scanf("%d",&b[i]);
}
for(int i = 0; i<x;i++){
for(int j=0;j<9;j++){
if(b[i]==a[j]){
... | #include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
vector<int> A(9);
for(int i=0;i<9;i++){
cin>>A[i];
}
int N;
cin>>N;
int b;
vector<int> C(9,0);
for(int i=0;i<N;i++){
cin>>b;
for(int j=0;j<9;j++){
... | 1 | 83,532,639 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
int N;
int a_cnt = 0;
int b_cnt = 0;
int cnt = 0;
int ans = 0;
string s;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s;
if (s[0] == 'B') {
b_cnt++;
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
int cnt1 = 0;
int cnt2 = 0;
int cnt3 = 0;
int cnt4 = 0;
for (auto &v : vec) {
cin >> v;
int tmp = static_cast<int>(v.size());
for (int i = 0; i < tmp - 1; ++i)
... | 1 | 80,096,792 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int l[n], ans = 0;
for(int i=0; i<n; ++i) cin >> l[i];
sort(l, l+n, greater<int>());
for(int i=0; i<k; ++i) ans += l[i];
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector <int> l(N);
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
int ans = 0;
for (int i = 1; i <= K; i++) {
ans += l[N-i];
}
cout << ans << endl;
... | 1 | 62,624,214 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
int n; cin >> n;
vector<int> a(n);
vector<int> b;
rep(i, n)
{
cin >> a[i];
if (i % 2 == 0)
b.p... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, A;cin >> N;
deque<ll> B;
rep(i, 0, N){
cin >> A;
if(i%2 == 0)B.push_back(A);
else B.push_front(A);
}
if(N%2 != 0)reverse(ALL(... | 1 | 25,694,738 |
#include<cstdio>
#include<cstring>
using namespace std;
char s[10001];
int main()
{
gets(s);
for(int i=0;i<strlen(s);i++)
{
printf("%c",s[i]);
if(i==3)
printf(" ");
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
string S; cin >> S;
REP(i,4) cout << S[i];
cout << " ";
FOR(i,4,12) cout << S[i];
cout << endl;
return 0;
} | 1 | 2,091,319 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 1 | 52,931,627 |
#include<iostream>
#include<cstdio>
using namespace std;
void node(int i, int h[]) {
cout << "node " << i << ": key = "<< h[i] << ", ";
}
void parent(int i, int n, int h[]) {
int p = i / 2;
if (p > 0) {
cout << "parent key = " << h[p] << ", ";
}
}
void left(int i, int n,int h[]) {
int l = 2 * i;
if (l <= n) {
... | #include<iostream>
#include<cstring>
using namespace std;
const int maxn=1e6;
int A[maxn];
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i)
{
return 2*i+1;
}
int main()
{
int H;
cin>>H;
memset(A,0,sizeof(A));
for(int i=1;i<=H;i++)cin>>A[i];
for(int i=1;i<=H;i++){
cout<<"node "<... | 1 | 91,079,111 |
#include<bits/stdc++.h>
#include<cstring>
#include<cmath>
#include<iterator>
#include<cstdlib>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define test long long t;cin >> t;while(t--)
#define ses "\n"
#define whp " "
#define mxi 1000000
#define REP(i,a,b) for(int i=a; i<b; i++)
#define rep0(i,n... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long max = 10, z = 1;
while (5*max < 1000000000000000000) {
max *= 5;
z++;
}
if (n % 2 == 0) {
long long count = 0;
while (z > 0) {
if (n / max > 0) {
... | 1 | 7,847,659 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200005;
int n,L,T,p=0,res[N];
int main(){
cin >> n >> L >> T;
for (int i=0,x,w;i<n;i++){
cin >> x >> w;
if (w==1)
res[i]=(x+T)%L,p=(p+(T+x)/L%n+n)%n;
else
res[i]=((x-T)%L+L)%L,p=(p-(T+L-x-1)/L%n+n)%n;
}
sort(res,res+n);
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int N;
ll L,T;
ll X[101010],W[101010],ans[101010];
int main(){
cin>>N>>L>>T;
int id=-1;
L*=2;
T*=2;
rep(i,N){
cin>>X[i]>>W[i];
X[i]*=2;
if(W[i]==1&&id==-1) id=i;
}... | 1 | 75,672,725 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, P;
cin >> N >> P;
int odd = 0;
int even = 0;
for( int i = 0; i < N; i++ ) {
int A;
cin >> A;
if( A % 2 ) odd++;
else even++;
}
long long ans = 0;
if( odd ) {
ans = 1;
for( int i = 0; i < N - 1; i++ ) {
ans *= 2;
}
}
else if( P ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long counter=0;
long long n;
cin>>n;
long long a;
cin>>a;
long long odd=0;
long long asd=0;
for(long long i=0;i<n;i++){
cin>>counter;
if(counter%2==0){
asd++;}
else{
odd++;}}
if(odd==0){
if(a==0){
counter=pow(2,n);
cout<<counter<<endl;}
else{
cout<<0<<endl... | 1 | 22,064,654 |
#include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
int k;
cin >>k;
vector<int> n = {1, 1, 1, 2, 1, 2, 1, 5, 2,... | #include<iostream>
using namespace std;
int main()
{
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
int ans;
cin>>K;
ans=a[K-1];
cout<<ans;
} | 1 | 23,311,479 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a-b>=0) {
cout << a-b << endl;
}
else {
cout << "0" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 1 | 90,382,175 |
#include<stdio.h>
int step(int s,long long a){
if(s==0)return a;
return step(s-1,a*s);
}
int main(){
int n;
scanf("%d",&n);
printf("%lld\n",step(n,1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(fa... | 1 | 16,218,094 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> c, s,... | 1 | 90,038,846 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> x(N), y(N);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
}
ll ans = 8e18;
for (int a = 0; a < N; a++) {
for (int b = a + 1; b < ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;long long x[50],y[50];
cin >>n>>k;
for (int i=0;i<n;i++){
cin >>x[i]>>y[i];
}
long long ans = 9223372036854775807;
for (int i1=0;i1<n;i1++){
for (int i2=0;i2<n;i2++){
for (int i3=0;i3<n;i3++){
for (int i4=0;i4<n;i4++){
... | 1 | 99,411,609 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
ll x, y;
cin >> x ... | #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 req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 1 | 35,499,653 |
#include<iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
using namespace std;
int main()
{
fastio;
long long n,i;
cin>>n;
pair<long long, long long> p[n];
for(i=0;i<n;i++)
{
cin>>p[i].first;
p[i].se... | #include <bits/stdc++.h>
using namespace std;
struct dt
{
int idx, num;
bool operator<(const dt rhs){
return num < rhs.num;
}
}s[100005];
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> s[i].num;
s[i].idx = i;
}
sort(s + 1, s + n + 1);
for(in... | 1 | 73,590,898 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#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;
using pii = pair<int,int>;
using vi = vecto... | 1 | 42,720,632 |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
int x,a,b;
cin>>x>>a>>b;
cout<<min({x+a,x+b,a+b})<<endl;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r - max(p, max(q, r));
cout << ans << endl;
return 0;
} | 1 | 48,459,264 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll x, y, c = 0;
cin >> x >> y;
while (x <= y) {
c++;
x = x * 2;
}
cout << c << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t X,Y;
cin>>X>>Y;
int64_t x=Y/X;
int64_t sum=1;
int ans=0;
for(int i=0;sum<=x;i++){
ans++; sum*=2;
}cout<<ans<<endl;
return 0;
} | 1 | 17,406,456 |
#include <bits/stdc++.h>
using namespace std;
int getDate(int y,int m,int d){
int res=0;
int a = (y-1)/3;
int b = (y-1) - a;
res += 200*a + 195*b;
res += 20*(m-1) - (y%3 == 0 ? 0 : (m-1)/2);
res += d;
return res;
}
int main(){
int y,m,d,n;
cin>>n;
for(int i=0;i<n;i++){
cin>>y>>m>>d;
cout<<getDate(1000,1,1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
for(int i=0,num[3],ans;i<n;i++){
for(int j=0;j<3;j++){
cin>>num[j];
if(j!=2)num[j]--;
}
if((num[0]+1)%3==0)ans=num[1]*20;
else ans=num[1]/2*39+num[1]%2*20;
cout<<196471-ans-num[0]/3*590-num[0]%3*195-num[2]<<endl;
}
} | 1 | 89,548,669 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1000000;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
... | #include<cstdio>
using ll = long long;
using ull = unsigned long long;
const static int MOD = 1000000007;
ll RepeatSquaring(ll N, ull P){
if(P == 0 || N == 1) return 1;
if(N == -1) return P & 1 ? -1 : 1;
if(!(P & 1)){
ll t = RepeatSquaring(N, P >> 1);
return t*t % MOD;
}
return N*RepeatSquaring(N, P - 1) % MOD... | 1 | 34,805,711 |
#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++)
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> void cmin(T &a, const S &b) { if (... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | 1 | 69,413,274 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
int main(){
int n;
std::cin >> n;
std::vector<int> a(n);
std::cin >> a[0];
int g = a[0];
for(int i = 1; i < n; i++){
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve()
{
int n, a, ans;
cin... | 1 | 8,180,745 |
#include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926
typedef struct{
double x,y;
}pxy_t;
void kock(int n,pxy_t p1 , pxy_t p2){
if(n==0)return;
pxy_t s,t,u;
s.x = (2*p1.x + p2.x)/3.0;
s.y = (2*p1.y + p2.y)/3.0;
t.x = (p1.x + 2*p2.x)/3.0;
t.y = (p1.y + 2*p2.y)/3.0;
u.x = (t.x-s.x)*cos(60.... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | 1 | 15,359,970 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#define int long long
#define CONTAINS(v,n) (find((v).... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#inc... | 1 | 30,901,138 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
cin >> S;
string keyence = "keyence";
string value;
rep(i, S.size())
{
for (int j = i; j < S.size(); j++)
{
if (S.substr(0, i) + S.substr(j, S.siz... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
string s;
cin>>s;
string t="keyence";
for(int i=0;i<s.size();i++){
for(int j=i;j<s.size();j++){
string h;
for(int k=0;k<s.size();k++){
if(k>i&&k<j){continue;}
else{h+=s[k];}
}
... | 1 | 85,204,838 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <sstream>
using namespace std;
class c_main
{
private:
public:
c_main();
void f_input();
};
c_main::c_main()
{
}
void c_main::f_input()
{
... | #include <stdio.h>
void QQ(int a,int b){
if( a >= 10 ){
return ;
}else if( b < 10 ){
printf("%dx%d=%d\n",a,b,a*b);
QQ(a,b+1);
}else{
QQ(a+1,1);
}
}
int main(){
QQ(1,1);
} | 1 | 6,051,122 |
#include <bits/stdc++.h>
int main(){
int X;
std::cin >> X;
int ans;
if(X < 600){
ans = 8;
}else if(X < 800){
ans = 7;
}else if(X < 1000){
ans = 6;
}else if(X < 1200){
ans = 5;
}else if(X < 1400){
ans = 4;
}else if(X < 1600){
ans = 3;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n)-1; i>=0; --i)
#define For(i,a,b) for(auto i=(a);i<=(b);++i)
#define rFor(i,a,b) for(auto i=(b);i>=(a);--i)
#define call(var) cerr<<#var<<"="<<var<<"\n";
#define dup(x,y) (((x)+(y)-1... | 1 | 10,792,240 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin>>n>>m;
int p = 1;
for(int i=1;i<=m;i++)p*=2;
int ans = p*(n*100+m*1800);
cout<<ans<<endl;
return 0;
} | #include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | 1 | 8,068,171 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if ((N[0] == N[1] && N[1] == N[2]) ||
(N[1] == N[2] && N[2] == N[3]) ||
(N[0] == N[1] && N[1] == N[2] && N[2] == N[3] && N[3] == N[4])) {
cout << "Yes" << endl;
} else {
cout << "No... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e;
cin >> a;
b = a / 1000;
c = a / 100 % 10;
d = a / 10 % 10;
e = a % 10;
if (((b == c) && (c == d)) || ((c == d) && (d == e)))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | 1 | 31,095,106 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i < n; i++)
#define P pair<int, int>
typedef long long ll;
const ll mod = 1e9+7;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inli... | 1 | 21,884,030 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
const std::string yes = "Yes";
const std::string no = "No";
int main(){
int n,m;
std::cin >> n;
std::set<std::string> st;
std... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s.at(i);
int M;
cin >> M;
vector<string> t(M);
rep... | 1 | 52,893,952 |
#include<iostream>
using namespace std;
int main(){
string s;
cin >> s;
int a = 0,b = 0,c = 0;
for(int i = 0;i < 3;i++){
switch(s.at(i)){
case 'a':
a++;
break;
case 'b':
b++;
break;
case 'c':
c++;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 1 | 22,733,083 |
#include<iostream>
#include<vector>
#include<string>
#include<set>
int main(){
std::string S, T;
std::cin >> S >> T;
std::vector<int> possible;
std::set<std::string> st;
for(int i = 0; i < S.size() - T.size() + 1; i++){
int j;
for(j = 0; j < T.size(); j++){
if(S[i + j] !=... | #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... | 1 | 31,203,475 |
#include <iostream>
using namespace std;
int main() {
int a[10];
for(int i=0;i<10;i++){
cin >> a[i];
}
for(int i=1;i<10;i++)
for(int j=0;j<i;j++){
if(a[i]<a[j]){
swap(a[i],a[j]);
}
}
for(int k=9;k>=7;k--)
cout << a[k] << endl;
return 0;
} | #include <iostream>
#include <queue>
using namespace std;
int main()
{
priority_queue<int> que;
int h;
for (int i = 0; i < 10; ++i) { cin >> h; que.push(h); }
int c = 0;
while (c < 3) {
cout << que.top() << '\n'; que.pop();
c++;
}
return 0;
} | 1 | 24,058,703 |
#define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll INF=1e18;
int main(){
int n,r;
cin>>n>>r;
int ans;
if(n>=10) {ans=r;}
else{ ans=r... | 1 | 28,304,040 |
#include <bits/stdc++.h>
using namespace std;
long long m=1e9+7;
long long fact[1000001],inv[1000001];
long long modRecursive(long long a,long long b,long long c)
{
if(b == 0) return 1;
if(b%2 ==0) return modRecursive((a*a)%c,b/2,c);
else return ((a%c)*(modRecursive((a*a)%c,b/2,c)))%c;
}
int main()
{
string S;
... | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 1 | 40,578,368 |
#include <stdio.h>
int main(void) {
int a, b, c, i ,j;
scanf("%d", &j);
for(i= 1; i <= j ;i++){
scanf("%d%d%d", &a, &b, &c);
if (a*a + b*b == c*c || a*a + c*c == b*b || b*b + c*c == a*a){
printf("YES\n");
}
else {
printf("NO\n");
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >>T ;
while(T--){
int s[3];
cin >> s[0] >> s[1] >> s[2];
sort(s,s+3);
if( s[0] * s[0] + s[1] * s[1] == s[2] * s[2] ) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | 1 | 81,358,914 |
#include <cstdio>
#include <queue>
using namespace std;
priority_queue<int> PQ;
int main() {
char cmd[8];
while (1) {
scanf("%s", cmd);
if (cmd[0] == 'i') {
int val;
scanf("%d", &val);
PQ.push(val);
} else if (cmd[1] == 'x') {
printf("%d\n"... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | 1 | 28,569,958 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
#define INF 10e12
#define MOD 1000000007
#define MAX 1001000
#define all(x) (x).begin(), (x).end()
#define max(x) *max_element(all(x))
#define min(x) *min_element(all(x))
using namespace std;
ll modinv(ll a, ll m)
{
... | #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;
ll f[3000000] = {0};
... | 1 | 96,960,439 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long do... | 1 | 17,552,618 |
#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>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int a[N], b[N];
int c[M], d[M];
rep(i,N) cin >> a[i] >> b[i];
rep(i,M) cin >> c[i] >> d[i];
rep(i,N) {
int dist_min = 1e9;
int cp;
rep(j,M) {
int dist = ... | 1 | 3,736,432 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
int main() {
string s; cin >> s;
int n = 0;
for(int i=0; i<s.size(); i++) {
n += s[i] - '0';
n %= 9;
}
if (n == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
using bint = cpp_int;
using bdec = cpp_dec_float_100;
int main() {
bint N;
cin >> N;
cout << ((N % 9) ? "No" : "Yes") << "\n";
} | 1 | 38,871,125 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int INF = 1e9;
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve()
{
ll n;
... | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
ll n;
cin >> n;
ll sum = 0;
for (int i = 1; i < n; i++) {
sum += i;
}
cout << sum << endl;
return 0;
} | 1 | 47,462,939 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
in... | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
string s;
cin>>s;
int c=0;
for(int i=0;i<s.size();i++){
if (s.at(i)=='x') c++;
}
cout<<((c>7) ? "NO":"YES")<<endl;
return 0;
} | 1 | 42,442,400 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl;
#define cyes cout << "Yes" << endl;
#define cno cout << "No" << endl;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1);
a[0] = 1e9;
int ans = 0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0... | 1 | 19,882,285 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <climits>
typedef long vertex;
typedef long dist;
using namespace std;
vector<bool> data_exists;
vector<long> xs;
long n;
long m;
vector<vertex> ls;
vector<vertex> rs;
vector<dist> ds;
map<vertex, vector... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> P;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
const ll mod=1000000007;
const ll INF=1e15;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP... | 1 | 76,687,598 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int> a(n);
rep(i, n) cin>>a.at(i);
int ans = 0;
int f = 1;
rep(i, n){
if(a.at(i)==f){
f++;
}
else{
ans+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
ios_base::sync_with_stdio(false);cin... | 1 | 98,494,318 |
#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
const int N=2e5+10;
int n,a[N],l=1,r=N-10,mid,ans;
map<int,int>p;
inline bool judge(int x){
p.clear();
for(register int i=2;i<=n;i++){
if(a[i]>a[i-1])continue;
if(x==1)return 0;
++p[a[i]];
map<int,int>::iterator it=p.upper_bound(a[i]);
w... | #include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
using namespace std;
int a[200001],n,i,j,k,l,L,R,Mid,tot;
map<int,int> mp;
map<int,int> :: iterator I;
bool pd(int t)
{
mp.clear(),tot=0;
fo(i,1,n)
{
if (a[i]>tot)
mp[a[i]]=0,tot=a[i];
el... | 1 | 99,600,327 |
#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 <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 1 | 16,574,437 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<ty... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main(){
string tmp;
map <string,bool> a;
int n,i;
cin>>n;
for(i=0;i<n;i++){
cin>>tmp;
if(tmp=="insert"){
cin>>tmp;
a.insert(make_pair(tmp,true));
} else {
cin>>tmp;
if(a.count(tmp)) cout<<"yes"<<e... | 1 | 92,537,636 |
#include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
if(360 % x == 0){
cout << 360 / x << endl;
}else{
for(int k=1; k<=360; k++){
if((x*k) % 360 == 0){
cout << k << endl;
return 0;
}
}
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int x;
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
scanf("%d",&x);
printf("%d",360/gcd(x,360));
return 0;
} | 1 | 86,185,148 |
#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.at(i);
for (int i = 0; i < B; i++) cin >> b.at(i);
int minA = *min_element(a.begin(), a.end()); int minB = *min_element(b.begin(), b.end());
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | 1 | 59,434,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X, Y;
cin >> X >> Y;
int ans = 1;
ll A = X;
while (1) {
A *= 2;
if (A > Y) break;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
ll x,y;cin >> x >> y;
ll cnt = x;
ll ans = 0;
while(x <= y){
ll a = 2;
while(true){
if(a*x%x=... | 1 | 16,105,234 |
#include <iostream>
using namespace std;
int main(void){
int a, b, res;
cin >> a >> b;
res = (a - 1) * (b - 1);
cout << res << endl;
} | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
cout << (N-1)*(M-1) << endl;
return 0;
} | 1 | 84,208,467 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int m, h[100], j = 0;
string s[10];
while (true){
cin >> s[j];
if (s[j] == "-")break;
cin >> m;
for (int i = 0; i < m; i++){
cin >> h[i];
}
for (int i = 0; i < m;i++){
s[j] += s[j].substr(0, h[i]);
s[j].erase(0, h[i]);
}
j+... | #include <iostream>
using namespace std;
int main(){
while(true){
string s; cin >> s;
if(s=="-")break;
int n;cin>>n;
for(int i = 0; n > i; i++){
int k;cin>>k;
string tmp;
for(int j = 0; s.size() > j; j++){
tmp.push_back(s[(j+k)%s.size()]);
}
s = tmp;
}
cou... | 1 | 29,396,300 |
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
int n , a[100001] , b[100001] = {} , x = 0 , y = 0;
cin >> n;
for (int i=0;i<n;i+... | 1 | 93,471,996 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B) cout << C << endl;
else if (A == C) cout << B << endl;
else i... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 1 | 82,364,242 |
#include <bits/stdc++.h>
using namespace std;
const string YES = "YES";
const string NO = "NO";
void solve(long long A, long long B, long long X)
{
cout << (((A <= X) && (X <= A + B)) ? YES : NO) << endl;
}
int main()
{
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long X;... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 1 | 37,954,562 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(pow(10, 5) + 5, vector<int>());
r... | 1 | 8,757,899 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int64_t a = 2, b = 1;
for (int i = 0; i < N; i++)
{
b += a;
a = b - a;
}
cout << a << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
ll F[90];
ll fibonacchi(ll n) {
if (n == 0)
retu... | 1 | 62,718,408 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin>>a>>b;
if(a>b){
for(int i=0; i<a; i++){
cout<<b;
}
}
else if(b>a){
for(int i=0; i<b; i++){
cout<<a;
}
}
else{
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
int a,b;
cin>>a>>b;
string aa,bb;
for(int i=0;i<b;++i)
{
bb+=(a+'0');
}
for(int i=0;i<a;++i)
{
aa+=(b+'0');
}
cout<<min(aa,bb)<<"\n";
} | 1 | 34,845,896 |
#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<<" ";ne... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x < y ? 0 : 10);
} | 1 | 45,392,108 |
#include <stdio.h>
int main() {
int bingos[3][3] = {0};
bool bingos_mark[3][3] = {false};
int ninp;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &bingos[i][j]);
}
}
scanf("%d", &ninp);
for (int i = 0; i < ninp; i++) {
int te;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> s(9);
for(int i=0;i<9;i++){
cin >> s.at(i);
}
int n;
cin >> n;
vector<int> m(n);
for(int i=0;i<n;i++){
cin >> m.at(i);
for(int j=0;j<9;j++){
if(m.at(i) == s.at(j)) s.at(j) = 0;
}
}
bool e ... | 1 | 13,757,376 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 1 | 5,042,277 |
#include<stdio.h>
int main (){
int A;
int B;
char str1[100];
int hasil;
scanf("%d %d", &A,&B);
char str[(A+B)+1];
scanf("%s", &str);
for(int i=0;i<A+B+1;i++){
if(i!=A){
if(str[i]>='0'&&str[i]<='9'){
hasil++;
}
}else if(str[i]=='-'){
hasil++;
}
}
if(hasil==A+B+1){
printf("Yes");
}else{
pr... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int,int> pairii;
typedef vector<char> vecc;
const double pi=3.1415926535;
const ll mod=1000000007;bool f=1;
void no(){f=0;return;}
void judge(char t){if(t... | 1 | 54,967,945 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf (1 << 21)
#define mod 1000000007
int main() {
string S; cin >> S;
int ans = inf;
for (int i = 0; i < S.size() - 2; i++) {
string s;
for (int j = i; j < i + 3; j++)... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
size_t min_value = 753;
for (size_t i = 0; i < s.length() - 2; ++i) {
auto diff = abs(stoi(s.substr(i, 3)) - 753);
if (diff < min_value) min_value = diff;
}
cout << mi... | 1 | 92,065,999 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <functional>
#define rep(i,n) for(int i=0;i<n;++i)
#define FOR(i,s) for(int i=s;i>=0;--i)
using ll... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<vector<string>>box(H,vector<string>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>box.at(i).at(j);
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(box.a... | 1 | 49,911,202 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s; cin>>s;
ll k; cin>>k;
ll ans=0,cnt=0;
if(s[0]!=s[s.size()-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cnt[214514];
int main(){
string s;
ll k;
cin>>s>>k;
ll ans=0,cnt=1,l=0,r=0;
bool f=0,g=1;
for(int i=1;i<s.size();i++){
if(s[i-1]==s[i])cnt++;
else{
g=0;
if(!f){
l=cnt;
f=1;
}
ans+=cnt/2;
cnt=1;
}
}
r=cnt;
ans+=c... | 1 | 15,238,513 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)ret... | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;... | 1 | 55,955,804 |
#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,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 1 | 24,364,863 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
#define int ll
#define pb push_back
#define pii pair<int,int>
#define ff... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
const int N=1e5+5;
ll cnt[N];
ll n,k,ans;
ll pow(ll num)
{
ll res=1,m=n;
while(m>0){
if(m&1)
res=res*num%mod;
num=num*num%mod;
m>>=1;
}
return res;
}
int main()
{
cin>>n>>k;
for(ll i=k;i>=1;i--)
{
cnt... | 1 | 78,331,875 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> A(n);
for (size_t i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
if (A[i] >= (d... | #include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
typedef long long ll;
typedef vector<int> vi;
ll mod = 1e9+7;
string solve() {
int n, m, a; cin >> n >> m;
vi nums;
rep(i, n) {
cin >> a;
nums.push_back(a);
... | 1 | 66,087,962 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const long long INF =1ll<<60;
const int DAM =-1;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int N,M;
cin>>N>>M;
vector<int> dp(N+2,0);
vector<int> broken(N+1,0);
for(int i=0... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N,M;
cin >> N >> M;
vector<ll... | 1 | 40,473,827 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<double> v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for(int i = 1; i < n; ++i)
{
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
} | 1 | 14,297,988 |
#include<iostream>
using namespace std;
void swap(int& l, int &r) {
int temp = l;
l = r;
r = temp;
}
int main() {
int temp[5];
for (int& a : temp) {
cin >> a;
}
for (int i = 0; i < 4; ++i) {
for (int j = 1; j < 5; ++j) {
if (temp[j - 1] < temp[j]) {
swap(temp[j - 1], temp[j]);
}
}
}
for (int i ... | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int n[5];
int main()
{
for(int i = 0; i < 5; i++)
{
scanf("%d",n + i);
}
sort(n,n + 5);
printf("%d %d %d %d %d\n",n[4],n[3],n[2],n[1],n[0]);
return 0;
} | 1 | 30,397,299 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n);
double ans = 0;
for (size_t i = 0; i < n; i++) {
int a;
cin >> a;
ans += 1/(double)a;
}
ans = 1/ans;
printf("%.10f\n", ans);
return 0;
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | 1 | 51,439,285 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> perm(N);
for(int i=0; i<N; i++){
cin >> perm.at(i);
perm.at(i)--;
}
vector<int64_t> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
int logK= 31- __builtin_clz(K);
vector<vector<int>> tra... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
#define INF ((1LL<<62LL) - 1)
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k; cin >> n >> k;
int p[n+1], c[n+1];
for(int i=1;i<=n;i++) cin >> p[i];
for(int i=1;i<=n;i++) cin >> c[i];
... | 1 | 45,701,060 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
using namespace std;
int n;
#define N 1005
string s[N], X;
int t[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i ++) cin >> s[i] >> t[i];
cin >> X;
int pos = -1;
for (int i = 1; i <= n; i ++) if (s[i] == X) pos = i;
int ans = 0;
for (int i = pos+1; i <= n; i ++) ans +... | 1 | 100,154,285 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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; }
const int64_t INF = 1LL << 60;
int main() {
int N1,N2,N3,N4;
cin>>N1... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
set<int>s;
int a;
for(int i=0;i<4;i++){
cin>>a;
if(a==1||a==9||a==7||a==4){
s.insert(a);
}
}
if(s.size()==4){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
} | 1 | 8,752,493 |
#include <iostream>
using namespace std;
#include <math.h>
int main()
{
double x1, y1, x2, y2, x3, y3, x, y;
double ax, ay, bx, by;
double z1, z2, z3;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x >> y) {
ax = x2 - x1;
ay = y2 - y1;
bx = x - x1;
by = y - y1;
... | #include <bits/stdc++.h>
#define range(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) range(i,0,n)
using namespace std;
typedef bool B;
typedef long double D;
typedef complex<D> P;
typedef vector<P> VP;
typedef struct {P s,t;} L;
typedef vector<L> VL;
typedef struct {P c;D r;} C;
typedef vector <C> VC;
const D... | 1 | 22,843,176 |
#include <stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int i, k, s, j, p, t=0;
cin >> k;
cin >> s;
for (i = 0; i <= k; i++) {
for (j = 0; j <= k; j++) {
if (s-(i+j)<=k&&s-(i+j)>=0){
t++;
}
}
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, k; cin >> k >> s;
long long ans = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - (x + y);
if (z >= 0 && z <= k) ans++;
}
}
cout << ans << "\n";
} | 1 | 20,321,183 |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define sl set<ll>
#define vs vector<string>
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define PI 3.14159265
#define mod 998244353
ll a[51];
ll p[51];
ll f(ll n,ll x)
{
if(x==0)
return 0;
el... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | 1 | 42,034,317 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int s, w;
cin >> s >> w;
if(w >= s) cout << "unsafe\n";
else cout << "safe\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s, w;
cin >> s >> w;
cout << (w>=s ? "unsafe" : "safe");
return 0;
} | 1 | 16,432,132 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
ll n, a, b;
cin >> n >> a >> ... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 1 | 97,335,407 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
int n, m;
int main(){
scanf("%d%d", &n, &m);
rep(i,m) printf("%d %d\n", i+1, n-i-(~n&1 && n<=i*4+2));
} | 1 | 28,170,442 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int h,w,k;
cin >>h>>w>>k;
vector<string> C(h);
rep(i, h){
cin >> C[i];
}
int ans=0;
rep(r, (1<<h)){
rep(c, (1<<w)){
int black = 0;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#defin... | 1 | 78,699,447 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.