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;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
string s;
cin>>s;
ll ans=0;
for(ll i=0;i<=999;i++){
ll now=i;
ll ch2[3];
for(ll j=0;j<3;j++){
ch2[j]=now%10;
now/=10;
}
ll cnt=0;
for(ll j=0;j<n;j++){
if(l... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 100,576,371 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 88,637,429 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s,t;
cin >> s >> t;
vector<int>a(s.size());
vector<int>b(t.size());
rep(i,s.size()) a.at(i) = s.at(i);
rep(i,t.size()) b.at(i) = t.at(i);
sort(a.begin(), a.end());
sort(b.begin(), b.end... | 0 | 20,948,476 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1e+9;
int main(){
int n;
while( cin >> n , n ){
int d[11][11], v=0, s[11]={0};
for(int i=0 ; i < 11 ; i++ ){
for(int j=0 ; j < 11 ; j++ ){
d[i][j] = (i==j)? 0 : INF;
}
}
for(int i=0 ; i < n ; i++ ){
int a,b,c;
cin >>... | #include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main()
{
int N, M;
while (scanf("%d ", &N) == 1) {
if (N == 0) {
break;
}
map<char, char> m;
char d, s;
for (int i = 0; i < N; i++) {
scanf("%c %c ", &s, &d);
m[s] = d;
}
scanf("%d ", &M);
... | 0 | 83,619,719 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int i = 0; i < N; i++)
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES";} else {ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, K;
cin >> N >> K;
int upper = (N - 1... | 0 | 85,563,137 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
long long a,b,c,k;
cin >> a >> b >> c >>k;
long long ans = a-b;
if(k%2 != 0){
ans *= -1;
}
cout << ans <<endl;
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ull = unsigned long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ull> a;
rep(i, n+1){
... | 0 | 70,948,672 |
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int sigma = 26;
string s;
int dp[1 << sigma];
int main() {
cin >> s;
dp[0] = 1;
int act = 0, crtBest = 0;
for(int i = 0; i < (int)s.size(); i++) {
act ^= (1 << (s[i] - 'a'));
crtBest =... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int i;
cin >> s;
for( i=0; i<s.size(); i++)
{
if(s[i]=='7')
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
} | 0 | 21,263,460 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | 0 | 91,594,458 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pi (acos(-1))
#define ull unsigned long long
#define ld long double
#define M 100000
ll LCM(ll a, ll b)
{
ll g = __gcd(a,b);
return (a*b)/g ;
}
string numtostr(ll n)
{
ostringstream str1 ;
str1 << n ;
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 52,748,020 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define zad tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
#define in1(x) scanf("%lld",&x)
#define in2(x,y) scanf("%lld%lld",&x,&y)
#define in3(x,y,z) scanf("%lld%lld%lld",&x,&... | 0 | 68,958,970 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | 0 | 44,172,151 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x,y;
cin>>x>>y;
cout<<x+(y+1)/2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int arra[m+5];
map<int,int>mp;
for(int i=0;i<m;i++) {
cin>>arra[i];
mp[arra[i]]++;
}
int fnd=0;
int val=n;
while(fnd!=1) {
if(!mp[val]) {
fnd=1;
}
else {
... | 0 | 82,516,921 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int h, w;
cin >> h >> w;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 97,061,675 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <list>
using namespace std;
#define N 22369620
#define X 50
struct hush
{
list <int> a;
};
int main(void)
{
int n, sum = 0, x, f[1000000] = { 0 }, cou = 0;
char str[7], acgt[13];
hush H[N / X];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
sum ... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 0 | 47,368,767 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
for (int bit = 0; bit < (1 <<... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve9b(string s, int a) {
int n = s.size();
string ans = s;
REP(i,a) {
int h;
... | 0 | 39,300,893 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI acos(-1)
int main(){
string s,t;
cin >> s >> t;
vector<vector<int>> alfs(26),alft(26);
for(int i = 0;i < (int)s.size();i++){
alfs[s[i] - 'a'].push_back(i);
alft[t[i] - 'a'].push_back(i);
}
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10, MOD = 1e9 + 7;
int dp[N], dp2[N], x[N], y[N];
int32_t main()
{
int n, m; cin >> n >> m;
for (int i = 0; i < n; i ++) cin >> x[i];
for (int i = 0; i < m; i ++) cin >> y[i];
sort(x, x + n);
sort(y, y + m);
... | 0 | 32,650,895 |
#include <iostream>
#include <cstdlib>
using namespace std;
int n;
void solve()
{
long double x[4],y[4],px[2],py[2];
for(int i = 0; i < 4; i++){
cin >> x[i] >> y[i];
}
px[0] = x[1] - x[0];
px[1] = x[3] - x[2];
py[0] = y[1] - y[0];
py[1] = y[3] - y[2];
if(px[0]*py[1] == px[1]*py[0])
cout << "YES";
else
co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 76,893,581 |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DUMP(a, n) REP(_i, n) printf("%d%c", a[_i], _i + 1 == n ? '\n' : ' ')
#define DUMP2D(a, n, m) REP(_i, n) REP(_j, m) printf("%d%c", a[_i][_j], _... | 0 | 83,073,080 |
#include <cstdio>
#include <cmath>
class point{
double x;
double y;
public:
point(double a, double b){x=a;y=b;}
point(){x=0;y=0;}
point operator+(point ob2);
point operator-(point ob2);
point operator/(double d);
point rot(point p, double theta);
void print(){printf("%f %f\n",x,y);}
... | #include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
ll N;
ll i;
vector<long long int> A;
cin >> N;
for(i=0;i<N;i++){
ll ai;
cin >> ai;
A.push... | 0 | 42,062,233 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define disl... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >>... | 0 | 33,237,294 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
bool flag1 = true;
while(flag1){
flag1 = false;
for(int i=0; i<n; ++i){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {... | 0 | 93,000,717 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<string, int>> card;
for(int i = 0; i < n; i++){
string s; cin >> s;
bool flag = true;
for(int j = 0; j < card.size(); j++){
if(card.at(j).first == s){
card.at(j).second++;
flag = false;
... | #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(){
ll q,... | 0 | 30,940,149 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
ty... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N; cin>>N;
int Amax;
vector<int> A(N,0);
for (int i = 0; i < N; i++){
cin>>A[i];
Amax=max(Amax,A[i]);
}
A.push_back(10000000);
sort(A.begin(),A.end());
vector<bool> not_divisible(Amax+1,true... | 0 | 29,418,872 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
0 <= a,b,c <= 100;
if(a < b && b < c){
cout << "Yes" << endl;
} else{
cout << "No" << endl;
}
} | #include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int people;
int total=0;
for (int i = 0; i < N; i++) {
... | 0 | 47,775,480 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =100000... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void)
{
int n;
string s1,s2;
string kurai = "mcxi";
vector<int> v1(4),v2(4);
vector<int> sum(4);
int temp;
char c;
int i,i1,i2;
cin >> n;
for(i=0; i<n; i++){
cin >> s1 >> s2;
for(i1=0; i1<4; i1++){
v1[i1] = 0;
v2[... | 0 | 95,284,030 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
int n;
cin >> n;
V<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
V<ll> s(n);
s[0] = a[0];
for (int i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | 0 | 13,495,516 |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=(a);i<=(b);i++)
#define per(i,a,b) for (rg int i=(b);i>=(a);i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define replow(i,a,b) for(rg int i = (a);i<=(b);i+=lowbit(i))
#define perlow(i,a,b) for(rg int i = (b);i>=(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = { 1, 0, -1, 0 }, dy[4]... | 0 | 40,684,896 |
#include<iostream>
#include<stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
const int NMAX = 65536, MMAX = 32, INF = 10000000;
int dp[NMAX];
int d[MMAX];
int main() {
int M, N;
cin >> N >> M;
REP(i, M) {
cin >> d[i];
}
REP(i, N+2) {
dp[i] = INF;
}
dp[0] = 0;
REP(m, M) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, k;
... | 0 | 79,680,269 |
#include <iostream>
void p(int a, int b, int c) {
std::cout << a << ' ' << b << ' ' << c << std::endl;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a > b) {
if (b > c) {
p(c, b, a);
} else {
if (a > c) {
p(b, c, a);
} else {... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int f,n,m;
cin>>n;
m=n/2;
f=n%2;
string a,s,t;
cin>>a;
s=a.substr(0,m);
t=a.substr(m,n-m);
if(f==0)
{
if(s==t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
cout<<... | 0 | 16,510,223 |
#include <cstdio>
using std::scanf;
using std::printf;
const int kNil = -1;
struct Node { int parent, left, right; };
void SetDepth(struct Node tree[], int cur_node, int cur_depth, int depth[]) {
depth[cur_node] = cur_depth;
if (tree[cur_node].left != kNil) {
SetDepth(tree, tree[cur_node].left, cur_depth + 1, d... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
map<int, int> A;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (A.count(a) == 0) {
A.insert(make_pair(a, 0));
}
A[a] += 1;
}
int ans = 0;
for (int x = 0; x <= ... | 0 | 96,764,209 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | 0 | 15,223,210 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << 0 << endl;
string s;
cin >> s;
if(s == "Vacant") return 0;
bool f0 = true;
if(s == "Male") f0 = false;
int l=0, r=n;
while(1){
int mid = (l+r)/2;
cout << mid << endl;
cin >> s;
if(s == "Vacant") return... | #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef pair<long long int, long long int> ... | 0 | 64,152,612 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
#define vi vector<int>
int main(){
int n; cin >> n;
vi a(n); rep(i, n) cin >> a[i];
vi lm(n);
vi rm(n);
for(int i = 1; i < n; i++) lm[i] = max(lm[i-1],a[i-1]);
for(int i = n-2; i >= 0; i--) rm[i] = max(rm[i+1],a[i+1])... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 46,433,445 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typed... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int x,y;
cin>>x>>y;
const long long INF=1LL<<60;
long long int ans1=INF,ans2=INF,ans3=INF,ans4=INF;
long long int tmp_x=-1*x;
long long int tmp_y=-1*y;
if (y-x>=0) {
ans1=y-x;
}
if (y-tmp_x>=0) {
... | 0 | 52,229,112 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | #include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <stack>
#define rep(i,x) for(int i=0;i<x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rep_to(a,i,x) for(int i=a;i<x;i++)
using namespace std;
int randset(int A,int B,int C,int X)
{
return ... | 0 | 41,391,952 |
#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... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 41,695,729 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cctype>
using namespace std;
string str2;
int main(){
int x[8],i,ans1=0,ans2=0;
for(i=0;i<8;i++){
cin>>x[i];
}
for(i=0;i<8;i++){
if(i==0||i==1||i==2||i==3){
ans1+=x[i];
}else{
ans2+=x[i];
}
}
if(ans1<ans2){
cout<<ans2<<endl;
}else{
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 5;
const int M = 1e6 + 5;
int n;
int a[N], cnt[M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
cnt[a[i]]++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
auto divi = [&](int i) {
fo... | 0 | 9,816,948 |
#include <iostream>
using namespace std;
const int MAX = 200000;
int main() {
int M; cin >> M;
int d[MAX];
long long c[MAX];
for (int i = 0; i < M; i++) cin >> d[i] >> c[i];
long long D = 0;
long long S = 0;
for (int i = 0; i < M; i++) {
S += d[i] * c[i];
D += c[i];
}
long long ans = (D - 1) +... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<(x)<<endl
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf=1e18;
const int N=2e5+10;
ll factorial(ll x){
if(x==0||x==1) return 1;
return x*factorial(x-1);
}
ll gcd(ll a ,ll b){return b ? gcd... | 0 | 63,264,456 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
#define all(v) v.begin(), v.end()
int main() {
string s, t;
cin >> s >> t;
int ls = s.size(), lt = t.size();
int ans = t.size() + 1;
for (int i = 0; i <= ls - lt;i++) {
int op = 0;
for (int j = 0; j... | 0 | 17,574,717 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
ll N,K;
cin >> N >> K;
vector<pair<ll,ll>> pos(N);
vector<ll> x(N);
vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 72,197,982 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int a,b,c,d; cin>>a>>b>>c>>d;
if(a+b>c+d) cout<<"Left"<<endl;
else if(a+b... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 51,481,644 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;
--n;
vector<vector<int>> ve... | #include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdlib>
using namespace std;
int main(){
string str;
int n;
cin >> str >> n;
for(int i=0;i<n;i++){
string cmd;
cin >> cmd;
if(cmd.compare("print") == 0){
int a,b;
... | 0 | 21,733,709 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, l, s = 0;
vector<int> v;
cin >> n;
REP(i, n * 2) {
cin >> l;
v.push_back(l);
}
sort(v.rbegin(), v.rend());
REP(i, n) {
s += min(v[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
char anti(char c){
if(c == 'W') return 'S';
else return 'W';
}
int main(){
ll n;
string s;
cin >> n >> s;
vector<char> a(n);
pair<char,char> cands... | 0 | 84,500,452 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | #include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b)... | 0 | 48,469,743 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define read(a) scanf("%d", &a)
#define x first
#define y second
#define N 1514
int n, K;
char s[N];
int dp[N][26];
int main() {
scanf("%s%d", s, &K);
n = int(strlen(s));
bool all = 1;
for (int i = 1; i < n; i++) all &= ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
... | 0 | 47,317,820 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(ll i = 0;i<n;++i)
using ll = long long;
using P = pair<string,int>;
int main(){
int n,a,b;
cin >> n >> a >> b;
vector<int> p(n);
rep(i,n) cin >> p[i];
sort(p.begin(),p.end());
int x = 0;
int y = 0;
int z = 0;
rep(i,n){
if(p[i] <= ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[1050];
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int mn=1000000;
for(int i=1;i<n;i++){
mn=min(mn,a[i]-a[i-1]);
}
cout<<mn<<endl;
}
... | 0 | 97,137,623 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | #include <iostream>
#include <vector>
using namespace std;
class Solution {
private:
int N, M, X;
vector<int> costs;
vector<vector<int>> arr;
public:
void load() {
cin >> N >> M >> X;
costs.assign(N, 0);
arr.resize(N);
for (int i = 0; i < N; ++i) {
arr[i].resi... | 0 | 6,543,171 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int N;
cin >> N;
int ct = 0, cx = 0, cy = 0;
rep(i, N)
{
int t, x, y;
cin >> t >> x >> y;
int d = abs(x + y - (cx + cy));... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 81,239,483 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
ll N, Ans = 0;
int main(){
cin >> N;
vector<ll> V(N + 1);
map<ll, ll> M;
rep(i, 1, N + 1){
cin >> V[i];
M[V[... | #include <iostream>
using namespace std;
int main() {
int sides[3];
int num;
cin >> num;
int sumSidesSq=0;
for(int i=0; i<num; i++) {
int maxIndex=0, maxValue=0;
for(int j=0; j<3; j++) {
cin >> sides[j];
if(sides[j] > maxValue) {
maxValue = sides[j];
maxIndex = j;
}
... | 0 | 52,658,984 |
#include <stdio.h>
#include <string.h>
int dp[20][55][20];
int cnt_sum(int n, int s, int x){
if(n < 0 || s < 0){
return 0;
}
if(dp[n][s][x] != -1){
return dp[n][s][x];
}
if(n == 0 && s == 0){
return (1);
}
if(x>9){
return (0);
}
return dp[n][s][x] = (cnt_sum(n-1, s-x, x+1) + cnt_sum(n,... | #include<stdio.h>
int main(void)
{
int a[10],i,j,tmp;
for(i=0;i<10;i++){
scanf("%d",&a[i]);
}
for(i=0;i<10;i++){
for(j=i+1;j<10;j++){
if(a[i]<a[j]){
tmp=a[j];
a[j]=a[i];
a[i]=tmp;
}
}
}
printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
return 0;
} | 0 | 8,410,252 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int c_get_keta(long long int a) {
int a_cnt = 0;
while (a > 0){
a_cnt++;
a /= 10;
}
return a_cnt;
}
void c_digits_in_multiplication(void) {
long long int n;
int min_tmp;
int ans_min = 1000000... | #include <iostream>
using namespace std;
typedef struct {
char mark;
int number;
} card;
int N;
card c1[40], c2[40];
void bubbleSort(card* c);
void selectionSort(card* c);
void trace(card* c);
bool compare();
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
char ch; int num;
cin >> ch >> num;
c1... | 0 | 51,544,024 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | #include<bits/stdc++.h>
#define ll long long
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
using namespace std;
ll mod=1e9 +7;
const ll M=500006;
ll f[M],inv[M];
ll expo(ll base,ll exponent){
ll ans=1;
while(exponent!=0){
if(exponent&1)... | 0 | 86,771,134 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
map<char,ll>a;
for(ll i=0;i<s.size();i++){
a[s[i]]++;
}
bool ch=true;
for(auto itr=a.begin();itr!=a.end();itr++){
ll val=itr->second;
if(val!=2){
ch=false;
}
... | 0 | 89,919,806 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int main() {
long long num;
long long Min;
long long tmp;
cin >> num;
vector<long long> vec(num);
for (int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
int N;
int M;
vector<pii> mem[100010];
int P[100010];
int num[100010];
signed main()
{
cin >> N >> M;
rep(i, M)
{
int p, y;
cin >> p >> y;
P[i] = p;
... | 0 | 9,212,681 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using Graph = vector<vector<pair<int, int>>>;
const ll INF = 1001001001;
vector<int> dist;
bool ok;
void dfs(int v, int cost, const Graph &G){
dist[v] = cost;
for(auto p : G[v]){
int nv = p.fir... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
using Tree = vector<vector<int>>;
int N;
vector<long long> D;
map<long long, int> dtoi;
vector<int> subtree_size;
long long rec(const Tree &G, int v) {
long long res = 0;
for (auto c : G[v]) {
res += rec(G, c)... | 0 | 73,045,179 |
#include <iostream>
using namespace std;
int main() {
long x, y;
cin >> x >> y;
int a;
if (x % y == 0) {
a = -1;
}
else {
a = x;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <string.h>
#include <map>
#define MEM(var, val) memset(var, (val), sizeof(var))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define nitro \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | 0 | 5,298,997 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char tmp;
int count = 0;
int finished = 0;
vector<string> a(H);
for (int i = 0; i < H; i++) {
cin >> a.at(i);
}
do {
finished = 0;
for(int i = 0; i < H; i++) {
count = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 53,150,707 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define rrep(i,a,b) for(int i = a; i >=b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#define nl "\n"
#define all(x) (x).begin(),(x).e... | 0 | 75,382,781 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
vector<int> scores(n);
for (int i = 0; i < n; i++) {
cin >> scores[i];
}
sort(scores.begin(), scores.end());
cout <... | 0 | 16,216,938 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
int main(){
int W, H, N;
vector<int> x(N);
vector<int> y(N);
ve... | 0 | 34,454,233 |
#include<bits/stdc++.h>
using namespace std;
int main(){
set<char> r;
r.insert('q');
r.insert('w');
r.insert('e');
r.insert('r');
r.insert('t');
r.insert('a');
r.insert('s');
r.insert('d');
r.insert('f');
r.insert('g');
r.insert('z');
r.insert('x');
r.insert('c');
r.insert('v');
r.insert... | #include <iostream>
using namespace std;
#include <stdio.h>
int main()
{
int x;
int i=0;
while (true) {
cin >> x;
if (x == 0){
break;
}
printf("Case %d: %d\n", ++i, x);
}
return 0;
} | 0 | 68,027,339 |
#include <iostream>
#include <stdio.h>
#define INF 10000
using namespace std;
struct edge {
int from, to, cost;
};
edge es[100];
int d[11];
int n,maxV=0;
int shortest_path(int s){
int sum=0;
for(int i=0;i<maxV+1;i++){
d[i] = INF;
}
d[s] = 0;
while(1){
bool update = false;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> route[200005];
vector<bool> visited(200005,0);
int s[200005];
void dfs(int v){
s[v]=0;
visited[v]=1;
for(int i:route[v]){
if (visited[i]==1) continue;
dfs(i);
s[v]+=s[i];
}
s[v]++;
return;
}
vo... | 0 | 48,470,965 |
#include <bits/stdc++.h>
typedef long long ll;
#define IO ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define endl '\n'
const int N = 2e5 + 10;
using namespace std;
int sum[N] = {};
vector<vector<int>> adj;
void dfs(int u, int p) {
for (auto child:adj[u]) {
if (child != p) {
sum[child]... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define FOR(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 MAX(x) *max_element(ALL(x))
#define MIN(x) *min_elemen... | 0 | 42,607,016 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a, b, C;
double S, L, h;
double PI=acos(-1);
cin>>a>>b>>C;
S=a*b*sin(C*PI/180.0)/2;
L=a+b+sqrt(a*a+b*b-2*a*b*cos(C*PI/180.0));
h=b*sin(C*PI/180.0);
printf("%f\n%f\n%f\n", S, L, h);
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<l... | 0 | 66,560,686 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
char s[2];
cin>>s;
s[0]++;
cout<<s<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 24,217,494 |
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
string s;cin>>s;
char c=s[0];
int ans=0;
for(int i=1;i<s.length();++i){
if(s[i]!=c){
ans++;
c=s[i];
}
}
cout<<ans<<endl;
return 0;
} | 0 | 74,332,424 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define ll long long
bool pairCompare(const pair<int, int> & f, const pair<int, int> & s)
{
return f.first < s.first;
}
int main()
{
int n, m;
ll ans;
cin >> ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 18,089,886 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int N = 2e5+10;
int cnt[N], a[N], res, n;
signed main()
{
Xin... | 0 | 24,120,762 |
#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 all(a) (a).begin(), (a).end()
int main(){
int N;
cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++) cin >> W[i];
int right = 0;
for(in... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(ll i... | 0 | 14,810,234 |
#include<iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)break;
int total = m + f;
if (m == -1 || f == -1) cout << 'F' << endl;
else {
if (total >= 80) cout << 'A' << endl;
else if (total < 80 && total >= 65) cout << 'B' << end... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,a,b,temp;
cin>>x>>a>>b;
temp=a-b;
if(temp>=0)
{
cout<<"delicious";
}
else
{
temp=abs(temp);
temp=x-temp;
if(temp>=0)
cout<<"safe";
else
cout<<"dangerous";
}... | 0 | 57,091,342 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, ... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <vector>
#include <cmath>
#include <cstdint>
#include <string>
using namespace std;
int main() {
while (true) {
string d;
cin >> d;
if (d == "-") break;
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
... | 0 | 41,325,945 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k; cin>>k;
string s; cin >> s;
int n=s.size();
if(n>k){
s = s.substr(0,k)+"...";
}
cout << s << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn= 5e5+5;
#define mod 1000000007
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
rishabh();
int a,b;
cin>>a>>b;
string s;
cin>>s;
for(int i=0;i<a;i++){
... | 0 | 95,195,042 |
#include <iostream>
using namespace std;
int main()
{
int N=0,a=0,b=0,c=0;
int num=0;
cin >> N;
for(N; N>0; N--){
cin >> a >> b >> c;
if(a < b){
num = a;
a = b;
b = num;
}
if(a < c){
num = a;
a = c;
c = num;
}
a = a * a;
b = b * b;
c = c * c;
if(a == (b + c)) cout << "YES" ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 12,237,394 |
#include <iostream>
using namespace std;
template <class T>
void printArray(T Array, int N)
{
for (int i = 0; i < N; ++i)
{
if (i > 0) cout << " ";
cout << Array[i];
}
cout << endl;
}
void swap(int & a, int & b)
{
int tmp = a;
a = b;
b = tmp;
}
void selectionSort(int A[], int... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong k;
llong a[100005];
llong res(ll... | 0 | 68,875,641 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
int sum = 0;
vector<int> d(n);
rep(i,n) cin >> d[i];
rep(i,n)rep(j,n){
if(i == j) continue;
sum += d[i]*d[j];
}
cout << sum/2 << endl;
} | #include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | 0 | 20,258,101 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll md = 1000000007;
#define rep(i, b) for(i = 0; i < b; i++)
#define fr first
#define sc second
using vl = vector<ll>;
using vvl = vector<vl>;
vl p, B, fac(2, 1), ifac(2, 1);
ll ad(ll a, ll b, ll mod = md) {
return (a%... | #include <iostream>
#include <cmath>
#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>
#inclu... | 0 | 9,769,478 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int A = S.size();
int i = 0;
while(i < A){
cout << S[i];
i += 2;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, g, I;
cin >> n;
long long S[n], M=5000000000, p, k, L=0, R=200002, t;
for (int i = 0; i < n; i++)
{
cin >> S[i];
}
while (R - L > 1)
{
t = (L + R) / 2;
g = 1;
set <long long> Se;
set... | 0 | 90,778,699 |
#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main(){
double a,b,c,d,s,L,h;
cin>>a>>b>>c;
s=0.5*a*b*sin(c*M_PI/180);
printf("%.10f\n",s);
h=2*s/a;
d=sqrt(a*a+b*b-2*a*b*cos(c*M_PI/180));
L=a+b+d;
printf("%.10f\n",L);
printf("%.10f\n",h);
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | 0 | 7,439,345 |
#include <bits/stdc++.h>
using namespace std;
signed main(void)
{
int a;
map<int, int> m;
for(int i = 0; i < 3; i++)
{
cin >> a;
m[a]++;
}
for(auto p: m)
{
if (p.second == 1)
{
cout << p.first << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 83,181,248 |
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#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--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 50,942,008 |
#include<iostream>
using namespace std;
int main()
{
long int n, i, fact=1;
cin>>n;
for(i=1; i<=n; i++)
{
fact=fact*i;
}
cout<<fact<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
LL k;
cin >> k;
if(k==0){
cout << 2 << endl;
cout << "1 1" << endl;
return 0;
}
if(k==1){
cout << 3 << endl;
cout << "1 0 3" << endl;
re... | 0 | 76,735,706 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
struct SegmentTree {
int n;
vector<int> dat;
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2*n-1, INF);
}
void up... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(i... | 0 | 81,368,536 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int N,A,B;
cin >> N >> A >> B;
int ans = 0;
for (int i = 1; i <= N; ++i)
{
int temp = i;
int now = 0;
while(temp > 0)
{
now += temp % 10;
temp /= 10;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lowbit(a) ((a) & -(a))
#define clean(a, b) memset(a, b, sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 9;
int _;
ll Pp[maxn],Cc[maxn],mp[5009];
ll a[maxn],sum[maxn];
vector<ll>ve[5009];
int main()
{
l... | 0 | 69,866,527 |
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
using namespace std;
bool judge(string s, string p)
{
if(s.find(p) == string::npos){
return false;
}
else{
return true;
}
}
void print_answer(bool judge)
{
if(judge == true){
printf("Yes\n");
}
else{
printf("No\n");
}
}
int main... | #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;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define s... | 0 | 88,915,390 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
double n, m, d;
cin >> n >> m >> d;
double a;
if(d==0) a = (n - d) / (n*n);
else ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#define ... | 0 | 16,064,024 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
main() {
char A[100],B[100],C[100];
int a,b,c;
cin>>A;
cin>>B;
cin>>C;
a=strlen(A);
b=strlen(B);
c=strlen(C);
if(A[a-1]==B[0] && B[b-1]==C[0])
cout<<"YES";
else
cout<<"NO";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<int> A(26);
for(int i=0;i<S.size();i++){
for(char C='a';C<='z';C++){
if(S.at(i)==C){
int B=C-'a';
A.at(B)++;
break;
}
}
}
bool a=false;
for(int i=0;i<26;i++){
if(A.at(i)==0)... | 0 | 33,529,251 |
#include <bits/stdc++.h>
using namespace std;
long long LCM (long long a, long long b) {
long long a2 = a, b2 = b;
long long r;
while(max(a,b)%min(a,b) != 0) {
r = max(a,b)%min(a,b);
(a > b ? a : b) = r;
}
return a2/min(a,b)*b2;
}
int main() {
int N;
cin >> N;
vector<long long> T(N);
for (int ... | #include<iostream>
using namespace std;
#include<string>
string s, t;
int dp[1001][1001];
int main()
{
int p;
cin >> p;
while(p>0)
{
p--;
cin >> s >> t;
int n = s.size();
int m = t.size();
for (int i = 1; i <= n; i++)
dp[i][0] = 0;
for (int i =... | 0 | 28,609,461 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n, k; cin >> n >> k;
ll ans = k * pow(k-1, n-1);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 0 | 81,694,787 |
#include <bits/stdc++.h>
using namespace std;
#define start_routine cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); int begtime = clock();
#define end_routine int endtime = clock(); cerr << endl << "Time elapsed: " << (endtime - begtime)*1000/CLOCKS_PER_SEC << " ms"; return 0
#define contests_de_diya_kar 0
#... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 100000000000000000
#define mod 1000000007
#define MAX 10000005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<lint,lint> pii;
bool prime[MAX];
int lowFactor[MAX];
void SIEVE(void){
for(int i=1... | 0 | 32,369,631 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
struct unionFind {
vector<int> par;
unionFind(int n):par(n, -1) {}
int root(int x) {
if(par[x] < 0) return x;
return par[x] = root(par... | #include <iostream>
#include <string>
int main()
{
std::string str;
std::cin >> str;
char current = str[0];
int count = 0;
for (const char c : str)
{
if (c != current)
{
++count;
current = c;
}
}
std::cout << count << std::endl;
return ... | 0 | 75,109,537 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++)
ans = max(ans, abs(a[j]-a[i]));
}
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
#include <utility>
typedef long long ll;
#define pi 3.141592653589793238... | 0 | 16,593,611 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll N, L, T;
cin >> N >> L >> T;
vector<ll> ans;
pair<ll, ll> a[N];
for(ll i = 0; i < N; i++) cin >> a[i].first >> a[i].second;
ll index = 0;
for(ll i = 1; i < N; i++){
if(a[i].second == a[0].second) continue... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | 0 | 91,535,284 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
using namespace std;
bool find(int i, int j, int k, string s) {
int now = 0;
for (int idx = 0; idx < s.size(); idx++) {
if (now == 0 && s[idx] == '0' + i) {
now++;
continue;
}
if (now == 1 && s[idx] == '0' + j) {
now++;
continue;
}
if (now == 2 &&... | 0 | 16,898,855 |
#include <cstdio>
#include <array>
using namespace std;
typedef array<int, 10001> v;
static inline int in()
{
int c, n = 0;
while ((c = getchar_unlocked()) >= '0' && c <= '9')
n = 10 * n + (c - '0');
return n;
}
static inline void out(int n)
{
static char buf[20];
char *p = buf;
if (!n)
*p++ = '0';
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
struct Edge{
int to;
int weight;
Edge(int t,int w) : to(t),weight(w){}
};
using Graph = vector<vector<Edge>>;
int main(){
int n,m;
cin >> n >> m;
Graph G(n);
for(int i=0;i<m;++i){
int from,to,weight;
cin >> from >> to >> weight;
... | 0 | 44,587,300 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
for (int i = A; i <= B; i++) {
int tmp1, tmp2, tmp3, tmp4;
tmp1 = i / 10000;
tmp2 = (i / 1000) % 10;
tmp3 = (i / 10) % 10;
tmp4 = i % 10;
if (tmp1 == tmp4 && tmp2 == tmp3) {
ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 63,512,151 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> can_reach_from_1;
vector<int> can_reach_to_n;
vector<pair<int, int>> link;
rep(i, m) {
int a, b;
cin >> a >> b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pii = pair<int, int>;
int main(){
int n,m; cin>>n>>m;
vector<pii> a(n),c(m);
rep(i,n)cin>>a.at(i).first>>a.at(i).second;
rep(i,m)cin>>c.at(i).first>>c.at(i).second;
int x,y;
rep(i,n){
rep(j,m){
... | 0 | 91,081,662 |
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class CColoringColorfully {
public:
void solve(std::istream &in, std::ostream &out) {
string s;
in >> s;
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, M;
cin >> N >> M;
ll ans = 0;
while (N >= 1 && M >= 2) {
if (2 * N >= M) {... | 0 | 42,895,841 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int tot=0,h[100005];
int n,x,y,siz[100005],f[100005];
struct Edge{
int x,next;
}e[200005];
inline void add_edge(int x,int y){
e[++tot].x=y;
e[tot].next=h[x],h[x]=tot;
}
bool dfs(int x,int fa){
siz[x]=1;
int cnt=0;
for(int... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | 0 | 71,598,015 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long int n,a,b;
cin >>n>> a>> b;
if(n<=a) cout << n<<endl;
else if(n<=a+b) cout <<a<<endl;
else{
long int s,g ;
s =n/(a+b);
g=n%(a+b);
if(g<=a) cout << s*a+g <<endl;
else cout <<s*a+a <<endl;
}
} | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 0 | 55,879,538 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e6 + 10;;
unsigned long long fac[1000010];
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long long... | 0 | 99,534,323 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.