SPOJ.com - Problem CP306

Problem hidden

|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

CP306 - Math5

Ó¨ĐłŃÓŠĐ˝ 3 ĐžŃĐžĐ˝ŃĐžĐš ŃĐžĐžĐ˝Ń Đ°ŃĐ°Đ˛Ń ĐąĐ° ĐˇŃŃŃŃĐ˝ ĐžŃĐ˝Ń ŃĐ¸ŃŃŇŻŇŻĐ´Đ¸ĐšĐ˝ Đ°ĐťŃ Đ¸Ń ĐąĐžĐťĐžŃŃĐł ŃĐžĐłŃĐžĐž. ĐĽŃŃŃĐ˛ Đ°ŃĐ°Đ˛ŃŃĐ˝ ŃĐ¸ŃŃ Đ¸Ń ĐąĐžĐť ARAVT, ĐˇŃŃŃŃĐ˝ ŃĐ¸ŃŃ Đ¸Ń ĐąĐžĐť ZUUT ĐłŃĐś ŃŃĐ˛ĐťŃ.

Input

ĐŃŃĐ˛Đ°Đ˝ ĐžŃĐžĐ˝ŃĐžĐš Đ˝ŃĐł ĐąŇŻŃŃĐť ŃĐžĐž ÓŠĐłÓŠĐłĐ´ÓŠĐ˝ÓŠ. ĐŃĐ°Đ˛Ń ĐąĐžĐťĐžĐ˝ ĐˇŃŃŃŃĐ˝ ĐžŃĐžĐ˝ĐłĐ¸ĐšĐ˝ ŃĐ¸ŃŃŇŻŇŻĐ´ Đ˝Ń ŃĐťĐłĐ°Đ°ŃĐ°Đš ŃĐžĐž ÓŠĐłÓŠĐłĐ´ÓŠĐ˝ÓŠ.

Output

ARAVT, ZUUT ĐłŃŃŃĐ˝ ŇŻŃ Đ´ŇŻĐ˝ĐłŇŻŇŻĐ´Đ¸ĐšĐ˝ Đ˝ŃĐłĐ¸ĐšĐł ŃŃĐ˛ĐťŃĐ˝Ń.

Example

Input:
526

Output:
ZUUT

Submit solution!

Нэмсэн:	munkhbat
Огноо:	2015-03-09
Хугацааны хязгаарлалт:	1s
Эх кодын хэмжээний хязгаарлалт:	50000B
Memory limit:	1536MB
Cluster:	Cube (Intel G860)
Програмчлалын хэлүүд:	Бүгд дараах хэлүүдээс бусад: ASM64 NCSHARP JS-MONKEY JULIA PYPY3

hide comments

