#include <stdio.h>
#include <stdlib.h>
int main()
{
int v,t,s;
while((scanf("%d %d",&v,&t))!=EOF)
{
s=2*v*t;
printf("%d\n",s);
}
return 0;
}
Category Ad-hoc
UVa – 11547 – Automatic Answer
#include <bits/stdc++.h>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define sz(x) x.size()
#define qu queue
#define pqu priority_queue
#define vc vector
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case(z,x) cout<<"Case "<<i<<": "<<x<<endl
#define case(z) cout<<"Case "<<z<<": "
#define PI 3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<r && ty>=0 && ty<c
#define MAX 2000
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
using namespace std;
int main()
{
CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ll t,a,b,c,n,x;
cin>>t;
loop1(z,t)
{
cin>>n;
a=(n*567)/9;
b=(a+7492)*235;
c=(b/47)-498;
loop0(j,2)
{
x=c%10;
c=c/10;
}
x=abs(x);
cout<<x<<endl;
}
return 0;
}
UVa – 11777 – Automate The Grades
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,T,t1,t2,finl,atndnc,ct1,ct2,ct3;
double a,total_marks;
scanf("%d",&T);
for(i=1;i<=T;i++)
{
scanf("%d %d %d %d %d %d %d",&t1,&t2,&finl,&atndnc,&ct1,&ct2,&ct3);
if(ct1<=ct2 && ct1<ct3)
{
a=(ct2+ct3)/2.0;
}
else if(ct2<ct1 && ct2<=ct3)
{
a=(ct1+ct3)/2.0;
}
else if(ct3<=ct1 && ct3<ct2)
{
a=(ct2+ct1)/2.0;
}
else if(ct1==ct2 && ct2==ct3)
{
a=(ct1+ct2)/2.0;
}
total_marks=t1+t2+finl+atndnc+a;
if(total_marks>=90)
{
printf("Case %d: A\n",i);
}
else if(total_marks>=80 && total_marks<90)
{
printf("Case %d: B\n",i);
}
else if(total_marks>=70 && total_marks<80)
{
printf("Case %d: C\n",i);
}
else if(total_marks>=60 && total_marks<70)
{
printf("Case %d: D\n",i);
}
else if(total_marks<60)
{
printf("Case %d: F\n",i);
}
}
return 0;
}
UVa – 11984 – A Change In Thermal Unit
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,t;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
float c,d,f,s;
scanf("%f %f",&c,&d);
f=(d/9)*5;
s=c+f;
printf("Case %d: %.2f\n",i,s);
}
return 0;
}
UVa – 12798 – Handball
#include <bits/stdc++.h>
#define pf printf
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sffffl(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define sfffff(a,b,c,d,e) scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)
#define sfffffl(a,b,c,d,e) scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)
#define sfc(a) scanf("%c",&a)
#define pii pair<int,int>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define pbp(a,b) push_back({a,b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forrev(i,n) for(int i=n-1; i>=0; i--)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define forba(i,b,a) for(int i=b;i>=a;i--)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case1(z) cout<<"Case "<<z<<": "
#define case2(z) printf("Case %d: ",z)
#define PI acos(-1) //3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<row && ty>=0 && ty<col
#define intlim 2147483648
#define MAX 100005
#define inf 100000008
/*------------------------------Graph Moves----------------------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
using namespace std;
int main()
{
//CIN;
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n,m,x,c,d;
while(sff(n,m)==2)
{
c=0;
for1(i,n)
{
d=0;
for1(j,m)
{
sf(x);
if(x==0)
{
d++;
if(d==1) c++;
}
}
}
pf("%d\n",n-c);
}
return 0;
}
Fall out, Codes! 