Еве неофицијални решенија:
Броеви:#
C++#
#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++#
#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++#
#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; }
Add new attachment
Only authorized users are allowed to upload new attachments.
«
This particular version was published on 20-Aug-2015 17:35 by bedzo.
G’day (anonymous guest)
Log in
JSPWiki v2.8.3