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-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

2024-01-13 07:25:05

Last edit: 2024-01-14 05:17:28

2024-01-12 10:54:55
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
string prt(string a)
{
string c="", v="";

for(int i = 0; i < a.size(); i=i+2)
{
c.push_back(a[i]);

}
for(int j = 1; j < a.size(); j=j+2)
{
v.push_back(a[j]);
}
reverse(c.begin(),c.end());
reverse(v.begin(),v.end());

a = v + c;
return a;
}
int main()
{
string a;
int n;
cin >> a >> n;
for(int i=1;i<=n;i++)
{
a=prt(a);
}
cout << a;
}

2024-01-11 04:54:29
#include<bits/stdc++.h>
using namespace std;

#define ll long long

ll n,m,k,urtn,urtm,t,x,y;
ll a[10]={0},b[10]={0},s[10]={0},p[10]={0};

long long Solve(ll q){
ll ans=0;
while(q>0){
ans++;
q/=10;
}
return ans;
}

void Stepn(){
t=9;
for(ll i=1;i<urtn;i++){
a[0]+=i*t;
t*=10;
}
a[0]=a[0]+(n-p[urtn]+1)*urtn;

while(urtn>0){
x=n/p[urtn];
y=n%p[urtn];
if(x>0){
a[x]+=y+s[urtn]*x+1;
for(ll i=1;i<x;i++)
a[i]=a[i]+s[urtn]*x+p[urtn];
for(ll i=x+1;i<10;i++)
a[i]+=s[urtn]*x;
}
urtn--;
n=y;
}
for(ll i=1;i<10;i++)
a[0]-=a[i];
}
void Stepm(){
t=9;
for(ll i=1;i<urtm;i++){
b[0]+=i*t;
t*=10;
}
b[0]=b[0]+(m-p[urtm]+1)*urtm;

while(urtm>0){
x=m/p[urtm];
y=m%p[urtm];
if(x>0){
b[x]+=y+s[urtm]*x+1;
for(ll i=1;i<x;i++)
b[i]=b[i]+s[urtm]*x+p[urtm];
for(ll i=x+1;i<10;i++)
b[i]+=s[urtm]*x;
}
urtm--;
m=y;
}
for(ll i=1;i<10;i++)
b[0]-=b[i];
}

main(){
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);

cin>>n>>m>>k;
//printf("%lld %lld %lld\n",n,m,k);

n--;
urtn=Solve(n);
urtm=Solve(m);
//printf("%lld %lld\n",urtn,urtm);

t=1;
s[2]=1;
p[1]=1;
p[2]=10;
for(ll i=3;i<10;i++){
s[i]=(s[i-1]+t)*10;
t*=10;
p[i]=t*10;
}
Stepn();
Stepm();
for(ll i=0;i<10;i++)
b[i]-=a[i];
for(ll i=9;i>=0;i--){
if(b[i]>=k){ k=0; printf("%lld\n",i); break; }
else k-=b[i];
}
if(k > 0) printf("-1\n");
}

2024-01-11 04:46:05
https://www.hackerrank.com/contests/2023-5/challenges

2024-01-11 04:28:21
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
float a,b,c,d,e=0;
int main()
{
scanf("%f%f",&a,&b);
for(c=1; c<=b ; c++)
{
d=pow(sin(a),c);
e=e+d;
}
printf("%.3f",e);
return 0;
}

2024-01-11 04:26:32
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
float a,b,c,d=0,k;
int main()
{
scanf("%f %f",&dulguun,&k);
for(c=1; c<=k; c++)
{
b=sin(pow(dulguun,c));
d=d+b;
}
printf("%.3f",d);
}

PROGRAMING PROBLEMS

CP306 - Math5

Input

Output

Example