code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
long long n,m=0,sum=1000,r=0;
long long num[100];
cin>>n;
for(int i=0;i<n;i++)
cin>>num[i];
for(int i=0;i<n-1;i++)
{
if(m==0)
{
if(num[i]<num[i+1])
{
m=sum/num[i];
sum=sum-m*num[i];
}
}
else if(m>0)
{
if(num[i]<=num[i+1])
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | 0 | 5,483,567 |
#include <bits/stdc++.h>
using namespace std;
int main() {int N;
cin>>N;
string S[N];
int t[N];
int i=0;
while(i<N){cin >> S[i] >> t[i];
i++;}
string x;
cin>>x;
int sum=0;
for(int j=0;j<N;j++){
if(x==S[j]){
for(int k=j+1;k<N;k++){sum +=t[k];}
break; }
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)x.size()
#define eb emplace_back
#define pb push_back
#defin... | 0 | 33,725,115 |
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
#define double long double
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _set(x) __builtin_popcount(x)
#define PI 3.14159265358979323846264338327950L
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
string num;
while(cin >> num){
if(num == "0"){
break;
}else{
int sum = 0;
for(int i = 0; i < num.length(); i++){
sum = (num[i] - '0... | 0 | 26,616,923 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, 0,-1};
... | #include <iostream>
#include <algorithm>
#include <climits>
#include <cstring>
using namespace std;
int flip=0, h, w, mp[105][105];
char board[105][105];
bool inside(int r, int c){
return r<=h && c<=w;
}
int dp(int r, int c){
int sum =0;
if(r==h && c==w){
if(board[h][w]=='#'){
sum=1;
... | 0 | 49,863,528 |
#include <iostream>
using namespace std;
int n,m,p;
int mem[101];
int main(){
while(cin >> n >> m >> p, n || m || p){
int sum = 0;
for(int i = 1; i <= n ; i++){
cin >> mem[i];
sum += mem[i];
}
sum *= 100;
if(mem[m]==0)cout << 0 << endl;
else {
sum = sum * (100-p)/100;
c... | #include <bits/stdc++.h>
using namespace std;
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define show(x) for(auto i: x){cout << i << " ";}
#define showm(m) for(auto i: m){cout << m.x << " ";}
typedef long long ll;
typedef pair<int, int> P;
#define N_MAX 305
vector<vector<ll>> dp(N_MA... | 0 | 56,446,799 |
#include<iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
if(n%m == 0) cout << 0;
else {
cout << 1;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
string s,t;
cin>>s>>t;
int ctr=0;
for( int i=0 ; i<s.size() ; i++ )
if( s[i]!=t[i] )
ctr++;
cout<<ctr;
}
retu... | 0 | 24,458,935 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int,int>
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define extract_word(s) stringstream str(s); while(str>>word)
#define fastio ios_base::sync_with_stdio(false);cin.ti... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include... | 0 | 76,087,715 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
int fin = 1;
int sum = 0;
while((fin*(fin+1))/2 < n){
fin++;
}
stack<int> st;
for(int i = fin;i >= 1;i--){
if(n >= i){
n -= i;
st.push(i);
}... | 0 | 68,416,049 |
#include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
if (a % 3 && b % 3 && (a + b) % 3)
cout << "Impossible" << endl;
else
cout << "Possible" << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int a[N];
long long k;
int main()
{
ios_base::sync_with_stdio(0);
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
... | 0 | 26,002,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0;
string s;
cin >> n >> s;
for(int i=0;i<1000;i++){
string pass = to_string(i);
if(int(pass.size()) == 1) pass = "00" +pass;
else if(int(pass.size()) == 2) pass = "0" +pass;
auto pos1 = s.find(pass... | #include<iostream>
#include<cstdio>
#include<cstring>
#define Nil -1
#define maxn 100005
using namespace std;
int n,root;
int dep[maxn];
struct node
{
int parent;
int left_son;
int right_brother;
node():parent(Nil),left_son(Nil),right_brother(Nil) {}
};
node t[maxn];
void build()
{
for(int i=0; i<n... | 0 | 58,506,498 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
#define FW freopen("data2.txt", "w", stdout);
template <class T>
inline bool Read(T& ret)
{
char c;
int sgn;... | 0 | 63,563,167 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 1;
for (int i = 0; i < n - 1; ++i) {
ans += s[i] != s[i + 1];
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
bool isMale() {
string result;
cin >> result;
if (result == "Vacant") {
exit(0);
}
return result == "Male";
}
int main() {
int N;
cin >> N;
int left = 0;
int right = N - 1;
cout << 0 << endl;
... | 0 | 50,398,060 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<string>
using namespace std;
int main()
{
string S, T; cin >> S;
int i, l;
i = 0;
l = S.size();
S += "zzzzzzzzzz";
while(i < l-1){
if(S.substr(i,6) == "eraser"){
i += 6;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 | 64,053,381 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i... | #include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define llu unsigned long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define tc int... | 0 | 33,522,238 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
#include <string.h>
using namespace std;
int main()
{
int n = 0;
int k = 0;
long long base = 1e9+7;
scanf("%d %d", &n, &k);
if(k == 0){
printf("1\n");
return 0;
}
vector<int> a(n, 0);
for(int i=0; i<n; i++){
scanf("%d", ... | #define MOD 998244353
#include <iostream>
#include <vector>
using namespace std;
long pow(long a, long b) {
if (!b) return 1;
long c = pow(a, b / 2);
if (b % 2) c = a * c % MOD * c % MOD;
else c = c * c % MOD;
return c;
}
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int& i : D) cin >> i;
if (D.front()... | 0 | 59,641,930 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <iostream>
using namespace std;
int main(void) {
int a[3];
bool flag = true;
int i = 0;
for(int i = 0; i < 3; i++) {
cin >> a[i];
}
while(i != 2) {
if(a[i] >= a[i + 1]) {
flag = false;
}
... | 0 | 78,113,628 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll... | #include <algorithm>
#include <iostream>
using namespace std;
int d2c[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int dd[8];
int qu[9], aa[9], aa_[9];
int k_, l_;
int c_;
void update(int k, int l) {
if (l_ > l)
return;
for (int h = 0; h < k; h++)
aa[h] = dd[qu[h]];
int m = min(l, 9);
for (int h = k; h < m; h++)
aa[... | 0 | 99,496,506 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a;
cin >> a;
cout << a * a << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
int n, T;
cin >> n >> T;
int t[n];
rep(i, ... | 0 | 70,317,121 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long int a[1000000],n,MIN,MAX,SUM;
MIN=100000000;
MAX=-100000000;
SUM=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(MIN>a[i]){
MIN=a[i];
}
if(MAX<a[i]){
MAX=a[i];
}
SUM += a[i];
}
cout<<MIN<<" "<<MAX<<" "<<SUM<<endl;
return 0;
} | #include <cstdint>
#include <iostream>
#include <istream>
#include <stack>
using namespace std;
int32_t main()
{
while (true) {
string str;
getline(cin, str);
if (str[0] == '.') break;
stack<char> s;
for (uint32_t i = 0; i < str.size(); i++) {
if (str[i] == '(') {
s.push('(');
... | 0 | 37,560,698 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)... | 0 | 35,660,311 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int value[220000] = {};
int valueSize = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
value[A]++;
if (value[A] == 1) valueSize++;
}
sort(value, value + 220000);
int i = 220000 - valueSize;
int res = ... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 47,973,148 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
const int MAXN = 1000;
const int MAXK = 4;
int dp[MAXN][MAXK][2];
i... | 0 | 41,866,977 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,s;
cin>>n>>s;
if(n>s)
cout<<"safe";
else
cout<<"unsafe";
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 71,545,105 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N;
cin >> N;
int T[3];
rep(i,3) cin >> T[i];
vector<int> L(N);
rep(i,N) cin >> L.at(i);
int DP[3][1<<8] = {0};
for(int i = 1; i <... | 0 | 164,008 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i,n,s) for (int i= (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
ll modpow(ll a, ll b... | #include <bits/stdc++.h>
using namespace std;
int apple[3][100005], need[2], siz[3];
int main() {
int x, y, a, b, c;
scanf("%d%d%d%d%d", &need[0], &need[1], &siz[0], &siz[1], &siz[2]);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < siz[i]; j++) {
scanf("%d", &apple[i][j]);
}
sort(apple[i], apple[i] + siz... | 0 | 92,151,932 |
#include<iostream>
using namespace std;
int main(){
string N;
cin>>N;
for(int i=111; i<=999; i+=111){
string s=to_string(i);
if(N<=s){
cout<<s<<endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)(x).size()
#define ll long long
using namespace std;
ll verif(ll* a , int n){
ll ans = 0;
while(a[n] >= n){
a[n] -= n;
for(int i = 1; i <= n - 1; ++i) ++a[i];
... | 0 | 59,348,186 |
#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--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int c... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define bizarre ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define ll long long
#define ld long double
#define pi acos(-1)
#define poi... | 0 | 2,733,575 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> l(n+1);
l[0] = 2;
l[1] = 1;
for(int i = 2; i < n+1; i++){
l[i] = l[i-1]+l[i-2];
}
cout << l[n] << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string ip;
cin>>ip;
ll n=ip.length();
bool isPossible=false;
string pattern[4];
pattern[0]="maerd";
pattern[1]="remaerd";
pattern[2]="esare";
pattern[3]="resare";
ll i=n-1;
string temp="";
while(i>=0){
temp+=ip[i]... | 0 | 86,861,904 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1000000000;
int main() {
ll s, v = 1000000000;
cin >> s;
ll x = (v - s % v) % v;
ll y = (s + x) / v;
cout << "0 0 1000000000 1 " << x << " " << y << endl;
return 0;
} | #include <iostream>
#include <ios>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n = 0;
int m = 0;
cin >> n >> m;
vector<int> dp(n + 1, n + 1);
dp[0] = 0;
vector<int> ds(m, 0);
for (auto & di : ds) cin >> di;
for (auto di : ... | 0 | 77,453,076 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 1000000007
#define inf 100000000000000000
using namespace std;
typedef long long ll;
typ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
ll solve(){
ll ret = 0;
ll N,K; cin >> N >> K;
vector<ll> A(N),B(N);
for(int i = 0; i < N;i++) cin >> A[i] >> B[i];
for(int i = 0; i < ... | 0 | 96,347,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll h,m;
cin>>h>>m;
ll ch[30000];
ll a[1010];
ll b[1010];
for(ll i=0;i<m;i++){
cin>>a[i]>>b[i];
}
for(ll i=0;i<30000;i++){
ch[i]=inf;
}
ch[0]=0;
ll ans=inf;
for(ll i=0;i<20000;i++){... | #pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | 0 | 61,490,977 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define INF (int)1e7
class Graph{
ty... | 0 | 74,415,392 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong A,B,C;... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
bool cout_flag = false;
cin >> str;
for (int i = 0; i < str.length() - 1; i++)
{
if(str[i] == str[i + 1])
{
cout << i + 1 << " " << i + 2;
cout_flag = true;
break;
}
else if(i < str.length() -... | 0 | 9,573,729 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++)
cin >> a[i];
vector<int> res(n);
res[0] = a[0];
for (int i = 1; i < n - 1; i++) {
res[i] = a[i];
if (res[i] > a[i - 1])... | #include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
... | 0 | 10,814,456 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG
#define PRE_... | 0 | 99,068,035 |
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long M = 1;
for (long long i = 2; i <= sqrt(N); i++) {
if (N % i == 0){
M = i;
}
}
long long L = max(M,N/M);
int count = 0;
for (int i = 0; i < 11; i++) {
count++;
if (L / 10 == 0){
cout <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k,l;
cin>>n;
vector<long long>a(n);
for(i=0;i<n;i++)
cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
queue<long long >q;
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
... | 0 | 65,031,397 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
vector<int> r(n);
REP(i, n) {
int tmp; cin >> tmp;
r[i] = tmp - 1;
}
int cnt = 0;
REP(i, n)
if (i == r[r[i]]... | #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(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int h,w;
cin >> h >> w;
vector<vector<char>> map(h+1, vector<char>(w+1));
vecto... | 0 | 25,821,641 |
#include<iostream>
#include<iomanip>
int a,b;
int main(){
std::cin>>a>>b;
std::cout<<a/b<<" "<<a%b<<" "<<std::fixed<<std::setprecision(8)<<static_cast<double>(a)/static_cast<double>(b)<<std::endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
ll INF=1e10;
int main(){
ll n,m; cin>>n>>m;
vector<vector<ll>>a(m,vector<ll>(3));
re... | 0 | 15,914,675 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | 0 | 38,265,823 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if(l % 2019 == 0)
return cout << l, 0;
vector<int> v;
for(int i = l; i <= r; ++i) {
if(i % 2019 < l % 2019)
return cout << i % 2019, 0;
v.push_back(i % 2019);
}
int mini = 1e9;
for(int x : v) {
for(... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 38,776,285 |
#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 k,x;
cin >> k >> x;
if (500*k < x){
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string S;
int main(){
cin >> S;
char buf = 'a';
int size = S.size();
map<char, int> dict;
for (int i=0; i<size; i++){
dict[S.at(i)]++;
}
int cnt = 0;
for (auto p: dict){
auto key = p.first;
auto value = p.second;
... | 0 | 59,260,808 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 662,789 |
#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 ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(... | 0 | 73,572,973 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 | 18,662,929 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t X;
int64_t t;
cin >> X >> t;
X -= t;
if( X < 0) X =0;
cout << X << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define DB(a) cerr << #a << " = " << (a) << endl;
#define OUT( a , n ) for( int J = 0; J < (n); J++ )cout<< (a)[J] << " \n"[J == (n) - 1 ]
#define WAIT cout << flush ... | 0 | 19,999,569 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
map<int, int> mp;
cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++){
cin >> a[i];
mp[a[i]] += 1;
}
int type_num = 0;
for (auto p : mp) {
++type_num;
}
int num[type_num] = {0};
int ... | 0 | 68,237,138 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
long long kotae=0;
if(a<=b)kotae=a*c;
else kotae=b*c+(a-b)*d;
cout<<kotae<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int vec[n];
map<int,int> ma;
map<int,int> mab;
for(int i=0;i<n;i++){
cin>>vec[i];
if(i%2==0){
ma[vec[i]]++;
}
else{
mab[vec[i]]++;
}
}
int a=0,b=0,c=1e6,d,e=0,f=0,g=1e6,h;
for(int i=0;i<n;i+=2){
... | 0 | 85,788,619 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
if(c%__gcd(a,b)==0) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 94,206,097 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int A[100010] = {};
for(int i = 0; i < N; i++) cin >> A[i];
long long int current = 1;
long long int ans = 0;
for(int i = 0; i < N; i++){
if(A[i] == current) current ++;
else if(A[i] < current) continue;
else{
... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typena... | 0 | 94,406,705 |
#include<iostream>
using namespace std;
void dfs(int n,int s,int k);
int ans=0;
int main(){
int n,sum;
while(cin>>n>>sum , n||sum){
ans=0;
dfs(n,sum,0);
cout<<ans<<endl;
}
}
void dfs(int n,int sum,int k){
if(n<0){
return ;
}
if(n==0){
if(sum==0){
ans++;
}
}
else{
if(9<k){
return ;
}
for(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
... | 0 | 90,892,084 |
#include <iostream>
#include <iomanip>
int main()
{
int d;
while (std::cin >> d) {
double s = 0.0;
for (int i = 1; i < 600 / d; ++i) {
s += d * d * d * i * i;
}
std::cout << (int)s << std::endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main(){
int a,b;
cin >> a >> b;
string s;
cin >> s;
string ans = "Yes";
rep(i,s.size()){
if(s[i]=='-' && i!=a){
ans="No";
}
... | 0 | 91,750,174 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pll;
#define fu(i,a,b) for(ll i=a;i<b;i++)
#define fd(i,b,a) for(ll i=b;i>=a;i--)
#define ms(a,x) memset(a, x, sizeof a)
#define prec(n) fixed<<setprecision(n)
#define pb(i) push_back(... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 64,510,430 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int x;
cin>>x;
int y;
rep(i,(x/105)+2){
y=x-(105*i);
rep(j,(y/104)+2){
y=x-(105*i)-(104*j);
rep(k,(y/103)+2){
y=x-(105*i)-(104*j)-(103*k);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
struct SegmentTree{
int n;
vector<int> value;
int SIJK;
Segm... | 0 | 68,229,731 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, d; cin >> h >> w >> d;
pair<int, int> loca[h*w];
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
int a; cin >> a;
loca[a-1] = make_pair(i, j);
}
}
long long cost[h*w];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i++)... | 0 | 66,435,982 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
ll a[50];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < 10000;... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int N;
int a[200010],b[200010];
int main(){
cin>>N;
int mB=2001001001;
... | 0 | 20,297,762 |
#include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a > d || b < c) cout << 0 << endl;
else if (a >= c) {
if(b <= d)... | 0 | 61,334,660 |
#include<iostream>
using namespace std;
int main() {
int df = 100000;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
df *= 1.05;
if (df % 1000 != 0) {
df /= 1000;
df++;
df *= 1000;
}
}
cout << df << endl;
return 0;
} | #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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
template<class... | 0 | 86,494,691 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int a[N],b[N];
for(int i=0;i<N;i++){
cin >> a[i];
}
for(int i=0;i<N;i++){
cin >> b[i];
}
ll sa=0; ll sb=0;
for(... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
float x1,y1,x2,y2,x3,y3,xp,yp;
float a,b,c,d,e,f,s1,s2,t1,t2;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
t2 = 0;
a = sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));
b = sq... | 0 | 51,901,863 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
ll L, R, t; cin >> L >> R;
vector<int> check(2019,0);
for(ll i=L; i<R; i++){
... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
int n,m;
int f[N],d[N];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
string s;
cin>>s;
int kl=0,r=0;
for(int i=0;i<n;i++){
if(s[i]==')'){
if(r==0) k... | 0 | 56,593,871 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) for(lint i{}; i < (l... | 0 | 37,689,450 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | #include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t dict;
int n;
string cmd;
string word;
unordered_set<string>::const_iterator got;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cmd >> word;
if (cmd[0] ... | 0 | 77,697,323 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define ull unsigned long long
#define pi (acos(-1))
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n... | 0 | 22,305,846 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
char c;
cin >> c;
cout << (char)(c + 1) << '\n';
return (0);
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
int main(void) {
ll N;
st... | 0 | 72,999,996 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for(int i=0; i<N; i++) {
int a;
cin >> a;
if(a>0)
pls.push_back(a);
else
... | 0 | 41,827,085 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<pair<ll,ll>>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typena... | 0 | 13,260,569 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
bool ip[N]; vector<int> ps;
int c[N];
vector<int> g[N];
int main(void) {
fill_n(ip, N, 1); ip[1] = 0;
for (int i = 2; i < N; ++i) {
if (ip[i]) ps.push_back(i);
for (int j : ps) {
if (i * j >= N) break;
i... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0)
cout << "Possible" << "\n";
else
cout << "Impossible" << "\n";
} | 0 | 48,104,112 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a[25];
cin>>a;
int i,la=strlen(a);
for(i=la-1;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int flag=0;
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size()-1;i++)
{
if (s[i]==s[i+1])
{
cout<<i+1<<" "<<i+2<<endl;
flag=1;
return 0;
}
else if (i<s.size()-2&&s[i]==s[i+2])
{
cout... | 0 | 82,946,729 |
#include <stdio.h>
int main(){
char c;
scanf("%c", &c);
if(c >= 'A' && c <= 'Z'){printf("%c", ++c)
;}
else if(c >= 'a' && c <= 'z'){printf("%c", ++c);}
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"... | 0 | 7,068,947 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 6,024,904 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N; int64_t ans = 0;
map<string, int64_t> memo;
for (int i = 0; i < N; i++) {
string s; cin >> s;
sort(s.begin(), s.end());
memo[s]++;
}
for (auto x : memo) {
int64_t tmp = x.second;
ans += tmp * (tmp - 1) / 2;
}
c... | #include <iostream>
void show_ret(int home[][10], bool use_partition) {
for(int i= 0; i < 3; i++) {
for(int j = 0; j < 10; j++) {
std::cout << " " << home[i][j];
}
std::cout << std::endl;
}
if(use_partition) std::cout << "####################" << std::endl;
}
int main(int... | 0 | 9,688,841 |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 45,196,915 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
n--;
cout << n * (n + 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string b;
char base[2][2] = {{'A','T'},{'C','G'}};
cin >> b;
for(int i=0;i<2;i++) {
for (int j=0;j<2;j++) {
if(b[0] == base[i][j]) {
cout << base[i][(j+1)%2] << endl;
break;
}
... | 0 | 27,469,423 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n,m;cin>> n >> m;
priority_queue<int> q;
for(int i = 0; i < n; i++) {
int a;cin >> a;
q.push(a);
}
for(int i = 0; i < m; i++) {
int x=q.top();
... | 0 | 59,402,868 |
#include<bits/stdc++.h>
int main(){
int h,w,a,b;
std::cin>>h>>w>>a>>b;
for(int i=0;i<b;i++){
for(int j=0;j<a;j++){
std::cout<<"1";
}
for(int j=a;j<w;j++){
std::cout<<"0";
}
std::cout<<std::endl;
}
for(int i=b;i<h;i++){
for(int j=0;j<a;j++){
std::cout<<"0";
}
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll ra = 0, lb = 0, ba = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 2) if (s[i][j] == 'A' && s[i][j + 1] == '... | 0 | 2,641,705 |
#include<bits/stdc++.h>
using namespace std;
int checkSize( int X );
int F( int A, int B );
int main( void )
{
long int N;
int max, min;
long int A, B;
cin >> N;
min = 1000;
for( long int i = 1; i * i <= N; i++ ) {
if( i * ( N / i ) == N ) {
A = i;
B = N / i;
if( N % A != 0 ) {
contin... | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#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 FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | 0 | 91,535,348 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 100000... | #include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
typedef pair<int... | 0 | 69,653,736 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll fac(ll n){if(n<=1)return 1; else return n*fac(n-1);}
int main()
{
ll n;
cin >> n;
string s;
cin >> s;
if(n%2)cout << "No" << endl;
else
{
if(s.substr(0,n/2)==s.substr(n/2,n/2))cout << "Yes" ... | #include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",s... | 0 | 14,385,710 |
#include<bits/stdc++.h>
using namespace std;
int main()
{int a,b,c;
cin>>a>>b>>c;
int q[a],w[b],n,m,k;
int ans=INT_MAX,a1=INT_MAX,a2=INT_MAX;
for(int i=0;i<a;i++)cin>>q[i],a1=min(a1,q[i]);
for(int i=0;i<b;i++)cin>>w[i],a2=min(a2,w[i]);
while(c--)
{
cin>>n>>m>>k;
ans=min(ans,(q[n-1]+w[m-1]-k));
}cout<<min(an... | #include <iostream>
#include <cstring>
using namespace std;
int main() {
int k=0,times[1000] = {0},top,topsoeji,hantei,sizetop,sizetopsoeji,size[1000] = {0};
char word[1000][32];
string str;
while (cin >> str) {
for(int i=0;i<str.size();i++) {
word[k][i] = str[i];
size[k] = str.size();
if(... | 0 | 33,691,590 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
long ans = 0;
if (a % 2 == 1) {
ans ^= a;
a++;
}
if (b % 2 == 0) {
ans ^= b;
b--;
}
if (a < b) {
ans ^= (b - a + 1) / 2 % 2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 81,751,553 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
long long M = max({ A,B,C });
long long sum;
if (M % 2 == (A + B + C) % 2) {
sum = M - A + M - B + M - C;
}
else {
sum = M + 1 - A + M + 1 - B + M + 1 - C;
}
cout << sum / 2 << endl;
} | #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 dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int h, w; cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i];
}
... | 0 | 76,925,010 |
#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;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s;
cin >> s;
... | 0 | 75,238,382 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v... | 0 | 6,721,142 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void abc_170a();
void abc_171a();
void abc_172a();
void abc_173a();
void abc_174a();
void abc_175a();
void abc_170b();
void abc_171b();
int main()
{
abc_171b();
}
void abc_170a()
{
vector<int> x(5);
for (int i = 0; i < 5; ++i) cin >> ... | #include <bits/stdc++.h>
using namespace std;
bool custom (vector<int> &a, vector<int> &b) {
return (a.size() < b.size());
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> r(n);
vector<pair<int, int>> b(n);
vector<vector<int>> rpp(n);
vector<vector<int>> bpp(n);
for(int i=0;i<n;i++) {
cin >> r... | 0 | 81,905,855 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int k;
cin>>k;
string s;
cin>>s;
if(s.length()<=k)cout<<s<<endl;
else{
rep(i,k)cout<<s[i];
cout<<"..."<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x,long y){
if(y==0)return x;
return gcd(y,x%y);
}
long long lcm(long x,long y){
return x*y/gcd(x,y);
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main()
{
int N,A[100010]={},B[100010]={},ans=0,o[1... | 0 | 67,529,004 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000000
int main(){
int A,B,M;
cin>>A>>B>>M;
vector<int> a(A),b(B);
for(int i=0;i<A;i++)cin>>a[i];
for(int i=0;i<B;i++)cin>>b[i];
int ans = 1000000;
for(int i=0;i<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
int sum=0;
for(int i=0;i<n;i++){
int w;
cin>>w;
arr[i]=w;
sum+=w;
}
int min=sum;
int summy=0;
for(int j=0;j<n;j++){
summy+=arr[j];
if(abs(sum-summy-su... | 0 | 44,305,269 |
#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;
string s;
cin>>s;
int arr[26]={0},cnt=0;
for(int i=0;i<s.length();i++)
... | #include<iostream>
#include<algorithm>
using namespace std;
int n;
main()
{
while(cin>>n,n)
{
int a[1111];
for(int i=0;i<n;i++)cin>>a[i];
int ans=1e9;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int A=abs(a[i]-a[j]);
ans=ans<A?ans:A;
}
}
cout<<ans<<endl;
}
} | 0 | 59,673,286 |
#include<iostream>
#include<list>
#include<stack>
using namespace std;
int main() {
int N, Q; cin >> N >> Q;
list<int> E[N];
int a, b, p, x;
long counter[N]; for (int i = 0; i < N; i++) counter[i] = 0;
for (int i = 0; i < N-1; i++) {
cin >> a >> b; a--; b--;
E[a].push_back(b); E[b].push_back(a);
}
... | #include <iostream>
#include <string>
int main()
{
int sum;
while (1) {
sum = 0;
std::string str;
std::cin >> str;
if (str == "0") {
break;
} else {
for (int i = 0; i < str.length(); i++) {
sum += (int)str[i] - 48;
}
... | 0 | 405,045 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
while ( cin >> n, n ) {
int pre = 0;
int asi = 0;
int cnt = 0;
for ( int i = 0; i < n; i++ ) {
string f;
cin >> f;
if ( f == "lu" ) asi |= 1;
if ( f == "ru" ) asi |= 2;
if ( f == "ld" ) asi ^= 1;
... | #include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
ll A, B, K; cin >> A >> B >> K;
... | 0 | 35,088,484 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,count=0;
cin >> n;
vector<ll>a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(),a.end());
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
vector<ll>x(n-1),y(n-1);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 48,743,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int s;
cin >> s;
vector<long long int> vec(1000000, 1000000);
vec.at(0) = s;
bool finished = false;
for(long long int i = 1; i < 1000000; i++) {
if(vec.at(i - 1) % 2 == 0) {
vec.at(i) = vec.at(i - 1) / 2;
}
else {
v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
string s;
cin>>s;
bool flg=true;
for(int i=0;i<s.size();i++){
if(i==a){
if(s.at(i)!='-')
flg=false;
}
else if(s.at(i)<'0'||s.at(i)>'9')
flg=false;
}
... | 0 | 62,985,207 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> t(N+2, 0), v(N+2, 0);
for(int i = 1; i <= N; i++) cin >> t[i];
for(int i = 1; i <= N; i++) cin >> v[i];
vector<int> l(N+2, 0), r(N+2, 0);
for(int i = 2; i < N+2; i++) l[i] = l[i-1] + t[i-1];
for(int i... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n,a[100005],b[100005],ans=0;
cin>>n;
for(int i=0;i<=n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
for(int i=0;i<n;i++){
... | 0 | 74,235,222 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
string N;
cin >> N;
int sum = 0;
for( int i = 0; i < N.size(); i++ )
sum += N.at( i ) - '0';
if( sum % 9 == 0 )
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <cstdio>
int fib(int *a,int n){
if(n==0 || n==1)return 1;
else{
int tmp;
if(a[n])tmp = a[n];
else{
tmp = fib(a,n-1) + fib(a,n-2);
a[n] = tmp;
}
return tmp;
}
}
int main(){
int i, n;
int a[45];
for(i=0;i<45;i++)a[i]=0;
s... | 0 | 17,371,820 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, k;
cin >> a >> b >> c >> k;
while (a >= b) {
b *= 2;
k--;
}
while (b >= c) {
c *= 2;
k--;
}
if (k >= 0) cout << "Yes\n";
else cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; i += 1) {
string s = to_string(i);
if (s.length() % 2 != 0) {
cnt++;
}
}
cou... | 0 | 56,295,409 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<long long> S(N + 1, 0);
for (int i = 1; i <= N; ++i) {
S[i] = S[i - 1] + A[i - 1];
}
sort(S.begin(), S.end());
l... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#define llint long long
#define inf 1e18
using namespace std;
typedef pair<double, double> P;
llint n;
llint x[1005], y[1005];
llint u[1005], v[1005];
void get(llint u, llint U[])
{
u = (1LL<<39)-1 - u;
f... | 0 | 38,904,742 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,K,m=0;
cin >> N >> K;
vector<ll> V(N);
rep(i,N){
cin >>... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
long long int n,m,a,b,c,d,e,f,g,sum;
cin>>n>>m;
a=n*(n-1)/2;
b=m*(m-1)/2;
sum=a+b;
cout<<sum<<endl;
return 0;
} | 0 | 83,083,491 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str, op, p;
int32_t q, a, b;
cin >> str >> q;
for (int32_t i = 0; i < q; i++) {
cin >> op >> a >> b;
if (op == "print") {
cout << str.substr(a, b - a + 1) << endl;
} el... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 36,036,026 |
#include <stdio.h>
#include <iostream>
int main() {
int r;
std::cin >> r;
std::cout << r * r << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 33,250,687 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << P / 2 + (P % 2 + A * 3) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define testcases() int var; cin>>var; while(var--)
int length(ull n)
{
int cnt = 0;
while(n)
{
cnt++;
n>>=1;
}
return cnt;
}
void solve(long long N, std::vector<long long> A){
long long tmp = 0;
fo... | 0 | 36,104,100 |
#include <iostream>
#include <math.h>
#include <map>
using namespace std;
int p,q,a,b; double s;
int main() {
scanf("%d%d",&a,&b);
p=a/b;
q=a%b;
s=(double)a/(double)b;
printf("%d %d %f\n",p,q,s);
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | 0 | 19,643,616 |
#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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int sum;
int main() {
int n, m;
cin >> n >> m;
int a;
rep(i,m) {
cin >> a;... | 0 | 72,112,681 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.