text
stringlengths 49
983k
|
|---|
#include <iostream>
#include <string>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
while(true){
int n;
cin >> n;
if(n == 0){ break; }
int answer = 0, cur = 0, next = 3;
for(int i = 0; i < n; ++i){
string s;
cin >> s;
if(s == "lu"){
cur |= 1;
}else if(s == "ru"){
cur |= 2;
}else if(s == "ld"){
cur &= ~1;
}else if(s == "rd"){
cur &= ~2;
}
if(cur == next){
++answer;
next = cur ^ 3;
}
}
cout << answer << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
int main(void){
int n;
while(cin>>n, n){
bool on = 0, l = 0, r = 0;
int cnt = 0;
rep(i,n){
string s;
cin>>s;
if(s[0]=='l') l ^= 1;
if(s[0]=='r') r ^= 1;
if(l==r && on^l){
on ^= 1;
cnt++;
}
}
cout<<cnt<<endl;
}
}
|
#include <iostream>
#include <string>
#include <set>
using namespace std;
const set<set<string>> correct={
{"lu","ru"},{"ld","rd"}
};
int main(){
int n,i,r;
string x,y;
for(;cin>>n,n;cout<<r<<endl){
for(r=i=0;i<n/2;i++){
set<string>se;
cin>>x>>y;
se.insert(x);
se.insert(y);
if(correct.find(se)!=correct.end())r++;
}
if(n&1)cin>>x;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int ch=0,ans=0;
for(int i=0;i<n;++i){
string s; cin>>s;
if(s=="lu" || s=="ru"){
if(ch==1){
ans++;
ch=0;
}else ch=1;
}else if(s=="ld" || s=="rd"){
if(ch==-1){
ans++;
ch=0;
}else ch=-1;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,s,c;
string m;
while(1){
cin>>n;
if(n==0) break;
s=c=0;
for(int i=0;i<n;i++){
cin>>m;
if(s==1&&(m=="lu"||m=="ru")) c++;
if(s==0&&(m=="ld"||m=="rd")) c++;
if(m=="lu"||m=="ru") s=1;
if(m=="ld"||m=="rd") s=0;
}
cout<<c<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int ch=0,a=0;
for(int i=0;i<n;++i){
string s; cin>>s;
if(s=="lu" || s=="ru"){
if(ch==1) a++, ch=0;
else ch=1;
}else if(s=="ld" || s=="rd"){
if(ch==-1) a++, ch=0;
else ch=-1;
}
}
cout<<a<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n) && n){
char prev[3] = "xy";
char now[3];
int ans = 0;
for (int i = 0; i < n; i++){
scanf("%s", now);
if (now[0] != prev[0] && now[1] == prev[1]) ans++;
strcpy(prev, now);
}
printf("%d\n", ans);
}
return (0);
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,r[3],l[3];
while(true){
cin>>n;
if(n==0)
break;
string f;
for(int i=0;i<3;i++)
r[i]=0,l[i]=0;
int count=0;
for(int i=0;i<n;i++){
cin>>f;
if(f=="ru")
r[0]=min(1,r[0]+1);
if(f=="rd")
r[0]=max(0,r[0]-1);
if(f=="lu")
l[0]=min(1,l[0]+1);
if(f=="ld")
l[0]=max(0,l[0]-1);
if(r[0]==l[0]&&r[2]==l[2]&&r[0]!=r[2])
count++;
r[2]=r[1],r[1]=r[0];
l[2]=l[1],l[1]=l[0];
}
cout<<count<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,ans,now;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> n,n){
ans=0,now=0;
for (int i=0;i<n;++i){
string next; cin >> next;
if (next[0]=='l') now^=1;
if (next[0]=='r') now^=2;
if (now==3) ++ans,now=0;
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n == 0) break;
int count = 0;
string back;
for(int i=0; i<n; i++){
string s;
cin >> s;
if(s == "lu" && back == "ru") count++;
if(s == "ru" && back == "lu") count++;
if(s == "ld" && back == "rd") count++;
if(s == "rd" && back == "ld") count++;
back = s;
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
bool isok(string a, string b)
{
return (a == "lu" && b == "ru") || (a == "ru" && b == "lu") || (a == "ld" && b == "rd") || (a == "rd" && b == "ld");
}
int main(void)
{
int n;
while (cin >> n, n){
string str, prev = "";
int ret = 0;
for (int i = 0; i < n; i++){
cin >> str;
if (isok(str, prev)) ret++;
prev = str;
}
cout << ret << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int n;
while(cin >> n && n) {
char preUd = 'd', state = 'd';
int count = 0;
for (int i = 0; i < n; ++i) {
string move;
cin >> move;
char ud = move[1];
if (preUd == ud && state != ud) {
++count;
state = ud;
}
preUd = ud;
}
cout << count << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
int n,count=0;
bool l,r,flag;
flag = true;
l = false;
r = false;
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
string str;
cin >> str;
if(str=="lu"){
l = true;
}
else if(str=="ru"){
r = true;
}
else if(str=="ld"){
l = false;
}
else if(str=="rd"){
r = false;
}
if(r&&l&&flag){
flag = false;
count++;
}
else if(!r&&!l&&!flag){
flag = true;
count++;
}
}
cout << count << endl;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
int main(void){
string s,p;
int n;
while(cin>>n,n){
int ret = 0;
cin>>p;
rep(i,n-1){
cin>>s;
if(s[0] != p[0] && s[1] == p[1])ret++;
p=s;
}
cout<<ret<<endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
int main() {
for (int n; cin >> n && n;) {
vector<string> f(n);
rep(i, 0, n)cin >> f[i];
int cnt = 0;
bool l = false, r = false;
bool u = false;
rep(i, 0, n) {
if (f[i] == "lu")
l = true;
if (f[i] == "ld")
l = false;
if (f[i] == "ru")
r = true;
if (f[i] == "rd")
r = false;
if (!u && l && r) {
cnt++;
u = true;
}
else if (u && !l && !r) {
cnt++;
u = false;
}
}
cout << cnt << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep2(i, a, b) for(int i=(a);i<=(b);++i)
int main(){
while(1){
int n;
cin >> n;
if(!n) break;
vector<string> s(n);
rep(i, n) cin >> s[i];
int ans = 0;
rep(i, n / 2) {
if(s[i * 2][0] != s[i * 2 + 1][0]) ans++;
}
cout << ans << "\n";
}
}
|
#include <iostream>
#include <string>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int T;
void solve(){
int ans=0;
char st[256]={};
rep(i,T){
string s;
cin >> s;
st[ (int)s[0] ] = s[1];
if( ans%2 == 0 ){
if( st['l'] == 'u' && st['r'] == 'u' ){
ans++;
}
}else{
if( st['l'] == 'd' && st['r'] == 'd' ){
ans++;
}
}
}
cout << ans << endl;
}
int main(){
while(cin>>T, T){
solve();
}
return 0;
}
|
#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;
if ( f == "rd" ) asi ^= 2;
if ( !pre && asi == 3 ) {
cnt++;
pre = 1;
} else if ( pre && asi == 0 ) {
cnt++;
pre = 0;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int n;
while (cin >> n, n) {
int ans = 0;
bool lf = false, rf = false;
bool f = false;
for (int i = 0; i < n;i++) {
string F; cin >> F;
if (F == "lu") lf = true;
if (F == "ru") rf = true;
if (F == "ld") lf = false;
if (F == "rd") rf = false;
if (lf == rf) {
if (f != lf) {
ans++;
f = lf;
}
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin >> n && n){
string s;
int prev = 0; /* 0: 地面に両足, 1: 踏み台の上に両足 */
int ans = 0, nl = 0, nr = 0;
for(int i = 0; i < n; ++i){
cin >> s;
if(s == "lu"){
nl = 1;
}
if(s == "ru"){
nr = 1;
}
if(s == "ld"){
nl = 0;
}
if(s == "rd"){
nr = 0;
}
if(!prev && nl && nr){
prev = 1;
ans++;
}
else if(prev && !nl && !nr){
prev = 0;
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[])
{
int n, cnt;
string f, s;
while (cin >> n, n) {
cnt = 0;
for (int i = 0; i < n; ++i) {
if (i % 2) {
cin >> s;
if (f[0] != s[0])
cnt++;
}
else {
cin >> f;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
int n,c=0;
cin>>n;
if(n==0)break;
string s,b;
for(int i=0;i<n;i++){
cin>>s;
if(s[1]==b[1])c++;
b=s;
}
cout<<c<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
bool pre=1,l=0,r=0;
int ans=0;
for(int i=0;i<n;++i){
string s;cin>>s;
if(s[0]=='l'){
if(l)l=0;
else l=1;
}
else{
if(r)r=0;
else r=1;
}
if((pre==r) && (pre==l)){
++ans;
if(pre)pre=0;
else pre=1;
}
}
cout<<ans<<endl;
}
}
|
#include <iostream>
using namespace std;
int main(){
while(true){
int n;
cin >> n;
if(n == 0) break;
int ans = 0;
string s[151];
for(int i = 0 ; i < n ; i++) cin >> s[i];
for(int i = 1 ; i < n ; i++){
if((s[i] == "lu" && s[i - 1] == "ru") || (s[i] == "ru" && s[i - 1] == "lu")){
ans++;
}
if((s[i] == "ld" && s[i - 1] == "rd") || (s[i] == "rd" && s[i - 1] == "ld")){
ans++;
}
}
cout << ans << '\n';
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s;
bool l,r,c;
while(1){
cin>>n;
if(n==0) break;
l=r=false;
c=true;
ans=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu") l=true;
else if(s=="ld") l=false;
else if(s=="ru") r=true;
else if(s=="rd") r=false;
if(l && r && c){
c=false;
ans++;
}
if(!l && !r && !c){
c=true;
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<stdio.h>
char str[3];
int main(){
int a;
while(scanf("%d",&a),a){
int ret=0;
int p=0;int q=0;
int last=0;
for(int i=0;i<a;i++){
scanf("%s",str);
if(str[0]=='l'&&str[1]=='u')p++;
if(str[0]=='l'&&str[1]=='d')p--;
if(str[0]=='r'&&str[1]=='u')q++;
if(str[0]=='r'&&str[1]=='d')q--;
if((p+q)%2==0&&last!=p+q){
ret++;
last=p+q;
}
}
printf("%d\n",ret);
}
}
|
// 2016-12-02
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, c;
bool l, r;
string s;
while (cin >> n, n) {
c = 0;
l = r = false;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'l') {
l ^= true;
} else {
r ^= true;
}
if (l && r) {
c++;
l = r = false;
}
}
cout << c << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
string s[n];
int ans = 0;
for (int i = 0; i < n; i++) cin >> s[i];
for (int i = 1; i < n; i++) {
if (s[i - 1][0] != s[i][0]) {
if (s[i - 1][1] == s[i][1]) ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int res = 0;
int target = 2;
int state = 0;
for(int i=0;i<n;i++){
string s; cin >> s;
if(s[1] == 'u') state++;
else state--;
if(state == target){
res++;
target = 2-target;
}
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i < (int)(b);++i)
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) break;
vector<string> s(n);
int cnt = 0;
rep(i,n) {
cin >> s[i];
}
int j = 0;
while((j+1) < n) {
if (s[j][0] != s[j+1][0]) {
cnt++;
}
j += 2;
}
cout << cnt << endl;
}
}
|
#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int n;
cin >> n;
while (n != 0) {
int count_step = 0;
int mode = 0;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
cin >> c;
if (c == 'u') {
if (mode != 1) {
mode = 1;
}else {
count_step++;
}
}
if (c == 'd') {
if (mode != 2) {
mode = 2;
}else {
count_step++;
}
}
}
cout << count_step << endl;
cin >> n;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s;
int lu,ru,ld,rd;
int n;
while(cin>>n&&n){
int ans=0;
bool l=false,r=false;
rep(i,n){
cin>>s;
if(s[0]=='l')l=!l;
else r=!r;
if(ans%2&&!l&&!r)ans++;
else if(ans%2==0&&l&&r)ans++;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin >>n;
if(n==0)break;
string s;
int l=0,r=0;
int ans=0;
bool f=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu"&&l==0)l++;
if(s=="ld"&&l==1)l--;
if(s=="ru"&&r==0)r++;
if(s=="rd"&&r==1)r--;
if(l==r&&l!=f){
ans++;
f=!f;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
int main(void){
int n;
while(cin>>n, n){
bool on = false, l = false, r = false;
int cnt = 0;
rep(i,n){
string s;
cin>>s;
if(s[0]=='l') l^=true;
if(s[0]=='r') r^=true;
if(l == r && on^l){
on^=true;
cnt++;
}
}
cout<<cnt<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0){
break;
}
int leg[2]={},last=0,ans=0;
string s;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu"){
leg[0]=1;
}else if(s=="ru"){
leg[1]=1;
}else if(s=="ld"){
leg[0]=0;
}else{
leg[1]=0;
}
if(leg[0]==leg[1]&&leg[0]!=last){
ans++;
last=leg[0];
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string a;
while(cin>>n&&n!=0){
int sum=0;
int r=0,l=0;
int f=0;
for(int i=0;i<n;i++){
cin>>a;
if(a=="lu"){
if(l==0) l++;
}
else if(a=="ru"){
if(r==0) r++;
}
else if(a=="ld"&&l==1) l--;
else if(a=="rd"&&r==1) r--;
if(r==0&&l==0&&f==1){
f=0;
sum++;
}
else if(r==1&&l==1&&f==0){
f=1;
sum++;
}
}
cout<<sum<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
map<string,int>M;
M["lu"]=1;
M["ru"]=2;
M["ld"]=-1;
M["rd"]=-2;
for(int n;cin>>n,n;){
int ans=0,asi=0,k=n,nx=3;
for(string s;k--;){
cin>>s;
asi+=M[s];
if(asi==nx){
nx=(nx==0?3:0);
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n, left, right, res;
string buf;
while (cin >> n, n) {
left = right = res = 0;
for (int i = 0; i < n; i++) {
cin >> buf;
if (buf == "lu") {
left = 1;
} else if(buf == "ld"){
left = 0;
} else if(buf == "ru"){
right = 1;
} else {
right = 0;
}
if ((res % 2 == 0 && left == 1 && right == 1) || (res % 2 == 1 && left == 0 && right == 0))
res++;
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
int n;
cin >> n;
if (n == 0) return 0;
int ans = 0, cnt = 0;
vector<string> f(n);
for (int i = 0; i < n; i++) {
cin >> f.at(i);
if (f.at(i).at(1) == 'u') cnt++;
else cnt--;
if (abs(cnt) == 2) {
ans++;
cnt = 0;
}
}
cout << ans << '\n';
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
string str;
while(cin >> n, n){
int cnt = 0;
bool next = true;
bool l = false, r = false;
for(int i = 0; i < n; i++){
cin >> str;
if(str == "lu") l = true;
if(str == "ru") r = true;
if(str == "ld") l = false;
if(str == "rd") r = false;
if(l == next && r == next){
cnt++;
next = !next;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
while(cin >> n && n != 0) {
vector<string> s(n);
for(int i=0;i<n;i++) cin >> s[i];
int lc = 0, rc = 0, ans = 0;
for(int i=0;i<n-1;i++) {
if(s[i]=="lu" and s[i+1]=="ru") {
ans++;
}else if(s[i]=="ru" and s[i+1]=="lu") {
ans++;
}else if(s[i]=="ld" and s[i+1]=="rd") {
ans++;
}else if(s[i]=="rd" and s[i+1]=="ld") {
ans++;
}
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<string>
#include<queue>
using namespace std;
int main(){
queue<double> step;
string in;
int n;
while(cin >> n,n){
int count = 0;
for(int i=0;i<n;i++){
double tmp;
cin >> in;
if(in == "lu" || in == "ru") tmp = 1;
else if(in == "ld" || in == "rd") tmp = -1;
step.push(tmp);
}
int sum = 2;
int target = 4;
while(!step.empty()){
sum += step.front();
step.pop();
if(sum == target){
count++;
target = 6 - min(target,4);
}
}
cout << count << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int N,K;
int dp[2][1001][1001];
int dm[2][1001][1001];
int a[1000];
int main(){
scanf("%d %d",&N,&K);
for(int i=0;i<N;i++)scanf("%d",&a[i]);
sort(a,a+N);
fill( (int*)dp[0], (int*)dp[1], 1e9);
int ans=1e9;
for(int T=1;T<=K;T++){
int t=T%2;
int u=1-t;
for(int i=0;i<N;i++){
dp[0][i][i+1]=0;
dp[1][i][i+1]=0;
}
for(int w=2;w<=N;w++){
for(int i=0;i+w<=N;i++){
int j=i+w;
int si=i+1;
int ti=j-1;
if(w>2){
si=dm[t][i][j-1];
ti=dm[t][i+1][j];
}
dp[t][i][j]=1e9;
for(int k=si;k<=ti;k++){
if(dp[t][i][j] > dp[u][i][k]+dp[u][k][j]+a[j-1]-a[k-1]){
dp[t][i][j]=dp[u][i][k]+dp[u][k][j]+a[j-1]-a[k-1];
dm[t][i][j]=k;
}
}
}
}
}
printf("%d\n",dp[K%2][0][N]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int N,K;
int dp[2][1001][1001];
int dm[2][1001][1001];
int a[1000];
int main(){
scanf("%d %d",&N,&K);
for(int i=0;i<N;i++)scanf("%d",&a[i]);
sort(a,a+N);
fill( (int*)dp[0], (int*)dp[1], 1e9);
int ans=1e9;
for(int T=1;T<=K;T++){
int t=T%2;
int u=1-t;
fill( (int*)dp[t], (int*)dp[t+1], 1e9);
for(int i=0;i<N;i++){
dp[0][i][i+1]=0;
dp[1][i][i+1]=0;
}
for(int w=2;w<=N;w++){
for(int i=0;i+w<=N;i++){
int j=i+w;
int si=i+1;
int ti=j-1;
if(w>2){
si=dm[t][i][j-1];
ti=dm[t][i+1][j];
}
for(int k=si;k<=ti;k++){
if(dp[t][i][j] > dp[u][i][k]+dp[u][k][j]+a[j-1]-a[k-1]){
dp[t][i][j]=dp[u][i][k]+dp[u][k][j]+a[j-1]-a[k-1];
dm[t][i][j]=k;
}
}
if(i==0&&j==N)ans=min(ans,dp[t][i][j]);
}
}
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 1005
int N,K;
ll dp[2][SIZE][SIZE];
ll MID[2][SIZE][SIZE];
ll A[SIZE];
int main(){
scanf("%d %d",&N,&K);
for(int i = 0; i < N; i++){
scanf("%lld",&A[i]);
}
sort(A,A+N);
int CURRENT = 0,NEXT = 1;
for(int left = 0; left <= N-1; left++){
for(int right = left; right <= N-1; right++){
if(left == right){
dp[CURRENT][left][right] = 0;
}else{
dp[CURRENT][left][right] = HUGE_NUM;
}
}
}
ll ans = HUGE_NUM;
int right,L,R;
for(int height = 1; height <= K; height++){
for(int left = 0; left <= N-1; left++){
for(int right = left; right <= N-1; right++){
if(left == right){
MID[CURRENT][left][right] = left;
dp[NEXT][left][right] = dp[CURRENT][left][right];
}else{
dp[NEXT][left][right] = HUGE_NUM;
}
}
}
for(int length = 2; length <= N; length++){
for(int left = 0; left+length-1 <= N-1; left++){
right = left+length-1;
L = MID[CURRENT][left][right-1];
R = MID[CURRENT][left+1][right];
for(int mid = L; mid <= R; mid++){
if(dp[NEXT][left][right] > dp[CURRENT][left][mid]+dp[CURRENT][mid+1][right]+(A[right]-A[mid])){
dp[NEXT][left][right] = dp[CURRENT][left][mid]+dp[CURRENT][mid+1][right]+(A[right]-A[mid]);
MID[CURRENT][left][right] = mid;
}
}
}
}
ans = min(ans,dp[NEXT][0][N-1]);
swap(CURRENT,NEXT);
}
printf("%lld\n",ans);
return 0;
}
|
#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;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day1/problems/A>
問題文============================================================
N 個の相違なる自然数 ai が与えられる。与えられた自然数から相違なる自然数を選び、ペアを作ることにした。
作ることができるペアのうち、値の差が N−1 の倍数であるペアを一つ出力せよ。
なお、そのようなペアは必ず存在する。
=================================================================
解説=============================================================
================================================================
*/
void solve(){
ll N; cin >> N;
vector<ll> a(N); for(auto& in:a) cin >> in;
[&]{
for(int i = 0; i < N;i++){
for(int j = i+1; j < N;j++){
if(a[i] == a[j]) continue;
if(abs(a[i] - a[j])%(N-1) == 0){
cout << a[i] << " " << a[j] << endl;
return;
}
}
}
return;
}();
}
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
solve();
return 0;
}
|
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
// output
#define OUT(d) std::cout<<(d);
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<(d);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << (d) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------
signed main() {
INIT;
VAR(int, n);
VEC(int, a, n);
std::vector<int> b(n - 1, -1);
REP(i, n) {
int t = a[i] % (n - 1);
if (b[t] == -1) {
b[t] = i;
}
else {
OUT(a[b[t]])SP OUT(a[i])BR;
return 0;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0 ; i < n ; ++i){
cin >> a[i];
for(int j = 0 ; j < i ; ++j){
if(abs(a[i] - a[j]) % (n - 1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, a[1010]; cin >> n; for (int i = 0; i < n; i++)cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if ((a[j] - a[i]) % (n - 1) == 0) {
cout << a[i] << ' ' << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
//typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
int main(){
int N;
cin >> N;
int a[2000];
for(int i = 0; i < N; i++){
cin >> a[i];
}
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++){
if((a[i] - a[j]) % (N - 1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) ((y)<0||(x)<0||(y)>=(h)||(x)>=(w))
#define dump(...)
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
is>>p.first>>p.second;return is;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
before_main_function() {
// cin.tie(0);ios::sync_with_stdio(false);
cout<<setprecision(15)<<fixed;
// #define endl "\n"
}
} before_main_function;
//------------------8<------------------------------------8<--------------------
signed main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
REP(i, n) {
REPF(j, i+1, n) {
int diff = abs(a[i] - a[j]);
if (diff % (n-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#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;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day1/problems/A>
問題文============================================================
N 個の相違なる自然数 ai が与えられる。与えられた自然数から相違なる自然数を選び、ペアを作ることにした。
作ることができるペアのうち、値の差が N−1 の倍数であるペアを一つ出力せよ。
なお、そのようなペアは必ず存在する。
=================================================================
解説=============================================================
N^2 試すだけ
================================================================
*/
void solve(){
ll N; cin >> N;
vector<ll> a(N); for(auto& in:a) cin >> in;
[&]{
for(int i = 0; i < N;i++){
for(int j = i+1; j < N;j++){
if(a[i] == a[j]) continue;
if(abs(a[i] - a[j])%(N-1) == 0){
cout << a[i] << " " << a[j] << endl;
return;
}
}
}
return;
}();
}
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N=0;
int tmp=0;
vector<int> natural;
cin>>N;
for(int i=0;i<N;i++){
cin>> tmp;
natural.push_back(tmp);
}
sort(natural.begin(), natural.end());
for(auto itr=natural.end()-1;itr!=natural.begin();--itr){
for(auto pulled=natural.begin();pulled!=natural.end();++pulled){
if((*itr-*pulled)%(N-1)==0&&*itr!=*pulled){
cout<<*itr<<" "<<*pulled<<"\n";
return 0;
}
}
}
}
|
#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int W,H;
bool inrange(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}
using namespace std;
typedef pair<int, int> pii;
typedef pair<int,pii> piii;
#define MP make_pair
signed main(){
int n;cin>>n;
vector<int>v(n);rep(i,n)cin>>v[i];
rep(i,n)rep(j,n)if(i!=j)if(abs(v[i]-v[j])%(n-1)==0)return cout<<v[i]<<" "<<v[j]<<endl,0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (abs(a[i] - a[j]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<tuple>
#include<utility>
#include<stack>
#include<set>
#include<iomanip>
using namespace std;
using ll=long long int;
int main() {
int n;
while (cin >> n) {
vector<int>a(n);
for (int i = 0; i < n; i++)cin >> a[i];
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++) {
if (abs(a[i] - a[j]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;
//-----------------------------------------------------------------------------
int n,a[1000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
REP(i,n) cin>>a[i];
REP(i,n) {
REP(j,i) {
if(abs(a[i]-a[j])%(n-1)==0) {
cout<<a[i]<<' '<<a[j]<<endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <ctime>
#include <cassert>
#include <random>
#include <cstring>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;
/*---------------------------------------------------*/
int main(){
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i++) cin >> a[i];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(i == j) continue;
if(abs(a[i] - a[j]) % (N - 1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int> ns(n);
for(auto &x: ns) {
cin >> x;
}
for(int i=0; i<n; i++)
for(int l=0; l<n; l++) {
int a = ns[i];
int b = ns[l];
if (i!=l && abs(a-b) % (n-1) == 0) {
cout << a << " " << b << endl;
return 0;
}
}
}
|
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#define BIT(a) (1 << (a))
using namespace std;
long long MOD = 1000000007;
long long mod_pow(long long x, long long n){
long long res = 1;
for(int i = 0;i < 60; i++){
if(n >> i & 1) res = res * x % MOD;
x = x * x % MOD;
}
return res;
}
int amari[1000];
int main(void){
int N;
cin >> N;
int a;
int flag = 1;
for (int i = 0; i < N; i++){
cin >> a;
if (amari[a%(N-1)] && flag){
cout << amari[a%(N-1)] << " " << a << endl;
flag = 0;
}
else amari[a%(N-1)] = a;
}
return 0;
}
|
#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];
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
int sa = (int)abs(a[i] - a[j]);
if(!(sa % (n - 1))){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
REP(i,n) REP(j,i) {
if ((a[j]-a[i])%(n-1)) continue;
cout << a[j] << ' ' << a[i] << endl;
return 0;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <numeric>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
using namespace std;
int main(){
int n;
cin>>n;
vector<int> v(n);
rep(i,0,n)cin>>v[i];
Sort(v);
rep(i,0,n){
rep(j,i+1,n){
if((v[j]-v[i])%(n-1)==0){
cout<<v[i]<<" "<<v[j]<<endl;
return 0;
}
}
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
cin>>n;
vector<int> v(n);
rep(i,n)cin>>v[i];
rep(i,n){
rep(j,n){
if(i==j)continue;
if(abs(v[i]-v[j])%(n-1)==0){
cout<<v[i]<<" "<<v[j]<<endl;
return 0;
}
}
}
}
|
/* -*- coding: utf-8 -*-
*
* 2874.cc: Pigeonhole principle
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
/* constant */
const int MAX_N = 1000;
/* typedef */
/* global variables */
int as[MAX_N];
/* subroutines */
/* main */
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", as + i);
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (abs(as[j] - as[i]) % (n - 1) == 0) {
printf("%d %d\n", as[i], as[j]);
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t; using u64 = uint64_t;
#define rep(i,a,b) for(i64 i=(i64)(a);i<(i64)(b);i++)
#define repn(i,n) rep(i,0,n)
#define din(t, ...) t __VA_ARGS__;_din(__VA_ARGS__)
#define stlv(t,n) vector<t> n
#define stls(t,n) set<t> n
void _din() {} void dout() { cout << endl; }
template <typename T, typename ... Args> inline void _din(T& head, Args& ... rest) { cin >> head; _din(rest...); }
template <typename T, typename ... Args> inline void dout(T head, Args ... rest) { cout << head; if (sizeof...(rest)) cout << ' '; dout(rest...); }
template <typename T>inline void vsortg(vector<T>& v) { sort(v.begin(), v.end(), greater<T>()); }
template <typename T>inline void vsortl(vector<T>& v) { sort(v.begin(), v.end(), less<T>()); }
template <typename T> inline T nmax(T f1, T f2) { return max(f1, f2); }
template <typename T, typename ... Args> inline T nmax(T first, Args ... rest) { return nmax(first, nmax(rest...)); }
template <typename T> inline T nmin(T f1, T f2) { return min(f1, f2); }
template <typename T, typename ... Args> inline T nmin(T first, Args ... rest) { return nmin(first, nmin(rest...)); }
int main()
{
din(i64, n);
stlv(i64, v(n));
repn(i, n)
{
din(, v[i]);
}
vsortl(v);
i64 st = 0;
for (;;)
{
for (int i = st + 1; i < n; i++)
{
if ((v[i] - v[st]) % (n - 1) == 0)
{
dout(v[i], v[st]);
return 0;
}
}
if (st + 1 < n) st++;
else
break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n);
for(int i = 0; i < n; i++){
cin >> A[i];
}
sort(A.begin(), A.end());
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if((A[j] - A[i]) % (n - 1) == 0){
cout << A[i] << ' ' << A[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int a[1001];
int main(void){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int di=abs(a[i]-a[j]);
if(di%(n-1)==0){
printf("%d %d\n",a[i],a[j]);
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define ssa pair<string,int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)
int dx[4]={0,-1,0,1};
int dy[4]={1,0,-1,0};
using namespace std;
class pa3{
public:
int x,y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
double x;
int y,z,w;
pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
pa2 operator * (int a) {return pa2(x*a,y*a);}
bool operator < (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x>p.x: y>p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
#define ppa pair<int,pas>
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
/*
int pr[1000010];
int inv[1000010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
int zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=inf;
r*=inv[nn-rr];
r%=inf;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%inf;
}
for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],inf-2,inf);
}
*/
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000)
set<int> se;
map<int,int> ma;
string s;
int a[100020];
int d[100020]={0};
vector<int> ans;
signed main(){
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
return 0;
}
|
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef int Def;
//typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};
int main(){
int n;cin>>n;
vi in(n);
rep(i,n)cin>>in[i];
vi t(n-1);
rep(i,n){
int r=in[i]%(n-1);
if(t[r]){
cout<<in[t[r]-1]<<" "<<in[i]<<endl;
return 0;
}
t[r]=i+1;
}
}
|
#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int main () {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++) {
if (abs(a[i] - a[j]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
|
#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];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<' '<<a[j]<<endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <array>
#include <bitset>
#include <assert.h>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
int main() {
int n;
cin >> n;
VI a(n);
REP(i,n) cin >> a[i];
REP(i,n) REP(j,n){
if (a[i] != a[j] && abs(a[i] - a[j]) % (n - 1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(abs(a[i]-a[j])%(n-1)==0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <cstdlib>
using namespace std;
void solve(int n, int *a)
{
for(int i = 0; i < n; i++) {
for (int j = i+1; j< n; j++) {
if(abs(a[i]-a[j])%(n-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return;
}
}
}
return;
}
int main()
{
int N;
int a[1000];
cin >> N;
for(int i = 0; i < N; i++) {
cin >> a[i];
}
solve(N, a);
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define range(i, a, b) for(auto i = a; i < b; i++)
#define rep(i, a) range(i, 0, a)
#define all(a) (a).begin(),(a).end()
using namespace std;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
const long double EPS = 1e-8;
using vi = vector <int>;
using vvi = vector <vi>;
signed main() {
int n;
cin >> n;
int a[n];
rep (i, n) cin >> a[i];
rep (i, n) rep (j, n) {
if (i != j && abs(a[i] - a[j]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef pair<ll, ll> pll;
int dx[4] = { 1,0,0,-1 };
int dy[4] = { 0,1,-1,0 };
#define ARRAY_MAX 100005
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++)
{
for (int j = i+1; j < n; j++)
{
if ((a[j] - a[i]) % (n - 1) == 0)
{
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
VI xs(N);
REP(i,N) cin >> xs[i];
REP(i,N) REP(j,i){
if((xs[i] - xs[j]) % (N-1) == 0){
cout << xs[i] << " " << xs[j] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[1001];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int ans1,ans2;
for(int i=0;i<n;++i) for(int j=0;j<n;j++)
{
if(i==j) continue;
if(abs(a[i]-a[j])%(n-1)==0)
{
ans1=a[i];
ans2=a[j];
break;
}
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
// typedef __int128_t Int;
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
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, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N;
cin >> N;
vector<int> v(N);
rep(i, 0, N) { cin >> v[i]; }
rep(i, 0, N) rep(j, i + 1, N) {
if (abs(v[i] - v[j]) % (N - 1) == 0) {
cout << v[i] << " " << v[j] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
int main(){
int N;
cin>>N;
vector<int> a(N);
rep(i,N) cin>>a[i];
rep(i,N) rep(j,i) if(abs(a[i]-a[j])%(N-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>table(n);
for (int i = 0; i < n; i++) {
cin >> table.at(i);
}
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j <n; j++) {
if (abs(table.at(i)-table.at(j)) % (n-1) == 0) {
cout << table.at(i) << " " << table.at(j);
return 0;
}
}
}
}
|
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#define REP(i,a,n) for(int i=a;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define REV(i,a,n) for(int i=n;i>=a;--i)
#define all(e) e.begin(),e.end()
#define rall(e) e.rbegin(),e.rend()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define mod 1000000007
#define show(n) cerr<<#n<<" = "<<n<<endl
#define shows(n) for(auto z:n){cerr<<z<<", ";}cerr<<endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using pint = pair<int,int>;
const int INF = (1 << 30);
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi vec(n);
rep(i, n){
cin >> vec[i];
}
rep(i, n){
rep(j, n){
//show(abs(vec[i] - vec[j]));
if(abs(vec[i] - vec[j]) != 0){
if(abs(vec[i] - vec[j]) % (n - 1) == 0){
cout << vec[i] << ' ' << vec[j] << endl;
return 0;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin>>n;
vector<int> a(n);
for(int i = 0;i < n;++i) {
cin>>a[i];
}
for(int i = 0;i < n;++i) {
for(int j = i+1;j < n;++j) {
if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
int main(){
int n;
cin>>n;
vi a(n);
rep(i,n)cin>>a[i];
rep(i,n){
rep(j,i){
if((a[j]-a[i])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
void solve() {
int n; cin >> n;
vector<int> a(n);
rep(i, n)cin >> a[i];
rep(i, n) {
Rep(j, i + 1, n) {
int dif = abs(a[i] - a[j]);
if (dif % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl; return;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(x, y) cerr<<#x<<": "<<bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
int paSize = printArray.size();
for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
if (between != '\n') {cerr << endl;}
}
// ------------------------------------------------------------------------------------------
int main() {
int n;
cin >> n;
vec<int> v(n);
rep (i, n) {
cin >> v[i];
}
rep (i, n) {
repp (j, 1, n) {
if (i == j) continue;
if (abs(v[i]-v[j])%(n-1) == 0) {
printf("%d %d\n", v[i], v[j]);
return 0;
}
}
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;
int N;
vector<int>A;
int main(void)
{
cin >> N;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < i; ++j) {
int dif = abs(A[i] - A[j]);
if (dif % (N - 1) == 0) {
cout << A[i] << " " << A[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}
template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}
using Pi = pair<int, int>;
using Tapris = tuple<int, int, int>;
using vint = vector<int>;
const int inf = 1LL << 55;
const int mod = 1e9 + 7;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
reps(j, i+1, n) {
if(llabs(a[i]-a[j])%(n-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
int N;
std::vector<int>a;
int main()
{
in >> N;
a.resize(N);
rep(i, N) in >> a[i];
rep(i, N)
{
rep(j, N)
{
if (i != j && abs(a[i] - a[j]) % (N - 1) == 0)
{
out << a[i] << " " << a[j] << std::endl;
return 0;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n;
cin >> n;
vector<int> v;
for(int i=0;i<n;++i){
int a;
cin >> a;
v.push_back(a);
}
for(int i=0;i<n;++i){
for(int j=i+1;j<n;++j){
if(abs(v[i]-v[j])%(n-1) == 0){
cout << v[i] << " " << v[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
Int n;
cin>>n;
vector<Int> a(n);
for(Int i=0;i<n;i++) cin>>a[i];
for(Int i=0;i<n;i++){
for(Int j=0;j<i;j++){
if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
if (n == 0)return 1;
if (n == 1)return x%MOD;
ll res = sq(mod_pow(x, n / 2));
res %= MOD;
if (n % 2 == 1) {
res *= x;
res %= MOD;
}
return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }
ll n;
ll a[1010];
int main() {
cin >> n;
rep(i, n)cin >> a[i];
sort(a, a + n);
rep(i, n) {
FOR(j, i + 1, n) {
if ((a[j] - a[i]) % (n - 1) == 0) {
cout << a[j] << " " << a[i] << endl;
return 0;
}
}
}
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
template<typename T> void cmax(T &a, T b) { a = max(a, b); }
template<typename T> void cmin(T &a, T b) { a = min(a, b); }
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> m;
rep(i, n) {
cin >> a[i];
m[a[i] % (n - 1)]++;
}
for (auto x : m) {
int tmp = 0;
if (2 <= x.second) {
bool flag = false;
rep(i, n) {
if (a[i] % (n - 1) == x.first) {
if (flag) cout << ' ';
cout << a[i];
flag = true;
tmp++;
}
if (tmp == 2) {
cout << endl;
return 0;
}
}
}
}
return 0;
}
|
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int main() {
cin >> N;
vector<int>v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (abs(v[i] - v[j]) % (N - 1) == 0) {
cout << v[i] << " " << v[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
int main(){
int n;
cin >>n;
vector<int> a(n);
rep(i,n) cin >>a[i];
rep(i,n)rep(j,i){
int d = abs(a[i]-a[j]);
if(d%(n-1)==0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[1000];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int32 N;
vector<int32> a;
cin >> N;
a.resize(N);
vector<int32> cnt(N, 0);
REP(i, N){
cin >> a[i];
}
REP(i, N){
FOR(j, i+1, N){
if(abs(a[i]-a[j])%(N-1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define C(i) cin>>i
#define C2(i,j) cin>>i>>j
#define C3(i,j,k) cin>>i>>j>>k
#define C4(i,j,k,m) cin>>i>>j>>k>>m
////////////////////////////////////////////////////////////
int main(){
int n;
cin >> n;
int a[n];
rep(i,0,n)
cin >> a[i];
int d = n - 1;
rep(i,0,n){
int num = a[i];
rep(j,0,n){
if(i == j )
continue;
if( (num - a[j] ) % d == 0 ){
cout << num << " " << a[j] << endl;
ret 0;
}
}
}
ret 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <bitset>
#include <limits.h>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF (LL)1e15
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
//#define int long long
/*************** using variables ***************/
int n;
vector<int> a;
/**********************************************/
signed main(){
cin >> n;
a.resize(n);
REP(i, n) cin >> a[i];
REP(i, n){
REP(j, n){
if(i == j) continue;
if(abs(a[i]-a[j]) % (n-1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.