Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <cstring>
- #include <bits/stdc++.h>
- using namespace std;
- ifstream in ("bacan.in");
- ofstream out ("bacan.out");
- struct bunaziua
- {
- char prod[25];
- int cant;
- } p[1005];
- int n,i,nrv,k,j,cantitate;
- char linie[30],*pp;
- int main()
- {
- in>>n;
- in.get();
- for(i=1; i<=n; i++)
- {
- in.getline(linie,30);
- pp=strstr(linie," * ");
- *pp=0;
- cantitate=atoi(pp+3);
- k=1;
- while(k<=nrv&&strcmp(linie,p[k].prod)!=0)
- k++;
- if(k<=nrv)
- p[k].cant+=cantitate;
- else
- {
- p[++nrv].cant=cantitate;
- strcpy(p[nrv].prod,linie);
- }
- }
- for(i=1; i<=nrv; i++)
- for(j=i+1; j<=nrv; j++)
- if(strcmp(p[j].prod,p[i].prod)<0)
- swap(p[i],p[j]);
- out<<nrv<<'\n';
- for(i=1; i<=nrv; i++)
- out<<p[i].prod<<" * "<<p[i].cant<<'\n';
- }
- #include <fstream>
- #include <cstring>
- #include <cstdlib>
- #include <iostream>
- using namespace std;
- ifstream in ("reteta.in");
- ofstream out ("reteta.out");
- long long int s;
- int i,nr;
- char a[1000],*p;
- struct bunaziua
- {
- char i[25];
- long long int cantitate;
- } r[1000];
- int main()
- {
- in.getline(a,1000);
- p=strtok(a,"( )");
- while(p)
- {
- if(atoi(p))
- s+=atoi(p);
- else
- {
- for(i=0; i<nr&&strcmp(r[i].i,p)!=0; i++);
- if(i==nr)
- strcpy(r[nr++].i,p);
- p=strtok(NULL,"( )");
- if(i==nr)
- r[nr].cantitate=atoi(p);
- else
- r[i].cantitate+=atoi(p);
- }
- p=strtok(NULL,"( )");
- }
- out<<s<<'\n';
- for(i=0; i<nr-1; i++)
- for(int j=i+1; j<nr; j++)
- if(strcmp(r[i].i,r[j].i)>0)
- swap(r[i],r[j]);
- for(i=0; i<nr; i++)
- out<<r[i].i<<" "<<r[i].cantitate<<'\n';
- }
- #include <fstream>
- #include <map>
- #include <cstring>
- #include <iostream>
- using namespace std;
- ifstream in ("replace.in");
- ofstream out ("replace.out");
- int n,nr,i;
- char a[30001],b[30001],*p;
- struct bunaseara
- {
- char a[85],b[85];
- } r[10];
- int main()
- {
- in>>n;
- in.get();
- for(; i<n; i++)
- {
- in.getline(r[i].a,85);
- in.getline(r[i].b,85);
- if(r[i].a[0]==0)
- r[i].a[0]=' ';
- }
- in.getline(a,30001);
- for(i=0; i<n; i++)
- {
- p=strstr(a,r[i].a);
- while(p)
- {
- strcpy(b,r[i].b);
- strcat(b,p+strlen(r[i].a));
- *p=0;
- strcat(a,b);
- p=strstr(a,r[i].a);
- }
- }
- out<<a;
- }
- #include <fstream>
- #include <cstring>
- using namespace std;
- ifstream in ("betisoare.in");
- ofstream out ("betisoare.out");
- long long s1,s2,s,n;
- char c;
- int main()
- {
- in>>n;
- in.get();
- for(; n; n--)
- {
- s=0;
- in.get(c);
- s1=1;
- while(c!='\n')
- {
- in.get(c);
- while(c=='I')
- s1++,in.get(c);
- if(c=='+'||c=='\n')
- s+=s1,s1=0;
- else
- {
- while(c=='*')
- {
- s2=0;
- in.get(c);
- while(c=='I')
- s2++,in.get(c);
- s1*=s2;
- }
- s+=s1;
- s1=0;
- }
- }
- out<<s<<'\n';
- }
- }
- #include <fstream>
- #include <cstring>
- #include <iostream>
- #include <iomanip>
- using namespace std;
- ifstream in ("ecuatii.in");
- ofstream out ("ecuatii.out");
- int i,n;
- bool ex,egal,neg;
- double x,nr,val;
- char a[500];
- int main()
- {
- in>>n;
- in.get();
- for(; n; n--)
- {
- in.getline(a,500);
- for(i=0,neg=false,ex=false,egal=false,x=0,nr=0; i<strlen(a); i++)
- {
- val=0;
- if(a[i]=='x')
- val++;
- else
- while(strchr("0123456789",a[i])&&i<strlen(a))
- val=val*10+(int)a[i++]-48;
- if(neg)
- val*=-1;
- if(a[i]=='x'&&i<strlen(a))
- ex=true,i++;
- else
- ex=false;
- if(i<=strlen(a))
- {
- if(a[i]=='+'&&egal||a[i]=='-'&&!egal)
- neg=true;
- else
- neg=false;
- if(a[i]=='=')
- egal=true,neg=true;
- if(ex)
- x+=val;
- else
- nr+=val;
- }
- }
- if(nr==0&&x==0)
- out<<"infinit\n";
- else if(x==0)
- out<<"imposibil\n";
- else
- out<<fixed<<setprecision(4)<<-nr/x<<'\n';
- }
- }
- //asta e de 90 da va trebuie 680 pentru 10 si ca sa nu faceti perfect
- #include <fstream>
- #include <cstring>
- #include <string.h>
- using namespace std;
- ifstream in ("text1.in");
- ofstream out ("text1.out");
- int n,nr,nrs,nrsp,i;
- bool boolean,ok;
- char a[1002],*p,b[701][1005];
- int main()
- {
- in>>n;
- in.get();
- while(in.getline(a,1005))
- {
- if(boolean)
- out<<'\n';
- boolean=true;
- p=strtok(a," ");
- ok=false;
- while(p)
- {
- strcpy(b[i++],p);
- nr+=strlen(p);
- if(nr+i-1>n)
- {
- i--;
- nrs=(n-nr+strlen(p))/(i-1);
- nrsp=(n-nr+strlen(p))%(i-1);
- for(int j=0; j<i-1; j++,nrsp--)
- {
- out<<b[j];
- for(int q=0; q<nrs; q++)
- out<<' ';
- if(nrsp>0)
- out<<' ';
- }
- out<<b[i-1]<<'\n';
- nr=strlen(p);
- strcpy(b[0],p);
- i=1;
- ok=true;
- }
- p=strtok(NULL," ");
- if(!p)
- {
- for(int j=0; j<i-1; j++)
- out<<b[j]<<' ';
- out<<b[i-1];
- }
- }
- nr=0;
- i=0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement