code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = (ss); i < (ee); ++i)
using Vi = vector<int>;
using VVi = vector<Vi>;
const int INF = 1e9;
void solve() {
int N, M, X;
cin >> N >> M >> X;
M++;
VVi v(N, Vi(M));
for (auto &e1 : v)
for (auto &e2 : e1) cin >> e2;
int ans = IN... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 1 | 77,112,061 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define all(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1'000'000'000'000'000'000
using Node = long long;
using Distance = long long;
using Weight = long long;
using Edge = tuple<Node, Node, Weight>;
ll V,E;
vector<Edge> Edges;
vector<Distance> dist;
bool BellmanFord(ll start){
dist.assign(... | 1 | 90,153,954 |
#include<bits/stdc++.h>
using namespace std;
long long a[200010];
int main(){
long long n,s,t=1,ans=0;
int i;
scanf("%lld",&n);
scanf("%lld",&s);
a[0]=s;
for (i=1;i<n;i++)
scanf("%lld",&a[i]);
i=1;
long long k=0;
ans=1;
while (i<n)
{
if ((s^a[i])==s+a[i])
{
s^=a[i];
i++;
t++;
ans+=t;... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <iomanip>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#de... | 1 | 78,076,643 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <iostream>
int main() {
long double A, B;
std::cin >> A >> B;
B = (long long int)(B * 100 + 0.001);
long long int ans = (long long int)(A * B / 100);
std::cout << ans << std::endl;
return 0;
} | 1 | 19,053,828 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
string s;
string p;
cin>>s>>p;
char tmp[300];
for(int i=1;i<=2;i++){
for(int j=0;j<s.size();j++){
if(i==2){
tmp[j+s.size()]=s[j];
}
else{
... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int count=0,flag=0,c;
string s;
string p;
cin >> s >> p;
for(int i=0;i<s.size();i++){
count=0;
for(int j=0;j<p.size();j++){
c = i+j;
c%=s.size();
if(s[c]==p[j])count++;
else break;
... | 1 | 32,082,507 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
c... | #include <iostream>
#include <cstdio>
#include <set>
using namespace std;
set<pair<int,int> > s1,s2;
int dx[8]={-1,-1,-1,0,0,1,1,1},dy[8]={-1,0,1,-1,1,-1,0,1};
int n,m,a,i,j;
long long ans[10];
bool in(int x,int y)
{
return x<=n&&x>=1&&y<=m&&y>=1;
}
int main()
{
cin>>n>>m>>a;
for(i=1;i<=a;i++){
int x,y;
cin>>x>>... | 1 | 75,767,243 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r, g;
cin >> r >> g;
cout << r * r - g << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, A;
cin >> N >> A;
cout << N * N - A << endl;
return 0;
} | 1 | 65,032,765 |
#include <iostream>
using namespace std;
int main(void){
int x, y;
while (true){
cin >> x >> y;
if (x == 0 && y == 0) break;
if (x > y) cout << y << " " << x << "\n";
else cout << x << " " << y << "\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
while (true) {
int a, b; cin >> a >> b;
if (a == 0 && b == 0) break;
cout << min(a, b) << ' ' << max(a, b) << endl;
}
return 0;
} | 1 | 48,548,397 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n,k;cin >> n >> k;
typedef pair<int,int> T;
priority_queue<T> pq1;
priority_queue<T,vector<T>,greater<T>> pq2;
for (int i = 0; i < n; i++) {
int t,d;cin >> t >> d;
t--;
pq1.push(make_pair(d... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n,k;
cin >> n >> k;
ll ans = 0;
vector<vector<int>> a(n);
vector<pair<int,int>> vp(n);
for(int i = 0;i<n;i++)
{
cin >> vp[i].first >> vp[i].second;
}
sort(vp.begin(),vp.end(),[&](auto a,auto b){return a.second>b.second;});
m... | 1 | 62,793,010 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
#define NIL -1
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int s;
cin >> s;
map<int,bool> mp;
int cnt = 0;
while (0 == 0) {
if (mp[s] == true) {
break;
}
mp[s] = true;
if (s % 2 == 0) {
... | 1 | 7,768,191 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int X;
cin >> X;
X /= 200;
cout << 10-X << endl;
return 0;
} | #include<bits/stdc++.h>
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,... | 1 | 47,920,277 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep2(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, x;
cin >> a >> b >> x;
cout << (a + b >= x &... | 1 | 95,157,142 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s1, s2;
cin >> s1 >> s2;
if(s1 == s2) cout << "H" << endl;
else cout << "D" << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#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>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#d... | 1 | 19,100,336 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) cin >> P.at(i);
int ans = 0;
for (int i = 0, mi = 1e9; i < N; i++) {
if (P.at(i) > mi) continue;
ans++;
mi = P.at(i);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin>>n;
int ml=n+1,res=0;
for(int i=0;i<n;i++){
int p;cin>>p;
ml=min(ml,p);
if(ml==p)++res;
}
cout<<res<<endl;
} | 1 | 6,228,745 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | 1 | 21,499,730 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n,m,i,j;
cin>>n>>m;
char o[n][m];
ll dp[n][m];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>o[i][j];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
... | #include<bits/stdc++.h>
using namespace std;
long long int MOD = 1e9+7;
int main(){
int n,m;
char x;
cin>>n>>m;
long long int adj[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>x;
if(x=='.') adj[i][j]=0;
else adj[i][j]=-1;
}
}
if(a... | 1 | 55,934,130 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, i; cin >> N >> i;
cout << N - i + 1 << endl;
} | #include <stdio.h>
int main()
{
int n,p;
scanf("%d%d",&n,&p);
printf("%d\n",n+1-p);
return 0;
} | 1 | 73,551,234 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <bitset>
#define ll long long
int main()
{
ll N;
std::cin >> N;
std::map<ll, ll> mp;
for(ll i=2; i*i <= N; i++) {
if(N%i==0) {
mp[i]++;
N/=i;
... | 1 | 92,293,770 |
#include <iostream>
#include <algorithm>
using namespace std;
void trace(int a[], int n)
{
int i;
for (i = 0; i < n; i++) {
if (i > 0) cout << " ";
cout << a[i];
}
cout << endl;
}
int main(void)
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
trace(a, 3);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int max, mid, min;
if (a > b) {
max = a;
mid = b;
if (c > a) {
max = c;
mid = a;
min = b;
} else if (c > b) {
mid = c;
min = b;
} else {
min = c;
}
}
else if (b > a) {
max = b;
mid = a;
if (c... | 1 | 48,197,909 |
#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,h;
cin >> n >> h;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n){
cin >> a[i] >> b[i];
}
sort(b.begin(),b.end(),greater<ll... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
ll i,j,k,l;
int main(){
ll n,h,sum=0;cin>>n>>h;
vector<ll> a(n),b(n);
for(i=0;i<n;i++){
cin>>a[i]>>b[i];
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
for(i=0;i<n;i++){
if(b[i]<=a[n... | 1 | 6,114,269 |
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #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... | 1 | 47,896,173 |
#include <iostream>
int main(void){
int n, a;
std::cin >> n >> a;
std::cout << n*n - a << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int b;
cin >> n >> b;
cout << n * n - b << endl;
} | 1 | 66,542,678 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, N;
cin >> N >> A;
if(A > N){cout << "Yes" << endl;}
else if(N%500 <= A){cout << "Yes" << endl;}
else if(N%500 == 0){cout << "Yes" << endl;}
else{cout << "No" << endl;}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,am;
cin >> n >> a;
am=n%500;
if(am <= a){
cout << "Yes\n";
} else {
cout << "No\n";
}
return(0);
} | 1 | 18,163,447 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<bits/stdc++.h>
using namespace std;
int64_t lcd(int64_t x,int64_t y){
int64_t u,v,z;
u=min(x,y);
v=max(x,y);
z=v%u;
while(z>0){
v=u;
u=z;
z=v%u;
}
return x/u*y;
}
int main(){
int n,i;
int64_t t,ans=1;
cin>>n;
for(i=0;i<n;i++){
cin>>t;
ans=lcd(ans,t);
}
cout<<ans<<e... | 1 | 12,007,537 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
int input[3];
cin >> input[0] >> inpu... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
vector<int> v(3);
rep(i, 3) {
cin >> v[i];
}
sort(v.begin(), v.end());
... | 1 | 30,958,694 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#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(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 1000000009
template <typename T>
bool chmax(T... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 1 | 3,823,223 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
printf("%d",max(a-b,0));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int x,t;
cin>>x>>t;
if(x==t||x<t) cout<<"0"<<endl;
else cout<<x-t<<endl;
return 0;
} | 1 | 61,644,596 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (l... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin>>n>>m;
vector<pair<long long,long long> > a(n);
for(int i=0;i<n;i++){
cin>>a[i].second>>a[i].first;
a[i].second--;
}
sort(a.rbegin(),a.rend());
long long s=0;
long long c=0;
priority_queue<pair<long long,long long> > k;
vector<lo... | 1 | 57,955,376 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
int main()
{
int n, T = 0, H = 0, Bool = 1;
char a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a >> b;
for (int j = 0; a[j] != '\0' && b[j] != '\0'; j++){
if (a[j] > b[j]) { T += 3; Bool = false; }
if (a[j] < b... | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
int main() {
string s, t;
int taro = 0, hanako = 0;
... | 1 | 84,898,114 |
#include <iostream>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <functional>
#include <map>
#include <set>
#define Rep(i, n) for(int i=0;i<n;++i)
#define rep(i, n) for(int i=... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int64_t n, m, d;
cin >> n >> m >> d;
double ans;
if (!d) {
double p = (double)n / (n * n);
ans = (double)p * (m - 1);
}
else {
double p = (double)2 * (n - d)... | 1 | 3,511,563 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define PP pop_back
#define sz(x) (int)(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();
int n, m, a;
cin >> n >> m;
int sum = 0;
for... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using pint = pair<int,int>;
int main(){
int n, m, sum = 0;
cin >> n >> m;
rep(i,m){
int a;
cin >> a;
sum += a;
}
cout << max(-1, n - sum) << endl;
} | 1 | 75,993,937 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define in insert
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#de... | 1 | 83,478,288 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B, C, K; cin >> A >> B >> C >> K;
int cnt = 0;
for(int i = 0; i < (1 << K); i++) {
bitset<7> bits(i);
int a = A, b = B, c = C;
for(int j = 0; j < K; j++) {
if(bits.test(j)) b *= 2;
else c *= 2;
}
... | #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 repr(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>>
using ll = long long;
#define ALL(v) (v).begi... | 1 | 10,931,741 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main(){
ll N, M , K; cin >> N >> M >> K;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,K;
cin>>N>>M>>K;
bool flag=0;
for(int i=0;i<=N;i++){
for(int j=0;j<=M;j++){
if((i*(M-j)+j*(N-i))==K){
flag=1;
}
}
}
if(flag){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | 1 | 29,919,006 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int N;cin>>N;
double result = 0.0;
for (int i = 0; i < N; i++) {
double x;
string u;
cin>>x>>u;
if (u == "JPY") result += x;
else result += x * 380000.0;
}
printf("%.6f\n", result);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double a, ans=0;
cin >> N;
string str;
vector<double> item(N);
cout << fixed;
for (int i = 0; i < N; i++) {
cin >> a >> str;
if (str == "JPY") item.at(i) = a;
else item.at(i) = a * 380000;
}
sort(item.begin(), item.end());
... | 1 | 19,799,811 |
#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 equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n; cin >> n;
string s; cin >> s;
vector<ll> num(30, 0);
for (auto c : s) {
num[c - 'a']++;
}
ll ans = 1;
for (int i = 0; i < 26; ++... | 1 | 11,483,674 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <numeric>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<int>> a(h,vector<int>(w,0));
queue<vector<int>> que;
for(int i=0; i<h; i++){
f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int main() {
int h, w;
cin >> h >> w;
int a[] = {1, 0, -1, 0};
int b[] = {0... | 1 | 42,118,597 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 1,579,970 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
template <class T>
inline void read(T &x) {
x = 0;
int f = 0;
char ch = getchar();
while (!isdigit(ch)) { f |= ch == '-'; ch = getchar(); }
while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); ... | #include <stdio.h>
int main(){
long long N;
scanf("%lld", &N);
long long A[N], sum = 1;
for(long long i=0; i<N; i++){
scanf("%lld", &A[i]);
}
for(long long i=0; i<N; i++){
if(A[i] == 0){
printf("0\n");
return 0;
}
}
for(long long i=0; i<N; i++){
if(A[i] <= (1000000000000000000/sum)){
s... | 1 | 57,959,077 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_... | 1 | 10,905,267 |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i =(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPm(i,n) for(int i=(n)-1;i>=0;i--)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define mp make_pair
typedef long long ll;
int main(){
int H,W;
int r;
int c;
cin >> H ... | #include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <... | 1 | 39,695,139 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 8580;
int X, Y;
bool dp[2][MAX_N << 1];
char S[MAX_N];
vector<int> vecs[2];
int main()
{
scanf("%s%d%d", S + 1, &X, &Y);
int opt = 0, acc = 0;
bool flag = true;
for (int i = 1; S[i]; i++)
if (S[i] == 'F')
acc++;
... | #include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1... | 1 | 25,995,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer, l, r;
for (cin >> N, answer = 0; N; N--) {
cin >> l >> r;
answer += r-l+1;
}
cout << answer;
} | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 | 53,653,879 |
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
typedef signed long long ll;
#define FOR(i,to) for(i=0;i<(to);i++)
int64_t n;
bool dp[1000000+10];
ll cnt[1000000+10];
int main() {
int i,j,k,l,r,x,y; string s;
ll N;
cin >> N;
ll A[N];
FOR(i,N){
cin >> A[i];
dp[A[i]]=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 1 | 80,366,413 |
#include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++)
cnt[s[i]-'a']++;
for(int i=0;i<26;i++)
if(cnt[i]>1){
cout<<"no"<<endl;
return 0;
}
cout<<"yes"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
map<char,int>Map;
for(int i = 0; i < S.size(); i++) {
Map[S[i]]++;
}
for(int i = 0; i < S.size(); i++) {
if(Map[S[i]] > 1) {
cout << "no" << endl;
return 0;
}
}
co... | 1 | 91,469,051 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int JPY=0;
int64_t BTC=0;
double x;
string u;
for(int i=0; i<N; i++){
cin >> x >> u;
if(u=="JPY"){
JPY+=(int)x;
}
else{
BTC+=(int64_t)(x*100000000);
}
}
double BTCd;
BTCd=BTC*380000;
BTCd/=100... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 1 | 63,148,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, n, m) for (long long i = (long long)(n); i <= (long long)(m); i++)
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
LL A[100001];
vector<LL>v;
bool check(LL x){
LL now=0;
REP(i,x+1... | 1 | 5,307,404 |
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
std::vector<int> PRIMES;
void init_primes(int max)
{
if (max < 2) return;
std::set<int> candidate;
PRIMES.push_back(2);
for (int i = 3; i < max; i+=2) {
candidate.insert(i);
}
for (int i = 3; i < sqrt(max); i+=2) {
auto it = candi... | #include<cstdio>
#include<cstring>
const int N = 1000009;
int dp[N];
int isprime[N];
int main()
{
dp[1] = 0;
for(int i=2;i<N;i++)
{
if(!isprime[i])
for(int j=2*i;j<N;j+=i)
isprime[j] = 1;
dp[i] = dp[i-1] + ((isprime[i])?0:1);
}
int y;
while(~scanf("%d"... | 1 | 82,886,089 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1}... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
char c=s[0];
int ans=1,flag=1;
for(int i=1;i<4;++i){
if(s[i]==c) ++ans;
... | 1 | 67,102,502 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb ... | 1 | 52,966,988 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | #include<iostream>
#include<cstring>
using namespace std;
int main(){
int i,j,a[300],b[300],c[300],len;
string str1,str2;
cin>>str1>>str2;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(b));
if(str2[0]=='0'&&str2[2]=='0'&&str2[3]=='0')
cout<<"0"<<endl;
else{
a[0]=str1.length();
for(i=1;i<=... | 1 | 63,291,111 |
#include<iostream>
#include<algorithm>
#include <string>
using namespace std;
int main() {
int a, b, c, d, n = 0, ans = 0, ans2 = 0;
string s;
cin >>s;
s.insert(4, " ");
cout << s << endl;
} | #define _USE_NATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | 1 | 20,405,370 |
#include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
using namespace std;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
int x,n;
cin>>x>>n;
if( n==0 )
{
cout<<x;
return 0;
}
bool arr[200]={0};
for( int i=0 ; i<n ; i++ )
... | 1 | 48,987,965 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define be(v) v.begin(), v.end()
#define ll long long
ll INF = 1e9;
int main() {
int n; cin >> n;
vector<int> w(n);
int ans = 0;
rep(i,n) {
cin >> w[i];
ans+=w[i];
}
int mi = ans;
int ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
deque<int>W;
for (int i = 0; i < N; i++)
{
int w;
cin>>w;
W.push_back(w);
}
int front=W.front();
W.pop_front();
auto T=abs(front-(accumulate(W.begin(),W.end(),0)));
for (int i = 1; i... | 1 | 26,577,238 |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
while(true){
int a, b, n, t1, t2;
scanf("%d %d", &a, &b);
if(a == 0 && b == 0) return 0;
scanf("%d", &n);
vector< vector<int> > ucs;
vector< vector<int> > crosses;
for(int i = 0;i < b;++i){
vector<int> row(a... | #include<iostream>
using namespace std;
int dp[20][20];
bool map[20][20];
int main(){
int a,b,n;
while(cin>>a>>b,a!=0||b!=0){
cin>>n;
int x,y;
for(int i=0;i<20;i++){
for(int j=0;j<20;j++){
dp[i][j]=map[i][j]=0;
}
}
for(int i=0;i<n;i++){
cin>>x>>y;
map[x][y]=1;
}
dp[1][1]=1;
for(int i=1... | 1 | 35,625,105 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<((a<b&&b<c)?"Yes\n":"No\n");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int i, j, k;
cin >> i >> j >> k;
if (i < j && j < k)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | 1 | 27,502,957 |
#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);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF =... | #include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) ... | 1 | 35,355,841 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double x1, y1, x2, y2, q;
cin >> x1 >> y1 >> x2 >> y2;
q = sqrt(pow(x2-x1,2) + pow(y2-y1,2));
cout << fixed << setprecision(5) << q << endl;
return 0;
} | #include<iostream>
using namespace std;
#include<cmath>
int main() {
double x1, y1, x2, y2;
double result, temp;
cin >> x1 >> y1 >> x2 >> y2;
temp = pow(x1 - x2, 2) + pow(y1 - y2, 2);
result = sqrt(temp);
cout << fixed;
cout << result << endl;
return 0;
} | 1 | 75,492,229 |
#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... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 42,262,629 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include <fstream>
#include <time.h>
#in... | #include "bits/stdc++.h"
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) ... | 1 | 86,716,867 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll N, Y;
cin >> N >> Y;
bool b = false;
rep(i,N+1){
rep(j... | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <cstring>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using PP = pair<ll, pair<ll,ll>>;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
ll n, y;
int main() {
... | 1 | 60,880,312 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b;
cin >> a >> b;
if(a + b == 15) cout << '+' << endl;
else if(a * b == 15) cout << '*' << endl;
else cout<< 'x' <<... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
typedef pair<int, int> pi;
#define rep(i,n) for (int i = 0; i < n; i++)
... | 1 | 40,868,445 |
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define ceil(a,b) (((a)+(b)-1)/(b))
#define dist(a,b) max((a)-(b),(b)-(a))
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define... | #include <iostream>
#include <vector>
#include <cassert>
int const nmax = 200000;
int const sigma = 50;
int v[5 + nmax], temp[5 + nmax];
void process(int n) {
for(int i = 0;i <= n; i++)
temp[i] = 0;
for(int i = 1;i <= n; i++) {
temp[std::max(1, i - v[i])]++;
temp[std::min(n + 1, i + v[i] + 1)]--;
}
... | 1 | 92,354,022 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n,m;
scanf("%d %d",&n,&m);
vector<int> coin(m);
for(auto&e:coin){
scanf("%d",&e);
}
int INF=1<<18, MAX_N=50001;
vector<int> dp_coin(MAX_N);... | #if 0
#endif
#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<cmath>
using namespace std;
const int MAXN = (int) 1e5 + 10;
const int INF = (int) 0x3f3f3f3f;
typedef long long LL;
int N,M;
int c[MAXN];
int dp[MAXN];
void ... | 1 | 48,199,254 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int K, S;
cin >> K >> S;
ll ans = 0;
for (int i = max(0, S - 2 * K); i <= min(S, K); i++)
{
for (int j = max(0, S - i - K); j <= min(S - i, K); j++)
{... | 1 | 48,535,749 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
int a[5];
int main(void){
rep(i, 5) cin >> a[i];
sort(a, a+5, greater<int>());
rep(i, 4) cout << a[i] << " ";
cout << a[4] << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 1 | 41,183,292 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
fastIO
ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> h(n + 1, 0);
for(int i = 1; i <= n; i++) cin >> h[i];
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 1LL << 60));
dp[0][0] = 0;
... | 1 | 3,229,086 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll ans = 0;
ll r, g, b, n; cin >> r >> g >> b >> n;
for(ll i = 0; i <= 3000; ++i){
for(ll j = 0; j <= 3000; ++j){
if(((n - i * r - j * g) % b == 0 && n - i * r - j * g > 0) || n - i * r - j * g == 0){
ans++;
}
}
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int R,G,B,N;
cin >> R >> G >> B >> N;
int ans = 0;
for(int i = 0; i*R <= N; i++) {
for(int j = 0; i*... | 1 | 75,093,379 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
while(n--) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
cout << (abs((x2-x1)*(y4-y3) - (x4-x3)*(y2-y1)) < eps ? "YES" : "NO") << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef double Real;
typedef complex<Real> Point;
typedef pair<Point,Point> Line;
const Real EPS=1e-10;
inline Point vec(const Line& a){
return a.second-a.first;
}
Real dot(Point a,Point b){
return (conj(a)*b).real();
}
Real cross(Point a,Point b){
return (conj(... | 1 | 60,785,106 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,M;
while(1) {
cin >> H >> M;
for ( int i = 0; i < H; i++ ){
for ( int j = 0; j < M; j++ ){
if(i*j>=1&&i<=(H-2)&&j<=(M-2)){
cout<<".";
}
else {
cout<<"#";
}
}
cout<<endl;
if(H==0&... | #include<iostream>
using namespace std;
int main(){
int H[100000],W[100000];
int c=0;
for(int i=1;i<100000;i++){
cin>>H[i]>>W[i];
c++;
if(H[i]==0 && W[i]==0){
goto aa;
}
}
aa:;
for(int i=1;i<c;i++){
for(int j=0;j<H[i];j++){
for(int k=0;k<W[i];k++){
if((j==0 || j==(H[i]-1)) || (k==0 || k==(W[i]-1))){
cout<<"#";
... | 1 | 95,053,755 |
#include <iostream>
using namespace std;
int main(){
int a,b,x;
for(int j=1;j<=9;j++){
a=j;
for(int i=1;i<=9;i++){
b=i;
cout<<a<<"x"<<b<<"="<<a*b<<endl;
}
}
} | #include <iostream>
int main(){
for(auto i=1; i<=9; ++i){
for(auto j=1; j<=9; ++j){
std::cout << i << "x" << j << "=" << i*j << "\n";
}
}
return 0;
} | 1 | 35,666,564 |
#include <iostream>
using namespace std;
int main() {
int n, res;
cin >> n;
if (0b1000000 <= n) {
res = 64;
} else if (0b100000 <= n) {
res = 32;
} else if (0b10000 <= n) {
res = 16;
} else if (0b1000 <= n) {
res = 8;
} else if (0b100 <= n) {
res = 4;
} else if (0b10 <= n) {
res ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 17,252,536 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int ans = 0, cnt = 0;
for (auto c: s){
if (c == 'R'){
cnt++;
}
else{
cnt = 0;
}
ans = max(ans, cnt);
}
cout << ans... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string S;
cin >> S;
if(S == "SSS") cout << 0 << endl;
else if(S == "SSR") cout << 1 << endl;
else if(S == "SRS") cout << 1 << endl;
else if(S == "SRR") cout << 2 << endl;
else if(S == "RSS") cout << 1 << endl;
else if(S == "RSR") cout... | 1 | 61,002,101 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
sort(S.begin(), S.end());
cout << ((S == "abc") ? "Yes" : "No") << "\n";
} | 1 | 67,433,239 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | 1 | 13,780,615 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
ll ans = 0;
for (ll i = 0; i < n-1; i++) {
ans += (n-i)*(n-i+1)/2;
ll u, v; cin >> u >> v;
if (u > v)
swap(u, v);
ans -= u*(n-v+1);
}
ans += 1;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int INF = 1e9 + 10;
const ll MOD = 1e9 + 7;
void printv(vector<ll> v) {
for (ll i : v)
cout << i << " ";
cout << endl;
}
bool operator<(pair<bool, ll> p1, pair<bool, ll> p2) {
return (p1.second == p2.second ? p1.first < p2.first : p1.sec... | 1 | 19,630,657 |
#include <stdio.h>
#include <algorithm>
#include <numeric>
using namespace std;
int n;
long h[200000];
int k;
void solve() {
if (k >= n) {
printf("0\n");
return;
}
sort(h, h+n);
long attack = accumulate(h, h+n-k, 0L);
printf("%ld\n", attack);
}
int main() {
scanf("%d", &n);
s... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo... | 1 | 18,744,730 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
int li;
int ri;
int result;
result = 0;
for (int i = 0; i < N; i++)
{
cin >> li;
cin >> ri;
result = result + (ri-li) + 1;
}
cout << result << endl;
} | 1 | 93,825,867 |
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define s(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main(){
int n,m;
cin >> n>>m;
ll a[n];
rep(i,n)cin>>a[i];
ll ans =1000... | #include<iostream>
#include<algorithm>
#include<vector>
using ll = long long;
using namespace std;
constexpr ll INFI = 1e18;
ll calc(int n, int k, vector<int> v, int* a);
int main() {
int n, k;
ll lcost;
ll cost;
cin >> n >> k;
int* a = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
vector<int> v;
v.... | 1 | 49,550,569 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int H, W, N;
int a[100010], b[100010];
map<pii, int> mp;
int cnt[10];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> H >> W >> N;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 1 | 98,269,957 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=b-a+1;
if(a==b)
{
if(a%c==0||a%d==0)
cout<<0;
return 0;
}
... | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i=s; i<e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while(b != 0) {
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
ll A, B, C, D... | 1 | 29,800,436 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if ((x > 0 && y > 0) || (x < 0 && y < 0)){
if (x > y) cout << 2 + x - y << endl;
else cout << y - x << endl;
}
if ((x > 0 && y < 0) || (x < 0 && y > 0)){
cout << abs(y - (-x)) + 1 << endl;
}
i... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
... | 1 | 41,568,984 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18+7)
#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>
#define PiP pair<int,pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define ... | 1 | 37,585,274 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int main() {
int n; cin >> n;
int adj[n][n] = {};
for (int i = 0; i < n; i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k; j++) {
int v; cin >> v;
adj[u-1][v-1] = 1;
}
}
for (int i = 0; i... | #include <stdio.h>
int main(){
int Map[101][101];
int N, u, k, temp;
scanf("%d\n",&N);
for (int ix = 0; ix < N; ix++)
for (int jx = 0; jx < N; jx++)
Map[ix][jx] = 0;
for (int ix = 0; ix < N; ix++){
scanf("%d %d",&u,&k);
for (int kx = 0; kx < k; kx++){
... | 1 | 23,606,031 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(){
string s;
cin >> s;
s.insert(4, " ");
cout << s << endl;... | 1 | 67,097,385 |
#include <iostream>
#include <cmath>
using namespace std;
int test(double x1, double y1, double x2, double y2, double x3, double y3, double xp, double yp)
{
double xa = (x2 - x1);
double ya = (y2 - y1);
double xb = (x3 - x1);
double yb = (y3 - y1);
double xc = (xp - x1);
double yc = (yp - y1);
... | #include <iostream>
using namespace std;
class point{
public:
double x;
double y;
point(double px, double py){
x = px;
y = py;
}
};
double cross(point a, point b, point c, point d){
return (b.x - a.x) * (d.y - c.y) - (b.y - a.y) * (d.x - c.x);
}
bool pn(double a){
if (a > 0)
return true;
else
return fals... | 1 | 18,739,529 |
#include <iostream>
#include <vector>
#include <numeric>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
}
int sum = std::accumulate(a.begin(), a.end(), 0);
int count = 0;
for (int i = 0; i < n; i++)
{
... | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int N, M;
cin >> N >> M;
vector <int> A(N);
rep(i,N) cin >> A.at(i);
int sum = accumulate(all(A), 0);
double kagen = ... | 1 | 30,565 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inlin... | #define _GLIBCXX_DEBUG
#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... | 1 | 25,847,751 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.bigin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define vi... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 1 | 40,151,908 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF (1<<30);
int main() {
int N; cin >> N;
vector<tuple<ll, ll, ll> > v(N);
rep(i, N) {
ll a, b, sum;
cin >> a >> b;
sum = a + ... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n;
long a[1<<17],b[1<<17];
vector<pair<long,int> >A;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
A.push_back(make_pair(a[i]+b[i],i));
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
long ans=0;
for(int i=0;i... | 1 | 24,142,674 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,L;
cin>>n>>L;
vector<ll>v(n),ans(n-1);
ll sum=0;
for(ll i=0;i<n;i++)
{
cin>>v[i];
sum+=v[i];
}
for(ll f=0,l=n-1,j=0;j<n-1;j++)
{
if(v[f]+v[f+1]<v[l]+v[l-1])
{
if(sum>=L)
sum-=v[f];
else
{
cout<<"Impossible";
... | #include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
int n, l;
cin >> n >> l;
vector <int> a(n);
for(int &u : a) cin >> u;
pair <int, int> best = {-1, -1};
for(i... | 1 | 1,741,522 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , N_, a ;
cin>>N;
N_=N;
a=0;
for(int i=0 ; i<N ; i++){
int b ;
b=N_%10;
N_ = (N_-b)/10;
a +=b;
}
if(N%a==0){
cout<< "Yes" << endl;
}
else{
cout<<"No"<<endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int ncopy = N;
int f = 0;
while (0 != ncopy) {
f += ncopy % 10;
ncopy /= 10;
}
if (0 == N%f) {
cout << "Yes"<<endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 1 | 35,621,382 |
#include <bits/stdc++.h>
using namespace std;
const int DIM = 1e5 + 5;
int lev[DIM];
vector<int> edg[DIM];
void dfs( int x, int f, bool &ok ) {
lev[x] = lev[f] + 1;
for( int y : edg[x] ) {
if( y == f )
continue;
if( lev[y] == 0 )
dfs( y, x, ok );
else
if( ... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 100001;
int n, m, vis[N];
vector <int> v[N];
void dfs(int node, int &sz, int &b){
sz++;
for(auto &i : v[node]){
if(vis[i] == -1){
vis[i] = vis[node] ^ 1;
... | 1 | 41,493,820 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
if((B - A) % 2 == 0){
cout << "Alice" << endl;
}
else{
cout << "Borys" << endl;
}
return 0;
} | #include<stdio.h>
int main()
{
int n,a,b;
scanf("%d %d %d",&n,&a,&b);
while(a<b && a,b>=0 && a,b<=n)
{
a++;
if(a==b)
{printf("Borys");
break;
}
if(b-a ==1)
{
printf("Alice");
break;
}
b--;
}
... | 1 | 88,982,307 |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#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 irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int order = 1;
int n = N;
while(n >= 10) {
n /= 10;
order++;
}
int ans = 0;
for(int i = order; i > 0; i--) {
if(i % 2 == 0) {
continue;
}
else if(i == order) {
ans += N - pow(10, order - 1) + 1;
... | 1 | 3,615,875 |
#include<iostream>
using namespace std;
int main(){
int mon,cnt;
while(1){
cin >> mon;
if(mon==0)break;
cnt=0;
mon=1000-mon;
while(1){
if(mon<5)break;
if(mon>=500){mon-=500;cnt++;}
else if(mon>=100 && mon<500){mon-=100;cnt++;}
else if(mon>=50 && mon<100){mon-=50;cnt++;}
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int num;
int money[]={500,100,50,10,5,1};
int i,ans;
for(;;){
cin>>num;
if(num==0) break;
i=0;ans=0;
num=1000-num;
while(num!=0){
ans += num/money[i];
num =... | 1 | 82,135,699 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long h, w;
cin >> h >> w;
long long result;
if (h == 1 || w == 1) {
result = 1;
} else if (h % 2 == 1 && w % 2 == 1) {
result = h * w / 2 + 1;
} else {
result = h * w / 2;
}
cout << result << endl;
return 0;
} | 1 | 98,181,892 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
vector<int>... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
vector<int> alphabet(26);
int N = S.size();
rep(i,N){
alphabet[S[i] - 'a']++;
}
rep(i,26){
if(alphabet[i] >= 2){
cout << "no" << ... | 1 | 36,139,016 |
#include <iostream>
#include<string>
using namespace std;
int main()
{
int n,a,b,aq;
string str,line;
cin >> str >> n ;
aq=(int)str.size();
char s[aq];
for(int i=0;i<n;i++){
cin >> line >> a >> b;
if(line=="print"){
for(int j=0;j<b-a+1;j++){
cout << st... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s, c, p;
int q, a, b;
cin >> s >> q;
while (q-- && cin >> c) {
cin >> a >> b;
int size = b - a + 1;
if (c == "print")
cout << s.substr(a, size) << endl;
else if... | 1 | 41,051,513 |
#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int y, x;
while (1) {
cin >> y >> x;
if (y == 0 && x == 0)break;
for (size_t i = 0; i < y; i++)
{
for (size_t i = 0; i < x; i++)
{
cout << '#';
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include<stdio.h>
int main(){
int x[10000],y[10000],i,j,h,w;
for(i=0;i<10000;i++){
scanf("%d %d",&x[i],&y[i]);
if(x[i]==0&&y[i]==0){
break;
}
}
for(j=0;j<i;j++){
for(h=0;h<x[j];h++){
for(w=0;w<y[j];w++){
printf("#");
}
printf("\n");
}
printf("\n");
}
r... | 1 | 70,639,987 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.