View Attach Info

Add new attachment

Only authorized users are allowed to upload new attachments.

This page (revision-3) was last changed on 20-Aug-2015 17:35 by bedzo

This page was created on 20-Aug-2015 17:35 by macstr1k3r

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Difference between version and

At line 1 changed one line
Страницата е креирана, уредување набргу.
Еве неофицијални решенија:
!!Броеви:
!C++
%%prettify
{{{
#include <iostream>
using namespace std;
int main()
{
int broj[25],i,j,n,m,pom1,pom2,z=0,sum=0,la;
cin>>n>>m;
for(i=n;i<m+1;i++){
z=0;
la=i;
while(la>=10){
pom1=la%10;
pom2=(la/10)%10;
la/=10;
if(pom1<=pom2){
z++;
break;
}
}
if(z==0) sum++;
}
cout<<sum;
return 0;
}
}}}
/%
!!Згради:
!C++
%%prettify
{{{
#include <iostream>
#include<vector>
#include<cstring>
using namespace std;
int main()
{
int n,zgradi[600],max=0,sum=0,i;
cin>>n;
for(i=0;i<n;i++) cin>>zgradi[i];
for(i=0;i<n;i++) if(zgradi[i]>max) max=zgradi[i];
for(i=0;i<n;i++) sum+=max-zgradi[i];
cout<<sum;
return 0;
}
}}}
/%
!!Зборови:
!C++
%%prettify
{{{
#include <iostream>
#include<vector>
#include<string>
using namespace std;
char buk[100];
int vred[100];
int main()
{
int i,n,j,m,sum=0,max=0,h;
string f,mm;
for(i=0;i<26;i++) cin>>buk[i]>>vred[i];
cin>>m;
for(i=0;i<26;i++){
for(j=i+1;j<26;j++){
if(buk[j]<buk[i]){
swap(buk[j],buk[i]);
swap(vred[j],vred[i]);
}
}
}
for(i=0;i<26;i++){
buk[i+26]=buk[i]-32;
vred[i+26]=vred[i]+20;
}
for(i=0;i<m;i++){
cin>>f;
sum=0;
for(h=0;h<f.size();h++){
for(j=0;j<52;j++){
if(f[h]==buk[j]) sum+=vred[j];
}
}
if(sum>max){
max=sum;
mm=f;
}
}
cout<<mm;
return 0;
}
}}}
/%
Version Date Modified Size Author Changes ... Change note
3 20-Aug-2015 17:35 7.515 kB bedzo to previous
2 20-Aug-2015 17:35 1.58 kB bedzo to previous | to last
1 20-Aug-2015 17:35 0.042 kB macstr1k3r to last
« This page (revision-3) was last changed on 20-Aug-2015 17:35 by bedzo