2024-01-21 09:24:59
#include<bits/stdc++.h>
using namespace std;
struct point
{
int x;
int y;
} p;
int main(){
int a,c;
double xm = 0 , ym = 0, b;
cin>>a;
b = a;
while(a--)
{
cin>>p.x>>p.y;
xm += p.x;
ym += p.y;
}

cout<<fixed<<setprecision(15)<<xm/b << " "<< ym/b;
return 0;

2024-01-21 07:21:12
#include<bits/stdc++.h>
using namespace std;
struct point
{
int x;
int y;
} p;
double zai(int x, int y)
{
return sqrt(x*x+y*y);

}
int main(){
int a,b,c;
double mx=0,z_x,z_y;
cin>>a;
while(a--)
{
cin>>p.x>>p.y;
if(zai(p.x,p.y)>mx) {
mx=zai(p.x,p.y);
z_x=p.x;
z_y=p.y;
}
}
cout<<z_x<<" "<<z_y;
return 0;
}
Хамгийн хол цэг

Last edit: 2024-01-22 03:18:45

2024-01-20 11:26:06
#include <iostream>

bool super(long long n) {
int a = 0, s = 0, f = 0;
while (n != 0) {
int digit = n % 10;
if (digit == 7) {
s++;
} else if (digit == 4) {
f++;
} else {
a++;
}
n /= 10;
}
return (s == f && a == 0);
}

int main() {
long long n;
std::cin >> n;

while (!super(n)) {
n++;
}

std::cout << n << std::endl;

return 0;
} aztai too

2024-01-20 07:04:48
#include<bits/stdc++.h>
using namespace std;
int jk[121];
int main()
{
char o[16], n[16];
int a, k, g = 0;
//freopen("Tex.in","r",stdin);
while(scanf("%s%s%d",&o,&n,&a)!=EOF)
{
jk[a]++;
}
k = jk[1];
for(int i = 2; i<= 120; i++)
{
if(k<jk[i])
k=jk[i];
}
cout << k<<endl;
for(int i = 0; i <= 120; i++)
{
if (k == jk[i])
{
cout << i <<endl;
}

}
}

2024-01-20 06:36:54

Last edit: 2024-01-20 07:04:59

2024-01-18 04:18:44
#include <bits/stdc++.h>
using namespace std;
int a[1001], d[1001];
int main()
{
int n,b,j,i,c,l,q=0,k=0;
cin>>n;

while(1)
{
d[q]=n;

q++;
i=0;
b=0; c=0;
while(n!=0)
{
a[i]=n%10;
n=n/10;
i++;
}
sort(a+0,a+i);
for(j=0; j<i; j++)
b=b*10+a[j];
for(j=i-1; j>=0; j--)
c=c*10+a[j];
l=abs(c-b);
for(int s=0;s<q;s++)
if(l==d[s]) {cout<<k+1; return 0; }
k++;
n=l;
}

}

2024-01-16 06:54:47
#include <bits/stdc++.h>
using namespace std;

long long tsifir(long long n) {
long long sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
long long find_k(long long n) {
long long k = tsifir(n);
while (k >= 10) {
k = tsifir(k);
}
return k;
}

int main() {
long long n;
while (1) {
cin >> n;
if (n == 0) {
break; }
long long k = find_k(n);
cout << k << endl;
}
return 0;
}
// 2024.1.15.17:04

2024-01-16 06:52:05
#include <iostream>
using namespace std;
int main() {
long long n,k,x,i,j,p,a,b;
cin >>n;
for(i=1;i<=n;i++){
cin >> k;
a = 0;
b = 0;
for(j=1;j<=k;j++) {
cin>>x;
p=x/29;
if(x%29!=0) p++;
a+=p*10;
p=x/59;
if(x%59!=0) p++;
b+=p*15;
}
if (a > b){
cout << "Case "<<i<<": Juice "<< b<<endl;
} else if (a < b) {
cout << "Case " <<i<<": Mile "<<a<< endl;
} else {
cout <<"Case "<<i<<": Mile Juice "<<a<<endl;
}
}

return 0;
}

2024-01-14 05:17:53
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,j,a;
cin >> n;
for(int i=pow(2,n)-1;i>=0;i--)
{
string a="";
j=i;
int s=0;
while (j!=0)
{
if (j%2==0) a ='0'+a;
else a ='1'+a;
j/=2;
s++;
}
int kl = n - s;
for(int i=1;i<=kl;i++)
a='0'+a;
cout<<a<<endl;
}
return 0;
}

2024-01-13 07:34:05
#include <bits/stdc++.h>
#include <bitset>
using namespace std;
string bin(int hoyort, int gariintoo) {
string toolol = bitset<15>(hoyort).to_string();
return toolol.substr(15 - gariintoo);
}
int main() {
int gariintoo;
cin >> gariintoo;
if (gariintoo >= 0 && gariintoo <= 15) {
for (int i = (1 << gariintoo) - 1; i >= 0; i--) {
cout << bin(i, gariintoo) << endl;
}
}
return 0;
} //2024 1 13 1:11 2toolol

PROGRAMING PROBLEMS

CP306 - Math5

Input

Output

Example