code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main() {
long long X, Y;
cin >> X >> Y;
long long ans=0;
while (X<=Y) {
X*=2;
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
struct Lazysegtree{
int n;
vector<ll>node,laz... | 0 | 99,778,870 |
#include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const ll INF = 1e15;... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1.0)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x... | 0 | 69,029,104 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007LL
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define endl '\n'
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define pii pair<int, int... | 0 | 23,102,174 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int k,u;
int v;
int table[200][200]={};
for(int i=0;i<n;i++){
cin >> u;
cin >> k;
for(int j=0;j<k;j++){
cin >> v;
... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 0 | 85,065,983 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,i,cur;
string s;
cin >> s;
n=s.size();
vector<long> ans(n+1,0);
for(i=0; i<n; i++){
if(s[i]=='<'){
ans[i+1]=ans[i]+1;
}
}
for(i=0; i<n; i++){
if(s[n-1-i]=='>'){
ans[n-1-i]=max(ans[n-i]+1,ans[n-1-i]);
}
}
cur=0;
for(i=0; i<n+1; i+... | 0 | 46,935,985 |
#include <stdio.h>
#include <string.h>
int st[10];
int main()
{
int stn = 0;
while(1)
{
int n;
if(EOF == scanf("%d",&n))
{
break;
}
if(n == 0)
{
stn--;
printf("%d\n",st[stn]);
}
else
{
st[stn] = n;
stn++;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 12,370,367 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n&&n!=EOF){
int ans=0;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int l=0;l<10;l++){
if(i+j+k+l==n)ans++;
}
... | #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;
vector<ll> a(51), b(51), c(51), d(51);
rep(i, n) cin >> a[i] >> b[i];
rep(i, m) cin >> c[i] >> d[i];
int ans[51];
for(int i=0; i<n; i++){
ll ... | 0 | 4,993,525 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n==0) break;
int left = 0, right = 0;
int state = 0;
int cnt=0;
for(int i=0; i<n; i++){
string f;
cin >> f;
if(f == "lu"){
le... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
vector<string> w(100);
bool flag = true;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> w[i];
if (i == 0)
continue;
if (w[i - 1][w[i - 1].size() - 1] != w[i][0])
flag = false;
for (int j = 0; j < i; j++)
{
... | 0 | 51,130,903 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b;
cin >> N;
bool exist = false;
for (int a = 0; a <= N/4+1; ++a) {
for (int b = 0; b <= N/7+1; ++b) {
int total = 4*a + 7*b;
if (total == N) exist = true;
}
}
if (exist) {
cout << "Yes" << endl;
}
else {
... | #include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
... | 0 | 38,768,219 |
#include <bits/stdc++.h>
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/gcd(m,n))
#define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define endl '\n'
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0;i < n;++i)cin >> a[i];
for (ll i = 1;i < n;++i)a[i] += a[i - 1];
a.push_back(0);
sort(a.begin(), a.end());
ll ans = 0;
ll cnt = 1;
ll prev = 1e10;
fo... | 0 | 66,258,138 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main(){
cin >> s >> t;
int cnt = 0;
for (int i=0; i<3; i++){
if(s.at(i) == t.at(i)){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
typedef pair<int,int> pa;
int n,m;
struct node
{
ll x,y,z;
}a[2000];
bool cmp1(node x,node y)
{
return x.x+x.y+x.z>y.x+y.y+y.z;
}
bool cmp2(node x,node y)
{
return x.y+x.z-x.x>+y.y+y.z-y.x;
}
bool... | 0 | 56,877,689 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll x,y;
cin >> x >> y;
ll cnt=0;
while(x<=y){
x*=2;
cnt++;
}
cout << cnt << endl;
} | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceill(a, b) (a+b-1)/b
#def... | 0 | 5,332,292 |
#include <iostream>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, x4, y4;
cin>>x1;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4){
double x12 = x2-x1;
double y12 = y2-y1;
double x34 = x4-x3;
double y34 = y4-y3;
if(x12<0){
x12 *= -1;
y12 *= -1;
}
if(x34<0){
x34 *= -1;
y34 *= -1... | #include <iostream>
using namespace std;
int main()
{
int x;
unsigned long long int ret=1;
cin >> x;
for(int i=1;i<=x;i++)
ret*=i;
if(!x)ret=0;
cout << ret << endl;
} | 0 | 96,567,212 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
#ifdef FASTIO
cin.tie... | 0 | 5,462,283 |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
#define mid (l+r>>1)
int a[15],dig;
char c[14];
long long ans,digi[15];
bool check(long long... | #include<iostream>
#include<numeric>
#include<vector>
int main(){
int N,M,X;
std::cin>>N>>M>>X;
std::vector<unsigned int> searchSpace(0x0001<<N);
std::iota(searchSpace.begin(),searchSpace.end(),0);
std::vector<int>costs(N)
; std::vector<std::vector<int> >scores(N,std::vector<int>(M));
for(int... | 0 | 38,331,320 |
#include<cstdio>
#include<algorithm>
#define MN 2100001
using namespace std;
int n,m,a[MN];
long long sum1=0,sum2=0,mmh=1e18;
long long _abs(long long x){return x<0?-x:x;}
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),sum2+=a[i];
for (int i=1;i<n;i++) if (sum1+=a[i],_abs(sum2-sum1-sum... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string check(int num);
int main(){
string s;
int n,h;
while(cin >> s){
if(s == "-")break;
cin >> n;
for(int i = 0;i < n;i++){
cin >> h;
s = s.substr(h) + s.substr(0,h);
}
cout << s << "\n";
}
return 0;
} | 0 | 10,048,514 |
#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | #include <iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int a=0,b=0,c=0,d=0,i=0;
char arr[1000]={};
for(i=0;;i++){
cin >> a >> b >> c;
d++;
if(a==-1 && b==-1 && c==-1)break;
else{
if(a==-1 || b==-1)cout << 'F' << endl;
... | 0 | 19,631,544 |
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main(){
string s;
while( getline(cin,s) ){
if( s == "." ) break;
stack<char> st;
bool flag = true;
for(int i=0 ; i < (int)s.size() ; i++ ){
char c = s[i];
if( c == '(' ){
st.push( c );
}else if( c == '[' ){
st.pus... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
ll n, k;
ll l[60];
cin >> n >> k;
rep(i, n) cin >> l[i];
sort(l,l+n, greater<ll>());
ll ans = 0;
rep(i, k) ans += l[i];
cout << ans << endl;
} | 0 | 79,913,950 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <valarray>
#include <utility>
#include <tuple>
#include <cmath>
#include <random>
using ll = long... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
unsigned long long A = 0, ans = 1;
vector<unsigned long long > vec;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
vec.push_back(A);
}
sort(vec.begin(), vec.end());
unsigned long long z = pow(10, 18)... | 0 | 95,505,989 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #include <iostream>
#include <algorithm>
using namespace std;
int po10[]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};
int n,s;
int dp[20][110];
int main(){
dp[0][0]=dp[1][0]=1;
for(int i=1;i<=9;i++){
for(int j=9;j>=1;j--){
for(int k=100;k>=i;k--){
dp[j][k]+=dp[j-1][k-i];
}
}
}
w... | 0 | 83,786,114 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int m, n, i, cnt = 0, sum = 0;
float x;
cin>>n>>m;
int a[n];
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(i = 0; i<n; i++)
{
sum += a[i];
}
x = (1.0/(4.0*m))*sum;
for(i = 0; i<n; i++)
{
if(a[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<int> pow_time(19,0);
for(int i=1; i<=n; i++){
int time=0;
int calc=i;
while(calc <k){
calc *= 2;
time++;
}
pow_time.at(time)++;
... | 0 | 67,114,204 |
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define uni(x) sort(all(x)),x.resize(unique(all(x))-x.begin());
#define GETPOS(c,x) (lower_bound(all(c),x)-c.begin())
#define lown1(x,val) low(in(x),val)-x
#define lowm1(x,val) low(im(x),val)-x
#define low1(x,nums,val) low(x+1,x+nums+1,val)-x
#define mst(x,val) mems... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | 0 | 60,375,679 |
#include <stdio.h>
#include <string.h>
int main(){
char A[11],B[11],C[11];
scanf("%s %s %s", &A,&B,&C);
int lenA=strlen(A);
int lenB=strlen(B);
if(A[lenA-1]==B[0] && B[lenB-1] == C[0]){
printf("YES");
}
else {
printf("NO");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 20,576,690 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
cons... | #include <stdio.h>
#include <iostream>
#include <math.h>
int main(){
int n, num;
while(scanf("%d", &n)!=EOF){
num = 0;
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
for(int k=0; k<10; k++){
for(int l=0; l<10; l++){
if(i+j+k+l==n) num++;
}
}
}
... | 0 | 73,810,498 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
vector<int> a(... | #include <cstdio>
int main() {
int a,b,c;
std::scanf("%d %d %d",&a,&b,&c);
if(a < b&&b < c){
std::printf("Yes\n");
}
else if(a >= b){
std::printf("No\n");
}
else if(a >= c){
std::printf("No\n");
}
else if(b >= c){
std::printf("No\n");
}
return 0;
} | 0 | 38,568,130 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int64_t n,ans;
cin>>n;
ans=1;
vector<int64_t> a(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
if(a.at(i)==0)
{
ans=0;
break;
}
}
for(int i=0;i<n;i++)
{
if(ans==0)
{
break;
}
else if(10000000000000000... | #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 | 57,850,534 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ll r;
cin>>r;
cout<<r*r<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, K;
cin >> N >> K;
vector<bool> use(N+1, false);
vector<pair<int, int>> sushi(N);
for (int i = 0; i < N; i++){
ll t, d;
cin >> t >> d;
sushi[i] = {t, d};
}
sort(sushi.begin(), sushi.e... | 0 | 97,783,437 |
#include <iostream>
#include <string>
#include <set>
#define llint long long
using namespace std;
string s;
string t = "qwertasdfgzxcvb";
bool used[26];
int main(void)
{
for(int i = 0; i < t.size(); i++) used[t[i]-'a'] = true;
while(1){
cin >> s;
if(s == "#") break;
llint ans = 0;
for(int i = 1; i < s.size();... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 18,746,170 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<int> X(a);
vector<int> Y(b);
vector<int> C(c);
for(int i = 0; i < a; i++) cin>>X[i];
for(int i = 0; i < b; i++) cin>>Y... | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main()
{
long long k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << endl;
} else {
if (a - 1 >= k) {
cout << k + 1 << endl;
} else {
long long now = a;
k = k - a + 1;
if (k % 2 == 0) {
now += (b - a) * (k... | 0 | 86,454,937 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
ans -= max(p, max(q, r));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | 0 | 62,071,720 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include <bits/stdc++.h>
using namespace std;
long long q;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>q;
while(q--)
{
long long x,y;
cin>>x>>y;
if(x>y)
swap(x,y);
if(x==y)
cout<<2*x-2<<endl;
else if(x==... | 0 | 36,681,513 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int,long long> a, pair<int,long long> b){
return a.second > b.second;
}
int main() {
int n,k;
long long cnt = 0, num = 0;
long long ans = 0, sz;
cin >> n >> k;
vector<pair<int,long long>> a(n);
for(int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
int main(){
int n, m;
cin >> n >> m;
vector<string> s(n);
for(int i=0; i<n; ++i)
cin >> s[i];
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
for(int i=0; i<... | 0 | 78,015,865 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int n,m,h,a[17][17],i,j,l,w,b,c,flg;
int main(void)
{
while(1){
scanf("%d %d",&n,&m);
if(n==0&&m==0) break;
scanf("%d",&h);
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
a[i][j]=0;
}
}
for(i=0;i<h;i++){
scanf("%d %d",&b,&c);
a[c][b]=-1;
}... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 0 | 22,762,232 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<vector<int>> connect(200005);
vector<int> val;
void dfs(int i,int k=-1){
for(auto p:connect[i]){
if(p==k) continue;
val[p]+=val[i];
dfs(p,i);
}
}
int main(){
int ... | #include <bits/stdc++.h>
using namespace std;
const string YES = "YES";
const string NO = "NO";
void solve(std::string S){
string ans;
vector<string> unit_string = {"dream", "dreamer", "erase", "eraser"};
for(int i = 0; i < 100000; ++i){
if(S.size() == 0){
ans = YES;
break;
... | 0 | 14,109,256 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main(){
ll n;
cin >> n;
ll ans=0;
ll a=10;
ll b=0;
if(n%2==1)
cout << ans << endl;
else{
while(n>=a){
... | 0 | 46,126,928 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
while ( n-- > 0 ) {
int a;
cin >> a;
h -= a;
}
string ans = ( h <= 0 ) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RRE... | 0 | 23,347,192 |
#include <iostream>
using namespace std;
int main(){
int n, i;
int h[200] = {0};
int most = 0;
while(cin >> n){
h[n]++;
if (most < h[n]) {
most = h[n];
}
}
for (i = 1; i <= 100; i++) {
if (h[i] == most) {
cout << i << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | 0 | 15,886,247 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans = 1;
while(1){
if(ans * 2 <= N){
ans *= 2;
}
else{
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 76,408,212 |
#include<iostream>
double cross( double x1, double y1, double x2, double y2 )
{
return x1 * y2 - x2 * y1;
}
int main()
{
double x[3], y[3], xp, yp;
while( std::cin >> x[0] >> y[0] )
{
for( int i = 1; i != 3; ++i )
std::cin >> x[i] >> y[i];
std::cin >> xp >> yp;
bool s, f = true;
for( int i = 0; i != 3; +... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 52,800,802 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
int sum=0;
if(a=='D')
sum++;
if(b=='D')
sum++;
if(sum==1)
cout<<'D'<<endl;
else
cout<<'H'<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, do... | 0 | 62,508,208 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main(){
int n, m;
cin >> n >> m;
vector<long long> x(n), y(m);
for(int i = 0; i < n; i++){
cin >> x[i];
}
for(int i = 0; i < m; i++){
cin >> ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 4,834,807 |
#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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 88,714,817 |
#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... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> in... | 0 | 75,696,516 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1e9+7
using namespace std;
typedef long long ll;
const double pi=acos(-1);
int a[1000000][3];
int dp[1000000][3];
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h, w;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> h >> w;
if (h % 3 == 0 || w % 3 == 0) {
cout << 0 << endl;
exit(0);
}
ll ans = min(h, w);
for (int i = 1; i < w; ++i) {
ll... | 0 | 90,252,096 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No... | 0 | 25,167,731 |
#include<iostream>
using namespace std;
string s;
void read() {
cin >> s;
}
void work() {
for (int i = 3; i >= 0; --i) {
if (s.find(string(i, 'R')) != string::npos) {
cout << i << endl;
return;
}
}
}
int main() {
read();
work();
return 0;
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long int;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
for (int i = 0; i <= 15; i++) {
... | 0 | 39,166,035 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#defi... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int) (n); i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b, c, k;
cin >> a >> b >> c >> k;
int cnt = 0;
while(a >= b) {
b *= 2;
cnt++;
}
w... | 0 | 76,279,435 |
#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define Pr(a) (#a)<<"="<<(a)<<" "
#define pr1(a) cerr<<Pr(a)<<endl;
#define pr2(a,b) cerr<<Pr(a)<<Pr(b)<<endl;
#define pr3(a,b,c) cerr<<Pr(a)<<Pr(b)<<Pr(c)<<endl;
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i... | 0 | 56,980,774 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
ll a;
double b;
cin >> a >> b;
ll mid=b*100+0.5;
ll ans;
ans=mid*a/100;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
... | 0 | 8,631,639 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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 NIL = -1;
const int INF = (1<<21);
const lo... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | 0 | 60,405,081 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string S; cin >> S;
string T = "YAKI", F = S.substr(0, 4);
if (T == F) printf("%s\n", "Yes");
else printf("%s\n", "No");
} | #include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
int main(void) {
std::string str;
int a;
int b;
int q;
std::string start = "";
std::string sub = "";
std::string end = "";
std::string s = "";
std::cin >> str >> q;
for (int i = 0; i < q; i++) {
... | 0 | 99,927,415 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << ... | 0 | 15,852,198 |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
double dp[44444][222];
int main(){
ll n,t[111],v[111];
... | 0 | 82,766,597 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios_base::sync_with_stdio(false) , cin.tie(0) ;
#define all(v) v.begin(),v.end()
#define w(x) cout << (#x) << " is " << x << "\n" ;
int main()
{
fast ;
int n,c=0,i;
string s ;
cin >> n >> s ;
for(i= 0 ; i < n-1 ; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc039_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 84,987,050 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
vector<char> s1(N), s2(N);
for(int i = 0; i < N; i++){
if(i % 2 == 0) {
s1[i] = '1';
s2[i] = '0';
}
else{
s1[i] =... | #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 | 36,450,209 |
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
int main() {
int W, H;
cin >> W >> H;
const int MAXN = 200000;
static P elts[MAXN];
for (int i = 0; i < W; i++) {
cin >> elts[i].first;
elts[i].second =... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
#include <climits>
#include <cassert>
using namespace std;
typedef unsigned int uint... | 0 | 95,840,495 |
#include <iostream>
#include <map>
using namespace std;
map<int,int> mp,ind;
typedef long long ll;
int imos[400010] = {};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i,n,d,a;
cin >> n >> d >> a;
for(i=0;i<n;i++){
int x,h; cin >> x >> h;
mp[x] += h; mp[x + 2*d + 1... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 19,490,541 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) cin >> S[i];
int ans = 0;
for (int i = 0; i < N; i++) {
bool check = true;
for (int j = 0; j < N; j++) {
for (int k = j; k ... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 35,630,889 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S,T;
char temp;
cin >> N;
cin >> S >> T;
for (int i =0; i < N; i++){
cout << S.at(i) << T.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 50;
long long a[MAXN];
long long check(long long steps, long long ub, int n)
{
long long moves = 0;
for (int i = 0; i < n; i++)
{
moves += max(0LL, (a[i] + steps - ub + n) / (n + 1));
}
return moves;
}
bool isBad(int n)
{
for... | 0 | 68,184,122 |
#include <bits/stdc++.h>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using boost::irange;
using boost::sort;
using boost::adaptors::reversed;
int main() {
long n, h;
cin >> n >> h;
vector<long> a(n), b(n);
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int n,a,b;
bool memo[300001]={true};
signed main() {
scanf("%d%d%d",&n,&a,&b);
if (n > a*b || n < a+b-1) puts("-1");
else {
int now=b,cnt=n;
while(1) {
rep(i,b) {
... | 0 | 14,899,456 |
#include <iostream>
int main() {
std::ios::sync_with_stdio(false);
for (int i = 1; i < 10; ++i) {
for (int j = 1; j < 10; ++j) {
std::cout << i << "x" << j
<< "=" << i * j << std::endl;
}
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 18,705,081 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int n;
int k;
int ar[N];
int cnt[N];
int main(){
scanf("%d%d " , &n , &k);
int mn = 2e9;
for(int i = 1; i <= n; i++){
scanf("%d" , &ar[i]);
mn = min(mn , ar[i]);
cnt[ar[i]]++;
}
k--;
... | #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(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 47,123,582 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000 + 7;
inline int my_rand() {
static int x = 880301;
return x = (x * 0xdefacedll + 1) % 0x7fffffff;
}
int dp[MAX_N];
pair<int, int> hv[26];
map<pair<int, int>, int> bst;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> vec(H, vector<char>(W));
vector<bool> vecH(H, false);
vector<bool> vecW(W, false);
for(int i=0; i<H; i++) {
for(int j=0; j<W; j++) {
cin >> vec.at(i).at(j);
if(vec.at(i).at(j... | 0 | 61,738,407 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool b = false;
int A, B, C;
cin >> A >> B >> C;
for (int i = 1; i <= B; i++) {
if (A * i % B == C) {
b = true;
break;
}
}
if (b) {cout << "YES" << endl;}
else {cout << "NO" << endl;}
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostr... | 0 | 79,470,452 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=100005;
const int MOD=998244353;
int n;
int d[N];
int cnt[N];
long long ksm(long long a,long long b)
{
long long res=1;
while(b)
{
if(b&1) res=res*a%MOD;
a=a*a%MOD,b>>=1;
}
return res;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
signed main()
{
string S;
bool izryt = false, flag = true;
stack < char > st;
cin.ignore();
while(getline(cin, S), izryt || S != ".") {... | 0 | 25,170,817 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char ch;
cin>>ch;
if(ch=='A')
cout<<"T"<<endl;
else if(ch=='T')
cout<<"A"<<endl;
else if(ch=='C')
cout<<"G"<<endl;
else if(ch=='G')
cout<<"C"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, K;
cin >> A >> B >> K;
int m = min(A, B);
int count = 0;
for(int i = m; i >= 0; i--) {
if(A % i == 0 && B % i == 0) {
count++;
}
if(count == K) { cout << i; return 0; }
}
return 0;
} | 0 | 2,829,306 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namesp... | 0 | 44,342,998 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
int main() {
int h[10] = { 0 };
for (int i = 0; i < 10; i++)
{
scanf("%d", &h[i]);
}
sort(h, h + 10, std::greater<int>());
for (int i = 0; i < 3; i++)
{
printf("%d\n", h[i]);
}
} | #include <iostream>
using namespace std;
int main(){
int n, i;
long double x1, x2, x3, x4, y1, y2, y3, y4, slopeofAB, slopeofCD;
cin >> n;
for(i = 0; i < n; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
slopeofAB = (y2 - y1) / (x2 - x1);
slopeofCD = (y4 - y3) / (x4 - x3);
if(slopeof... | 0 | 9,841,013 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<long long int> A(n);
for(int i=0; i<n; i++) cin >> A[i];
for(int i=0; i<n; i++){
if(A[i] == 0){
cout << "0" << endl;
exit(0);
}
}
long long int ans = 1;
for(int i=0; i<n; ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 6,003,605 |
#include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, root, degree[N];
long long s[N];
vector<int> adj[N];
int dfs(int x, int f) {
bool go = false;
vector<long long> values;
for (auto y : adj[x]) {
if (y != f) {
go = true;
values.push_back(dfs(y, x));
}
}
if (!go) {
... | #include<iostream>
#include <string.h>
#include <algorithm>
#include<cstdlib>
typedef long long ll;
using namespace std;
int main()
{
ll n,a[200000],x = 0,y = 0,lim= 9223372036854775807,ans=0;
memset(a,0,sizeof(a));
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
ans += a[i];
... | 0 | 73,171,260 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++) cin >> a[i];
sort(a,a+5);
reverse(a,a+5);
for(int i=0;i<5;i++){
cout << a[i];
if(i==4) cout << endl;
else cout << ' ';
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 0 | 39,160,684 |
#include <iostream>
using namespace std;
int main(){
int a[100000][4];
int b=0;
for(int i=1;i<100000;i++){
cin>>a[i][0]>>a[i][1];
b++;
if(a[i][0]>a[i][1]){
a[i][3]=a[i][0];
a[i][2]=a[i][1];
}
else{
a[i][2]=a[i][0];
a[i][3]=a[i][1];
}
if(a[i][0]==0 && a[i][1]==0){
goto aa;
}
}
aa:;
for(int i=1;i<b;i++){
cout<<a[i][2]<<"... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> dp(h, vector<int>(w, h * w));
dp[0][0] = (s[0][0] == '.' ? 0 :... | 0 | 92,573,530 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
int main(){
ll N; cin>>N;
vector<ll> H(N);
for (ll i = 0; i < N; i++){
cin>>H[i];
}
ll ans=0,cnt=0;
ll i=0;
while(i<N-1){
if(H[i]>=H[i+1]){
cnt++;
}else{
ans=max(ans,cnt);
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[1005][1005];
void ExtendedEditDistance(vector<string> s1, vector<string> s2){
const int INF = 1e9;
for(int i=0;i<1005;i++)
for(int j=0;j<1005;j++) dp[i][j] = INF;
dp[0][0] = 0;
int sum1 = 0, sum2;
for(int i=0;i<(int)s1.size();i++){... | 0 | 36,671,320 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=2e5+5;
char S[N];
int main()
{
scanf("%s",S);
int n = strlen(S);
ll sum = 0;
for(int i=0;i<n;i++) sum += int(S[i] - '0');
puts(sum % 9 == 0 ? "Yes" : "No");
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 86,954,324 |
#include <cstdio>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d", (a*a)-b);
} | #include<bits/stdc++.h>
using namespace std;
int n,ans;
struct node
{
int v,p;
}a[100010];
int cmp(node x,node y)
{
return x.v<y.v;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].v);
a[i].p=i;
}
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
if((a[i].p&1)!=(i&1))
++ans;
ans>>=1;
... | 0 | 62,681,171 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h , w;
cin >> h >> w;
int i, j;
vector<vector<char>> a(h, vector<char>(w));
for(i = 0;i < h;i++){
for(j = 0;j < w;j++){
cin >> a.at(i).at(j);
}
}
for(i = 0;i < a.size();i++){
for(j = 0;j < w;j++)... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vecto... | 0 | 50,117,645 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w; cin >> n >> h >> w;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x, y; cin >> x >> y;
if (h <= x && w <= y) cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 9,397,564 |
#include <iostream>
using namespace std;
int main () {
int n = -1, max = 0, cum = 0;
cin >> n;
int foo[5000];
while (n) {
for (int i = 0; i < n; i++) {
cin >> foo [i];
if (i == 0)
max = foo [i];
if (cum < 0)
cum = 0;
cum += foo[i];
if (cum > ma... | #include <iostream>
using namespace std;
int main() {
int n, x, result;
cin >> n >> x;
while(n != 0 || x != 0) {
result=0;
for(int i=1; i <= n-2; i++) {
for(int j=i+1; j <= n-1; j++) {
for(int k=j+1; k <= n; k++) {
if(i+j+k == x) result++;
}
}
}
cout << result... | 0 | 33,851,637 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REP1(i,n) for(int i=1;i<=(int)(n);i++)
#define RREP(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
int main(){
int N,M,ans=0;
string temp;
vector<string> str;
vector<int> num;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) {
return atan2(a.second, a.first) < atan2(b.second, b.first);
}
int main ()
{
int n;
cin >> n;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x |... | 0 | 208,907 |
#include<bits/stdc++.h>
using namespace std;
int n,xb,a[1200][1200];
int main(){
scanf("%d",&n);
for (int i=1;i<=n+1;++i)
if (i*(i-1)/2==n){
printf("Yes\n%d\n",i);
for (int j=1;j<=i;++j){
printf("%d",i-1);
for (int k=1;k<=i;++k){
if (k<j) a[j][k]=a[k][j];
if (k>j) a[j][k]=++xb;
if (k!=j... | #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;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
... | 0 | 57,754,971 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | #include <stdio.h>
int main(void)
{
int n,x;
int i,j,k;
int co;
do{
co = 0;
scanf("%d%d",&n,&x);
if(n == 0 && x == 0)
break;
else{
for(i=1; i<=n; i++){
for(j=1; j<=n; j++){
for(k=1; k<=n; k++){
if((i + j + k) == x){
if(i == j || j == k || k ==i)
co = co;
else... | 0 | 93,324,357 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
#define vecmin(A) *min_element(A.begin(),A.end())
#define vecmax(A) *max_element(A.begin(),A.en... | #include <bits/stdc++.h>
using namespace std;
#define Vi vector<int>
#define FOR(i,s,e) for (int i=s; i<e; i++)
#define ITER(v) v.begin(), v.end()
constexpr int MAX_LEN = 1'000;
int dp[MAX_LEN][MAX_LEN];
void set_val(int i, int j, int inc) {
int val = inc;
if (i > 0 && j > 0) {
int tmp = dp[i-1][j-1] + ... | 0 | 60,757,628 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#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;
bool f(int x)
{
vector<int> v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll v,e;
cin >> v >> e;
vector<ll> invec(v, 0);
vector<vector<ll>> graph(v);
for(i = 0;i < e;++i){
ll s,t;
cin >> s >> t... | 0 | 10,817,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
vector<int> X(4);
for (int i = 0; i < 4; ++i) {
X[i] = a[i]-'0';
}
for (int i = 0; i < (1 << 3); ++i) {
bitset<3> bit(i);
int sum = X[0];
vector<string> ans(7);
ans.push_back(to... | #include <bits/stdc++.h>
using namespace std;
float mix(float x = 0, float y = 0){
float res = (x + y) / 2;
return res;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int n = 0;
cin>>n;
vector<float> nums(n);
for(int i = 0;i<n;i++){
cin>>nums[i];
}
while(nums.siz... | 0 | 79,416,285 |
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 100,764,088 |
#include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
using namespace std;
int main()
{
lli n,i,k=0;
cin>>n;
char c;
vector<char>v;
for(i=0;i<n;i++){
cin>>c;
v.pb(c);
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll n, m;
int z = 0;
cin >> n; m = n;
for (ll i = 2; i * i <= m; i... | 0 | 29,422,117 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
vector<int> V(N);
rep(i,0,N)cin >> V[i];
int maxi = 0, second = INF;
rep(i,0,N)maxi = max(maxi, V[i]);
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 50;
const int mod = 1e9 + 7;
int n,k;
int h[N];
ll dp[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", h + i);
if (n == k)
{
puts("0");
return 0;
}
... | 0 | 66,634,851 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int N; cin >> N;
vector< pair<int, int> > R(N), B(N);
for (int i = 0; i < N; i++) cin >> R[i].first >> R[i].second;... | #include <cstdio>
#define REP(i,n) for(int i=0;i<(n);i++)
int main(void) {
int n;
const int N = 10;
while(~scanf("%d", &n)) {
int ans = 0;
REP(a,N) REP(b,N) REP(c,N) REP(d,N) {
if(a+b+c+d == n) ans++;
}
printf("%d\n", ans);
}
return 0;
} | 0 | 63,636,326 |
#include<iostream>
using namespace std;
#define RENT 100000
int main(){
int n, ans;
int counter = 0;
while (cin >> n){
counter = 0;
for (int i = 0; i < 10; i++){
for (int q = 0; q < 10; q++){
for (int w = 0; w < 10; w++){
for (int e = 0; e < 10; e++){
ans = i + q + w + e;
if (ans == n){
... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 66,536,510 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, M, D;
cin >> N >> M >> D;
double ans = 1.0 * (N - D) / N / N * (M - 1);
if (D != 0) {
ans *= 2;
}
cout << setprecision(10) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
#define LARGE 1000000007
int main() {
int n;
cin >> n;
vector<P> p(n);
rep(i, n) {
int a;
cin >> a;
p[i] = make_pair(a, i+1);
}
... | 0 | 56,629,708 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
reverse(s.begin(), s.end());
int64_t ans = 0, cnt = 0;
for(int i = 0; i < s.size(); i++){
if (s.at(i) == 'B'){
ans += i - cnt;
cnt++;
}
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 1000000;
const ll INF = (1LL << 31) - 1;
const double pi=acos(-1);
int main(){
ll n,k;
cin >> n >> k;
vector<ll>a(n);
rep(i,n)cin >> a[i];
ll ans=0;
rep(i,n){... | 0 | 26,224,272 |
#include <iostream>
using namespace std;
static const int NINF = -100;
int dp[17][17];
void solve()
{
int a, b;
while(cin >> a >> b, a || b)
{
int n;
cin >> n;
for(int i = 0; i < b; ++i)
{
for(int j = 0; j < a; ++j)
{
dp[i][j] = NINF;
}
}
for(int i = 0; i < n; ++i)
{
int x, y;
cin >>... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#define bFor(i,a,b) for(i=a;i>=b;i--)
#d... | 0 | 15,060,248 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
ll n; cin >> n;
bool jud = true;
ll ans = 0;
ll modifier = 1002003004;
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
#define ever ;true;
#define Dbug(x) cout << "Debug: " << #x << " = " << x << endl
#define _ << ", " <<
#define ll long long
#define int ll
#define all(v) v.begin(), v.end()
int n;
map<int, int> cnt, smallest_idx;
vector<int> freq;
main() {
ios_base::sync_with_stdio(0);... | 0 | 74,528,216 |
#include <iostream>
using namespace std;
int main()
{
int a,b,x;
cin>>a>>b>>x;
if(b >=x-a && x >= a){
cout<<"YES";
}else{
cout<<"NO";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | 0 | 44,657,698 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #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... | 0 | 92,988,922 |
#include<iostream>
#include<string>
using namespace std;
const long long M = 1046527;
string Hash[M];
int getchar(char ch)
{
if ('A' == ch)
return 1;
else if ('C' == ch)
return 2;
else if ('G' == ch)
return 3;
else if ('T' == ch)
return 4;
else
return 0;
}
long long get_key(string str)
{
long long sum =... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <ctime>
#include <unordered_map>
#include <iomanip>
#include <complex>
#include <cassert>
using namespace std;
#define fi first
#define se second
#de... | 0 | 72,011,962 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 11
#define INF (1<<23)
int G[MAX][MAX];
int main() {
int n, x, y, c;
int V;
while(cin >> n, n) {
fill(G[0], G[MAX], INF);
for(int i=0; i<MAX; i++) {
G[i][i] = 0;
}
V = 0;
for(int i=0; i<n; i++) {
cin >> x >> ... | 0 | 53,633,593 |
#include <bits/stdc++.h>
using namespace std;
#define rep(src,dst) for(int i=src; i<dst; i++)
#define rep2(src,dst) for(int j=src; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define PI acos(-1)
#define ll long long
template<typename T> inline void ChMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 41,789,207 |
#include <bits/stdc++.h>
#define mod 1000000007ll
using namespace std;
typedef long long ll;
ll n, p, a[60], ans, dp[60][2];
int main() {
cin >> n >> p;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | 0 | 56,758,641 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
vector<int> v;
while(1){
int temp;
cin >> temp;
if(temp == 0) break;
v.push_back(temp);
}
for(int i = 0; i < v.size(); i++ ){
cout << "Case " << i+1 << ": " << v[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
const int64_t MAXN = 100010;
int64_t P[MAXN];
int64_t pow_mod(int64_t x, int64_t n)
{
int64_t res = 1;
if (n > 0)
{
res = pow_mod(x, n / 2);
if (n % 2 == 0)
res = (res * res) % MOD;
else
res = (((res * res) % MOD... | 0 | 98,249,455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.